./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-chromosome-subst.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-chromosome-subst.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 60539e5483ee028af31550fcc6bdc40a30b35263f2407e34b5392a698998aa9c --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 06:52:23,988 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:52:24,038 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-04 06:52:24,044 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:52:24,045 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:52:24,061 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:52:24,061 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:52:24,061 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:52:24,062 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:52:24,062 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:52:24,062 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:52:24,062 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:52:24,062 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:52:24,062 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:52:24,062 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:52:24,062 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:52:24,062 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:52:24,062 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:52:24,062 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:52:24,062 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:52:24,062 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:52:24,062 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:52:24,062 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-04 06:52:24,062 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 06:52:24,063 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:52:24,063 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:52:24,063 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:52:24,063 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:52:24,063 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:52:24,063 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:52:24,063 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:52:24,063 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:52:24,063 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:52:24,063 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:52:24,063 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:52:24,063 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:52:24,063 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:52:24,063 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:52:24,063 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:52:24,063 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:52:24,063 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:52:24,063 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:52:24,063 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 -> 60539e5483ee028af31550fcc6bdc40a30b35263f2407e34b5392a698998aa9c [2025-03-04 06:52:24,286 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:52:24,293 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:52:24,295 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:52:24,296 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:52:24,297 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:52:24,298 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-chromosome-subst.wvr.c [2025-03-04 06:52:25,449 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd1482d09/d3f9de61e9034fa6b32df7f41ea0a2d9/FLAG1bf954a5d [2025-03-04 06:52:25,713 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:52:25,716 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-chromosome-subst.wvr.c [2025-03-04 06:52:25,723 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd1482d09/d3f9de61e9034fa6b32df7f41ea0a2d9/FLAG1bf954a5d [2025-03-04 06:52:26,036 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd1482d09/d3f9de61e9034fa6b32df7f41ea0a2d9 [2025-03-04 06:52:26,038 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:52:26,039 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:52:26,040 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:52:26,040 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:52:26,043 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:52:26,044 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:52:26" (1/1) ... [2025-03-04 06:52:26,046 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9c9d351 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:52:26, skipping insertion in model container [2025-03-04 06:52:26,047 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:52:26" (1/1) ... [2025-03-04 06:52:26,061 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:52:26,223 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:52:26,231 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:52:26,269 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:52:26,283 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:52:26,284 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:52:26 WrapperNode [2025-03-04 06:52:26,284 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:52:26,285 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:52:26,285 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:52:26,286 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:52:26,290 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:52:26" (1/1) ... [2025-03-04 06:52:26,301 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:52:26" (1/1) ... [2025-03-04 06:52:26,336 INFO L138 Inliner]: procedures = 25, calls = 33, calls flagged for inlining = 18, calls inlined = 26, statements flattened = 428 [2025-03-04 06:52:26,340 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:52:26,342 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:52:26,342 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:52:26,342 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:52:26,347 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:52:26" (1/1) ... [2025-03-04 06:52:26,347 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:52:26" (1/1) ... [2025-03-04 06:52:26,355 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:52:26" (1/1) ... [2025-03-04 06:52:26,355 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:52:26" (1/1) ... [2025-03-04 06:52:26,373 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:52:26" (1/1) ... [2025-03-04 06:52:26,378 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:52:26" (1/1) ... [2025-03-04 06:52:26,381 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:52:26" (1/1) ... [2025-03-04 06:52:26,382 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:52:26" (1/1) ... [2025-03-04 06:52:26,387 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:52:26,388 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:52:26,389 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:52:26,389 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:52:26,389 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:52:26" (1/1) ... [2025-03-04 06:52:26,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:52:26,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:52:26,417 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 06:52:26,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 06:52:26,438 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:52:26,438 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 06:52:26,438 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 06:52:26,438 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 06:52:26,438 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 06:52:26,438 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 06:52:26,438 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 06:52:26,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 06:52:26,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 06:52:26,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 06:52:26,439 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:52:26,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:52:26,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 06:52:26,440 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 06:52:26,544 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:52:26,546 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:52:27,044 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 06:52:27,044 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:52:27,067 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:52:27,067 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 06:52:27,068 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:52:27 BoogieIcfgContainer [2025-03-04 06:52:27,068 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:52:27,070 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:52:27,070 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:52:27,073 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:52:27,074 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:52:26" (1/3) ... [2025-03-04 06:52:27,074 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66a60138 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:52:27, skipping insertion in model container [2025-03-04 06:52:27,074 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:52:26" (2/3) ... [2025-03-04 06:52:27,074 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66a60138 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:52:27, skipping insertion in model container [2025-03-04 06:52:27,074 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:52:27" (3/3) ... [2025-03-04 06:52:27,075 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-chromosome-subst.wvr.c [2025-03-04 06:52:27,085 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:52:27,087 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-chromosome-subst.wvr.c that has 4 procedures, 557 locations, 1 initial locations, 6 loop locations, and 47 error locations. [2025-03-04 06:52:27,087 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 06:52:27,235 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 06:52:27,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 566 places, 583 transitions, 1187 flow [2025-03-04 06:52:27,445 INFO L124 PetriNetUnfolderBase]: 27/580 cut-off events. [2025-03-04 06:52:27,448 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 06:52:27,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 593 conditions, 580 events. 27/580 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1285 event pairs, 0 based on Foata normal form. 0/506 useless extension candidates. Maximal degree in co-relation 431. Up to 2 conditions per place. [2025-03-04 06:52:27,464 INFO L82 GeneralOperation]: Start removeDead. Operand has 566 places, 583 transitions, 1187 flow [2025-03-04 06:52:27,475 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 545 places, 560 transitions, 1138 flow [2025-03-04 06:52:27,485 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:52:27,498 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;@4c624a8a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:52:27,499 INFO L334 AbstractCegarLoop]: Starting to check reachability of 83 error locations. [2025-03-04 06:52:27,535 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:52:27,536 INFO L124 PetriNetUnfolderBase]: 2/63 cut-off events. [2025-03-04 06:52:27,536 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:52:27,536 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:27,537 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-04 06:52:27,537 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-03-04 06:52:27,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:27,542 INFO L85 PathProgramCache]: Analyzing trace with hash -83003237, now seen corresponding path program 1 times [2025-03-04 06:52:27,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:27,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82079926] [2025-03-04 06:52:27,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:27,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:27,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 06:52:27,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 06:52:27,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:27,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:28,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:28,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:28,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82079926] [2025-03-04 06:52:28,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82079926] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:28,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:28,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:52:28,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109608741] [2025-03-04 06:52:28,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:28,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:52:28,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:28,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:52:28,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:52:28,600 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 493 out of 583 [2025-03-04 06:52:28,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 545 places, 560 transitions, 1138 flow. Second operand has 6 states, 6 states have (on average 494.5) internal successors, (2967), 6 states have internal predecessors, (2967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:28,606 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:28,606 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 493 of 583 [2025-03-04 06:52:28,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:30,914 INFO L124 PetriNetUnfolderBase]: 2074/15191 cut-off events. [2025-03-04 06:52:30,915 INFO L125 PetriNetUnfolderBase]: For 633/635 co-relation queries the response was YES. [2025-03-04 06:52:30,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18394 conditions, 15191 events. 2074/15191 cut-off events. For 633/635 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 184251 event pairs, 1520 based on Foata normal form. 641/13459 useless extension candidates. Maximal degree in co-relation 16163. Up to 2820 conditions per place. [2025-03-04 06:52:31,026 INFO L140 encePairwiseOnDemand]: 549/583 looper letters, 54 selfloop transitions, 15 changer transitions 7/541 dead transitions. [2025-03-04 06:52:31,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 547 places, 541 transitions, 1238 flow [2025-03-04 06:52:31,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:52:31,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:52:31,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3046 transitions. [2025-03-04 06:52:31,040 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8707833047455689 [2025-03-04 06:52:31,042 INFO L175 Difference]: Start difference. First operand has 545 places, 560 transitions, 1138 flow. Second operand 6 states and 3046 transitions. [2025-03-04 06:52:31,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 547 places, 541 transitions, 1238 flow [2025-03-04 06:52:31,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 541 places, 541 transitions, 1226 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-04 06:52:31,062 INFO L231 Difference]: Finished difference. Result has 541 places, 534 transitions, 1104 flow [2025-03-04 06:52:31,065 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1088, PETRI_DIFFERENCE_MINUEND_PLACES=536, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=541, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=526, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1104, PETRI_PLACES=541, PETRI_TRANSITIONS=534} [2025-03-04 06:52:31,067 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, -4 predicate places. [2025-03-04 06:52:31,068 INFO L471 AbstractCegarLoop]: Abstraction has has 541 places, 534 transitions, 1104 flow [2025-03-04 06:52:31,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 494.5) internal successors, (2967), 6 states have internal predecessors, (2967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:31,070 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:31,070 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-04 06:52:31,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:52:31,070 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-03-04 06:52:31,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:31,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1097483258, now seen corresponding path program 1 times [2025-03-04 06:52:31,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:31,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155749321] [2025-03-04 06:52:31,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:31,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:31,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 06:52:31,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 06:52:31,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:31,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:31,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:31,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:31,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155749321] [2025-03-04 06:52:31,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155749321] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:31,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:31,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:31,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120146311] [2025-03-04 06:52:31,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:31,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:31,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:31,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:31,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:31,136 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 550 out of 583 [2025-03-04 06:52:31,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 541 places, 534 transitions, 1104 flow. Second operand has 3 states, 3 states have (on average 551.3333333333334) internal successors, (1654), 3 states have internal predecessors, (1654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:31,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:31,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 550 of 583 [2025-03-04 06:52:31,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:31,241 INFO L124 PetriNetUnfolderBase]: 24/956 cut-off events. [2025-03-04 06:52:31,241 INFO L125 PetriNetUnfolderBase]: For 2/5 co-relation queries the response was YES. [2025-03-04 06:52:31,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1007 conditions, 956 events. 24/956 cut-off events. For 2/5 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 3978 event pairs, 7 based on Foata normal form. 0/828 useless extension candidates. Maximal degree in co-relation 959. Up to 25 conditions per place. [2025-03-04 06:52:31,251 INFO L140 encePairwiseOnDemand]: 580/583 looper letters, 11 selfloop transitions, 2 changer transitions 0/533 dead transitions. [2025-03-04 06:52:31,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 535 places, 533 transitions, 1128 flow [2025-03-04 06:52:31,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:31,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:31,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1664 transitions. [2025-03-04 06:52:31,255 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9514008004574043 [2025-03-04 06:52:31,255 INFO L175 Difference]: Start difference. First operand has 541 places, 534 transitions, 1104 flow. Second operand 3 states and 1664 transitions. [2025-03-04 06:52:31,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 535 places, 533 transitions, 1128 flow [2025-03-04 06:52:31,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 530 places, 533 transitions, 1098 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:52:31,261 INFO L231 Difference]: Finished difference. Result has 530 places, 533 transitions, 1076 flow [2025-03-04 06:52:31,261 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1072, PETRI_DIFFERENCE_MINUEND_PLACES=528, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=533, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=531, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1076, PETRI_PLACES=530, PETRI_TRANSITIONS=533} [2025-03-04 06:52:31,262 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, -15 predicate places. [2025-03-04 06:52:31,262 INFO L471 AbstractCegarLoop]: Abstraction has has 530 places, 533 transitions, 1076 flow [2025-03-04 06:52:31,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 551.3333333333334) internal successors, (1654), 3 states have internal predecessors, (1654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:31,263 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:31,263 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-04 06:52:31,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:52:31,263 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-03-04 06:52:31,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:31,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1258338247, now seen corresponding path program 1 times [2025-03-04 06:52:31,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:31,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262870234] [2025-03-04 06:52:31,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:31,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:31,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-04 06:52:31,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-04 06:52:31,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:31,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:31,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:31,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:31,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262870234] [2025-03-04 06:52:31,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262870234] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:31,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:31,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:31,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401224908] [2025-03-04 06:52:31,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:31,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:31,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:31,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:31,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:31,323 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 550 out of 583 [2025-03-04 06:52:31,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 530 places, 533 transitions, 1076 flow. Second operand has 3 states, 3 states have (on average 551.3333333333334) internal successors, (1654), 3 states have internal predecessors, (1654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:31,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:31,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 550 of 583 [2025-03-04 06:52:31,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:31,394 INFO L124 PetriNetUnfolderBase]: 18/748 cut-off events. [2025-03-04 06:52:31,394 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-03-04 06:52:31,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 781 conditions, 748 events. 18/748 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2627 event pairs, 5 based on Foata normal form. 0/655 useless extension candidates. Maximal degree in co-relation 708. Up to 22 conditions per place. [2025-03-04 06:52:31,400 INFO L140 encePairwiseOnDemand]: 580/583 looper letters, 11 selfloop transitions, 2 changer transitions 0/532 dead transitions. [2025-03-04 06:52:31,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 531 places, 532 transitions, 1100 flow [2025-03-04 06:52:31,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:31,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:31,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1664 transitions. [2025-03-04 06:52:31,403 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9514008004574043 [2025-03-04 06:52:31,403 INFO L175 Difference]: Start difference. First operand has 530 places, 533 transitions, 1076 flow. Second operand 3 states and 1664 transitions. [2025-03-04 06:52:31,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 531 places, 532 transitions, 1100 flow [2025-03-04 06:52:31,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 529 places, 532 transitions, 1096 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:52:31,409 INFO L231 Difference]: Finished difference. Result has 529 places, 532 transitions, 1074 flow [2025-03-04 06:52:31,409 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1070, PETRI_DIFFERENCE_MINUEND_PLACES=527, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=532, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=530, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1074, PETRI_PLACES=529, PETRI_TRANSITIONS=532} [2025-03-04 06:52:31,410 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, -16 predicate places. [2025-03-04 06:52:31,410 INFO L471 AbstractCegarLoop]: Abstraction has has 529 places, 532 transitions, 1074 flow [2025-03-04 06:52:31,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 551.3333333333334) internal successors, (1654), 3 states have internal predecessors, (1654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:31,411 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:31,411 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] [2025-03-04 06:52:31,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:52:31,411 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-03-04 06:52:31,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:31,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1448650468, now seen corresponding path program 1 times [2025-03-04 06:52:31,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:31,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210426365] [2025-03-04 06:52:31,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:31,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:31,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-04 06:52:31,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-04 06:52:31,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:31,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:31,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:31,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:31,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210426365] [2025-03-04 06:52:31,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210426365] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:31,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:31,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:31,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801179517] [2025-03-04 06:52:31,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:31,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:31,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:31,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:31,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:31,531 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 550 out of 583 [2025-03-04 06:52:31,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 529 places, 532 transitions, 1074 flow. Second operand has 3 states, 3 states have (on average 551.3333333333334) internal successors, (1654), 3 states have internal predecessors, (1654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:31,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:31,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 550 of 583 [2025-03-04 06:52:31,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:31,607 INFO L124 PetriNetUnfolderBase]: 18/645 cut-off events. [2025-03-04 06:52:31,607 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2025-03-04 06:52:31,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 680 conditions, 645 events. 18/645 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2031 event pairs, 7 based on Foata normal form. 0/570 useless extension candidates. Maximal degree in co-relation 560. Up to 25 conditions per place. [2025-03-04 06:52:31,613 INFO L140 encePairwiseOnDemand]: 580/583 looper letters, 11 selfloop transitions, 2 changer transitions 0/531 dead transitions. [2025-03-04 06:52:31,614 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 530 places, 531 transitions, 1098 flow [2025-03-04 06:52:31,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:31,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:31,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1664 transitions. [2025-03-04 06:52:31,617 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9514008004574043 [2025-03-04 06:52:31,617 INFO L175 Difference]: Start difference. First operand has 529 places, 532 transitions, 1074 flow. Second operand 3 states and 1664 transitions. [2025-03-04 06:52:31,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 530 places, 531 transitions, 1098 flow [2025-03-04 06:52:31,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 528 places, 531 transitions, 1094 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:52:31,625 INFO L231 Difference]: Finished difference. Result has 528 places, 531 transitions, 1072 flow [2025-03-04 06:52:31,626 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1068, PETRI_DIFFERENCE_MINUEND_PLACES=526, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=531, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=529, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1072, PETRI_PLACES=528, PETRI_TRANSITIONS=531} [2025-03-04 06:52:31,626 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, -17 predicate places. [2025-03-04 06:52:31,627 INFO L471 AbstractCegarLoop]: Abstraction has has 528 places, 531 transitions, 1072 flow [2025-03-04 06:52:31,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 551.3333333333334) internal successors, (1654), 3 states have internal predecessors, (1654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:31,627 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:31,628 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] [2025-03-04 06:52:31,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:52:31,628 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-03-04 06:52:31,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:31,629 INFO L85 PathProgramCache]: Analyzing trace with hash -859777081, now seen corresponding path program 1 times [2025-03-04 06:52:31,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:31,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759236230] [2025-03-04 06:52:31,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:31,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:31,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-04 06:52:31,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 06:52:31,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:31,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:31,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:31,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:31,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759236230] [2025-03-04 06:52:31,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759236230] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:31,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:31,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:31,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667151648] [2025-03-04 06:52:31,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:31,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:31,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:31,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:31,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:31,697 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 550 out of 583 [2025-03-04 06:52:31,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 528 places, 531 transitions, 1072 flow. Second operand has 3 states, 3 states have (on average 551.3333333333334) internal successors, (1654), 3 states have internal predecessors, (1654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:31,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:31,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 550 of 583 [2025-03-04 06:52:31,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:31,807 INFO L124 PetriNetUnfolderBase]: 28/1131 cut-off events. [2025-03-04 06:52:31,807 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 06:52:31,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1169 conditions, 1131 events. 28/1131 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 5512 event pairs, 7 based on Foata normal form. 0/973 useless extension candidates. Maximal degree in co-relation 1002. Up to 25 conditions per place. [2025-03-04 06:52:31,819 INFO L140 encePairwiseOnDemand]: 580/583 looper letters, 11 selfloop transitions, 2 changer transitions 0/530 dead transitions. [2025-03-04 06:52:31,819 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 529 places, 530 transitions, 1096 flow [2025-03-04 06:52:31,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:31,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:31,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1664 transitions. [2025-03-04 06:52:31,822 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9514008004574043 [2025-03-04 06:52:31,822 INFO L175 Difference]: Start difference. First operand has 528 places, 531 transitions, 1072 flow. Second operand 3 states and 1664 transitions. [2025-03-04 06:52:31,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 529 places, 530 transitions, 1096 flow [2025-03-04 06:52:31,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 527 places, 530 transitions, 1092 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:52:31,833 INFO L231 Difference]: Finished difference. Result has 527 places, 530 transitions, 1070 flow [2025-03-04 06:52:31,834 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1066, PETRI_DIFFERENCE_MINUEND_PLACES=525, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=530, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=528, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1070, PETRI_PLACES=527, PETRI_TRANSITIONS=530} [2025-03-04 06:52:31,836 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, -18 predicate places. [2025-03-04 06:52:31,836 INFO L471 AbstractCegarLoop]: Abstraction has has 527 places, 530 transitions, 1070 flow [2025-03-04 06:52:31,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 551.3333333333334) internal successors, (1654), 3 states have internal predecessors, (1654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:31,837 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:31,837 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-04 06:52:31,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:52:31,838 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-03-04 06:52:31,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:31,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1946930681, now seen corresponding path program 1 times [2025-03-04 06:52:31,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:31,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898248968] [2025-03-04 06:52:31,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:31,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:31,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-04 06:52:31,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-04 06:52:31,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:31,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:31,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:31,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:31,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898248968] [2025-03-04 06:52:31,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898248968] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:31,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:31,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:31,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544960613] [2025-03-04 06:52:31,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:31,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:31,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:31,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:31,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:31,910 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 550 out of 583 [2025-03-04 06:52:31,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 527 places, 530 transitions, 1070 flow. Second operand has 3 states, 3 states have (on average 551.3333333333334) internal successors, (1654), 3 states have internal predecessors, (1654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:31,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:31,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 550 of 583 [2025-03-04 06:52:31,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:32,003 INFO L124 PetriNetUnfolderBase]: 22/941 cut-off events. [2025-03-04 06:52:32,003 INFO L125 PetriNetUnfolderBase]: For 5/10 co-relation queries the response was YES. [2025-03-04 06:52:32,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 974 conditions, 941 events. 22/941 cut-off events. For 5/10 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 3561 event pairs, 5 based on Foata normal form. 0/819 useless extension candidates. Maximal degree in co-relation 799. Up to 22 conditions per place. [2025-03-04 06:52:32,013 INFO L140 encePairwiseOnDemand]: 580/583 looper letters, 11 selfloop transitions, 2 changer transitions 0/529 dead transitions. [2025-03-04 06:52:32,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 528 places, 529 transitions, 1094 flow [2025-03-04 06:52:32,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:32,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:32,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1664 transitions. [2025-03-04 06:52:32,016 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9514008004574043 [2025-03-04 06:52:32,016 INFO L175 Difference]: Start difference. First operand has 527 places, 530 transitions, 1070 flow. Second operand 3 states and 1664 transitions. [2025-03-04 06:52:32,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 528 places, 529 transitions, 1094 flow [2025-03-04 06:52:32,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 526 places, 529 transitions, 1090 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:52:32,022 INFO L231 Difference]: Finished difference. Result has 526 places, 529 transitions, 1068 flow [2025-03-04 06:52:32,023 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1064, PETRI_DIFFERENCE_MINUEND_PLACES=524, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=529, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=527, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1068, PETRI_PLACES=526, PETRI_TRANSITIONS=529} [2025-03-04 06:52:32,023 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, -19 predicate places. [2025-03-04 06:52:32,023 INFO L471 AbstractCegarLoop]: Abstraction has has 526 places, 529 transitions, 1068 flow [2025-03-04 06:52:32,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 551.3333333333334) internal successors, (1654), 3 states have internal predecessors, (1654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:32,024 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:32,024 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-04 06:52:32,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 06:52:32,024 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-03-04 06:52:32,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:32,025 INFO L85 PathProgramCache]: Analyzing trace with hash 113104616, now seen corresponding path program 1 times [2025-03-04 06:52:32,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:32,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649007673] [2025-03-04 06:52:32,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:32,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:32,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-04 06:52:32,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-04 06:52:32,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:32,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:32,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:32,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:32,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649007673] [2025-03-04 06:52:32,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649007673] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:32,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:32,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:32,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106596039] [2025-03-04 06:52:32,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:32,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:32,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:32,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:32,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:32,085 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 550 out of 583 [2025-03-04 06:52:32,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 526 places, 529 transitions, 1068 flow. Second operand has 3 states, 3 states have (on average 551.3333333333334) internal successors, (1654), 3 states have internal predecessors, (1654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:32,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:32,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 550 of 583 [2025-03-04 06:52:32,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:32,194 INFO L124 PetriNetUnfolderBase]: 24/906 cut-off events. [2025-03-04 06:52:32,195 INFO L125 PetriNetUnfolderBase]: For 6/15 co-relation queries the response was YES. [2025-03-04 06:52:32,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 941 conditions, 906 events. 24/906 cut-off events. For 6/15 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 3255 event pairs, 7 based on Foata normal form. 0/790 useless extension candidates. Maximal degree in co-relation 758. Up to 25 conditions per place. [2025-03-04 06:52:32,203 INFO L140 encePairwiseOnDemand]: 580/583 looper letters, 11 selfloop transitions, 2 changer transitions 0/528 dead transitions. [2025-03-04 06:52:32,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 527 places, 528 transitions, 1092 flow [2025-03-04 06:52:32,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:32,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:32,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1664 transitions. [2025-03-04 06:52:32,206 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9514008004574043 [2025-03-04 06:52:32,207 INFO L175 Difference]: Start difference. First operand has 526 places, 529 transitions, 1068 flow. Second operand 3 states and 1664 transitions. [2025-03-04 06:52:32,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 527 places, 528 transitions, 1092 flow [2025-03-04 06:52:32,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 525 places, 528 transitions, 1088 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:52:32,212 INFO L231 Difference]: Finished difference. Result has 525 places, 528 transitions, 1066 flow [2025-03-04 06:52:32,212 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1062, PETRI_DIFFERENCE_MINUEND_PLACES=523, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=528, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=526, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1066, PETRI_PLACES=525, PETRI_TRANSITIONS=528} [2025-03-04 06:52:32,213 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, -20 predicate places. [2025-03-04 06:52:32,213 INFO L471 AbstractCegarLoop]: Abstraction has has 525 places, 528 transitions, 1066 flow [2025-03-04 06:52:32,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 551.3333333333334) internal successors, (1654), 3 states have internal predecessors, (1654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:32,214 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:32,214 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] [2025-03-04 06:52:32,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 06:52:32,214 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-03-04 06:52:32,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:32,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1320611906, now seen corresponding path program 1 times [2025-03-04 06:52:32,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:32,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595949547] [2025-03-04 06:52:32,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:32,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:32,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-04 06:52:32,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-04 06:52:32,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:32,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:32,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:32,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:32,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595949547] [2025-03-04 06:52:32,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595949547] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:32,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:32,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:32,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264367590] [2025-03-04 06:52:32,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:32,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:32,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:32,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:32,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:32,262 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 552 out of 583 [2025-03-04 06:52:32,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 525 places, 528 transitions, 1066 flow. Second operand has 3 states, 3 states have (on average 553.3333333333334) internal successors, (1660), 3 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:32,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:32,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 552 of 583 [2025-03-04 06:52:32,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:32,388 INFO L124 PetriNetUnfolderBase]: 45/1330 cut-off events. [2025-03-04 06:52:32,388 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 06:52:32,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1395 conditions, 1330 events. 45/1330 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 7330 event pairs, 6 based on Foata normal form. 0/1148 useless extension candidates. Maximal degree in co-relation 1204. Up to 43 conditions per place. [2025-03-04 06:52:32,402 INFO L140 encePairwiseOnDemand]: 579/583 looper letters, 13 selfloop transitions, 2 changer transitions 0/530 dead transitions. [2025-03-04 06:52:32,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 525 places, 530 transitions, 1102 flow [2025-03-04 06:52:32,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:32,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:32,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1673 transitions. [2025-03-04 06:52:32,406 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.956546598056032 [2025-03-04 06:52:32,406 INFO L175 Difference]: Start difference. First operand has 525 places, 528 transitions, 1066 flow. Second operand 3 states and 1673 transitions. [2025-03-04 06:52:32,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 525 places, 530 transitions, 1102 flow [2025-03-04 06:52:32,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 523 places, 530 transitions, 1098 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:52:32,414 INFO L231 Difference]: Finished difference. Result has 524 places, 528 transitions, 1072 flow [2025-03-04 06:52:32,415 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1058, PETRI_DIFFERENCE_MINUEND_PLACES=521, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=526, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=524, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1072, PETRI_PLACES=524, PETRI_TRANSITIONS=528} [2025-03-04 06:52:32,415 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, -21 predicate places. [2025-03-04 06:52:32,416 INFO L471 AbstractCegarLoop]: Abstraction has has 524 places, 528 transitions, 1072 flow [2025-03-04 06:52:32,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 553.3333333333334) internal successors, (1660), 3 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:32,417 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:32,417 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:52:32,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 06:52:32,417 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-03-04 06:52:32,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:32,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1054006339, now seen corresponding path program 1 times [2025-03-04 06:52:32,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:32,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042859553] [2025-03-04 06:52:32,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:32,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:32,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-04 06:52:32,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-04 06:52:32,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:32,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:32,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:32,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:32,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042859553] [2025-03-04 06:52:32,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042859553] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:32,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:32,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:32,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87376667] [2025-03-04 06:52:32,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:32,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:32,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:32,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:32,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:32,464 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 552 out of 583 [2025-03-04 06:52:32,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 524 places, 528 transitions, 1072 flow. Second operand has 3 states, 3 states have (on average 553.3333333333334) internal successors, (1660), 3 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:32,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:32,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 552 of 583 [2025-03-04 06:52:32,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:32,582 INFO L124 PetriNetUnfolderBase]: 36/1203 cut-off events. [2025-03-04 06:52:32,582 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-04 06:52:32,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1254 conditions, 1203 events. 36/1203 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 5733 event pairs, 6 based on Foata normal form. 0/1048 useless extension candidates. Maximal degree in co-relation 953. Up to 31 conditions per place. [2025-03-04 06:52:32,598 INFO L140 encePairwiseOnDemand]: 579/583 looper letters, 13 selfloop transitions, 2 changer transitions 0/530 dead transitions. [2025-03-04 06:52:32,598 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 524 places, 530 transitions, 1108 flow [2025-03-04 06:52:32,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:32,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:32,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1673 transitions. [2025-03-04 06:52:32,601 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.956546598056032 [2025-03-04 06:52:32,601 INFO L175 Difference]: Start difference. First operand has 524 places, 528 transitions, 1072 flow. Second operand 3 states and 1673 transitions. [2025-03-04 06:52:32,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 524 places, 530 transitions, 1108 flow [2025-03-04 06:52:32,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 524 places, 530 transitions, 1108 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:52:32,658 INFO L231 Difference]: Finished difference. Result has 525 places, 528 transitions, 1082 flow [2025-03-04 06:52:32,658 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1068, PETRI_DIFFERENCE_MINUEND_PLACES=522, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=526, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=524, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1082, PETRI_PLACES=525, PETRI_TRANSITIONS=528} [2025-03-04 06:52:32,659 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, -20 predicate places. [2025-03-04 06:52:32,659 INFO L471 AbstractCegarLoop]: Abstraction has has 525 places, 528 transitions, 1082 flow [2025-03-04 06:52:32,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 553.3333333333334) internal successors, (1660), 3 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:32,660 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:32,660 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] [2025-03-04 06:52:32,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 06:52:32,660 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-03-04 06:52:32,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:32,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1383249503, now seen corresponding path program 1 times [2025-03-04 06:52:32,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:32,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505464273] [2025-03-04 06:52:32,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:32,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:32,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-04 06:52:32,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-04 06:52:32,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:32,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:32,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:32,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:32,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505464273] [2025-03-04 06:52:32,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505464273] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:32,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:32,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:32,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149177328] [2025-03-04 06:52:32,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:32,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:32,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:32,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:32,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:32,738 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 549 out of 583 [2025-03-04 06:52:32,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 525 places, 528 transitions, 1082 flow. Second operand has 3 states, 3 states have (on average 550.3333333333334) internal successors, (1651), 3 states have internal predecessors, (1651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:32,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:32,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 549 of 583 [2025-03-04 06:52:32,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:32,903 INFO L124 PetriNetUnfolderBase]: 39/1108 cut-off events. [2025-03-04 06:52:32,903 INFO L125 PetriNetUnfolderBase]: For 2/14 co-relation queries the response was YES. [2025-03-04 06:52:32,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1192 conditions, 1108 events. 39/1108 cut-off events. For 2/14 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 5598 event pairs, 12 based on Foata normal form. 1/971 useless extension candidates. Maximal degree in co-relation 891. Up to 38 conditions per place. [2025-03-04 06:52:32,919 INFO L140 encePairwiseOnDemand]: 580/583 looper letters, 15 selfloop transitions, 2 changer transitions 0/529 dead transitions. [2025-03-04 06:52:32,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 526 places, 529 transitions, 1120 flow [2025-03-04 06:52:32,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:32,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:32,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1665 transitions. [2025-03-04 06:52:32,922 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9519725557461407 [2025-03-04 06:52:32,922 INFO L175 Difference]: Start difference. First operand has 525 places, 528 transitions, 1082 flow. Second operand 3 states and 1665 transitions. [2025-03-04 06:52:32,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 526 places, 529 transitions, 1120 flow [2025-03-04 06:52:32,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 526 places, 529 transitions, 1120 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:52:32,930 INFO L231 Difference]: Finished difference. Result has 526 places, 527 transitions, 1084 flow [2025-03-04 06:52:32,930 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1080, PETRI_DIFFERENCE_MINUEND_PLACES=524, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=527, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=525, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1084, PETRI_PLACES=526, PETRI_TRANSITIONS=527} [2025-03-04 06:52:32,931 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, -19 predicate places. [2025-03-04 06:52:32,931 INFO L471 AbstractCegarLoop]: Abstraction has has 526 places, 527 transitions, 1084 flow [2025-03-04 06:52:32,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 550.3333333333334) internal successors, (1651), 3 states have internal predecessors, (1651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:32,932 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:32,932 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] [2025-03-04 06:52:32,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 06:52:32,932 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-03-04 06:52:32,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:32,933 INFO L85 PathProgramCache]: Analyzing trace with hash -987302140, now seen corresponding path program 1 times [2025-03-04 06:52:32,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:32,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770902562] [2025-03-04 06:52:32,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:32,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:32,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-04 06:52:32,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-04 06:52:32,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:32,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:32,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-04 06:52:32,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:32,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770902562] [2025-03-04 06:52:32,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770902562] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:32,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:32,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:32,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928045044] [2025-03-04 06:52:32,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:32,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:32,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:32,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:32,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:32,995 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 552 out of 583 [2025-03-04 06:52:32,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 526 places, 527 transitions, 1084 flow. Second operand has 3 states, 3 states have (on average 553.6666666666666) internal successors, (1661), 3 states have internal predecessors, (1661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:32,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:32,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 552 of 583 [2025-03-04 06:52:32,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:33,291 INFO L124 PetriNetUnfolderBase]: 77/2149 cut-off events. [2025-03-04 06:52:33,292 INFO L125 PetriNetUnfolderBase]: For 13/17 co-relation queries the response was YES. [2025-03-04 06:52:33,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2246 conditions, 2149 events. 77/2149 cut-off events. For 13/17 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 15045 event pairs, 16 based on Foata normal form. 0/1857 useless extension candidates. Maximal degree in co-relation 1651. Up to 66 conditions per place. [2025-03-04 06:52:33,318 INFO L140 encePairwiseOnDemand]: 579/583 looper letters, 13 selfloop transitions, 2 changer transitions 0/529 dead transitions. [2025-03-04 06:52:33,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 526 places, 529 transitions, 1120 flow [2025-03-04 06:52:33,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:33,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:33,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1673 transitions. [2025-03-04 06:52:33,322 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.956546598056032 [2025-03-04 06:52:33,322 INFO L175 Difference]: Start difference. First operand has 526 places, 527 transitions, 1084 flow. Second operand 3 states and 1673 transitions. [2025-03-04 06:52:33,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 526 places, 529 transitions, 1120 flow [2025-03-04 06:52:33,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 524 places, 529 transitions, 1116 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:52:33,330 INFO L231 Difference]: Finished difference. Result has 525 places, 527 transitions, 1090 flow [2025-03-04 06:52:33,330 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1076, PETRI_DIFFERENCE_MINUEND_PLACES=522, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=525, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=523, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1090, PETRI_PLACES=525, PETRI_TRANSITIONS=527} [2025-03-04 06:52:33,331 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, -20 predicate places. [2025-03-04 06:52:33,331 INFO L471 AbstractCegarLoop]: Abstraction has has 525 places, 527 transitions, 1090 flow [2025-03-04 06:52:33,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 553.6666666666666) internal successors, (1661), 3 states have internal predecessors, (1661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:33,332 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:33,332 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-04 06:52:33,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 06:52:33,332 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-03-04 06:52:33,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:33,333 INFO L85 PathProgramCache]: Analyzing trace with hash -624284565, now seen corresponding path program 1 times [2025-03-04 06:52:33,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:33,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340727484] [2025-03-04 06:52:33,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:33,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:33,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-04 06:52:33,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-04 06:52:33,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:33,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:33,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:33,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:33,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340727484] [2025-03-04 06:52:33,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340727484] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:33,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:33,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:33,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714772768] [2025-03-04 06:52:33,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:33,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:33,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:33,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:33,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:33,395 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 552 out of 583 [2025-03-04 06:52:33,396 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 525 places, 527 transitions, 1090 flow. Second operand has 3 states, 3 states have (on average 553.3333333333334) internal successors, (1660), 3 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:33,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:33,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 552 of 583 [2025-03-04 06:52:33,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:33,713 INFO L124 PetriNetUnfolderBase]: 77/1945 cut-off events. [2025-03-04 06:52:33,714 INFO L125 PetriNetUnfolderBase]: For 7/11 co-relation queries the response was YES. [2025-03-04 06:52:33,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2067 conditions, 1945 events. 77/1945 cut-off events. For 7/11 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 12856 event pairs, 4 based on Foata normal form. 1/1687 useless extension candidates. Maximal degree in co-relation 1564. Up to 69 conditions per place. [2025-03-04 06:52:33,742 INFO L140 encePairwiseOnDemand]: 579/583 looper letters, 16 selfloop transitions, 2 changer transitions 0/532 dead transitions. [2025-03-04 06:52:33,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 525 places, 532 transitions, 1141 flow [2025-03-04 06:52:33,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:33,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:33,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1676 transitions. [2025-03-04 06:52:33,745 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9582618639222413 [2025-03-04 06:52:33,746 INFO L175 Difference]: Start difference. First operand has 525 places, 527 transitions, 1090 flow. Second operand 3 states and 1676 transitions. [2025-03-04 06:52:33,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 525 places, 532 transitions, 1141 flow [2025-03-04 06:52:33,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 525 places, 532 transitions, 1141 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:52:33,752 INFO L231 Difference]: Finished difference. Result has 526 places, 527 transitions, 1100 flow [2025-03-04 06:52:33,753 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1086, PETRI_DIFFERENCE_MINUEND_PLACES=523, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=525, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=523, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1100, PETRI_PLACES=526, PETRI_TRANSITIONS=527} [2025-03-04 06:52:33,754 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, -19 predicate places. [2025-03-04 06:52:33,754 INFO L471 AbstractCegarLoop]: Abstraction has has 526 places, 527 transitions, 1100 flow [2025-03-04 06:52:33,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 553.3333333333334) internal successors, (1660), 3 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:33,755 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:33,755 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] [2025-03-04 06:52:33,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 06:52:33,755 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-03-04 06:52:33,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:33,756 INFO L85 PathProgramCache]: Analyzing trace with hash 2122046949, now seen corresponding path program 1 times [2025-03-04 06:52:33,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:33,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729651855] [2025-03-04 06:52:33,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:33,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:33,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-04 06:52:33,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-04 06:52:33,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:33,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:33,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-04 06:52:33,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:33,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729651855] [2025-03-04 06:52:33,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729651855] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:33,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:33,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:33,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258496257] [2025-03-04 06:52:33,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:33,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:33,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:33,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:33,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:33,836 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 547 out of 583 [2025-03-04 06:52:33,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 526 places, 527 transitions, 1100 flow. Second operand has 3 states, 3 states have (on average 548.3333333333334) internal successors, (1645), 3 states have internal predecessors, (1645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:33,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:33,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 547 of 583 [2025-03-04 06:52:33,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:34,267 INFO L124 PetriNetUnfolderBase]: 90/2599 cut-off events. [2025-03-04 06:52:34,268 INFO L125 PetriNetUnfolderBase]: For 7/15 co-relation queries the response was YES. [2025-03-04 06:52:34,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2789 conditions, 2599 events. 90/2599 cut-off events. For 7/15 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 17733 event pairs, 10 based on Foata normal form. 0/2265 useless extension candidates. Maximal degree in co-relation 2373. Up to 40 conditions per place. [2025-03-04 06:52:34,286 INFO L140 encePairwiseOnDemand]: 575/583 looper letters, 15 selfloop transitions, 5 changer transitions 0/529 dead transitions. [2025-03-04 06:52:34,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 525 places, 529 transitions, 1146 flow [2025-03-04 06:52:34,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:34,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:34,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1664 transitions. [2025-03-04 06:52:34,289 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9514008004574043 [2025-03-04 06:52:34,289 INFO L175 Difference]: Start difference. First operand has 526 places, 527 transitions, 1100 flow. Second operand 3 states and 1664 transitions. [2025-03-04 06:52:34,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 525 places, 529 transitions, 1146 flow [2025-03-04 06:52:34,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 525 places, 529 transitions, 1146 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:52:34,294 INFO L231 Difference]: Finished difference. Result has 527 places, 527 transitions, 1126 flow [2025-03-04 06:52:34,295 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1094, PETRI_DIFFERENCE_MINUEND_PLACES=523, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=524, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=519, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1126, PETRI_PLACES=527, PETRI_TRANSITIONS=527} [2025-03-04 06:52:34,295 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, -18 predicate places. [2025-03-04 06:52:34,295 INFO L471 AbstractCegarLoop]: Abstraction has has 527 places, 527 transitions, 1126 flow [2025-03-04 06:52:34,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 548.3333333333334) internal successors, (1645), 3 states have internal predecessors, (1645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:34,296 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:34,296 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] [2025-03-04 06:52:34,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 06:52:34,297 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-03-04 06:52:34,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:34,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1305608933, now seen corresponding path program 1 times [2025-03-04 06:52:34,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:34,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775704800] [2025-03-04 06:52:34,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:34,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:34,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-04 06:52:34,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-04 06:52:34,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:34,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:34,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:34,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:34,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775704800] [2025-03-04 06:52:34,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775704800] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:34,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:34,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:34,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795741732] [2025-03-04 06:52:34,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:34,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:34,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:34,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:34,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:34,364 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 548 out of 583 [2025-03-04 06:52:34,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 527 places, 527 transitions, 1126 flow. Second operand has 3 states, 3 states have (on average 549.6666666666666) internal successors, (1649), 3 states have internal predecessors, (1649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:34,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:34,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 548 of 583 [2025-03-04 06:52:34,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:34,639 INFO L124 PetriNetUnfolderBase]: 104/2074 cut-off events. [2025-03-04 06:52:34,640 INFO L125 PetriNetUnfolderBase]: For 31/63 co-relation queries the response was YES. [2025-03-04 06:52:34,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2326 conditions, 2074 events. 104/2074 cut-off events. For 31/63 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 13959 event pairs, 36 based on Foata normal form. 1/1806 useless extension candidates. Maximal degree in co-relation 1940. Up to 112 conditions per place. [2025-03-04 06:52:34,670 INFO L140 encePairwiseOnDemand]: 580/583 looper letters, 16 selfloop transitions, 2 changer transitions 0/528 dead transitions. [2025-03-04 06:52:34,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 528 places, 528 transitions, 1166 flow [2025-03-04 06:52:34,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:34,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:34,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1663 transitions. [2025-03-04 06:52:34,673 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9508290451686678 [2025-03-04 06:52:34,673 INFO L175 Difference]: Start difference. First operand has 527 places, 527 transitions, 1126 flow. Second operand 3 states and 1663 transitions. [2025-03-04 06:52:34,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 528 places, 528 transitions, 1166 flow [2025-03-04 06:52:34,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 526 places, 528 transitions, 1156 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:52:34,679 INFO L231 Difference]: Finished difference. Result has 526 places, 526 transitions, 1118 flow [2025-03-04 06:52:34,680 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1114, PETRI_DIFFERENCE_MINUEND_PLACES=524, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=526, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=524, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1118, PETRI_PLACES=526, PETRI_TRANSITIONS=526} [2025-03-04 06:52:34,680 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, -19 predicate places. [2025-03-04 06:52:34,680 INFO L471 AbstractCegarLoop]: Abstraction has has 526 places, 526 transitions, 1118 flow [2025-03-04 06:52:34,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 549.6666666666666) internal successors, (1649), 3 states have internal predecessors, (1649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:34,681 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:34,681 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] [2025-03-04 06:52:34,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 06:52:34,682 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-03-04 06:52:34,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:34,682 INFO L85 PathProgramCache]: Analyzing trace with hash 307806930, now seen corresponding path program 1 times [2025-03-04 06:52:34,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:34,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485415775] [2025-03-04 06:52:34,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:34,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:34,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-04 06:52:34,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-04 06:52:34,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:34,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:34,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:34,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:34,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485415775] [2025-03-04 06:52:34,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485415775] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:34,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:34,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 06:52:34,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280690823] [2025-03-04 06:52:34,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:34,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 06:52:34,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:34,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 06:52:34,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 06:52:34,822 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 551 out of 583 [2025-03-04 06:52:34,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 526 places, 526 transitions, 1118 flow. Second operand has 4 states, 4 states have (on average 552.25) internal successors, (2209), 4 states have internal predecessors, (2209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:34,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:34,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 551 of 583 [2025-03-04 06:52:34,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:35,203 INFO L124 PetriNetUnfolderBase]: 99/3208 cut-off events. [2025-03-04 06:52:35,203 INFO L125 PetriNetUnfolderBase]: For 9/43 co-relation queries the response was YES. [2025-03-04 06:52:35,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3478 conditions, 3208 events. 99/3208 cut-off events. For 9/43 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 22138 event pairs, 15 based on Foata normal form. 4/2801 useless extension candidates. Maximal degree in co-relation 3059. Up to 50 conditions per place. [2025-03-04 06:52:35,234 INFO L140 encePairwiseOnDemand]: 578/583 looper letters, 27 selfloop transitions, 4 changer transitions 0/542 dead transitions. [2025-03-04 06:52:35,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 530 places, 542 transitions, 1222 flow [2025-03-04 06:52:35,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 06:52:35,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 06:52:35,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2787 transitions. [2025-03-04 06:52:35,237 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9560891938250429 [2025-03-04 06:52:35,237 INFO L175 Difference]: Start difference. First operand has 526 places, 526 transitions, 1118 flow. Second operand 5 states and 2787 transitions. [2025-03-04 06:52:35,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 530 places, 542 transitions, 1222 flow [2025-03-04 06:52:35,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 528 places, 542 transitions, 1218 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:52:35,243 INFO L231 Difference]: Finished difference. Result has 531 places, 528 transitions, 1139 flow [2025-03-04 06:52:35,244 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1110, PETRI_DIFFERENCE_MINUEND_PLACES=524, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=525, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=521, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1139, PETRI_PLACES=531, PETRI_TRANSITIONS=528} [2025-03-04 06:52:35,244 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, -14 predicate places. [2025-03-04 06:52:35,244 INFO L471 AbstractCegarLoop]: Abstraction has has 531 places, 528 transitions, 1139 flow [2025-03-04 06:52:35,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 552.25) internal successors, (2209), 4 states have internal predecessors, (2209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:35,245 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:35,245 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:52:35,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 06:52:35,245 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-03-04 06:52:35,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:35,246 INFO L85 PathProgramCache]: Analyzing trace with hash -683721101, now seen corresponding path program 1 times [2025-03-04 06:52:35,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:35,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348974511] [2025-03-04 06:52:35,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:35,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:35,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-04 06:52:35,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-04 06:52:35,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:35,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:35,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:35,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:35,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348974511] [2025-03-04 06:52:35,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348974511] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:35,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:35,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:52:35,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717734404] [2025-03-04 06:52:35,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:35,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 06:52:35,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:35,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 06:52:35,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 06:52:35,444 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 532 out of 583 [2025-03-04 06:52:35,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 531 places, 528 transitions, 1139 flow. Second operand has 5 states, 5 states have (on average 537.0) internal successors, (2685), 5 states have internal predecessors, (2685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:35,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:35,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 532 of 583 [2025-03-04 06:52:35,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:35,655 INFO L124 PetriNetUnfolderBase]: 33/1368 cut-off events. [2025-03-04 06:52:35,655 INFO L125 PetriNetUnfolderBase]: For 8/22 co-relation queries the response was YES. [2025-03-04 06:52:35,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1493 conditions, 1368 events. 33/1368 cut-off events. For 8/22 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 6532 event pairs, 1 based on Foata normal form. 3/1218 useless extension candidates. Maximal degree in co-relation 1367. Up to 20 conditions per place. [2025-03-04 06:52:35,667 INFO L140 encePairwiseOnDemand]: 562/583 looper letters, 18 selfloop transitions, 18 changer transitions 0/531 dead transitions. [2025-03-04 06:52:35,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 535 places, 531 transitions, 1217 flow [2025-03-04 06:52:35,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 06:52:35,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 06:52:35,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2699 transitions. [2025-03-04 06:52:35,670 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9259005145797599 [2025-03-04 06:52:35,670 INFO L175 Difference]: Start difference. First operand has 531 places, 528 transitions, 1139 flow. Second operand 5 states and 2699 transitions. [2025-03-04 06:52:35,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 535 places, 531 transitions, 1217 flow [2025-03-04 06:52:35,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 535 places, 531 transitions, 1217 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:52:35,676 INFO L231 Difference]: Finished difference. Result has 536 places, 531 transitions, 1199 flow [2025-03-04 06:52:35,676 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1139, PETRI_DIFFERENCE_MINUEND_PLACES=531, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=528, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=510, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1199, PETRI_PLACES=536, PETRI_TRANSITIONS=531} [2025-03-04 06:52:35,677 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, -9 predicate places. [2025-03-04 06:52:35,677 INFO L471 AbstractCegarLoop]: Abstraction has has 536 places, 531 transitions, 1199 flow [2025-03-04 06:52:35,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 537.0) internal successors, (2685), 5 states have internal predecessors, (2685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:35,678 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:35,678 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] [2025-03-04 06:52:35,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 06:52:35,678 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-03-04 06:52:35,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:35,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1440188446, now seen corresponding path program 1 times [2025-03-04 06:52:35,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:35,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901986922] [2025-03-04 06:52:35,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:35,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:35,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-04 06:52:35,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-04 06:52:35,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:35,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:35,733 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-04 06:52:35,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:35,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901986922] [2025-03-04 06:52:35,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901986922] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:35,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:35,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:35,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629324058] [2025-03-04 06:52:35,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:35,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:35,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:35,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:35,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:35,757 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 549 out of 583 [2025-03-04 06:52:35,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 536 places, 531 transitions, 1199 flow. Second operand has 3 states, 3 states have (on average 551.0) internal successors, (1653), 3 states have internal predecessors, (1653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:35,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:35,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 549 of 583 [2025-03-04 06:52:35,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:36,329 INFO L124 PetriNetUnfolderBase]: 142/4467 cut-off events. [2025-03-04 06:52:36,330 INFO L125 PetriNetUnfolderBase]: For 46/93 co-relation queries the response was YES. [2025-03-04 06:52:36,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4867 conditions, 4467 events. 142/4467 cut-off events. For 46/93 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 35283 event pairs, 28 based on Foata normal form. 7/3908 useless extension candidates. Maximal degree in co-relation 4638. Up to 95 conditions per place. [2025-03-04 06:52:36,383 INFO L140 encePairwiseOnDemand]: 580/583 looper letters, 17 selfloop transitions, 2 changer transitions 0/532 dead transitions. [2025-03-04 06:52:36,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 537 places, 532 transitions, 1241 flow [2025-03-04 06:52:36,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:36,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:36,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1665 transitions. [2025-03-04 06:52:36,386 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9519725557461407 [2025-03-04 06:52:36,386 INFO L175 Difference]: Start difference. First operand has 536 places, 531 transitions, 1199 flow. Second operand 3 states and 1665 transitions. [2025-03-04 06:52:36,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 537 places, 532 transitions, 1241 flow [2025-03-04 06:52:36,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 534 places, 532 transitions, 1211 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 06:52:36,392 INFO L231 Difference]: Finished difference. Result has 534 places, 530 transitions, 1171 flow [2025-03-04 06:52:36,392 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1167, PETRI_DIFFERENCE_MINUEND_PLACES=532, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=530, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=528, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1171, PETRI_PLACES=534, PETRI_TRANSITIONS=530} [2025-03-04 06:52:36,393 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, -11 predicate places. [2025-03-04 06:52:36,393 INFO L471 AbstractCegarLoop]: Abstraction has has 534 places, 530 transitions, 1171 flow [2025-03-04 06:52:36,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 551.0) internal successors, (1653), 3 states have internal predecessors, (1653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:36,394 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:36,394 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] [2025-03-04 06:52:36,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 06:52:36,394 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-03-04 06:52:36,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:36,395 INFO L85 PathProgramCache]: Analyzing trace with hash -299605285, now seen corresponding path program 1 times [2025-03-04 06:52:36,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:36,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694990755] [2025-03-04 06:52:36,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:36,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:36,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-04 06:52:36,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-04 06:52:36,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:36,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:36,537 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 06:52:36,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:36,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694990755] [2025-03-04 06:52:36,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694990755] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:52:36,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844929967] [2025-03-04 06:52:36,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:36,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:52:36,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:52:36,540 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 06:52:36,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 06:52:36,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-04 06:52:36,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-04 06:52:36,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:36,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:36,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 06:52:36,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:52:36,793 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 06:52:36,793 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:52:36,882 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 06:52:36,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1844929967] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:52:36,882 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:52:36,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-03-04 06:52:36,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601554111] [2025-03-04 06:52:36,882 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:52:36,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 06:52:36,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:36,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 06:52:36,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-03-04 06:52:37,259 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 523 out of 583 [2025-03-04 06:52:37,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 534 places, 530 transitions, 1171 flow. Second operand has 15 states, 15 states have (on average 526.4666666666667) internal successors, (7897), 15 states have internal predecessors, (7897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:37,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:37,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 523 of 583 [2025-03-04 06:52:37,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:37,661 INFO L124 PetriNetUnfolderBase]: 33/1416 cut-off events. [2025-03-04 06:52:37,661 INFO L125 PetriNetUnfolderBase]: For 14/28 co-relation queries the response was YES. [2025-03-04 06:52:37,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1597 conditions, 1416 events. 33/1416 cut-off events. For 14/28 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 6444 event pairs, 1 based on Foata normal form. 6/1272 useless extension candidates. Maximal degree in co-relation 1467. Up to 20 conditions per place. [2025-03-04 06:52:37,677 INFO L140 encePairwiseOnDemand]: 553/583 looper letters, 30 selfloop transitions, 39 changer transitions 0/554 dead transitions. [2025-03-04 06:52:37,678 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 544 places, 554 transitions, 1363 flow [2025-03-04 06:52:37,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 06:52:37,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 06:52:37,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 5828 transitions. [2025-03-04 06:52:37,684 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9087790425697801 [2025-03-04 06:52:37,684 INFO L175 Difference]: Start difference. First operand has 534 places, 530 transitions, 1171 flow. Second operand 11 states and 5828 transitions. [2025-03-04 06:52:37,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 544 places, 554 transitions, 1363 flow [2025-03-04 06:52:37,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 542 places, 554 transitions, 1359 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:52:37,690 INFO L231 Difference]: Finished difference. Result has 545 places, 548 transitions, 1347 flow [2025-03-04 06:52:37,691 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1167, PETRI_DIFFERENCE_MINUEND_PLACES=532, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=530, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=500, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1347, PETRI_PLACES=545, PETRI_TRANSITIONS=548} [2025-03-04 06:52:37,691 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, 0 predicate places. [2025-03-04 06:52:37,691 INFO L471 AbstractCegarLoop]: Abstraction has has 545 places, 548 transitions, 1347 flow [2025-03-04 06:52:37,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 526.4666666666667) internal successors, (7897), 15 states have internal predecessors, (7897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:37,693 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:37,693 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:52:37,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 06:52:37,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 06:52:37,897 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-03-04 06:52:37,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:37,898 INFO L85 PathProgramCache]: Analyzing trace with hash 678015643, now seen corresponding path program 2 times [2025-03-04 06:52:37,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:37,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030941370] [2025-03-04 06:52:37,898 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:52:37,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:37,921 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 306 statements into 2 equivalence classes. [2025-03-04 06:52:37,926 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 171 of 306 statements. [2025-03-04 06:52:37,926 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 06:52:37,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:38,223 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 06:52:38,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:38,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030941370] [2025-03-04 06:52:38,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030941370] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:38,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:38,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:52:38,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963245769] [2025-03-04 06:52:38,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:38,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:52:38,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:38,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:52:38,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:52:38,476 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 537 out of 583 [2025-03-04 06:52:38,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 545 places, 548 transitions, 1347 flow. Second operand has 6 states, 6 states have (on average 540.5) internal successors, (3243), 6 states have internal predecessors, (3243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:38,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:38,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 537 of 583 [2025-03-04 06:52:38,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:38,852 INFO L124 PetriNetUnfolderBase]: 77/2316 cut-off events. [2025-03-04 06:52:38,852 INFO L125 PetriNetUnfolderBase]: For 50/92 co-relation queries the response was YES. [2025-03-04 06:52:38,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2705 conditions, 2316 events. 77/2316 cut-off events. For 50/92 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 14070 event pairs, 5 based on Foata normal form. 8/2072 useless extension candidates. Maximal degree in co-relation 2564. Up to 70 conditions per place. [2025-03-04 06:52:38,881 INFO L140 encePairwiseOnDemand]: 577/583 looper letters, 30 selfloop transitions, 6 changer transitions 0/555 dead transitions. [2025-03-04 06:52:38,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 549 places, 555 transitions, 1441 flow [2025-03-04 06:52:38,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:52:38,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:52:38,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3258 transitions. [2025-03-04 06:52:38,885 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9313893653516295 [2025-03-04 06:52:38,885 INFO L175 Difference]: Start difference. First operand has 545 places, 548 transitions, 1347 flow. Second operand 6 states and 3258 transitions. [2025-03-04 06:52:38,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 549 places, 555 transitions, 1441 flow [2025-03-04 06:52:38,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 546 places, 555 transitions, 1405 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-03-04 06:52:38,892 INFO L231 Difference]: Finished difference. Result has 546 places, 547 transitions, 1321 flow [2025-03-04 06:52:38,893 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1309, PETRI_DIFFERENCE_MINUEND_PLACES=541, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=547, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=541, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1321, PETRI_PLACES=546, PETRI_TRANSITIONS=547} [2025-03-04 06:52:38,893 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, 1 predicate places. [2025-03-04 06:52:38,893 INFO L471 AbstractCegarLoop]: Abstraction has has 546 places, 547 transitions, 1321 flow [2025-03-04 06:52:38,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 540.5) internal successors, (3243), 6 states have internal predecessors, (3243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:38,894 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:38,894 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:52:38,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 06:52:38,894 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread3Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-03-04 06:52:38,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:38,895 INFO L85 PathProgramCache]: Analyzing trace with hash -678009966, now seen corresponding path program 1 times [2025-03-04 06:52:38,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:38,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049135160] [2025-03-04 06:52:38,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:38,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:38,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-03-04 06:52:38,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-03-04 06:52:38,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:38,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:38,968 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 06:52:38,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:38,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049135160] [2025-03-04 06:52:38,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049135160] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:38,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:38,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:38,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115132867] [2025-03-04 06:52:38,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:38,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:38,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:38,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:38,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:38,992 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 548 out of 583 [2025-03-04 06:52:38,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 546 places, 547 transitions, 1321 flow. Second operand has 3 states, 3 states have (on average 550.0) internal successors, (1650), 3 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:38,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:38,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 548 of 583 [2025-03-04 06:52:38,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:39,410 INFO L124 PetriNetUnfolderBase]: 145/2185 cut-off events. [2025-03-04 06:52:39,410 INFO L125 PetriNetUnfolderBase]: For 121/165 co-relation queries the response was YES. [2025-03-04 06:52:39,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2591 conditions, 2185 events. 145/2185 cut-off events. For 121/165 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 14532 event pairs, 61 based on Foata normal form. 1/1889 useless extension candidates. Maximal degree in co-relation 2262. Up to 187 conditions per place. [2025-03-04 06:52:39,434 INFO L140 encePairwiseOnDemand]: 580/583 looper letters, 16 selfloop transitions, 2 changer transitions 0/548 dead transitions. [2025-03-04 06:52:39,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 547 places, 548 transitions, 1361 flow [2025-03-04 06:52:39,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:39,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:39,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1663 transitions. [2025-03-04 06:52:39,436 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9508290451686678 [2025-03-04 06:52:39,436 INFO L175 Difference]: Start difference. First operand has 546 places, 547 transitions, 1321 flow. Second operand 3 states and 1663 transitions. [2025-03-04 06:52:39,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 547 places, 548 transitions, 1361 flow [2025-03-04 06:52:39,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 542 places, 548 transitions, 1349 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:52:39,442 INFO L231 Difference]: Finished difference. Result has 542 places, 546 transitions, 1311 flow [2025-03-04 06:52:39,443 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1307, PETRI_DIFFERENCE_MINUEND_PLACES=540, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=546, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=544, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1311, PETRI_PLACES=542, PETRI_TRANSITIONS=546} [2025-03-04 06:52:39,443 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, -3 predicate places. [2025-03-04 06:52:39,443 INFO L471 AbstractCegarLoop]: Abstraction has has 542 places, 546 transitions, 1311 flow [2025-03-04 06:52:39,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 550.0) internal successors, (1650), 3 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:39,444 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:39,444 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:52:39,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 06:52:39,444 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-03-04 06:52:39,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:39,445 INFO L85 PathProgramCache]: Analyzing trace with hash -898089629, now seen corresponding path program 1 times [2025-03-04 06:52:39,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:39,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439231478] [2025-03-04 06:52:39,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:39,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:39,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-03-04 06:52:39,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-03-04 06:52:39,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:39,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:39,533 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 06:52:39,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:39,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439231478] [2025-03-04 06:52:39,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439231478] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:39,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:39,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:39,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254880239] [2025-03-04 06:52:39,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:39,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:39,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:39,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:39,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:39,557 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 544 out of 583 [2025-03-04 06:52:39,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 542 places, 546 transitions, 1311 flow. Second operand has 3 states, 3 states have (on average 545.6666666666666) internal successors, (1637), 3 states have internal predecessors, (1637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:39,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:39,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 544 of 583 [2025-03-04 06:52:39,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:40,191 INFO L124 PetriNetUnfolderBase]: 154/3695 cut-off events. [2025-03-04 06:52:40,191 INFO L125 PetriNetUnfolderBase]: For 47/115 co-relation queries the response was YES. [2025-03-04 06:52:40,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4180 conditions, 3695 events. 154/3695 cut-off events. For 47/115 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 27439 event pairs, 25 based on Foata normal form. 1/3273 useless extension candidates. Maximal degree in co-relation 3851. Up to 110 conditions per place. [2025-03-04 06:52:40,242 INFO L140 encePairwiseOnDemand]: 574/583 looper letters, 17 selfloop transitions, 5 changer transitions 0/547 dead transitions. [2025-03-04 06:52:40,242 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 540 places, 547 transitions, 1359 flow [2025-03-04 06:52:40,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:40,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:40,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1658 transitions. [2025-03-04 06:52:40,244 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9479702687249857 [2025-03-04 06:52:40,244 INFO L175 Difference]: Start difference. First operand has 542 places, 546 transitions, 1311 flow. Second operand 3 states and 1658 transitions. [2025-03-04 06:52:40,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 540 places, 547 transitions, 1359 flow [2025-03-04 06:52:40,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 538 places, 547 transitions, 1355 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:52:40,251 INFO L231 Difference]: Finished difference. Result has 540 places, 545 transitions, 1331 flow [2025-03-04 06:52:40,251 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1299, PETRI_DIFFERENCE_MINUEND_PLACES=536, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=542, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=537, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1331, PETRI_PLACES=540, PETRI_TRANSITIONS=545} [2025-03-04 06:52:40,251 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, -5 predicate places. [2025-03-04 06:52:40,251 INFO L471 AbstractCegarLoop]: Abstraction has has 540 places, 545 transitions, 1331 flow [2025-03-04 06:52:40,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 545.6666666666666) internal successors, (1637), 3 states have internal predecessors, (1637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:40,252 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:40,252 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:52:40,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 06:52:40,252 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-03-04 06:52:40,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:40,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1261958115, now seen corresponding path program 1 times [2025-03-04 06:52:40,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:40,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396585099] [2025-03-04 06:52:40,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:40,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:40,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-03-04 06:52:40,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-03-04 06:52:40,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:40,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:40,324 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 06:52:40,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:40,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396585099] [2025-03-04 06:52:40,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396585099] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:40,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:40,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:40,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532476741] [2025-03-04 06:52:40,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:40,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:40,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:40,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:40,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:40,333 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 552 out of 583 [2025-03-04 06:52:40,334 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 540 places, 545 transitions, 1331 flow. Second operand has 3 states, 3 states have (on average 553.3333333333334) internal successors, (1660), 3 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:40,334 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:40,334 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 552 of 583 [2025-03-04 06:52:40,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:40,945 INFO L124 PetriNetUnfolderBase]: 136/3757 cut-off events. [2025-03-04 06:52:40,945 INFO L125 PetriNetUnfolderBase]: For 76/112 co-relation queries the response was YES. [2025-03-04 06:52:40,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4214 conditions, 3757 events. 136/3757 cut-off events. For 76/112 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 27941 event pairs, 30 based on Foata normal form. 1/3336 useless extension candidates. Maximal degree in co-relation 3883. Up to 141 conditions per place. [2025-03-04 06:52:40,983 INFO L140 encePairwiseOnDemand]: 579/583 looper letters, 16 selfloop transitions, 2 changer transitions 0/550 dead transitions. [2025-03-04 06:52:40,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 540 places, 550 transitions, 1382 flow [2025-03-04 06:52:40,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:40,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:40,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1676 transitions. [2025-03-04 06:52:40,986 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9582618639222413 [2025-03-04 06:52:40,986 INFO L175 Difference]: Start difference. First operand has 540 places, 545 transitions, 1331 flow. Second operand 3 states and 1676 transitions. [2025-03-04 06:52:40,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 540 places, 550 transitions, 1382 flow [2025-03-04 06:52:40,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 538 places, 550 transitions, 1372 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:52:40,991 INFO L231 Difference]: Finished difference. Result has 539 places, 545 transitions, 1331 flow [2025-03-04 06:52:40,992 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1317, PETRI_DIFFERENCE_MINUEND_PLACES=536, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=543, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=541, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1331, PETRI_PLACES=539, PETRI_TRANSITIONS=545} [2025-03-04 06:52:40,992 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, -6 predicate places. [2025-03-04 06:52:40,992 INFO L471 AbstractCegarLoop]: Abstraction has has 539 places, 545 transitions, 1331 flow [2025-03-04 06:52:40,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 553.3333333333334) internal successors, (1660), 3 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:40,993 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:40,993 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:52:40,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 06:52:40,993 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-03-04 06:52:40,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:40,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1605969381, now seen corresponding path program 1 times [2025-03-04 06:52:40,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:40,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233372086] [2025-03-04 06:52:40,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:40,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:41,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 310 statements into 1 equivalence classes. [2025-03-04 06:52:41,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 310 of 310 statements. [2025-03-04 06:52:41,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:41,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:41,099 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 06:52:41,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:41,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233372086] [2025-03-04 06:52:41,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233372086] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:41,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:41,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 06:52:41,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92288254] [2025-03-04 06:52:41,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:41,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 06:52:41,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:41,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 06:52:41,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 06:52:41,140 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 551 out of 583 [2025-03-04 06:52:41,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 539 places, 545 transitions, 1331 flow. Second operand has 4 states, 4 states have (on average 552.5) internal successors, (2210), 4 states have internal predecessors, (2210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:41,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:41,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 551 of 583 [2025-03-04 06:52:41,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:42,303 INFO L124 PetriNetUnfolderBase]: 244/6510 cut-off events. [2025-03-04 06:52:42,303 INFO L125 PetriNetUnfolderBase]: For 89/254 co-relation queries the response was YES. [2025-03-04 06:52:42,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7319 conditions, 6510 events. 244/6510 cut-off events. For 89/254 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 56572 event pairs, 58 based on Foata normal form. 6/5735 useless extension candidates. Maximal degree in co-relation 6989. Up to 155 conditions per place. [2025-03-04 06:52:42,394 INFO L140 encePairwiseOnDemand]: 578/583 looper letters, 25 selfloop transitions, 4 changer transitions 0/559 dead transitions. [2025-03-04 06:52:42,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 543 places, 559 transitions, 1425 flow [2025-03-04 06:52:42,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 06:52:42,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 06:52:42,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2785 transitions. [2025-03-04 06:52:42,398 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9554030874785592 [2025-03-04 06:52:42,398 INFO L175 Difference]: Start difference. First operand has 539 places, 545 transitions, 1331 flow. Second operand 5 states and 2785 transitions. [2025-03-04 06:52:42,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 543 places, 559 transitions, 1425 flow [2025-03-04 06:52:42,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 543 places, 559 transitions, 1425 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:52:42,404 INFO L231 Difference]: Finished difference. Result has 546 places, 547 transitions, 1356 flow [2025-03-04 06:52:42,405 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1327, PETRI_DIFFERENCE_MINUEND_PLACES=539, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=544, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=540, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1356, PETRI_PLACES=546, PETRI_TRANSITIONS=547} [2025-03-04 06:52:42,405 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, 1 predicate places. [2025-03-04 06:52:42,405 INFO L471 AbstractCegarLoop]: Abstraction has has 546 places, 547 transitions, 1356 flow [2025-03-04 06:52:42,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 552.5) internal successors, (2210), 4 states have internal predecessors, (2210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:42,406 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:42,406 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:52:42,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 06:52:42,406 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-03-04 06:52:42,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:42,407 INFO L85 PathProgramCache]: Analyzing trace with hash 163043743, now seen corresponding path program 1 times [2025-03-04 06:52:42,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:42,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209539327] [2025-03-04 06:52:42,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:42,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:42,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-03-04 06:52:42,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-03-04 06:52:42,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:42,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:42,496 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 06:52:42,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:42,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209539327] [2025-03-04 06:52:42,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209539327] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:42,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:42,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:42,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807625224] [2025-03-04 06:52:42,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:42,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:42,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:42,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:42,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:42,519 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 548 out of 583 [2025-03-04 06:52:42,520 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 546 places, 547 transitions, 1356 flow. Second operand has 3 states, 3 states have (on average 550.3333333333334) internal successors, (1651), 3 states have internal predecessors, (1651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:42,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:42,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 548 of 583 [2025-03-04 06:52:42,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:44,178 INFO L124 PetriNetUnfolderBase]: 386/9202 cut-off events. [2025-03-04 06:52:44,178 INFO L125 PetriNetUnfolderBase]: For 237/455 co-relation queries the response was YES. [2025-03-04 06:52:44,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10421 conditions, 9202 events. 386/9202 cut-off events. For 237/455 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 92128 event pairs, 113 based on Foata normal form. 6/8092 useless extension candidates. Maximal degree in co-relation 10088. Up to 310 conditions per place. [2025-03-04 06:52:44,241 INFO L140 encePairwiseOnDemand]: 580/583 looper letters, 18 selfloop transitions, 2 changer transitions 0/548 dead transitions. [2025-03-04 06:52:44,242 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 547 places, 548 transitions, 1400 flow [2025-03-04 06:52:44,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:44,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:44,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1663 transitions. [2025-03-04 06:52:44,243 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9508290451686678 [2025-03-04 06:52:44,244 INFO L175 Difference]: Start difference. First operand has 546 places, 547 transitions, 1356 flow. Second operand 3 states and 1663 transitions. [2025-03-04 06:52:44,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 547 places, 548 transitions, 1400 flow [2025-03-04 06:52:44,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 547 places, 548 transitions, 1400 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:52:44,250 INFO L231 Difference]: Finished difference. Result has 547 places, 546 transitions, 1358 flow [2025-03-04 06:52:44,251 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1354, PETRI_DIFFERENCE_MINUEND_PLACES=545, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=546, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=544, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1358, PETRI_PLACES=547, PETRI_TRANSITIONS=546} [2025-03-04 06:52:44,251 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, 2 predicate places. [2025-03-04 06:52:44,251 INFO L471 AbstractCegarLoop]: Abstraction has has 547 places, 546 transitions, 1358 flow [2025-03-04 06:52:44,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 550.3333333333334) internal successors, (1651), 3 states have internal predecessors, (1651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:44,251 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:44,252 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:52:44,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 06:52:44,252 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-03-04 06:52:44,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:44,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1576749988, now seen corresponding path program 1 times [2025-03-04 06:52:44,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:44,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374445737] [2025-03-04 06:52:44,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:44,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:44,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-03-04 06:52:44,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-03-04 06:52:44,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:44,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:44,498 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-03-04 06:52:44,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:44,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374445737] [2025-03-04 06:52:44,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374445737] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:52:44,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140533948] [2025-03-04 06:52:44,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:44,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:52:44,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:52:44,501 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 06:52:44,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 06:52:44,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-03-04 06:52:44,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-03-04 06:52:44,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:44,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:44,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 721 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 06:52:44,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:52:44,892 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-03-04 06:52:44,892 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:52:45,026 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-03-04 06:52:45,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2140533948] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:52:45,027 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:52:45,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2025-03-04 06:52:45,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626061077] [2025-03-04 06:52:45,028 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:52:45,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 06:52:45,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:45,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 06:52:45,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2025-03-04 06:52:45,696 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 523 out of 583 [2025-03-04 06:52:45,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 547 places, 546 transitions, 1358 flow. Second operand has 22 states, 22 states have (on average 526.1363636363636) internal successors, (11575), 22 states have internal predecessors, (11575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:45,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:45,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 523 of 583 [2025-03-04 06:52:45,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:46,308 INFO L124 PetriNetUnfolderBase]: 50/2302 cut-off events. [2025-03-04 06:52:46,308 INFO L125 PetriNetUnfolderBase]: For 84/116 co-relation queries the response was YES. [2025-03-04 06:52:46,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2761 conditions, 2302 events. 50/2302 cut-off events. For 84/116 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 13208 event pairs, 4 based on Foata normal form. 6/2101 useless extension candidates. Maximal degree in co-relation 2482. Up to 37 conditions per place. [2025-03-04 06:52:46,343 INFO L140 encePairwiseOnDemand]: 553/583 looper letters, 36 selfloop transitions, 57 changer transitions 0/576 dead transitions. [2025-03-04 06:52:46,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 563 places, 576 transitions, 1688 flow [2025-03-04 06:52:46,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 06:52:46,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-04 06:52:46,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 8990 transitions. [2025-03-04 06:52:46,351 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.90707294924831 [2025-03-04 06:52:46,351 INFO L175 Difference]: Start difference. First operand has 547 places, 546 transitions, 1358 flow. Second operand 17 states and 8990 transitions. [2025-03-04 06:52:46,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 563 places, 576 transitions, 1688 flow [2025-03-04 06:52:46,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 561 places, 576 transitions, 1684 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:52:46,359 INFO L231 Difference]: Finished difference. Result has 564 places, 567 transitions, 1630 flow [2025-03-04 06:52:46,359 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1354, PETRI_DIFFERENCE_MINUEND_PLACES=545, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=546, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=501, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1630, PETRI_PLACES=564, PETRI_TRANSITIONS=567} [2025-03-04 06:52:46,360 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, 19 predicate places. [2025-03-04 06:52:46,360 INFO L471 AbstractCegarLoop]: Abstraction has has 564 places, 567 transitions, 1630 flow [2025-03-04 06:52:46,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 526.1363636363636) internal successors, (11575), 22 states have internal predecessors, (11575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:46,362 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:46,362 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:52:46,369 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 06:52:46,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-04 06:52:46,563 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-03-04 06:52:46,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:46,564 INFO L85 PathProgramCache]: Analyzing trace with hash -458173412, now seen corresponding path program 2 times [2025-03-04 06:52:46,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:46,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546989581] [2025-03-04 06:52:46,564 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:52:46,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:46,594 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 402 statements into 2 equivalence classes. [2025-03-04 06:52:46,601 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 177 of 402 statements. [2025-03-04 06:52:46,601 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 06:52:46,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:46,909 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2025-03-04 06:52:46,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:46,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546989581] [2025-03-04 06:52:46,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546989581] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:46,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:46,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:52:46,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173028563] [2025-03-04 06:52:46,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:46,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:52:46,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:46,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:52:46,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:52:47,133 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 537 out of 583 [2025-03-04 06:52:47,135 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 564 places, 567 transitions, 1630 flow. Second operand has 6 states, 6 states have (on average 540.6666666666666) internal successors, (3244), 6 states have internal predecessors, (3244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:47,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:47,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 537 of 583 [2025-03-04 06:52:47,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:48,028 INFO L124 PetriNetUnfolderBase]: 200/4564 cut-off events. [2025-03-04 06:52:48,028 INFO L125 PetriNetUnfolderBase]: For 219/444 co-relation queries the response was YES. [2025-03-04 06:52:48,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5524 conditions, 4564 events. 200/4564 cut-off events. For 219/444 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 34926 event pairs, 18 based on Foata normal form. 17/4114 useless extension candidates. Maximal degree in co-relation 5209. Up to 147 conditions per place. [2025-03-04 06:52:48,105 INFO L140 encePairwiseOnDemand]: 577/583 looper letters, 30 selfloop transitions, 6 changer transitions 0/574 dead transitions. [2025-03-04 06:52:48,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 568 places, 574 transitions, 1724 flow [2025-03-04 06:52:48,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:52:48,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:52:48,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3258 transitions. [2025-03-04 06:52:48,107 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9313893653516295 [2025-03-04 06:52:48,107 INFO L175 Difference]: Start difference. First operand has 564 places, 567 transitions, 1630 flow. Second operand 6 states and 3258 transitions. [2025-03-04 06:52:48,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 568 places, 574 transitions, 1724 flow [2025-03-04 06:52:48,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 560 places, 574 transitions, 1646 flow, removed 12 selfloop flow, removed 8 redundant places. [2025-03-04 06:52:48,115 INFO L231 Difference]: Finished difference. Result has 560 places, 566 transitions, 1562 flow [2025-03-04 06:52:48,116 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1550, PETRI_DIFFERENCE_MINUEND_PLACES=555, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=566, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=560, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1562, PETRI_PLACES=560, PETRI_TRANSITIONS=566} [2025-03-04 06:52:48,116 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, 15 predicate places. [2025-03-04 06:52:48,116 INFO L471 AbstractCegarLoop]: Abstraction has has 560 places, 566 transitions, 1562 flow [2025-03-04 06:52:48,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 540.6666666666666) internal successors, (3244), 6 states have internal predecessors, (3244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:48,117 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:48,117 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:52:48,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-04 06:52:48,117 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread3Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-03-04 06:52:48,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:48,118 INFO L85 PathProgramCache]: Analyzing trace with hash -77762984, now seen corresponding path program 1 times [2025-03-04 06:52:48,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:48,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683058934] [2025-03-04 06:52:48,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:48,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:48,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 403 statements into 1 equivalence classes. [2025-03-04 06:52:48,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 403 of 403 statements. [2025-03-04 06:52:48,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:48,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:48,204 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2025-03-04 06:52:48,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:48,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683058934] [2025-03-04 06:52:48,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683058934] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:48,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:48,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:48,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436441357] [2025-03-04 06:52:48,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:48,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:48,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:48,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:48,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:48,223 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 544 out of 583 [2025-03-04 06:52:48,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 560 places, 566 transitions, 1562 flow. Second operand has 3 states, 3 states have (on average 546.0) internal successors, (1638), 3 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:48,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:48,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 544 of 583 [2025-03-04 06:52:48,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:49,075 INFO L124 PetriNetUnfolderBase]: 235/4728 cut-off events. [2025-03-04 06:52:49,075 INFO L125 PetriNetUnfolderBase]: For 255/339 co-relation queries the response was YES. [2025-03-04 06:52:49,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5621 conditions, 4728 events. 235/4728 cut-off events. For 255/339 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 39298 event pairs, 56 based on Foata normal form. 14/4236 useless extension candidates. Maximal degree in co-relation 5108. Up to 240 conditions per place. [2025-03-04 06:52:49,138 INFO L140 encePairwiseOnDemand]: 574/583 looper letters, 13 selfloop transitions, 4 changer transitions 18/567 dead transitions. [2025-03-04 06:52:49,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 558 places, 567 transitions, 1608 flow [2025-03-04 06:52:49,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:49,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:49,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1657 transitions. [2025-03-04 06:52:49,140 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9473985134362493 [2025-03-04 06:52:49,140 INFO L175 Difference]: Start difference. First operand has 560 places, 566 transitions, 1562 flow. Second operand 3 states and 1657 transitions. [2025-03-04 06:52:49,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 558 places, 567 transitions, 1608 flow [2025-03-04 06:52:49,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 553 places, 567 transitions, 1596 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:52:49,147 INFO L231 Difference]: Finished difference. Result has 555 places, 547 transitions, 1529 flow [2025-03-04 06:52:49,147 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1542, PETRI_DIFFERENCE_MINUEND_PLACES=551, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=562, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=558, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1529, PETRI_PLACES=555, PETRI_TRANSITIONS=547} [2025-03-04 06:52:49,147 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, 10 predicate places. [2025-03-04 06:52:49,147 INFO L471 AbstractCegarLoop]: Abstraction has has 555 places, 547 transitions, 1529 flow [2025-03-04 06:52:49,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 546.0) internal successors, (1638), 3 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:49,148 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:49,148 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:52:49,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-04 06:52:49,148 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-03-04 06:52:49,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:49,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1139840192, now seen corresponding path program 1 times [2025-03-04 06:52:49,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:49,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640252139] [2025-03-04 06:52:49,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:49,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:49,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 404 statements into 1 equivalence classes. [2025-03-04 06:52:49,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 404 of 404 statements. [2025-03-04 06:52:49,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:49,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:49,824 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2025-03-04 06:52:49,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:49,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640252139] [2025-03-04 06:52:49,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640252139] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:49,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:49,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:52:49,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105750244] [2025-03-04 06:52:49,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:49,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:52:49,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:49,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:52:49,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:52:50,048 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 537 out of 583 [2025-03-04 06:52:50,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 555 places, 547 transitions, 1529 flow. Second operand has 6 states, 6 states have (on average 540.5) internal successors, (3243), 6 states have internal predecessors, (3243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:50,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:50,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 537 of 583 [2025-03-04 06:52:50,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:51,142 INFO L124 PetriNetUnfolderBase]: 124/3943 cut-off events. [2025-03-04 06:52:51,143 INFO L125 PetriNetUnfolderBase]: For 193/293 co-relation queries the response was YES. [2025-03-04 06:52:51,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4820 conditions, 3943 events. 124/3943 cut-off events. For 193/293 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 27111 event pairs, 15 based on Foata normal form. 16/3623 useless extension candidates. Maximal degree in co-relation 4718. Up to 107 conditions per place. [2025-03-04 06:52:51,212 INFO L140 encePairwiseOnDemand]: 577/583 looper letters, 29 selfloop transitions, 6 changer transitions 0/554 dead transitions. [2025-03-04 06:52:51,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 541 places, 554 transitions, 1621 flow [2025-03-04 06:52:51,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:52:51,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:52:51,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3257 transitions. [2025-03-04 06:52:51,214 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9311034877072613 [2025-03-04 06:52:51,214 INFO L175 Difference]: Start difference. First operand has 555 places, 547 transitions, 1529 flow. Second operand 6 states and 3257 transitions. [2025-03-04 06:52:51,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 541 places, 554 transitions, 1621 flow [2025-03-04 06:52:51,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 539 places, 554 transitions, 1613 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:52:51,222 INFO L231 Difference]: Finished difference. Result has 539 places, 546 transitions, 1531 flow [2025-03-04 06:52:51,222 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1519, PETRI_DIFFERENCE_MINUEND_PLACES=534, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=546, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=540, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1531, PETRI_PLACES=539, PETRI_TRANSITIONS=546} [2025-03-04 06:52:51,223 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, -6 predicate places. [2025-03-04 06:52:51,223 INFO L471 AbstractCegarLoop]: Abstraction has has 539 places, 546 transitions, 1531 flow [2025-03-04 06:52:51,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 540.5) internal successors, (3243), 6 states have internal predecessors, (3243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:51,223 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:51,223 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:52:51,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-04 06:52:51,224 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-03-04 06:52:51,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:51,225 INFO L85 PathProgramCache]: Analyzing trace with hash 2077023806, now seen corresponding path program 1 times [2025-03-04 06:52:51,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:51,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907128411] [2025-03-04 06:52:51,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:51,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:51,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 404 statements into 1 equivalence classes. [2025-03-04 06:52:51,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 404 of 404 statements. [2025-03-04 06:52:51,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:51,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:51,307 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2025-03-04 06:52:51,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:51,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907128411] [2025-03-04 06:52:51,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907128411] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:51,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:51,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:51,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544072192] [2025-03-04 06:52:51,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:51,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:51,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:51,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:51,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:51,316 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 552 out of 583 [2025-03-04 06:52:51,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 539 places, 546 transitions, 1531 flow. Second operand has 3 states, 3 states have (on average 553.6666666666666) internal successors, (1661), 3 states have internal predecessors, (1661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:51,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:51,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 552 of 583 [2025-03-04 06:52:51,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:53,305 INFO L124 PetriNetUnfolderBase]: 497/10763 cut-off events. [2025-03-04 06:52:53,305 INFO L125 PetriNetUnfolderBase]: For 245/255 co-relation queries the response was YES. [2025-03-04 06:52:53,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12414 conditions, 10763 events. 497/10763 cut-off events. For 245/255 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 112023 event pairs, 162 based on Foata normal form. 0/9765 useless extension candidates. Maximal degree in co-relation 11900. Up to 618 conditions per place. [2025-03-04 06:52:53,424 INFO L140 encePairwiseOnDemand]: 579/583 looper letters, 13 selfloop transitions, 2 changer transitions 0/549 dead transitions. [2025-03-04 06:52:53,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 539 places, 549 transitions, 1570 flow [2025-03-04 06:52:53,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:53,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:53,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1673 transitions. [2025-03-04 06:52:53,426 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.956546598056032 [2025-03-04 06:52:53,426 INFO L175 Difference]: Start difference. First operand has 539 places, 546 transitions, 1531 flow. Second operand 3 states and 1673 transitions. [2025-03-04 06:52:53,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 539 places, 549 transitions, 1570 flow [2025-03-04 06:52:53,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 534 places, 549 transitions, 1558 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:52:53,437 INFO L231 Difference]: Finished difference. Result has 535 places, 546 transitions, 1529 flow [2025-03-04 06:52:53,438 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1515, PETRI_DIFFERENCE_MINUEND_PLACES=532, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=544, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=542, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1529, PETRI_PLACES=535, PETRI_TRANSITIONS=546} [2025-03-04 06:52:53,438 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, -10 predicate places. [2025-03-04 06:52:53,439 INFO L471 AbstractCegarLoop]: Abstraction has has 535 places, 546 transitions, 1529 flow [2025-03-04 06:52:53,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 553.6666666666666) internal successors, (1661), 3 states have internal predecessors, (1661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:53,440 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:53,441 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:52:53,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-04 06:52:53,441 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-03-04 06:52:53,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:53,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1618700147, now seen corresponding path program 1 times [2025-03-04 06:52:53,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:53,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829488411] [2025-03-04 06:52:53,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:53,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:53,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 406 statements into 1 equivalence classes. [2025-03-04 06:52:53,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 406 of 406 statements. [2025-03-04 06:52:53,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:53,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:53,567 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2025-03-04 06:52:53,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:53,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829488411] [2025-03-04 06:52:53,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829488411] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:53,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:53,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 06:52:53,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390274467] [2025-03-04 06:52:53,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:53,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 06:52:53,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:53,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 06:52:53,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 06:52:53,606 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 551 out of 583 [2025-03-04 06:52:53,608 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 535 places, 546 transitions, 1529 flow. Second operand has 4 states, 4 states have (on average 552.75) internal successors, (2211), 4 states have internal predecessors, (2211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:53,608 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:53,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 551 of 583 [2025-03-04 06:52:53,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:55,196 INFO L124 PetriNetUnfolderBase]: 373/7895 cut-off events. [2025-03-04 06:52:55,196 INFO L125 PetriNetUnfolderBase]: For 359/421 co-relation queries the response was YES. [2025-03-04 06:52:55,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9567 conditions, 7895 events. 373/7895 cut-off events. For 359/421 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 79945 event pairs, 146 based on Foata normal form. 4/7091 useless extension candidates. Maximal degree in co-relation 9053. Up to 444 conditions per place. [2025-03-04 06:52:55,286 INFO L140 encePairwiseOnDemand]: 578/583 looper letters, 20 selfloop transitions, 4 changer transitions 0/556 dead transitions. [2025-03-04 06:52:55,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 539 places, 556 transitions, 1601 flow [2025-03-04 06:52:55,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 06:52:55,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 06:52:55,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2780 transitions. [2025-03-04 06:52:55,288 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9536878216123499 [2025-03-04 06:52:55,288 INFO L175 Difference]: Start difference. First operand has 535 places, 546 transitions, 1529 flow. Second operand 5 states and 2780 transitions. [2025-03-04 06:52:55,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 539 places, 556 transitions, 1601 flow [2025-03-04 06:52:55,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 539 places, 556 transitions, 1601 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:52:55,295 INFO L231 Difference]: Finished difference. Result has 542 places, 548 transitions, 1554 flow [2025-03-04 06:52:55,296 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1525, PETRI_DIFFERENCE_MINUEND_PLACES=535, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=545, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=541, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1554, PETRI_PLACES=542, PETRI_TRANSITIONS=548} [2025-03-04 06:52:55,296 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, -3 predicate places. [2025-03-04 06:52:55,296 INFO L471 AbstractCegarLoop]: Abstraction has has 542 places, 548 transitions, 1554 flow [2025-03-04 06:52:55,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 552.75) internal successors, (2211), 4 states have internal predecessors, (2211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:55,297 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:55,297 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:52:55,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-04 06:52:55,297 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-03-04 06:52:55,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:55,299 INFO L85 PathProgramCache]: Analyzing trace with hash 813682801, now seen corresponding path program 1 times [2025-03-04 06:52:55,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:55,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148757929] [2025-03-04 06:52:55,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:55,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:55,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 408 statements into 1 equivalence classes. [2025-03-04 06:52:55,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 408 of 408 statements. [2025-03-04 06:52:55,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:55,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:55,380 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2025-03-04 06:52:55,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:55,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148757929] [2025-03-04 06:52:55,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148757929] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:55,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:55,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:55,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77906061] [2025-03-04 06:52:55,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:55,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:55,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:55,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:55,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:55,401 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 548 out of 583 [2025-03-04 06:52:55,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 542 places, 548 transitions, 1554 flow. Second operand has 3 states, 3 states have (on average 550.6666666666666) internal successors, (1652), 3 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:55,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:55,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 548 of 583 [2025-03-04 06:52:55,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:57,043 INFO L124 PetriNetUnfolderBase]: 534/7743 cut-off events. [2025-03-04 06:52:57,043 INFO L125 PetriNetUnfolderBase]: For 830/900 co-relation queries the response was YES. [2025-03-04 06:52:57,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10197 conditions, 7743 events. 534/7743 cut-off events. For 830/900 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 80467 event pairs, 275 based on Foata normal form. 2/7077 useless extension candidates. Maximal degree in co-relation 9680. Up to 783 conditions per place. [2025-03-04 06:52:57,131 INFO L140 encePairwiseOnDemand]: 580/583 looper letters, 14 selfloop transitions, 2 changer transitions 1/549 dead transitions. [2025-03-04 06:52:57,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 543 places, 549 transitions, 1592 flow [2025-03-04 06:52:57,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:57,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:57,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1660 transitions. [2025-03-04 06:52:57,133 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9491137793024585 [2025-03-04 06:52:57,133 INFO L175 Difference]: Start difference. First operand has 542 places, 548 transitions, 1554 flow. Second operand 3 states and 1660 transitions. [2025-03-04 06:52:57,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 543 places, 549 transitions, 1592 flow [2025-03-04 06:52:57,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 543 places, 549 transitions, 1592 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:52:57,142 INFO L231 Difference]: Finished difference. Result has 543 places, 547 transitions, 1556 flow [2025-03-04 06:52:57,142 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1552, PETRI_DIFFERENCE_MINUEND_PLACES=541, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=547, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=545, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1556, PETRI_PLACES=543, PETRI_TRANSITIONS=547} [2025-03-04 06:52:57,143 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, -2 predicate places. [2025-03-04 06:52:57,143 INFO L471 AbstractCegarLoop]: Abstraction has has 543 places, 547 transitions, 1556 flow [2025-03-04 06:52:57,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 550.6666666666666) internal successors, (1652), 3 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:57,143 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:57,143 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:52:57,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-04 06:52:57,144 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread3Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-03-04 06:52:57,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:57,145 INFO L85 PathProgramCache]: Analyzing trace with hash -926110930, now seen corresponding path program 1 times [2025-03-04 06:52:57,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:57,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789906582] [2025-03-04 06:52:57,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:57,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:57,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 408 statements into 1 equivalence classes. [2025-03-04 06:52:57,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 408 of 408 statements. [2025-03-04 06:52:57,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:57,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:57,746 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2025-03-04 06:52:57,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:57,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789906582] [2025-03-04 06:52:57,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789906582] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:57,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:57,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:52:57,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864406489] [2025-03-04 06:52:57,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:57,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:52:57,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:57,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:52:57,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:52:57,958 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 537 out of 583 [2025-03-04 06:52:57,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 543 places, 547 transitions, 1556 flow. Second operand has 6 states, 6 states have (on average 540.8333333333334) internal successors, (3245), 6 states have internal predecessors, (3245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:57,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:57,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 537 of 583 [2025-03-04 06:52:57,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:59,576 INFO L124 PetriNetUnfolderBase]: 363/7609 cut-off events. [2025-03-04 06:52:59,577 INFO L125 PetriNetUnfolderBase]: For 675/765 co-relation queries the response was YES. [2025-03-04 06:52:59,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9897 conditions, 7609 events. 363/7609 cut-off events. For 675/765 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 75276 event pairs, 64 based on Foata normal form. 8/7100 useless extension candidates. Maximal degree in co-relation 9317. Up to 224 conditions per place. [2025-03-04 06:52:59,685 INFO L140 encePairwiseOnDemand]: 577/583 looper letters, 29 selfloop transitions, 6 changer transitions 0/554 dead transitions. [2025-03-04 06:52:59,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 547 places, 554 transitions, 1648 flow [2025-03-04 06:52:59,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:52:59,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:52:59,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3257 transitions. [2025-03-04 06:52:59,687 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9311034877072613 [2025-03-04 06:52:59,687 INFO L175 Difference]: Start difference. First operand has 543 places, 547 transitions, 1556 flow. Second operand 6 states and 3257 transitions. [2025-03-04 06:52:59,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 547 places, 554 transitions, 1648 flow [2025-03-04 06:52:59,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 545 places, 554 transitions, 1644 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:52:59,696 INFO L231 Difference]: Finished difference. Result has 545 places, 546 transitions, 1562 flow [2025-03-04 06:52:59,697 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1550, PETRI_DIFFERENCE_MINUEND_PLACES=540, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=546, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=540, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1562, PETRI_PLACES=545, PETRI_TRANSITIONS=546} [2025-03-04 06:52:59,697 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, 0 predicate places. [2025-03-04 06:52:59,697 INFO L471 AbstractCegarLoop]: Abstraction has has 545 places, 546 transitions, 1562 flow [2025-03-04 06:52:59,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 540.8333333333334) internal successors, (3245), 6 states have internal predecessors, (3245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:59,698 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:59,698 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:52:59,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-04 06:52:59,699 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-03-04 06:52:59,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:59,700 INFO L85 PathProgramCache]: Analyzing trace with hash -742827775, now seen corresponding path program 1 times [2025-03-04 06:52:59,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:59,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812709991] [2025-03-04 06:52:59,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:59,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:59,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 410 statements into 1 equivalence classes. [2025-03-04 06:52:59,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 410 of 410 statements. [2025-03-04 06:52:59,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:59,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:53:00,325 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2025-03-04 06:53:00,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:53:00,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812709991] [2025-03-04 06:53:00,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812709991] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:53:00,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:53:00,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:53:00,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873235768] [2025-03-04 06:53:00,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:53:00,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:53:00,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:53:00,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:53:00,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:53:00,575 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 537 out of 583 [2025-03-04 06:53:00,577 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 545 places, 546 transitions, 1562 flow. Second operand has 6 states, 6 states have (on average 540.6666666666666) internal successors, (3244), 6 states have internal predecessors, (3244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:00,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:53:00,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 537 of 583 [2025-03-04 06:53:00,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:53:02,214 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1325] L68-18-->L68-17: Formula: (= (store |v_#race_30| v_~o_4~0.base_6 (store (select |v_#race_30| v_~o_4~0.base_6) (+ (* |v_thread2Thread1of1ForFork2_~i~1#1_23| 4) v_~o_4~0.offset_6) 0)) |v_#race_29|) InVars {#race=|v_#race_30|, ~o_4~0.base=v_~o_4~0.base_6, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_23|, ~o_4~0.offset=v_~o_4~0.offset_6} OutVars{#race=|v_#race_29|, ~o_4~0.base=v_~o_4~0.base_6, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_23|, ~o_4~0.offset=v_~o_4~0.offset_6} AuxVars[] AssignedVars[#race][382], [620#true, 3956#(= (select (select |#race| ~o_4~0.base) (+ ~o_4~0.offset (* |thread2Thread1of1ForFork2_~i~1#1| 4))) 0), 3934#(= |#race~o_4~0| 0), 3938#(= |thread3Thread1of1ForFork1_~i~2#1| 0), 32#L82-20true, Black: 1989#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (not (= (mod |thread2Thread1of1ForFork2_~stop~1#1| 256) 0))), Black: 1986#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 3911#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3905#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 3)), Black: 3885#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 595#(= |#race~isNull_1~0| 0), 1982#(= |#race~o_2~0| 0), Black: 593#true, Black: 3923#(= |#race~result_13~0| 0), Black: 597#true, 429#L105true, Black: 3932#true, Black: 604#true, Black: 608#true, 511#L68-17true, 1984#true, Black: 3936#true, 606#(= |#race~isNull_5~0| 0), Black: 3941#(and (= |thread3Thread1of1ForFork1_~i~2#1| 0) (not (= (mod |thread3Thread1of1ForFork1_~stop~2#1| 256) 0))), Black: 614#(= |#race~result_7~0| 0), Black: 1962#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1948#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1956#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 3953#(and (= (select (select |#race| ~o_2~0.base) (+ (* 4 |thread3Thread1of1ForFork1_~i~2#1|) ~o_2~0.offset 1)) 0) (= (select (select |#race| ~o_2~0.base) (+ 3 (* 4 |thread3Thread1of1ForFork1_~i~2#1|) ~o_2~0.offset)) 0) (= (select (select |#race| ~o_2~0.base) (+ (* 4 |thread3Thread1of1ForFork1_~i~2#1|) ~o_2~0.offset)) 0) (= (select (select |#race| ~o_2~0.base) (+ 2 (* 4 |thread3Thread1of1ForFork1_~i~2#1|) ~o_2~0.offset)) 0)), 610#(= |#race~o_0~0| 0), Black: 625#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (not (= (mod |thread1Thread1of1ForFork0_~stop~0#1| 256) 0))), 599#(= |#race~isNull_3~0| 0), Black: 622#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 1975#true, Black: 637#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 1980#true]) [2025-03-04 06:53:02,214 INFO L294 olderBase$Statistics]: this new event has 684 ancestors and is cut-off event [2025-03-04 06:53:02,215 INFO L297 olderBase$Statistics]: existing Event has 578 ancestors and is cut-off event [2025-03-04 06:53:02,215 INFO L297 olderBase$Statistics]: existing Event has 631 ancestors and is cut-off event [2025-03-04 06:53:02,215 INFO L297 olderBase$Statistics]: existing Event has 631 ancestors and is cut-off event [2025-03-04 06:53:02,217 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1325] L68-18-->L68-17: Formula: (= (store |v_#race_30| v_~o_4~0.base_6 (store (select |v_#race_30| v_~o_4~0.base_6) (+ (* |v_thread2Thread1of1ForFork2_~i~1#1_23| 4) v_~o_4~0.offset_6) 0)) |v_#race_29|) InVars {#race=|v_#race_30|, ~o_4~0.base=v_~o_4~0.base_6, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_23|, ~o_4~0.offset=v_~o_4~0.offset_6} OutVars{#race=|v_#race_29|, ~o_4~0.base=v_~o_4~0.base_6, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_23|, ~o_4~0.offset=v_~o_4~0.offset_6} AuxVars[] AssignedVars[#race][382], [3956#(= (select (select |#race| ~o_4~0.base) (+ ~o_4~0.offset (* |thread2Thread1of1ForFork2_~i~1#1| 4))) 0), 3938#(= |thread3Thread1of1ForFork1_~i~2#1| 0), 3934#(= |#race~o_4~0| 0), 32#L82-20true, Black: 1989#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (not (= (mod |thread2Thread1of1ForFork2_~stop~1#1| 256) 0))), Black: 1986#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 3911#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3905#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 3)), Black: 3885#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 595#(= |#race~isNull_1~0| 0), 1982#(= |#race~o_2~0| 0), Black: 593#true, Black: 3923#(= |#race~result_13~0| 0), Black: 597#true, 429#L105true, Black: 3932#true, Black: 604#true, 623#(not (= (mod |thread1Thread1of1ForFork0_~stop~0#1| 256) 0)), Black: 608#true, 511#L68-17true, 1984#true, Black: 3936#true, 606#(= |#race~isNull_5~0| 0), Black: 3941#(and (= |thread3Thread1of1ForFork1_~i~2#1| 0) (not (= (mod |thread3Thread1of1ForFork1_~stop~2#1| 256) 0))), Black: 614#(= |#race~result_7~0| 0), Black: 1962#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1948#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1956#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 3953#(and (= (select (select |#race| ~o_2~0.base) (+ (* 4 |thread3Thread1of1ForFork1_~i~2#1|) ~o_2~0.offset 1)) 0) (= (select (select |#race| ~o_2~0.base) (+ 3 (* 4 |thread3Thread1of1ForFork1_~i~2#1|) ~o_2~0.offset)) 0) (= (select (select |#race| ~o_2~0.base) (+ (* 4 |thread3Thread1of1ForFork1_~i~2#1|) ~o_2~0.offset)) 0) (= (select (select |#race| ~o_2~0.base) (+ 2 (* 4 |thread3Thread1of1ForFork1_~i~2#1|) ~o_2~0.offset)) 0)), Black: 620#true, 610#(= |#race~o_0~0| 0), 599#(= |#race~isNull_3~0| 0), Black: 625#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (not (= (mod |thread1Thread1of1ForFork0_~stop~0#1| 256) 0))), Black: 622#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 1975#true, Black: 637#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 1980#true]) [2025-03-04 06:53:02,217 INFO L294 olderBase$Statistics]: this new event has 686 ancestors and is cut-off event [2025-03-04 06:53:02,217 INFO L297 olderBase$Statistics]: existing Event has 633 ancestors and is cut-off event [2025-03-04 06:53:02,218 INFO L297 olderBase$Statistics]: existing Event has 633 ancestors and is cut-off event [2025-03-04 06:53:02,218 INFO L297 olderBase$Statistics]: existing Event has 580 ancestors and is cut-off event [2025-03-04 06:53:02,273 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1325] L68-18-->L68-17: Formula: (= (store |v_#race_30| v_~o_4~0.base_6 (store (select |v_#race_30| v_~o_4~0.base_6) (+ (* |v_thread2Thread1of1ForFork2_~i~1#1_23| 4) v_~o_4~0.offset_6) 0)) |v_#race_29|) InVars {#race=|v_#race_30|, ~o_4~0.base=v_~o_4~0.base_6, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_23|, ~o_4~0.offset=v_~o_4~0.offset_6} OutVars{#race=|v_#race_29|, ~o_4~0.base=v_~o_4~0.base_6, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_23|, ~o_4~0.offset=v_~o_4~0.offset_6} AuxVars[] AssignedVars[#race][382], [620#true, 3956#(= (select (select |#race| ~o_4~0.base) (+ ~o_4~0.offset (* |thread2Thread1of1ForFork2_~i~1#1| 4))) 0), 3934#(= |#race~o_4~0| 0), 32#L82-20true, Black: 1989#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (not (= (mod |thread2Thread1of1ForFork2_~stop~1#1| 256) 0))), Black: 1986#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 3911#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3905#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 3)), Black: 3885#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 595#(= |#race~isNull_1~0| 0), 1982#(= |#race~o_2~0| 0), Black: 593#true, Black: 3921#true, Black: 597#true, 429#L105true, Black: 3932#true, Black: 604#true, 511#L68-17true, Black: 608#true, 1984#true, 606#(= |#race~isNull_5~0| 0), Black: 3941#(and (= |thread3Thread1of1ForFork1_~i~2#1| 0) (not (= (mod |thread3Thread1of1ForFork1_~stop~2#1| 256) 0))), Black: 614#(= |#race~result_7~0| 0), Black: 3938#(= |thread3Thread1of1ForFork1_~i~2#1| 0), Black: 1962#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1948#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1956#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 3936#true, 3953#(and (= (select (select |#race| ~o_2~0.base) (+ (* 4 |thread3Thread1of1ForFork1_~i~2#1|) ~o_2~0.offset 1)) 0) (= (select (select |#race| ~o_2~0.base) (+ 3 (* 4 |thread3Thread1of1ForFork1_~i~2#1|) ~o_2~0.offset)) 0) (= (select (select |#race| ~o_2~0.base) (+ (* 4 |thread3Thread1of1ForFork1_~i~2#1|) ~o_2~0.offset)) 0) (= (select (select |#race| ~o_2~0.base) (+ 2 (* 4 |thread3Thread1of1ForFork1_~i~2#1|) ~o_2~0.offset)) 0)), 610#(= |#race~o_0~0| 0), 599#(= |#race~isNull_3~0| 0), Black: 625#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (not (= (mod |thread1Thread1of1ForFork0_~stop~0#1| 256) 0))), Black: 622#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 1975#true, Black: 637#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 1980#true]) [2025-03-04 06:53:02,274 INFO L294 olderBase$Statistics]: this new event has 737 ancestors and is cut-off event [2025-03-04 06:53:02,274 INFO L297 olderBase$Statistics]: existing Event has 631 ancestors and is cut-off event [2025-03-04 06:53:02,274 INFO L297 olderBase$Statistics]: existing Event has 684 ancestors and is cut-off event [2025-03-04 06:53:02,274 INFO L297 olderBase$Statistics]: existing Event has 684 ancestors and is cut-off event [2025-03-04 06:53:02,274 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1325] L68-18-->L68-17: Formula: (= (store |v_#race_30| v_~o_4~0.base_6 (store (select |v_#race_30| v_~o_4~0.base_6) (+ (* |v_thread2Thread1of1ForFork2_~i~1#1_23| 4) v_~o_4~0.offset_6) 0)) |v_#race_29|) InVars {#race=|v_#race_30|, ~o_4~0.base=v_~o_4~0.base_6, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_23|, ~o_4~0.offset=v_~o_4~0.offset_6} OutVars{#race=|v_#race_29|, ~o_4~0.base=v_~o_4~0.base_6, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_23|, ~o_4~0.offset=v_~o_4~0.offset_6} AuxVars[] AssignedVars[#race][382], [3956#(= (select (select |#race| ~o_4~0.base) (+ ~o_4~0.offset (* |thread2Thread1of1ForFork2_~i~1#1| 4))) 0), 3934#(= |#race~o_4~0| 0), 32#L82-20true, Black: 1989#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (not (= (mod |thread2Thread1of1ForFork2_~stop~1#1| 256) 0))), Black: 1986#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 3911#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3905#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 3)), Black: 3885#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 595#(= |#race~isNull_1~0| 0), 1982#(= |#race~o_2~0| 0), Black: 593#true, Black: 3921#true, Black: 597#true, 429#L105true, Black: 3932#true, Black: 604#true, 623#(not (= (mod |thread1Thread1of1ForFork0_~stop~0#1| 256) 0)), 511#L68-17true, Black: 608#true, 1984#true, 606#(= |#race~isNull_5~0| 0), Black: 614#(= |#race~result_7~0| 0), Black: 3941#(and (= |thread3Thread1of1ForFork1_~i~2#1| 0) (not (= (mod |thread3Thread1of1ForFork1_~stop~2#1| 256) 0))), Black: 3938#(= |thread3Thread1of1ForFork1_~i~2#1| 0), Black: 1962#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1948#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1956#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 3936#true, 3953#(and (= (select (select |#race| ~o_2~0.base) (+ (* 4 |thread3Thread1of1ForFork1_~i~2#1|) ~o_2~0.offset 1)) 0) (= (select (select |#race| ~o_2~0.base) (+ 3 (* 4 |thread3Thread1of1ForFork1_~i~2#1|) ~o_2~0.offset)) 0) (= (select (select |#race| ~o_2~0.base) (+ (* 4 |thread3Thread1of1ForFork1_~i~2#1|) ~o_2~0.offset)) 0) (= (select (select |#race| ~o_2~0.base) (+ 2 (* 4 |thread3Thread1of1ForFork1_~i~2#1|) ~o_2~0.offset)) 0)), 610#(= |#race~o_0~0| 0), Black: 620#true, 599#(= |#race~isNull_3~0| 0), Black: 625#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (not (= (mod |thread1Thread1of1ForFork0_~stop~0#1| 256) 0))), Black: 622#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 1975#true, Black: 637#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 1980#true]) [2025-03-04 06:53:02,274 INFO L294 olderBase$Statistics]: this new event has 739 ancestors and is cut-off event [2025-03-04 06:53:02,274 INFO L297 olderBase$Statistics]: existing Event has 633 ancestors and is cut-off event [2025-03-04 06:53:02,274 INFO L297 olderBase$Statistics]: existing Event has 686 ancestors and is cut-off event [2025-03-04 06:53:02,274 INFO L297 olderBase$Statistics]: existing Event has 686 ancestors and is cut-off event [2025-03-04 06:53:02,274 INFO L124 PetriNetUnfolderBase]: 331/7564 cut-off events. [2025-03-04 06:53:02,274 INFO L125 PetriNetUnfolderBase]: For 463/512 co-relation queries the response was YES. [2025-03-04 06:53:02,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9684 conditions, 7564 events. 331/7564 cut-off events. For 463/512 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 68216 event pairs, 39 based on Foata normal form. 0/7058 useless extension candidates. Maximal degree in co-relation 9468. Up to 169 conditions per place. [2025-03-04 06:53:02,341 INFO L140 encePairwiseOnDemand]: 577/583 looper letters, 29 selfloop transitions, 6 changer transitions 0/553 dead transitions. [2025-03-04 06:53:02,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 549 places, 553 transitions, 1654 flow [2025-03-04 06:53:02,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:53:02,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:53:02,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3257 transitions. [2025-03-04 06:53:02,343 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9311034877072613 [2025-03-04 06:53:02,343 INFO L175 Difference]: Start difference. First operand has 545 places, 546 transitions, 1562 flow. Second operand 6 states and 3257 transitions. [2025-03-04 06:53:02,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 549 places, 553 transitions, 1654 flow [2025-03-04 06:53:02,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 544 places, 553 transitions, 1642 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:53:02,351 INFO L231 Difference]: Finished difference. Result has 544 places, 545 transitions, 1560 flow [2025-03-04 06:53:02,352 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1548, PETRI_DIFFERENCE_MINUEND_PLACES=539, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=545, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=539, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1560, PETRI_PLACES=544, PETRI_TRANSITIONS=545} [2025-03-04 06:53:02,352 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, -1 predicate places. [2025-03-04 06:53:02,352 INFO L471 AbstractCegarLoop]: Abstraction has has 544 places, 545 transitions, 1560 flow [2025-03-04 06:53:02,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 540.6666666666666) internal successors, (3244), 6 states have internal predecessors, (3244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:02,353 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:53:02,353 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:53:02,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-04 06:53:02,354 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting thread3Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-03-04 06:53:02,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:53:02,355 INFO L85 PathProgramCache]: Analyzing trace with hash 481812883, now seen corresponding path program 1 times [2025-03-04 06:53:02,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:53:02,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101486230] [2025-03-04 06:53:02,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:53:02,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:53:02,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 416 statements into 1 equivalence classes. [2025-03-04 06:53:02,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 416 of 416 statements. [2025-03-04 06:53:02,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:53:02,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:53:02,936 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2025-03-04 06:53:02,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:53:02,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101486230] [2025-03-04 06:53:02,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101486230] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:53:02,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:53:02,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:53:02,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468136452] [2025-03-04 06:53:02,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:53:02,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:53:02,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:53:02,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:53:02,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:53:03,207 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 537 out of 583 [2025-03-04 06:53:03,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 544 places, 545 transitions, 1560 flow. Second operand has 6 states, 6 states have (on average 540.8333333333334) internal successors, (3245), 6 states have internal predecessors, (3245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:03,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:53:03,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 537 of 583 [2025-03-04 06:53:03,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:53:05,055 INFO L124 PetriNetUnfolderBase]: 413/7689 cut-off events. [2025-03-04 06:53:05,056 INFO L125 PetriNetUnfolderBase]: For 651/741 co-relation queries the response was YES. [2025-03-04 06:53:05,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9999 conditions, 7689 events. 413/7689 cut-off events. For 651/741 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 77523 event pairs, 62 based on Foata normal form. 16/7268 useless extension candidates. Maximal degree in co-relation 9420. Up to 276 conditions per place. [2025-03-04 06:53:05,132 INFO L140 encePairwiseOnDemand]: 577/583 looper letters, 29 selfloop transitions, 6 changer transitions 0/552 dead transitions. [2025-03-04 06:53:05,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 548 places, 552 transitions, 1652 flow [2025-03-04 06:53:05,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:53:05,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:53:05,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3257 transitions. [2025-03-04 06:53:05,134 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9311034877072613 [2025-03-04 06:53:05,134 INFO L175 Difference]: Start difference. First operand has 544 places, 545 transitions, 1560 flow. Second operand 6 states and 3257 transitions. [2025-03-04 06:53:05,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 548 places, 552 transitions, 1652 flow [2025-03-04 06:53:05,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 543 places, 552 transitions, 1640 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:53:05,141 INFO L231 Difference]: Finished difference. Result has 543 places, 544 transitions, 1558 flow [2025-03-04 06:53:05,142 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1546, PETRI_DIFFERENCE_MINUEND_PLACES=538, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=544, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=538, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1558, PETRI_PLACES=543, PETRI_TRANSITIONS=544} [2025-03-04 06:53:05,142 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, -2 predicate places. [2025-03-04 06:53:05,142 INFO L471 AbstractCegarLoop]: Abstraction has has 543 places, 544 transitions, 1558 flow [2025-03-04 06:53:05,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 540.8333333333334) internal successors, (3245), 6 states have internal predecessors, (3245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:05,142 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:53:05,143 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:53:05,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-04 06:53:05,143 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-03-04 06:53:05,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:53:05,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1415914447, now seen corresponding path program 1 times [2025-03-04 06:53:05,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:53:05,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570198507] [2025-03-04 06:53:05,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:53:05,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:53:05,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 430 statements into 1 equivalence classes. [2025-03-04 06:53:05,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 430 of 430 statements. [2025-03-04 06:53:05,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:53:05,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:53:05,226 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2025-03-04 06:53:05,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:53:05,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570198507] [2025-03-04 06:53:05,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570198507] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:53:05,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:53:05,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:53:05,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491713734] [2025-03-04 06:53:05,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:53:05,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:53:05,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:53:05,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:53:05,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:53:05,247 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 549 out of 583 [2025-03-04 06:53:05,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 543 places, 544 transitions, 1558 flow. Second operand has 3 states, 3 states have (on average 550.6666666666666) internal successors, (1652), 3 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:05,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:53:05,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 549 of 583 [2025-03-04 06:53:05,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:53:07,034 INFO L124 PetriNetUnfolderBase]: 180/7839 cut-off events. [2025-03-04 06:53:07,034 INFO L125 PetriNetUnfolderBase]: For 322/508 co-relation queries the response was YES. [2025-03-04 06:53:07,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9862 conditions, 7839 events. 180/7839 cut-off events. For 322/508 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 71774 event pairs, 69 based on Foata normal form. 6/7496 useless extension candidates. Maximal degree in co-relation 9594. Up to 166 conditions per place. [2025-03-04 06:53:07,112 INFO L140 encePairwiseOnDemand]: 580/583 looper letters, 14 selfloop transitions, 3 changer transitions 0/545 dead transitions. [2025-03-04 06:53:07,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 544 places, 545 transitions, 1596 flow [2025-03-04 06:53:07,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:53:07,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:53:07,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1663 transitions. [2025-03-04 06:53:07,113 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9508290451686678 [2025-03-04 06:53:07,113 INFO L175 Difference]: Start difference. First operand has 543 places, 544 transitions, 1558 flow. Second operand 3 states and 1663 transitions. [2025-03-04 06:53:07,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 544 places, 545 transitions, 1596 flow [2025-03-04 06:53:07,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 539 places, 545 transitions, 1584 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:53:07,122 INFO L231 Difference]: Finished difference. Result has 539 places, 543 transitions, 1550 flow [2025-03-04 06:53:07,122 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1544, PETRI_DIFFERENCE_MINUEND_PLACES=537, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=543, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=540, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1550, PETRI_PLACES=539, PETRI_TRANSITIONS=543} [2025-03-04 06:53:07,123 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, -6 predicate places. [2025-03-04 06:53:07,123 INFO L471 AbstractCegarLoop]: Abstraction has has 539 places, 543 transitions, 1550 flow [2025-03-04 06:53:07,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 550.6666666666666) internal successors, (1652), 3 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:07,123 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:53:07,123 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:53:07,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-04 06:53:07,123 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-03-04 06:53:07,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:53:07,125 INFO L85 PathProgramCache]: Analyzing trace with hash 779141168, now seen corresponding path program 1 times [2025-03-04 06:53:07,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:53:07,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651524600] [2025-03-04 06:53:07,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:53:07,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:53:07,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 436 statements into 1 equivalence classes. [2025-03-04 06:53:07,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 436 of 436 statements. [2025-03-04 06:53:07,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:53:07,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:53:07,211 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 468 trivial. 0 not checked. [2025-03-04 06:53:07,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:53:07,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651524600] [2025-03-04 06:53:07,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651524600] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:53:07,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:53:07,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:53:07,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635284041] [2025-03-04 06:53:07,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:53:07,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:53:07,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:53:07,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:53:07,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:53:07,230 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 548 out of 583 [2025-03-04 06:53:07,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 539 places, 543 transitions, 1550 flow. Second operand has 3 states, 3 states have (on average 550.0) internal successors, (1650), 3 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:07,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:53:07,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 548 of 583 [2025-03-04 06:53:07,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:53:09,656 INFO L124 PetriNetUnfolderBase]: 468/9815 cut-off events. [2025-03-04 06:53:09,656 INFO L125 PetriNetUnfolderBase]: For 574/648 co-relation queries the response was YES. [2025-03-04 06:53:09,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12366 conditions, 9815 events. 468/9815 cut-off events. For 574/648 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 98913 event pairs, 177 based on Foata normal form. 0/9279 useless extension candidates. Maximal degree in co-relation 11848. Up to 516 conditions per place. [2025-03-04 06:53:09,752 INFO L140 encePairwiseOnDemand]: 580/583 looper letters, 14 selfloop transitions, 3 changer transitions 0/544 dead transitions. [2025-03-04 06:53:09,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 540 places, 544 transitions, 1588 flow [2025-03-04 06:53:09,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:53:09,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:53:09,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1660 transitions. [2025-03-04 06:53:09,753 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9491137793024585 [2025-03-04 06:53:09,753 INFO L175 Difference]: Start difference. First operand has 539 places, 543 transitions, 1550 flow. Second operand 3 states and 1660 transitions. [2025-03-04 06:53:09,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 540 places, 544 transitions, 1588 flow [2025-03-04 06:53:09,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 538 places, 544 transitions, 1582 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:53:09,762 INFO L231 Difference]: Finished difference. Result has 538 places, 542 transitions, 1548 flow [2025-03-04 06:53:09,762 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1542, PETRI_DIFFERENCE_MINUEND_PLACES=536, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=542, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=539, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1548, PETRI_PLACES=538, PETRI_TRANSITIONS=542} [2025-03-04 06:53:09,762 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, -7 predicate places. [2025-03-04 06:53:09,762 INFO L471 AbstractCegarLoop]: Abstraction has has 538 places, 542 transitions, 1548 flow [2025-03-04 06:53:09,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 550.0) internal successors, (1650), 3 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:09,763 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:53:09,763 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:53:09,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-04 06:53:09,763 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting thread3Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-03-04 06:53:09,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:53:09,764 INFO L85 PathProgramCache]: Analyzing trace with hash 753626530, now seen corresponding path program 1 times [2025-03-04 06:53:09,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:53:09,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87826456] [2025-03-04 06:53:09,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:53:09,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:53:09,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 442 statements into 1 equivalence classes. [2025-03-04 06:53:09,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 442 of 442 statements. [2025-03-04 06:53:09,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:53:09,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:53:09,847 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 468 trivial. 0 not checked. [2025-03-04 06:53:09,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:53:09,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87826456] [2025-03-04 06:53:09,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87826456] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:53:09,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:53:09,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:53:09,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442935521] [2025-03-04 06:53:09,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:53:09,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:53:09,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:53:09,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:53:09,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:53:09,870 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 548 out of 583 [2025-03-04 06:53:09,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 538 places, 542 transitions, 1548 flow. Second operand has 3 states, 3 states have (on average 550.3333333333334) internal successors, (1651), 3 states have internal predecessors, (1651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:09,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:53:09,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 548 of 583 [2025-03-04 06:53:09,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:53:11,563 INFO L124 PetriNetUnfolderBase]: 493/7668 cut-off events. [2025-03-04 06:53:11,563 INFO L125 PetriNetUnfolderBase]: For 731/777 co-relation queries the response was YES. [2025-03-04 06:53:11,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10078 conditions, 7668 events. 493/7668 cut-off events. For 731/777 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 78566 event pairs, 260 based on Foata normal form. 0/7276 useless extension candidates. Maximal degree in co-relation 9560. Up to 746 conditions per place. [2025-03-04 06:53:11,663 INFO L140 encePairwiseOnDemand]: 580/583 looper letters, 0 selfloop transitions, 0 changer transitions 543/543 dead transitions. [2025-03-04 06:53:11,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 539 places, 543 transitions, 1586 flow [2025-03-04 06:53:11,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:53:11,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:53:11,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1660 transitions. [2025-03-04 06:53:11,664 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9491137793024585 [2025-03-04 06:53:11,664 INFO L175 Difference]: Start difference. First operand has 538 places, 542 transitions, 1548 flow. Second operand 3 states and 1660 transitions. [2025-03-04 06:53:11,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 539 places, 543 transitions, 1586 flow [2025-03-04 06:53:11,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 537 places, 543 transitions, 1580 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:53:11,671 INFO L231 Difference]: Finished difference. Result has 537 places, 0 transitions, 0 flow [2025-03-04 06:53:11,671 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1540, PETRI_DIFFERENCE_MINUEND_PLACES=535, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=541, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=541, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=537, PETRI_TRANSITIONS=0} [2025-03-04 06:53:11,671 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, -8 predicate places. [2025-03-04 06:53:11,671 INFO L471 AbstractCegarLoop]: Abstraction has has 537 places, 0 transitions, 0 flow [2025-03-04 06:53:11,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 550.3333333333334) internal successors, (1651), 3 states have internal predecessors, (1651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:11,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (82 of 83 remaining) [2025-03-04 06:53:11,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (81 of 83 remaining) [2025-03-04 06:53:11,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (80 of 83 remaining) [2025-03-04 06:53:11,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (79 of 83 remaining) [2025-03-04 06:53:11,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (78 of 83 remaining) [2025-03-04 06:53:11,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (77 of 83 remaining) [2025-03-04 06:53:11,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (76 of 83 remaining) [2025-03-04 06:53:11,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (75 of 83 remaining) [2025-03-04 06:53:11,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (74 of 83 remaining) [2025-03-04 06:53:11,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (73 of 83 remaining) [2025-03-04 06:53:11,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (72 of 83 remaining) [2025-03-04 06:53:11,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (71 of 83 remaining) [2025-03-04 06:53:11,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (70 of 83 remaining) [2025-03-04 06:53:11,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (69 of 83 remaining) [2025-03-04 06:53:11,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (68 of 83 remaining) [2025-03-04 06:53:11,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (67 of 83 remaining) [2025-03-04 06:53:11,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (66 of 83 remaining) [2025-03-04 06:53:11,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (65 of 83 remaining) [2025-03-04 06:53:11,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (64 of 83 remaining) [2025-03-04 06:53:11,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (63 of 83 remaining) [2025-03-04 06:53:11,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (62 of 83 remaining) [2025-03-04 06:53:11,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (61 of 83 remaining) [2025-03-04 06:53:11,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (60 of 83 remaining) [2025-03-04 06:53:11,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (59 of 83 remaining) [2025-03-04 06:53:11,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (58 of 83 remaining) [2025-03-04 06:53:11,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (57 of 83 remaining) [2025-03-04 06:53:11,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (56 of 83 remaining) [2025-03-04 06:53:11,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (55 of 83 remaining) [2025-03-04 06:53:11,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (54 of 83 remaining) [2025-03-04 06:53:11,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (53 of 83 remaining) [2025-03-04 06:53:11,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (52 of 83 remaining) [2025-03-04 06:53:11,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (51 of 83 remaining) [2025-03-04 06:53:11,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (50 of 83 remaining) [2025-03-04 06:53:11,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (49 of 83 remaining) [2025-03-04 06:53:11,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (48 of 83 remaining) [2025-03-04 06:53:11,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (47 of 83 remaining) [2025-03-04 06:53:11,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (46 of 83 remaining) [2025-03-04 06:53:11,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (45 of 83 remaining) [2025-03-04 06:53:11,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (44 of 83 remaining) [2025-03-04 06:53:11,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (43 of 83 remaining) [2025-03-04 06:53:11,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (42 of 83 remaining) [2025-03-04 06:53:11,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (41 of 83 remaining) [2025-03-04 06:53:11,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (40 of 83 remaining) [2025-03-04 06:53:11,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (39 of 83 remaining) [2025-03-04 06:53:11,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (38 of 83 remaining) [2025-03-04 06:53:11,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (37 of 83 remaining) [2025-03-04 06:53:11,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (36 of 83 remaining) [2025-03-04 06:53:11,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 83 remaining) [2025-03-04 06:53:11,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 83 remaining) [2025-03-04 06:53:11,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (33 of 83 remaining) [2025-03-04 06:53:11,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (32 of 83 remaining) [2025-03-04 06:53:11,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (31 of 83 remaining) [2025-03-04 06:53:11,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (30 of 83 remaining) [2025-03-04 06:53:11,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (29 of 83 remaining) [2025-03-04 06:53:11,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (28 of 83 remaining) [2025-03-04 06:53:11,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (27 of 83 remaining) [2025-03-04 06:53:11,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (26 of 83 remaining) [2025-03-04 06:53:11,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (25 of 83 remaining) [2025-03-04 06:53:11,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (24 of 83 remaining) [2025-03-04 06:53:11,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (23 of 83 remaining) [2025-03-04 06:53:11,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (22 of 83 remaining) [2025-03-04 06:53:11,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (21 of 83 remaining) [2025-03-04 06:53:11,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (20 of 83 remaining) [2025-03-04 06:53:11,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (19 of 83 remaining) [2025-03-04 06:53:11,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (18 of 83 remaining) [2025-03-04 06:53:11,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (17 of 83 remaining) [2025-03-04 06:53:11,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (16 of 83 remaining) [2025-03-04 06:53:11,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (15 of 83 remaining) [2025-03-04 06:53:11,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (14 of 83 remaining) [2025-03-04 06:53:11,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (13 of 83 remaining) [2025-03-04 06:53:11,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (12 of 83 remaining) [2025-03-04 06:53:11,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (11 of 83 remaining) [2025-03-04 06:53:11,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (10 of 83 remaining) [2025-03-04 06:53:11,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (9 of 83 remaining) [2025-03-04 06:53:11,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (8 of 83 remaining) [2025-03-04 06:53:11,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (7 of 83 remaining) [2025-03-04 06:53:11,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (6 of 83 remaining) [2025-03-04 06:53:11,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (5 of 83 remaining) [2025-03-04 06:53:11,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (4 of 83 remaining) [2025-03-04 06:53:11,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (3 of 83 remaining) [2025-03-04 06:53:11,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (2 of 83 remaining) [2025-03-04 06:53:11,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (1 of 83 remaining) [2025-03-04 06:53:11,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (0 of 83 remaining) [2025-03-04 06:53:11,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-04 06:53:11,676 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:53:11,680 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 06:53:11,680 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 06:53:11,687 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 06:53:11 BasicIcfg [2025-03-04 06:53:11,687 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 06:53:11,688 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 06:53:11,688 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 06:53:11,688 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 06:53:11,689 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:52:27" (3/4) ... [2025-03-04 06:53:11,690 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 06:53:11,693 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-04 06:53:11,693 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-04 06:53:11,693 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-03-04 06:53:11,699 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2025-03-04 06:53:11,700 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-04 06:53:11,701 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 06:53:11,701 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 06:53:11,775 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 06:53:11,775 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 06:53:11,775 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 06:53:11,776 INFO L158 Benchmark]: Toolchain (without parser) took 45736.58ms. Allocated memory was 142.6MB in the beginning and 2.4GB in the end (delta: 2.3GB). Free memory was 105.2MB in the beginning and 757.1MB in the end (delta: -651.9MB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2025-03-04 06:53:11,776 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 06:53:11,777 INFO L158 Benchmark]: CACSL2BoogieTranslator took 244.64ms. Allocated memory is still 142.6MB. Free memory was 105.2MB in the beginning and 91.9MB in the end (delta: 13.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 06:53:11,777 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.32ms. Allocated memory is still 142.6MB. Free memory was 91.9MB in the beginning and 88.1MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 06:53:11,779 INFO L158 Benchmark]: Boogie Preprocessor took 45.34ms. Allocated memory is still 142.6MB. Free memory was 88.1MB in the beginning and 85.4MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 06:53:11,779 INFO L158 Benchmark]: IcfgBuilder took 679.52ms. Allocated memory is still 142.6MB. Free memory was 85.4MB in the beginning and 44.0MB in the end (delta: 41.5MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-04 06:53:11,779 INFO L158 Benchmark]: TraceAbstraction took 44617.28ms. Allocated memory was 142.6MB in the beginning and 2.4GB in the end (delta: 2.3GB). Free memory was 43.5MB in the beginning and 765.5MB in the end (delta: -722.0MB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2025-03-04 06:53:11,780 INFO L158 Benchmark]: Witness Printer took 87.01ms. Allocated memory is still 2.4GB. Free memory was 765.5MB in the beginning and 757.1MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 06:53:11,781 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.23ms. Allocated memory is still 201.3MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 244.64ms. Allocated memory is still 142.6MB. Free memory was 105.2MB in the beginning and 91.9MB in the end (delta: 13.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.32ms. Allocated memory is still 142.6MB. Free memory was 91.9MB in the beginning and 88.1MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 45.34ms. Allocated memory is still 142.6MB. Free memory was 88.1MB in the beginning and 85.4MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 679.52ms. Allocated memory is still 142.6MB. Free memory was 85.4MB in the beginning and 44.0MB in the end (delta: 41.5MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 44617.28ms. Allocated memory was 142.6MB in the beginning and 2.4GB in the end (delta: 2.3GB). Free memory was 43.5MB in the beginning and 765.5MB in the end (delta: -722.0MB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. * Witness Printer took 87.01ms. Allocated memory is still 2.4GB. Free memory was 765.5MB in the beginning and 757.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: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: 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: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: 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: 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: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: 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: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: 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: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: 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: 121]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 121]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 121]: 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: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: 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 7 procedures, 857 locations, 83 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: 44.4s, OverallIterations: 37, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 36.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3940 SdHoareTripleChecker+Valid, 4.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2592 mSDsluCounter, 1263 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1080 mSDsCounter, 737 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6745 IncrementalHoareTripleChecker+Invalid, 7482 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 737 mSolverCounterUnsat, 183 mSDtfsCounter, 6745 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1204 GetRequests, 1078 SyntacticMatches, 5 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1630occurred in iteration=25, InterpolantAutomatonStates: 162, 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.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 10237 NumberOfCodeBlocks, 9877 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 10724 ConstructedInterpolants, 0 QuantifiedInterpolants, 12786 SizeOfPredicates, 14 NumberOfNonLiveVariables, 1184 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 41 InterpolantComputations, 35 PerfectInterpolantSequences, 6747/6894 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 47 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 06:53:11,798 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