./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/unroll-5.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/unroll-5.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 624ca078114fa3c35bb1960efece3c50cba0d03b97522c4936fd5f6e5d783f29 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 06:56:21,936 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:56:21,994 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-04 06:56:21,999 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:56:22,000 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:56:22,020 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:56:22,020 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:56:22,020 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:56:22,020 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:56:22,020 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:56:22,021 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:56:22,021 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:56:22,021 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:56:22,021 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:56:22,021 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:56:22,021 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:56:22,021 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:56:22,021 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:56:22,021 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:56:22,021 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:56:22,021 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:56:22,021 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:56:22,021 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-04 06:56:22,021 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 06:56:22,021 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:56:22,023 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:56:22,023 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:56:22,023 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:56:22,023 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:56:22,023 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:56:22,023 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:56:22,023 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:56:22,023 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:56:22,023 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:56:22,023 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:56:22,024 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:56:22,024 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:56:22,024 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:56:22,024 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:56:22,024 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:56:22,024 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:56:22,024 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:56:22,024 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 -> 624ca078114fa3c35bb1960efece3c50cba0d03b97522c4936fd5f6e5d783f29 [2025-03-04 06:56:22,242 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:56:22,247 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:56:22,250 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:56:22,251 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:56:22,252 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:56:22,253 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/unroll-5.wvr.c [2025-03-04 06:56:23,413 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16db60620/5d1d944c6a2d45fe8e16fe62145115bf/FLAGb122fe42c [2025-03-04 06:56:23,665 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:56:23,666 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/unroll-5.wvr.c [2025-03-04 06:56:23,672 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16db60620/5d1d944c6a2d45fe8e16fe62145115bf/FLAGb122fe42c [2025-03-04 06:56:23,978 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16db60620/5d1d944c6a2d45fe8e16fe62145115bf [2025-03-04 06:56:23,980 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:56:23,981 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:56:23,983 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:56:23,984 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:56:23,986 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:56:23,987 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:56:23" (1/1) ... [2025-03-04 06:56:23,988 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44f1e6c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:56:23, skipping insertion in model container [2025-03-04 06:56:23,988 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:56:23" (1/1) ... [2025-03-04 06:56:23,998 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:56:24,163 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:56:24,173 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:56:24,206 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:56:24,225 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:56:24,225 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:56:24 WrapperNode [2025-03-04 06:56:24,225 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:56:24,226 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:56:24,226 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:56:24,226 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:56:24,231 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:56:24" (1/1) ... [2025-03-04 06:56:24,241 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:56:24" (1/1) ... [2025-03-04 06:56:24,269 INFO L138 Inliner]: procedures = 23, calls = 29, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 325 [2025-03-04 06:56:24,272 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:56:24,272 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:56:24,272 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:56:24,272 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:56:24,278 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:56:24" (1/1) ... [2025-03-04 06:56:24,279 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:56:24" (1/1) ... [2025-03-04 06:56:24,283 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:56:24" (1/1) ... [2025-03-04 06:56:24,287 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:56:24" (1/1) ... [2025-03-04 06:56:24,304 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:56:24" (1/1) ... [2025-03-04 06:56:24,305 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:56:24" (1/1) ... [2025-03-04 06:56:24,306 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:56:24" (1/1) ... [2025-03-04 06:56:24,307 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:56:24" (1/1) ... [2025-03-04 06:56:24,309 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:56:24,309 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:56:24,309 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:56:24,309 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:56:24,310 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:56:24" (1/1) ... [2025-03-04 06:56:24,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:56:24,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:56:24,340 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:56:24,342 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:56:24,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:56:24,360 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 06:56:24,360 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 06:56:24,360 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 06:56:24,360 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 06:56:24,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 06:56:24,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 06:56:24,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 06:56:24,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:56:24,361 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:56:24,361 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 06:56:24,362 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:56:24,438 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:56:24,440 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:56:24,907 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 06:56:24,907 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:56:24,922 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:56:24,922 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 06:56:24,923 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:56:24 BoogieIcfgContainer [2025-03-04 06:56:24,923 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:56:24,924 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:56:24,924 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:56:24,932 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:56:24,932 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:56:23" (1/3) ... [2025-03-04 06:56:24,932 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31c1daf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:56:24, skipping insertion in model container [2025-03-04 06:56:24,932 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:56:24" (2/3) ... [2025-03-04 06:56:24,932 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31c1daf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:56:24, skipping insertion in model container [2025-03-04 06:56:24,932 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:56:24" (3/3) ... [2025-03-04 06:56:24,933 INFO L128 eAbstractionObserver]: Analyzing ICFG unroll-5.wvr.c [2025-03-04 06:56:24,942 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:56:24,944 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unroll-5.wvr.c that has 3 procedures, 417 locations, 1 initial locations, 3 loop locations, and 53 error locations. [2025-03-04 06:56:24,944 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 06:56:25,026 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 06:56:25,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 423 places, 438 transitions, 890 flow [2025-03-04 06:56:25,200 INFO L124 PetriNetUnfolderBase]: 22/436 cut-off events. [2025-03-04 06:56:25,203 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 06:56:25,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 436 events. 22/436 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 564 event pairs, 0 based on Foata normal form. 0/361 useless extension candidates. Maximal degree in co-relation 300. Up to 2 conditions per place. [2025-03-04 06:56:25,213 INFO L82 GeneralOperation]: Start removeDead. Operand has 423 places, 438 transitions, 890 flow [2025-03-04 06:56:25,221 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 405 places, 419 transitions, 850 flow [2025-03-04 06:56:25,230 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:56:25,239 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;@7b785bc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:56:25,240 INFO L334 AbstractCegarLoop]: Starting to check reachability of 99 error locations. [2025-03-04 06:56:25,244 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:56:25,244 INFO L124 PetriNetUnfolderBase]: 0/20 cut-off events. [2025-03-04 06:56:25,244 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:56:25,245 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:25,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] [2025-03-04 06:56:25,246 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 95 more)] === [2025-03-04 06:56:25,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:25,250 INFO L85 PathProgramCache]: Analyzing trace with hash 231268555, now seen corresponding path program 1 times [2025-03-04 06:56:25,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:25,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449999117] [2025-03-04 06:56:25,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:25,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:25,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 06:56:25,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 06:56:25,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:25,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:25,356 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:56:25,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:25,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449999117] [2025-03-04 06:56:25,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449999117] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:25,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:25,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:56:25,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945877341] [2025-03-04 06:56:25,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:25,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:56:25,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:25,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:56:25,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:56:25,420 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 410 out of 438 [2025-03-04 06:56:25,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 405 places, 419 transitions, 850 flow. Second operand has 3 states, 3 states have (on average 411.3333333333333) internal successors, (1234), 3 states have internal predecessors, (1234), 0 states have call successors, (0), 0 states 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:56:25,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:25,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 410 of 438 [2025-03-04 06:56:25,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:25,523 INFO L124 PetriNetUnfolderBase]: 16/514 cut-off events. [2025-03-04 06:56:25,524 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-04 06:56:25,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 547 conditions, 514 events. 16/514 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1117 event pairs, 3 based on Foata normal form. 12/433 useless extension candidates. Maximal degree in co-relation 409. Up to 19 conditions per place. [2025-03-04 06:56:25,531 INFO L140 encePairwiseOnDemand]: 423/438 looper letters, 10 selfloop transitions, 2 changer transitions 4/406 dead transitions. [2025-03-04 06:56:25,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 406 places, 406 transitions, 848 flow [2025-03-04 06:56:25,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:56:25,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:56:25,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1255 transitions. [2025-03-04 06:56:25,549 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9550989345509894 [2025-03-04 06:56:25,553 INFO L175 Difference]: Start difference. First operand has 405 places, 419 transitions, 850 flow. Second operand 3 states and 1255 transitions. [2025-03-04 06:56:25,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 406 places, 406 transitions, 848 flow [2025-03-04 06:56:25,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 402 places, 406 transitions, 840 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 06:56:25,566 INFO L231 Difference]: Finished difference. Result has 402 places, 402 transitions, 812 flow [2025-03-04 06:56:25,569 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=438, PETRI_DIFFERENCE_MINUEND_FLOW=816, PETRI_DIFFERENCE_MINUEND_PLACES=400, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=404, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=812, PETRI_PLACES=402, PETRI_TRANSITIONS=402} [2025-03-04 06:56:25,574 INFO L279 CegarLoopForPetriNet]: 405 programPoint places, -3 predicate places. [2025-03-04 06:56:25,575 INFO L471 AbstractCegarLoop]: Abstraction has has 402 places, 402 transitions, 812 flow [2025-03-04 06:56:25,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 411.3333333333333) internal successors, (1234), 3 states have internal predecessors, (1234), 0 states have call successors, (0), 0 states 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:56:25,576 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:25,576 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] [2025-03-04 06:56:25,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:56:25,577 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 95 more)] === [2025-03-04 06:56:25,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:25,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1457821753, now seen corresponding path program 1 times [2025-03-04 06:56:25,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:25,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771382143] [2025-03-04 06:56:25,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:25,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:25,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 06:56:25,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 06:56:25,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:25,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:25,635 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:56:25,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:25,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771382143] [2025-03-04 06:56:25,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771382143] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:25,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:25,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:56:25,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310756855] [2025-03-04 06:56:25,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:25,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:56:25,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:25,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:56:25,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:56:25,680 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 405 out of 438 [2025-03-04 06:56:25,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 402 places, 402 transitions, 812 flow. Second operand has 3 states, 3 states have (on average 406.3333333333333) internal successors, (1219), 3 states have internal predecessors, (1219), 0 states have call successors, (0), 0 states 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:56:25,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:25,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 405 of 438 [2025-03-04 06:56:25,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:25,773 INFO L124 PetriNetUnfolderBase]: 26/649 cut-off events. [2025-03-04 06:56:25,773 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-04 06:56:25,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 696 conditions, 649 events. 26/649 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1681 event pairs, 11 based on Foata normal form. 0/531 useless extension candidates. Maximal degree in co-relation 668. Up to 38 conditions per place. [2025-03-04 06:56:25,778 INFO L140 encePairwiseOnDemand]: 435/438 looper letters, 15 selfloop transitions, 2 changer transitions 0/401 dead transitions. [2025-03-04 06:56:25,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 399 places, 401 transitions, 844 flow [2025-03-04 06:56:25,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:56:25,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:56:25,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1233 transitions. [2025-03-04 06:56:25,783 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9383561643835616 [2025-03-04 06:56:25,783 INFO L175 Difference]: Start difference. First operand has 402 places, 402 transitions, 812 flow. Second operand 3 states and 1233 transitions. [2025-03-04 06:56:25,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 399 places, 401 transitions, 844 flow [2025-03-04 06:56:25,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 397 places, 401 transitions, 840 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:56:25,790 INFO L231 Difference]: Finished difference. Result has 397 places, 401 transitions, 810 flow [2025-03-04 06:56:25,791 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=438, PETRI_DIFFERENCE_MINUEND_FLOW=806, PETRI_DIFFERENCE_MINUEND_PLACES=395, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=401, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=399, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=810, PETRI_PLACES=397, PETRI_TRANSITIONS=401} [2025-03-04 06:56:25,792 INFO L279 CegarLoopForPetriNet]: 405 programPoint places, -8 predicate places. [2025-03-04 06:56:25,792 INFO L471 AbstractCegarLoop]: Abstraction has has 397 places, 401 transitions, 810 flow [2025-03-04 06:56:25,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 406.3333333333333) internal successors, (1219), 3 states have internal predecessors, (1219), 0 states have call successors, (0), 0 states 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:56:25,793 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:25,794 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] [2025-03-04 06:56:25,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:56:25,794 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 95 more)] === [2025-03-04 06:56:25,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:25,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1496914048, now seen corresponding path program 1 times [2025-03-04 06:56:25,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:25,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010859790] [2025-03-04 06:56:25,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:25,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:25,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 06:56:25,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 06:56:25,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:25,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:25,833 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:56:25,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:25,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010859790] [2025-03-04 06:56:25,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010859790] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:25,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:25,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:56:25,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026467635] [2025-03-04 06:56:25,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:25,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:56:25,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:25,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:56:25,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:56:25,868 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 395 out of 438 [2025-03-04 06:56:25,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 397 places, 401 transitions, 810 flow. Second operand has 3 states, 3 states have (on average 396.0) internal successors, (1188), 3 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states 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:56:25,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:25,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 395 of 438 [2025-03-04 06:56:25,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:26,056 INFO L124 PetriNetUnfolderBase]: 96/1418 cut-off events. [2025-03-04 06:56:26,056 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-03-04 06:56:26,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1545 conditions, 1418 events. 96/1418 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 6423 event pairs, 32 based on Foata normal form. 0/1154 useless extension candidates. Maximal degree in co-relation 1509. Up to 117 conditions per place. [2025-03-04 06:56:26,065 INFO L140 encePairwiseOnDemand]: 429/438 looper letters, 20 selfloop transitions, 1 changer transitions 0/393 dead transitions. [2025-03-04 06:56:26,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 391 places, 393 transitions, 836 flow [2025-03-04 06:56:26,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:56:26,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:56:26,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1214 transitions. [2025-03-04 06:56:26,067 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.923896499238965 [2025-03-04 06:56:26,068 INFO L175 Difference]: Start difference. First operand has 397 places, 401 transitions, 810 flow. Second operand 3 states and 1214 transitions. [2025-03-04 06:56:26,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 391 places, 393 transitions, 836 flow [2025-03-04 06:56:26,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 389 places, 393 transitions, 832 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:56:26,072 INFO L231 Difference]: Finished difference. Result has 389 places, 393 transitions, 792 flow [2025-03-04 06:56:26,073 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=438, PETRI_DIFFERENCE_MINUEND_FLOW=790, PETRI_DIFFERENCE_MINUEND_PLACES=387, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=393, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=392, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=792, PETRI_PLACES=389, PETRI_TRANSITIONS=393} [2025-03-04 06:56:26,073 INFO L279 CegarLoopForPetriNet]: 405 programPoint places, -16 predicate places. [2025-03-04 06:56:26,073 INFO L471 AbstractCegarLoop]: Abstraction has has 389 places, 393 transitions, 792 flow [2025-03-04 06:56:26,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 396.0) internal successors, (1188), 3 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states 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:56:26,074 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:26,074 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:56:26,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:56:26,074 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 95 more)] === [2025-03-04 06:56:26,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:26,075 INFO L85 PathProgramCache]: Analyzing trace with hash -730664979, now seen corresponding path program 1 times [2025-03-04 06:56:26,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:26,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167643539] [2025-03-04 06:56:26,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:26,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:26,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 06:56:26,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 06:56:26,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:26,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:26,162 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:56:26,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:26,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167643539] [2025-03-04 06:56:26,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167643539] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:26,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:26,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:56:26,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580545782] [2025-03-04 06:56:26,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:26,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:56:26,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:26,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:56:26,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:56:26,200 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 407 out of 438 [2025-03-04 06:56:26,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 389 places, 393 transitions, 792 flow. Second operand has 3 states, 3 states have (on average 408.3333333333333) internal successors, (1225), 3 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states 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:56:26,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:26,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 407 of 438 [2025-03-04 06:56:26,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:26,256 INFO L124 PetriNetUnfolderBase]: 26/635 cut-off events. [2025-03-04 06:56:26,256 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-04 06:56:26,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 679 conditions, 635 events. 26/635 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1633 event pairs, 11 based on Foata normal form. 0/531 useless extension candidates. Maximal degree in co-relation 643. Up to 36 conditions per place. [2025-03-04 06:56:26,260 INFO L140 encePairwiseOnDemand]: 435/438 looper letters, 13 selfloop transitions, 2 changer transitions 0/392 dead transitions. [2025-03-04 06:56:26,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 390 places, 392 transitions, 820 flow [2025-03-04 06:56:26,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:56:26,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:56:26,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1237 transitions. [2025-03-04 06:56:26,263 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.941400304414003 [2025-03-04 06:56:26,263 INFO L175 Difference]: Start difference. First operand has 389 places, 393 transitions, 792 flow. Second operand 3 states and 1237 transitions. [2025-03-04 06:56:26,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 390 places, 392 transitions, 820 flow [2025-03-04 06:56:26,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 389 places, 392 transitions, 819 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:56:26,276 INFO L231 Difference]: Finished difference. Result has 389 places, 392 transitions, 793 flow [2025-03-04 06:56:26,276 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=438, PETRI_DIFFERENCE_MINUEND_FLOW=789, PETRI_DIFFERENCE_MINUEND_PLACES=387, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=392, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=390, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=793, PETRI_PLACES=389, PETRI_TRANSITIONS=392} [2025-03-04 06:56:26,277 INFO L279 CegarLoopForPetriNet]: 405 programPoint places, -16 predicate places. [2025-03-04 06:56:26,278 INFO L471 AbstractCegarLoop]: Abstraction has has 389 places, 392 transitions, 793 flow [2025-03-04 06:56:26,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 408.3333333333333) internal successors, (1225), 3 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states 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:56:26,278 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:26,279 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] [2025-03-04 06:56:26,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:56:26,279 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 95 more)] === [2025-03-04 06:56:26,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:26,280 INFO L85 PathProgramCache]: Analyzing trace with hash -218428815, now seen corresponding path program 1 times [2025-03-04 06:56:26,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:26,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465633478] [2025-03-04 06:56:26,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:26,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:26,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 06:56:26,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 06:56:26,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:26,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:26,763 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:56:26,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:26,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465633478] [2025-03-04 06:56:26,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465633478] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:26,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:26,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:56:26,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526152568] [2025-03-04 06:56:26,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:26,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:56:26,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:26,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:56:26,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:56:26,898 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 382 out of 438 [2025-03-04 06:56:26,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 389 places, 392 transitions, 793 flow. Second operand has 6 states, 6 states have (on average 383.5) internal successors, (2301), 6 states have internal predecessors, (2301), 0 states have call successors, (0), 0 states 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:56:26,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:26,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 382 of 438 [2025-03-04 06:56:26,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:27,057 INFO L124 PetriNetUnfolderBase]: 188/1752 cut-off events. [2025-03-04 06:56:27,058 INFO L125 PetriNetUnfolderBase]: For 43/43 co-relation queries the response was YES. [2025-03-04 06:56:27,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2060 conditions, 1752 events. 188/1752 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 8992 event pairs, 104 based on Foata normal form. 0/1456 useless extension candidates. Maximal degree in co-relation 2025. Up to 292 conditions per place. [2025-03-04 06:56:27,067 INFO L140 encePairwiseOnDemand]: 432/438 looper letters, 36 selfloop transitions, 5 changer transitions 0/391 dead transitions. [2025-03-04 06:56:27,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 393 places, 391 transitions, 873 flow [2025-03-04 06:56:27,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:56:27,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:56:27,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2334 transitions. [2025-03-04 06:56:27,071 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8881278538812786 [2025-03-04 06:56:27,071 INFO L175 Difference]: Start difference. First operand has 389 places, 392 transitions, 793 flow. Second operand 6 states and 2334 transitions. [2025-03-04 06:56:27,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 393 places, 391 transitions, 873 flow [2025-03-04 06:56:27,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 391 places, 391 transitions, 869 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:56:27,076 INFO L231 Difference]: Finished difference. Result has 391 places, 391 transitions, 797 flow [2025-03-04 06:56:27,077 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=438, PETRI_DIFFERENCE_MINUEND_FLOW=787, PETRI_DIFFERENCE_MINUEND_PLACES=386, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=391, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=386, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=797, PETRI_PLACES=391, PETRI_TRANSITIONS=391} [2025-03-04 06:56:27,079 INFO L279 CegarLoopForPetriNet]: 405 programPoint places, -14 predicate places. [2025-03-04 06:56:27,079 INFO L471 AbstractCegarLoop]: Abstraction has has 391 places, 391 transitions, 797 flow [2025-03-04 06:56:27,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 383.5) internal successors, (2301), 6 states have internal predecessors, (2301), 0 states have call successors, (0), 0 states 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:56:27,082 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:27,082 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:56:27,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:56:27,083 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 95 more)] === [2025-03-04 06:56:27,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:27,085 INFO L85 PathProgramCache]: Analyzing trace with hash -2117880153, now seen corresponding path program 1 times [2025-03-04 06:56:27,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:27,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925379485] [2025-03-04 06:56:27,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:27,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:27,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-04 06:56:27,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-04 06:56:27,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:27,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:27,127 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:56:27,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:27,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925379485] [2025-03-04 06:56:27,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925379485] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:27,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:27,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:56:27,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981171303] [2025-03-04 06:56:27,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:27,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:56:27,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:27,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:56:27,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:56:27,142 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 410 out of 438 [2025-03-04 06:56:27,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 391 places, 391 transitions, 797 flow. Second operand has 3 states, 3 states have (on average 411.0) internal successors, (1233), 3 states have internal predecessors, (1233), 0 states have call successors, (0), 0 states 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:56:27,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:27,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 410 of 438 [2025-03-04 06:56:27,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:27,235 INFO L124 PetriNetUnfolderBase]: 40/1161 cut-off events. [2025-03-04 06:56:27,235 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 06:56:27,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1207 conditions, 1161 events. 40/1161 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 4706 event pairs, 8 based on Foata normal form. 0/964 useless extension candidates. Maximal degree in co-relation 1189. Up to 32 conditions per place. [2025-03-04 06:56:27,240 INFO L140 encePairwiseOnDemand]: 434/438 looper letters, 10 selfloop transitions, 1 changer transitions 0/388 dead transitions. [2025-03-04 06:56:27,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 390 places, 388 transitions, 813 flow [2025-03-04 06:56:27,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:56:27,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:56:27,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1244 transitions. [2025-03-04 06:56:27,243 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9467275494672754 [2025-03-04 06:56:27,243 INFO L175 Difference]: Start difference. First operand has 391 places, 391 transitions, 797 flow. Second operand 3 states and 1244 transitions. [2025-03-04 06:56:27,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 390 places, 388 transitions, 813 flow [2025-03-04 06:56:27,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 385 places, 388 transitions, 803 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:56:27,248 INFO L231 Difference]: Finished difference. Result has 385 places, 388 transitions, 783 flow [2025-03-04 06:56:27,249 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=438, PETRI_DIFFERENCE_MINUEND_FLOW=781, PETRI_DIFFERENCE_MINUEND_PLACES=383, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=388, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=387, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=783, PETRI_PLACES=385, PETRI_TRANSITIONS=388} [2025-03-04 06:56:27,249 INFO L279 CegarLoopForPetriNet]: 405 programPoint places, -20 predicate places. [2025-03-04 06:56:27,249 INFO L471 AbstractCegarLoop]: Abstraction has has 385 places, 388 transitions, 783 flow [2025-03-04 06:56:27,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 411.0) internal successors, (1233), 3 states have internal predecessors, (1233), 0 states have call successors, (0), 0 states 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:56:27,250 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:27,250 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] [2025-03-04 06:56:27,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 06:56:27,250 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 95 more)] === [2025-03-04 06:56:27,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:27,251 INFO L85 PathProgramCache]: Analyzing trace with hash -113628919, now seen corresponding path program 1 times [2025-03-04 06:56:27,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:27,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694471149] [2025-03-04 06:56:27,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:27,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:27,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-04 06:56:27,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-04 06:56:27,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:27,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:27,301 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:56:27,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:27,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694471149] [2025-03-04 06:56:27,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694471149] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:27,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:27,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:56:27,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249981800] [2025-03-04 06:56:27,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:27,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:56:27,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:27,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:56:27,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:56:27,318 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 407 out of 438 [2025-03-04 06:56:27,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 385 places, 388 transitions, 783 flow. Second operand has 3 states, 3 states have (on average 408.0) internal successors, (1224), 3 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states 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:56:27,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:27,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 407 of 438 [2025-03-04 06:56:27,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:27,379 INFO L124 PetriNetUnfolderBase]: 23/649 cut-off events. [2025-03-04 06:56:27,379 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 06:56:27,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 690 conditions, 649 events. 23/649 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1307 event pairs, 1 based on Foata normal form. 0/556 useless extension candidates. Maximal degree in co-relation 655. Up to 20 conditions per place. [2025-03-04 06:56:27,383 INFO L140 encePairwiseOnDemand]: 431/438 looper letters, 11 selfloop transitions, 3 changer transitions 0/385 dead transitions. [2025-03-04 06:56:27,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 385 transitions, 806 flow [2025-03-04 06:56:27,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:56:27,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:56:27,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1239 transitions. [2025-03-04 06:56:27,386 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9429223744292238 [2025-03-04 06:56:27,386 INFO L175 Difference]: Start difference. First operand has 385 places, 388 transitions, 783 flow. Second operand 3 states and 1239 transitions. [2025-03-04 06:56:27,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 385 transitions, 806 flow [2025-03-04 06:56:27,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 385 transitions, 805 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:56:27,392 INFO L231 Difference]: Finished difference. Result has 382 places, 384 transitions, 780 flow [2025-03-04 06:56:27,393 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=438, PETRI_DIFFERENCE_MINUEND_FLOW=774, PETRI_DIFFERENCE_MINUEND_PLACES=380, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=381, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=780, PETRI_PLACES=382, PETRI_TRANSITIONS=384} [2025-03-04 06:56:27,393 INFO L279 CegarLoopForPetriNet]: 405 programPoint places, -23 predicate places. [2025-03-04 06:56:27,393 INFO L471 AbstractCegarLoop]: Abstraction has has 382 places, 384 transitions, 780 flow [2025-03-04 06:56:27,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 408.0) internal successors, (1224), 3 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states 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:56:27,394 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:27,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] [2025-03-04 06:56:27,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 06:56:27,394 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err34ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 95 more)] === [2025-03-04 06:56:27,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:27,395 INFO L85 PathProgramCache]: Analyzing trace with hash -834669530, now seen corresponding path program 1 times [2025-03-04 06:56:27,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:27,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358764057] [2025-03-04 06:56:27,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:27,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:27,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-04 06:56:27,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-04 06:56:27,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:27,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:27,438 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:56:27,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:27,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358764057] [2025-03-04 06:56:27,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358764057] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:27,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:27,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:56:27,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639124444] [2025-03-04 06:56:27,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:27,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:56:27,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:27,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:56:27,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:56:27,501 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 367 out of 438 [2025-03-04 06:56:27,502 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 384 transitions, 780 flow. Second operand has 3 states, 3 states have (on average 368.3333333333333) internal successors, (1105), 3 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states 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:56:27,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:27,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 367 of 438 [2025-03-04 06:56:27,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:27,567 INFO L124 PetriNetUnfolderBase]: 49/568 cut-off events. [2025-03-04 06:56:27,567 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2025-03-04 06:56:27,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 688 conditions, 568 events. 49/568 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1663 event pairs, 5 based on Foata normal form. 1/516 useless extension candidates. Maximal degree in co-relation 653. Up to 91 conditions per place. [2025-03-04 06:56:27,570 INFO L140 encePairwiseOnDemand]: 411/438 looper letters, 29 selfloop transitions, 10 changer transitions 4/369 dead transitions. [2025-03-04 06:56:27,570 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 369 transitions, 833 flow [2025-03-04 06:56:27,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:56:27,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:56:27,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1158 transitions. [2025-03-04 06:56:27,575 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8812785388127854 [2025-03-04 06:56:27,575 INFO L175 Difference]: Start difference. First operand has 382 places, 384 transitions, 780 flow. Second operand 3 states and 1158 transitions. [2025-03-04 06:56:27,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 369 transitions, 833 flow [2025-03-04 06:56:27,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 369 transitions, 827 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:56:27,580 INFO L231 Difference]: Finished difference. Result has 366 places, 364 transitions, 753 flow [2025-03-04 06:56:27,582 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=438, PETRI_DIFFERENCE_MINUEND_FLOW=742, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=358, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=753, PETRI_PLACES=366, PETRI_TRANSITIONS=364} [2025-03-04 06:56:27,585 INFO L279 CegarLoopForPetriNet]: 405 programPoint places, -39 predicate places. [2025-03-04 06:56:27,585 INFO L471 AbstractCegarLoop]: Abstraction has has 366 places, 364 transitions, 753 flow [2025-03-04 06:56:27,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 368.3333333333333) internal successors, (1105), 3 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states 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:56:27,585 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:27,586 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] [2025-03-04 06:56:27,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 06:56:27,586 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 95 more)] === [2025-03-04 06:56:27,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:27,587 INFO L85 PathProgramCache]: Analyzing trace with hash -293593831, now seen corresponding path program 1 times [2025-03-04 06:56:27,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:27,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749876258] [2025-03-04 06:56:27,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:27,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:27,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-04 06:56:27,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-04 06:56:27,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:27,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:27,638 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:56:27,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:27,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749876258] [2025-03-04 06:56:27,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749876258] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:27,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:27,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:56:27,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963121076] [2025-03-04 06:56:27,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:27,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:56:27,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:27,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:56:27,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:56:27,665 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 401 out of 438 [2025-03-04 06:56:27,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 364 transitions, 753 flow. Second operand has 3 states, 3 states have (on average 402.3333333333333) internal successors, (1207), 3 states have internal predecessors, (1207), 0 states have call successors, (0), 0 states 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:56:27,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:27,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 401 of 438 [2025-03-04 06:56:27,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:27,759 INFO L124 PetriNetUnfolderBase]: 85/1157 cut-off events. [2025-03-04 06:56:27,759 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-03-04 06:56:27,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1315 conditions, 1157 events. 85/1157 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 4614 event pairs, 10 based on Foata normal form. 0/1046 useless extension candidates. Maximal degree in co-relation 1280. Up to 104 conditions per place. [2025-03-04 06:56:27,765 INFO L140 encePairwiseOnDemand]: 430/438 looper letters, 18 selfloop transitions, 2 changer transitions 0/362 dead transitions. [2025-03-04 06:56:27,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 362 transitions, 791 flow [2025-03-04 06:56:27,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:56:27,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:56:27,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1229 transitions. [2025-03-04 06:56:27,768 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9353120243531202 [2025-03-04 06:56:27,768 INFO L175 Difference]: Start difference. First operand has 366 places, 364 transitions, 753 flow. Second operand 3 states and 1229 transitions. [2025-03-04 06:56:27,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 358 places, 362 transitions, 791 flow [2025-03-04 06:56:27,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 362 transitions, 771 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:56:27,775 INFO L231 Difference]: Finished difference. Result has 357 places, 360 transitions, 735 flow [2025-03-04 06:56:27,776 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=438, PETRI_DIFFERENCE_MINUEND_FLOW=721, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=356, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=735, PETRI_PLACES=357, PETRI_TRANSITIONS=360} [2025-03-04 06:56:27,777 INFO L279 CegarLoopForPetriNet]: 405 programPoint places, -48 predicate places. [2025-03-04 06:56:27,777 INFO L471 AbstractCegarLoop]: Abstraction has has 357 places, 360 transitions, 735 flow [2025-03-04 06:56:27,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 402.3333333333333) internal successors, (1207), 3 states have internal predecessors, (1207), 0 states have call successors, (0), 0 states 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:56:27,778 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:27,778 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] [2025-03-04 06:56:27,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 06:56:27,778 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 95 more)] === [2025-03-04 06:56:27,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:27,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1118002173, now seen corresponding path program 1 times [2025-03-04 06:56:27,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:27,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265318238] [2025-03-04 06:56:27,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:27,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:27,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-04 06:56:27,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-04 06:56:27,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:27,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:27,886 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:56:27,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:27,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265318238] [2025-03-04 06:56:27,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265318238] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:27,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:27,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 06:56:27,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834581667] [2025-03-04 06:56:27,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:27,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 06:56:27,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:27,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 06:56:27,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 06:56:27,905 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 413 out of 438 [2025-03-04 06:56:27,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 360 transitions, 735 flow. Second operand has 4 states, 4 states have (on average 414.25) internal successors, (1657), 4 states have internal predecessors, (1657), 0 states have call successors, (0), 0 states 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:56:27,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:27,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 413 of 438 [2025-03-04 06:56:27,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:28,020 INFO L124 PetriNetUnfolderBase]: 49/1348 cut-off events. [2025-03-04 06:56:28,020 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 06:56:28,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1419 conditions, 1348 events. 49/1348 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 5282 event pairs, 3 based on Foata normal form. 0/1216 useless extension candidates. Maximal degree in co-relation 1383. Up to 18 conditions per place. [2025-03-04 06:56:28,027 INFO L140 encePairwiseOnDemand]: 432/438 looper letters, 13 selfloop transitions, 6 changer transitions 0/369 dead transitions. [2025-03-04 06:56:28,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 369 transitions, 795 flow [2025-03-04 06:56:28,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 06:56:28,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 06:56:28,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2085 transitions. [2025-03-04 06:56:28,031 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.952054794520548 [2025-03-04 06:56:28,031 INFO L175 Difference]: Start difference. First operand has 357 places, 360 transitions, 735 flow. Second operand 5 states and 2085 transitions. [2025-03-04 06:56:28,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 361 places, 369 transitions, 795 flow [2025-03-04 06:56:28,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 369 transitions, 795 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:56:28,035 INFO L231 Difference]: Finished difference. Result has 364 places, 364 transitions, 773 flow [2025-03-04 06:56:28,035 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=438, PETRI_DIFFERENCE_MINUEND_FLOW=735, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=360, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=355, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=773, PETRI_PLACES=364, PETRI_TRANSITIONS=364} [2025-03-04 06:56:28,036 INFO L279 CegarLoopForPetriNet]: 405 programPoint places, -41 predicate places. [2025-03-04 06:56:28,036 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 364 transitions, 773 flow [2025-03-04 06:56:28,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 414.25) internal successors, (1657), 4 states have internal predecessors, (1657), 0 states have call successors, (0), 0 states 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:56:28,037 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:28,037 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] [2025-03-04 06:56:28,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 06:56:28,037 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 95 more)] === [2025-03-04 06:56:28,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:28,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1872118129, now seen corresponding path program 1 times [2025-03-04 06:56:28,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:28,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488579112] [2025-03-04 06:56:28,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:28,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:28,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-04 06:56:28,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-04 06:56:28,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:28,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:28,359 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:56:28,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:28,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488579112] [2025-03-04 06:56:28,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488579112] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:28,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:28,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:56:28,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217454145] [2025-03-04 06:56:28,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:28,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:56:28,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:28,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:56:28,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:56:28,657 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 406 out of 438 [2025-03-04 06:56:28,659 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 364 transitions, 773 flow. Second operand has 6 states, 6 states have (on average 407.5) internal successors, (2445), 6 states have internal predecessors, (2445), 0 states have call successors, (0), 0 states 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:56:28,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:28,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 406 of 438 [2025-03-04 06:56:28,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:28,781 INFO L124 PetriNetUnfolderBase]: 42/1051 cut-off events. [2025-03-04 06:56:28,781 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2025-03-04 06:56:28,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1149 conditions, 1051 events. 42/1051 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3382 event pairs, 2 based on Foata normal form. 0/956 useless extension candidates. Maximal degree in co-relation 1107. Up to 17 conditions per place. [2025-03-04 06:56:28,789 INFO L140 encePairwiseOnDemand]: 432/438 looper letters, 15 selfloop transitions, 6 changer transitions 0/367 dead transitions. [2025-03-04 06:56:28,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 367 transitions, 825 flow [2025-03-04 06:56:28,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:56:28,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:56:28,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2457 transitions. [2025-03-04 06:56:28,793 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.934931506849315 [2025-03-04 06:56:28,793 INFO L175 Difference]: Start difference. First operand has 364 places, 364 transitions, 773 flow. Second operand 6 states and 2457 transitions. [2025-03-04 06:56:28,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 367 transitions, 825 flow [2025-03-04 06:56:28,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 367 transitions, 825 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:56:28,799 INFO L231 Difference]: Finished difference. Result has 368 places, 363 transitions, 783 flow [2025-03-04 06:56:28,799 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=438, PETRI_DIFFERENCE_MINUEND_FLOW=771, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=363, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=357, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=783, PETRI_PLACES=368, PETRI_TRANSITIONS=363} [2025-03-04 06:56:28,800 INFO L279 CegarLoopForPetriNet]: 405 programPoint places, -37 predicate places. [2025-03-04 06:56:28,800 INFO L471 AbstractCegarLoop]: Abstraction has has 368 places, 363 transitions, 783 flow [2025-03-04 06:56:28,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 407.5) internal successors, (2445), 6 states have internal predecessors, (2445), 0 states have call successors, (0), 0 states 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:56:28,801 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:28,801 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] [2025-03-04 06:56:28,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 06:56:28,801 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err29ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 95 more)] === [2025-03-04 06:56:28,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:28,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1663326231, now seen corresponding path program 1 times [2025-03-04 06:56:28,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:28,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976364671] [2025-03-04 06:56:28,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:28,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:28,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-04 06:56:28,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-04 06:56:28,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:28,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:28,884 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:56:28,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:28,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976364671] [2025-03-04 06:56:28,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976364671] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:28,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:28,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 06:56:28,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878735956] [2025-03-04 06:56:28,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:28,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 06:56:28,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:28,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 06:56:28,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 06:56:28,958 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 409 out of 438 [2025-03-04 06:56:28,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 363 transitions, 783 flow. Second operand has 4 states, 4 states have (on average 410.5) internal successors, (1642), 4 states have internal predecessors, (1642), 0 states have call successors, (0), 0 states 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:56:28,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:28,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 409 of 438 [2025-03-04 06:56:28,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:29,088 INFO L124 PetriNetUnfolderBase]: 63/1321 cut-off events. [2025-03-04 06:56:29,089 INFO L125 PetriNetUnfolderBase]: For 36/37 co-relation queries the response was YES. [2025-03-04 06:56:29,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1472 conditions, 1321 events. 63/1321 cut-off events. For 36/37 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 5807 event pairs, 6 based on Foata normal form. 0/1198 useless extension candidates. Maximal degree in co-relation 1430. Up to 67 conditions per place. [2025-03-04 06:56:29,095 INFO L140 encePairwiseOnDemand]: 432/438 looper letters, 16 selfloop transitions, 6 changer transitions 0/371 dead transitions. [2025-03-04 06:56:29,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 371 transitions, 846 flow [2025-03-04 06:56:29,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 06:56:29,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 06:56:29,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2068 transitions. [2025-03-04 06:56:29,098 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9442922374429223 [2025-03-04 06:56:29,098 INFO L175 Difference]: Start difference. First operand has 368 places, 363 transitions, 783 flow. Second operand 5 states and 2068 transitions. [2025-03-04 06:56:29,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 371 transitions, 846 flow [2025-03-04 06:56:29,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 367 places, 371 transitions, 834 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:56:29,104 INFO L231 Difference]: Finished difference. Result has 370 places, 367 transitions, 809 flow [2025-03-04 06:56:29,104 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=438, PETRI_DIFFERENCE_MINUEND_FLOW=771, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=363, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=358, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=809, PETRI_PLACES=370, PETRI_TRANSITIONS=367} [2025-03-04 06:56:29,105 INFO L279 CegarLoopForPetriNet]: 405 programPoint places, -35 predicate places. [2025-03-04 06:56:29,105 INFO L471 AbstractCegarLoop]: Abstraction has has 370 places, 367 transitions, 809 flow [2025-03-04 06:56:29,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 410.5) internal successors, (1642), 4 states have internal predecessors, (1642), 0 states have call successors, (0), 0 states 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:56:29,106 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:29,106 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] [2025-03-04 06:56:29,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 06:56:29,107 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 95 more)] === [2025-03-04 06:56:29,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:29,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1294239407, now seen corresponding path program 1 times [2025-03-04 06:56:29,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:29,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630217790] [2025-03-04 06:56:29,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:29,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:29,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-04 06:56:29,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 06:56:29,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:29,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:29,149 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:56:29,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:29,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630217790] [2025-03-04 06:56:29,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630217790] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:29,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:29,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:56:29,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040693219] [2025-03-04 06:56:29,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:29,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:56:29,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:29,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:56:29,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:56:29,169 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 438 [2025-03-04 06:56:29,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 367 transitions, 809 flow. Second operand has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states 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:56:29,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:29,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 438 [2025-03-04 06:56:29,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:29,310 INFO L124 PetriNetUnfolderBase]: 57/1684 cut-off events. [2025-03-04 06:56:29,310 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2025-03-04 06:56:29,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1869 conditions, 1684 events. 57/1684 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 7671 event pairs, 10 based on Foata normal form. 0/1538 useless extension candidates. Maximal degree in co-relation 1824. Up to 34 conditions per place. [2025-03-04 06:56:29,319 INFO L140 encePairwiseOnDemand]: 435/438 looper letters, 9 selfloop transitions, 2 changer transitions 0/367 dead transitions. [2025-03-04 06:56:29,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 367 transitions, 832 flow [2025-03-04 06:56:29,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:56:29,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:56:29,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1245 transitions. [2025-03-04 06:56:29,321 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9474885844748858 [2025-03-04 06:56:29,321 INFO L175 Difference]: Start difference. First operand has 370 places, 367 transitions, 809 flow. Second operand 3 states and 1245 transitions. [2025-03-04 06:56:29,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 367 transitions, 832 flow [2025-03-04 06:56:29,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 367 transitions, 832 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:56:29,327 INFO L231 Difference]: Finished difference. Result has 371 places, 366 transitions, 811 flow [2025-03-04 06:56:29,328 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=438, PETRI_DIFFERENCE_MINUEND_FLOW=807, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=364, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=811, PETRI_PLACES=371, PETRI_TRANSITIONS=366} [2025-03-04 06:56:29,329 INFO L279 CegarLoopForPetriNet]: 405 programPoint places, -34 predicate places. [2025-03-04 06:56:29,329 INFO L471 AbstractCegarLoop]: Abstraction has has 371 places, 366 transitions, 811 flow [2025-03-04 06:56:29,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states 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:56:29,329 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:29,330 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] [2025-03-04 06:56:29,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 06:56:29,330 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err29ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 95 more)] === [2025-03-04 06:56:29,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:29,331 INFO L85 PathProgramCache]: Analyzing trace with hash -190503636, now seen corresponding path program 1 times [2025-03-04 06:56:29,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:29,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847199428] [2025-03-04 06:56:29,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:29,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:29,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-04 06:56:29,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 06:56:29,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:29,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:29,613 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:56:29,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:29,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847199428] [2025-03-04 06:56:29,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847199428] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:29,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:29,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:56:29,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367891001] [2025-03-04 06:56:29,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:29,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:56:29,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:29,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:56:29,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:56:29,865 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 378 out of 438 [2025-03-04 06:56:29,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 366 transitions, 811 flow. Second operand has 6 states, 6 states have (on average 379.6666666666667) internal successors, (2278), 6 states have internal predecessors, (2278), 0 states have call successors, (0), 0 states 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:56:29,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:29,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 378 of 438 [2025-03-04 06:56:29,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:29,990 INFO L124 PetriNetUnfolderBase]: 102/1146 cut-off events. [2025-03-04 06:56:29,990 INFO L125 PetriNetUnfolderBase]: For 91/92 co-relation queries the response was YES. [2025-03-04 06:56:29,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1495 conditions, 1146 events. 102/1146 cut-off events. For 91/92 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 5702 event pairs, 12 based on Foata normal form. 0/1071 useless extension candidates. Maximal degree in co-relation 1447. Up to 84 conditions per place. [2025-03-04 06:56:29,996 INFO L140 encePairwiseOnDemand]: 408/438 looper letters, 19 selfloop transitions, 26 changer transitions 0/365 dead transitions. [2025-03-04 06:56:29,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 365 transitions, 903 flow [2025-03-04 06:56:29,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:56:29,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:56:29,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2317 transitions. [2025-03-04 06:56:30,000 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8816590563165906 [2025-03-04 06:56:30,000 INFO L175 Difference]: Start difference. First operand has 371 places, 366 transitions, 811 flow. Second operand 6 states and 2317 transitions. [2025-03-04 06:56:30,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 365 transitions, 903 flow [2025-03-04 06:56:30,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 365 transitions, 899 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:56:30,004 INFO L231 Difference]: Finished difference. Result has 369 places, 361 transitions, 849 flow [2025-03-04 06:56:30,005 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=438, PETRI_DIFFERENCE_MINUEND_FLOW=797, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=335, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=849, PETRI_PLACES=369, PETRI_TRANSITIONS=361} [2025-03-04 06:56:30,005 INFO L279 CegarLoopForPetriNet]: 405 programPoint places, -36 predicate places. [2025-03-04 06:56:30,005 INFO L471 AbstractCegarLoop]: Abstraction has has 369 places, 361 transitions, 849 flow [2025-03-04 06:56:30,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 379.6666666666667) internal successors, (2278), 6 states have internal predecessors, (2278), 0 states have call successors, (0), 0 states 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:56:30,006 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:30,006 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] [2025-03-04 06:56:30,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 06:56:30,007 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err28ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 95 more)] === [2025-03-04 06:56:30,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:30,007 INFO L85 PathProgramCache]: Analyzing trace with hash 665984814, now seen corresponding path program 1 times [2025-03-04 06:56:30,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:30,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7439791] [2025-03-04 06:56:30,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:30,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:30,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-04 06:56:30,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-04 06:56:30,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:30,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:30,039 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:56:30,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:30,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7439791] [2025-03-04 06:56:30,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7439791] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:30,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:30,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:56:30,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501584767] [2025-03-04 06:56:30,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:30,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:56:30,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:30,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:56:30,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:56:30,101 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 395 out of 438 [2025-03-04 06:56:30,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 361 transitions, 849 flow. Second operand has 3 states, 3 states have (on average 397.6666666666667) internal successors, (1193), 3 states have internal predecessors, (1193), 0 states have call successors, (0), 0 states 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:56:30,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:30,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 395 of 438 [2025-03-04 06:56:30,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:30,214 INFO L124 PetriNetUnfolderBase]: 89/1309 cut-off events. [2025-03-04 06:56:30,214 INFO L125 PetriNetUnfolderBase]: For 86/87 co-relation queries the response was YES. [2025-03-04 06:56:30,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1733 conditions, 1309 events. 89/1309 cut-off events. For 86/87 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 6381 event pairs, 50 based on Foata normal form. 0/1227 useless extension candidates. Maximal degree in co-relation 1687. Up to 170 conditions per place. [2025-03-04 06:56:30,220 INFO L140 encePairwiseOnDemand]: 435/438 looper letters, 25 selfloop transitions, 2 changer transitions 0/361 dead transitions. [2025-03-04 06:56:30,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 361 transitions, 904 flow [2025-03-04 06:56:30,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:56:30,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:56:30,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1213 transitions. [2025-03-04 06:56:30,223 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9231354642313546 [2025-03-04 06:56:30,223 INFO L175 Difference]: Start difference. First operand has 369 places, 361 transitions, 849 flow. Second operand 3 states and 1213 transitions. [2025-03-04 06:56:30,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 361 transitions, 904 flow [2025-03-04 06:56:30,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 361 transitions, 852 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:56:30,227 INFO L231 Difference]: Finished difference. Result has 365 places, 360 transitions, 799 flow [2025-03-04 06:56:30,228 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=438, PETRI_DIFFERENCE_MINUEND_FLOW=795, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=360, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=358, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=799, PETRI_PLACES=365, PETRI_TRANSITIONS=360} [2025-03-04 06:56:30,228 INFO L279 CegarLoopForPetriNet]: 405 programPoint places, -40 predicate places. [2025-03-04 06:56:30,228 INFO L471 AbstractCegarLoop]: Abstraction has has 365 places, 360 transitions, 799 flow [2025-03-04 06:56:30,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 397.6666666666667) internal successors, (1193), 3 states have internal predecessors, (1193), 0 states have call successors, (0), 0 states 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:56:30,228 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:30,228 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:56:30,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 06:56:30,229 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err21ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 95 more)] === [2025-03-04 06:56:30,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:30,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1047032510, now seen corresponding path program 1 times [2025-03-04 06:56:30,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:30,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844191593] [2025-03-04 06:56:30,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:30,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:30,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-04 06:56:30,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-04 06:56:30,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:30,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:30,277 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:56:30,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:30,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844191593] [2025-03-04 06:56:30,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844191593] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:30,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:30,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:56:30,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452481053] [2025-03-04 06:56:30,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:30,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:56:30,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:30,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:56:30,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:56:30,348 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 395 out of 438 [2025-03-04 06:56:30,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 360 transitions, 799 flow. Second operand has 3 states, 3 states have (on average 398.6666666666667) internal successors, (1196), 3 states have internal predecessors, (1196), 0 states have call successors, (0), 0 states 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:56:30,349 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:30,349 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 395 of 438 [2025-03-04 06:56:30,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:30,462 INFO L124 PetriNetUnfolderBase]: 88/1272 cut-off events. [2025-03-04 06:56:30,463 INFO L125 PetriNetUnfolderBase]: For 79/80 co-relation queries the response was YES. [2025-03-04 06:56:30,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1561 conditions, 1272 events. 88/1272 cut-off events. For 79/80 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 6154 event pairs, 50 based on Foata normal form. 0/1196 useless extension candidates. Maximal degree in co-relation 1515. Up to 170 conditions per place. [2025-03-04 06:56:30,473 INFO L140 encePairwiseOnDemand]: 435/438 looper letters, 25 selfloop transitions, 2 changer transitions 0/360 dead transitions. [2025-03-04 06:56:30,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 360 transitions, 854 flow [2025-03-04 06:56:30,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:56:30,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:56:30,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1213 transitions. [2025-03-04 06:56:30,475 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9231354642313546 [2025-03-04 06:56:30,475 INFO L175 Difference]: Start difference. First operand has 365 places, 360 transitions, 799 flow. Second operand 3 states and 1213 transitions. [2025-03-04 06:56:30,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 360 transitions, 854 flow [2025-03-04 06:56:30,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 360 transitions, 850 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:56:30,480 INFO L231 Difference]: Finished difference. Result has 364 places, 359 transitions, 797 flow [2025-03-04 06:56:30,480 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=438, PETRI_DIFFERENCE_MINUEND_FLOW=793, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=359, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=357, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=797, PETRI_PLACES=364, PETRI_TRANSITIONS=359} [2025-03-04 06:56:30,481 INFO L279 CegarLoopForPetriNet]: 405 programPoint places, -41 predicate places. [2025-03-04 06:56:30,481 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 359 transitions, 797 flow [2025-03-04 06:56:30,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 398.6666666666667) internal successors, (1196), 3 states have internal predecessors, (1196), 0 states have call successors, (0), 0 states 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:56:30,482 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:30,482 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] [2025-03-04 06:56:30,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 06:56:30,482 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 95 more)] === [2025-03-04 06:56:30,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:30,483 INFO L85 PathProgramCache]: Analyzing trace with hash 72699062, now seen corresponding path program 1 times [2025-03-04 06:56:30,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:30,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784271623] [2025-03-04 06:56:30,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:30,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:30,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-04 06:56:30,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-04 06:56:30,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:30,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:30,536 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:56:30,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:30,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784271623] [2025-03-04 06:56:30,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784271623] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:30,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:30,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:56:30,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22356000] [2025-03-04 06:56:30,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:30,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:56:30,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:30,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:56:30,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:56:30,603 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 395 out of 438 [2025-03-04 06:56:30,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 359 transitions, 797 flow. Second operand has 3 states, 3 states have (on average 399.6666666666667) internal successors, (1199), 3 states have internal predecessors, (1199), 0 states have call successors, (0), 0 states 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:56:30,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:30,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 395 of 438 [2025-03-04 06:56:30,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:30,708 INFO L124 PetriNetUnfolderBase]: 87/1234 cut-off events. [2025-03-04 06:56:30,708 INFO L125 PetriNetUnfolderBase]: For 78/79 co-relation queries the response was YES. [2025-03-04 06:56:30,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1522 conditions, 1234 events. 87/1234 cut-off events. For 78/79 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 5834 event pairs, 50 based on Foata normal form. 0/1164 useless extension candidates. Maximal degree in co-relation 1476. Up to 170 conditions per place. [2025-03-04 06:56:30,716 INFO L140 encePairwiseOnDemand]: 435/438 looper letters, 25 selfloop transitions, 2 changer transitions 0/359 dead transitions. [2025-03-04 06:56:30,716 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 359 transitions, 852 flow [2025-03-04 06:56:30,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:56:30,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:56:30,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1213 transitions. [2025-03-04 06:56:30,719 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9231354642313546 [2025-03-04 06:56:30,719 INFO L175 Difference]: Start difference. First operand has 364 places, 359 transitions, 797 flow. Second operand 3 states and 1213 transitions. [2025-03-04 06:56:30,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 359 transitions, 852 flow [2025-03-04 06:56:30,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 359 transitions, 848 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:56:30,723 INFO L231 Difference]: Finished difference. Result has 363 places, 358 transitions, 795 flow [2025-03-04 06:56:30,724 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=438, PETRI_DIFFERENCE_MINUEND_FLOW=791, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=356, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=795, PETRI_PLACES=363, PETRI_TRANSITIONS=358} [2025-03-04 06:56:30,724 INFO L279 CegarLoopForPetriNet]: 405 programPoint places, -42 predicate places. [2025-03-04 06:56:30,724 INFO L471 AbstractCegarLoop]: Abstraction has has 363 places, 358 transitions, 795 flow [2025-03-04 06:56:30,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 399.6666666666667) internal successors, (1199), 3 states have internal predecessors, (1199), 0 states have call successors, (0), 0 states 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:56:30,726 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:30,726 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] [2025-03-04 06:56:30,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 06:56:30,726 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 95 more)] === [2025-03-04 06:56:30,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:30,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1687336330, now seen corresponding path program 1 times [2025-03-04 06:56:30,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:30,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872810032] [2025-03-04 06:56:30,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:30,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:30,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-04 06:56:30,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-04 06:56:30,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:30,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:30,787 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:56:30,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:30,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872810032] [2025-03-04 06:56:30,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872810032] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:30,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:30,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:56:30,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624124543] [2025-03-04 06:56:30,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:30,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:56:30,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:30,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:56:30,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:56:30,853 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 395 out of 438 [2025-03-04 06:56:30,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 358 transitions, 795 flow. Second operand has 3 states, 3 states have (on average 400.6666666666667) internal successors, (1202), 3 states have internal predecessors, (1202), 0 states have call successors, (0), 0 states 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:56:30,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:30,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 395 of 438 [2025-03-04 06:56:30,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:30,991 INFO L124 PetriNetUnfolderBase]: 86/1196 cut-off events. [2025-03-04 06:56:30,991 INFO L125 PetriNetUnfolderBase]: For 78/79 co-relation queries the response was YES. [2025-03-04 06:56:30,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1484 conditions, 1196 events. 86/1196 cut-off events. For 78/79 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 5622 event pairs, 50 based on Foata normal form. 0/1132 useless extension candidates. Maximal degree in co-relation 1438. Up to 170 conditions per place. [2025-03-04 06:56:30,998 INFO L140 encePairwiseOnDemand]: 435/438 looper letters, 25 selfloop transitions, 2 changer transitions 0/358 dead transitions. [2025-03-04 06:56:30,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 358 transitions, 850 flow [2025-03-04 06:56:30,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:56:30,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:56:31,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1213 transitions. [2025-03-04 06:56:31,001 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9231354642313546 [2025-03-04 06:56:31,001 INFO L175 Difference]: Start difference. First operand has 363 places, 358 transitions, 795 flow. Second operand 3 states and 1213 transitions. [2025-03-04 06:56:31,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 358 transitions, 850 flow [2025-03-04 06:56:31,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 358 transitions, 846 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:56:31,005 INFO L231 Difference]: Finished difference. Result has 362 places, 357 transitions, 793 flow [2025-03-04 06:56:31,005 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=438, PETRI_DIFFERENCE_MINUEND_FLOW=789, PETRI_DIFFERENCE_MINUEND_PLACES=360, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=355, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=793, PETRI_PLACES=362, PETRI_TRANSITIONS=357} [2025-03-04 06:56:31,006 INFO L279 CegarLoopForPetriNet]: 405 programPoint places, -43 predicate places. [2025-03-04 06:56:31,006 INFO L471 AbstractCegarLoop]: Abstraction has has 362 places, 357 transitions, 793 flow [2025-03-04 06:56:31,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 400.6666666666667) internal successors, (1202), 3 states have internal predecessors, (1202), 0 states have call successors, (0), 0 states 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:56:31,006 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:31,007 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:56:31,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 06:56:31,007 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 95 more)] === [2025-03-04 06:56:31,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:31,009 INFO L85 PathProgramCache]: Analyzing trace with hash -41082946, now seen corresponding path program 1 times [2025-03-04 06:56:31,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:31,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405592577] [2025-03-04 06:56:31,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:31,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:31,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 245 statements into 1 equivalence classes. [2025-03-04 06:56:31,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 245 of 245 statements. [2025-03-04 06:56:31,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:31,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:31,085 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:56:31,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:31,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405592577] [2025-03-04 06:56:31,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405592577] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:31,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:31,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:56:31,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027730281] [2025-03-04 06:56:31,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:31,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:56:31,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:31,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:56:31,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:56:31,152 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 395 out of 438 [2025-03-04 06:56:31,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 357 transitions, 793 flow. Second operand has 3 states, 3 states have (on average 401.6666666666667) internal successors, (1205), 3 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states 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:56:31,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:31,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 395 of 438 [2025-03-04 06:56:31,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:31,243 INFO L124 PetriNetUnfolderBase]: 85/1158 cut-off events. [2025-03-04 06:56:31,244 INFO L125 PetriNetUnfolderBase]: For 78/79 co-relation queries the response was YES. [2025-03-04 06:56:31,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1446 conditions, 1158 events. 85/1158 cut-off events. For 78/79 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 5406 event pairs, 50 based on Foata normal form. 0/1100 useless extension candidates. Maximal degree in co-relation 1400. Up to 170 conditions per place. [2025-03-04 06:56:31,248 INFO L140 encePairwiseOnDemand]: 435/438 looper letters, 0 selfloop transitions, 0 changer transitions 357/357 dead transitions. [2025-03-04 06:56:31,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 357 transitions, 848 flow [2025-03-04 06:56:31,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:56:31,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:56:31,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1213 transitions. [2025-03-04 06:56:31,251 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9231354642313546 [2025-03-04 06:56:31,251 INFO L175 Difference]: Start difference. First operand has 362 places, 357 transitions, 793 flow. Second operand 3 states and 1213 transitions. [2025-03-04 06:56:31,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 357 transitions, 848 flow [2025-03-04 06:56:31,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 357 transitions, 844 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:56:31,253 INFO L231 Difference]: Finished difference. Result has 361 places, 0 transitions, 0 flow [2025-03-04 06:56:31,253 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=438, PETRI_DIFFERENCE_MINUEND_FLOW=787, PETRI_DIFFERENCE_MINUEND_PLACES=359, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=356, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=361, PETRI_TRANSITIONS=0} [2025-03-04 06:56:31,254 INFO L279 CegarLoopForPetriNet]: 405 programPoint places, -44 predicate places. [2025-03-04 06:56:31,254 INFO L471 AbstractCegarLoop]: Abstraction has has 361 places, 0 transitions, 0 flow [2025-03-04 06:56:31,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 401.6666666666667) internal successors, (1205), 3 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states 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:56:31,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (98 of 99 remaining) [2025-03-04 06:56:31,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (97 of 99 remaining) [2025-03-04 06:56:31,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (96 of 99 remaining) [2025-03-04 06:56:31,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (95 of 99 remaining) [2025-03-04 06:56:31,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (94 of 99 remaining) [2025-03-04 06:56:31,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (93 of 99 remaining) [2025-03-04 06:56:31,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (92 of 99 remaining) [2025-03-04 06:56:31,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (91 of 99 remaining) [2025-03-04 06:56:31,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err35ASSERT_VIOLATIONDATA_RACE (90 of 99 remaining) [2025-03-04 06:56:31,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err34ASSERT_VIOLATIONDATA_RACE (89 of 99 remaining) [2025-03-04 06:56:31,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err33ASSERT_VIOLATIONDATA_RACE (88 of 99 remaining) [2025-03-04 06:56:31,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err32ASSERT_VIOLATIONDATA_RACE (87 of 99 remaining) [2025-03-04 06:56:31,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err31ASSERT_VIOLATIONDATA_RACE (86 of 99 remaining) [2025-03-04 06:56:31,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err30ASSERT_VIOLATIONDATA_RACE (85 of 99 remaining) [2025-03-04 06:56:31,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err29ASSERT_VIOLATIONDATA_RACE (84 of 99 remaining) [2025-03-04 06:56:31,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err28ASSERT_VIOLATIONDATA_RACE (83 of 99 remaining) [2025-03-04 06:56:31,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err27ASSERT_VIOLATIONDATA_RACE (82 of 99 remaining) [2025-03-04 06:56:31,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err26ASSERT_VIOLATIONDATA_RACE (81 of 99 remaining) [2025-03-04 06:56:31,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err25ASSERT_VIOLATIONDATA_RACE (80 of 99 remaining) [2025-03-04 06:56:31,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err24ASSERT_VIOLATIONDATA_RACE (79 of 99 remaining) [2025-03-04 06:56:31,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (78 of 99 remaining) [2025-03-04 06:56:31,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (77 of 99 remaining) [2025-03-04 06:56:31,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (76 of 99 remaining) [2025-03-04 06:56:31,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (75 of 99 remaining) [2025-03-04 06:56:31,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (74 of 99 remaining) [2025-03-04 06:56:31,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (73 of 99 remaining) [2025-03-04 06:56:31,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (72 of 99 remaining) [2025-03-04 06:56:31,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (71 of 99 remaining) [2025-03-04 06:56:31,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (70 of 99 remaining) [2025-03-04 06:56:31,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (69 of 99 remaining) [2025-03-04 06:56:31,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (68 of 99 remaining) [2025-03-04 06:56:31,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (67 of 99 remaining) [2025-03-04 06:56:31,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (66 of 99 remaining) [2025-03-04 06:56:31,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (65 of 99 remaining) [2025-03-04 06:56:31,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (64 of 99 remaining) [2025-03-04 06:56:31,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (63 of 99 remaining) [2025-03-04 06:56:31,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (62 of 99 remaining) [2025-03-04 06:56:31,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (61 of 99 remaining) [2025-03-04 06:56:31,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (60 of 99 remaining) [2025-03-04 06:56:31,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (59 of 99 remaining) [2025-03-04 06:56:31,259 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (58 of 99 remaining) [2025-03-04 06:56:31,259 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (57 of 99 remaining) [2025-03-04 06:56:31,259 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (56 of 99 remaining) [2025-03-04 06:56:31,259 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (55 of 99 remaining) [2025-03-04 06:56:31,259 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (54 of 99 remaining) [2025-03-04 06:56:31,259 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (53 of 99 remaining) [2025-03-04 06:56:31,259 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (52 of 99 remaining) [2025-03-04 06:56:31,259 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (51 of 99 remaining) [2025-03-04 06:56:31,259 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (50 of 99 remaining) [2025-03-04 06:56:31,259 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (49 of 99 remaining) [2025-03-04 06:56:31,259 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (48 of 99 remaining) [2025-03-04 06:56:31,259 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (47 of 99 remaining) [2025-03-04 06:56:31,259 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (46 of 99 remaining) [2025-03-04 06:56:31,259 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (45 of 99 remaining) [2025-03-04 06:56:31,259 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (44 of 99 remaining) [2025-03-04 06:56:31,259 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (43 of 99 remaining) [2025-03-04 06:56:31,259 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (42 of 99 remaining) [2025-03-04 06:56:31,259 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (41 of 99 remaining) [2025-03-04 06:56:31,259 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (40 of 99 remaining) [2025-03-04 06:56:31,259 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (39 of 99 remaining) [2025-03-04 06:56:31,259 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (38 of 99 remaining) [2025-03-04 06:56:31,259 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (37 of 99 remaining) [2025-03-04 06:56:31,259 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (36 of 99 remaining) [2025-03-04 06:56:31,259 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err35ASSERT_VIOLATIONDATA_RACE (35 of 99 remaining) [2025-03-04 06:56:31,259 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err34ASSERT_VIOLATIONDATA_RACE (34 of 99 remaining) [2025-03-04 06:56:31,259 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err33ASSERT_VIOLATIONDATA_RACE (33 of 99 remaining) [2025-03-04 06:56:31,259 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err32ASSERT_VIOLATIONDATA_RACE (32 of 99 remaining) [2025-03-04 06:56:31,259 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err31ASSERT_VIOLATIONDATA_RACE (31 of 99 remaining) [2025-03-04 06:56:31,259 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err30ASSERT_VIOLATIONDATA_RACE (30 of 99 remaining) [2025-03-04 06:56:31,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err29ASSERT_VIOLATIONDATA_RACE (29 of 99 remaining) [2025-03-04 06:56:31,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err28ASSERT_VIOLATIONDATA_RACE (28 of 99 remaining) [2025-03-04 06:56:31,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err27ASSERT_VIOLATIONDATA_RACE (27 of 99 remaining) [2025-03-04 06:56:31,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err26ASSERT_VIOLATIONDATA_RACE (26 of 99 remaining) [2025-03-04 06:56:31,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err25ASSERT_VIOLATIONDATA_RACE (25 of 99 remaining) [2025-03-04 06:56:31,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err24ASSERT_VIOLATIONDATA_RACE (24 of 99 remaining) [2025-03-04 06:56:31,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (23 of 99 remaining) [2025-03-04 06:56:31,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (22 of 99 remaining) [2025-03-04 06:56:31,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (21 of 99 remaining) [2025-03-04 06:56:31,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (20 of 99 remaining) [2025-03-04 06:56:31,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (19 of 99 remaining) [2025-03-04 06:56:31,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (18 of 99 remaining) [2025-03-04 06:56:31,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (17 of 99 remaining) [2025-03-04 06:56:31,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (16 of 99 remaining) [2025-03-04 06:56:31,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (15 of 99 remaining) [2025-03-04 06:56:31,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (14 of 99 remaining) [2025-03-04 06:56:31,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (13 of 99 remaining) [2025-03-04 06:56:31,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (12 of 99 remaining) [2025-03-04 06:56:31,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (11 of 99 remaining) [2025-03-04 06:56:31,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (10 of 99 remaining) [2025-03-04 06:56:31,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (9 of 99 remaining) [2025-03-04 06:56:31,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (8 of 99 remaining) [2025-03-04 06:56:31,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (7 of 99 remaining) [2025-03-04 06:56:31,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (6 of 99 remaining) [2025-03-04 06:56:31,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (5 of 99 remaining) [2025-03-04 06:56:31,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (4 of 99 remaining) [2025-03-04 06:56:31,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (3 of 99 remaining) [2025-03-04 06:56:31,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (2 of 99 remaining) [2025-03-04 06:56:31,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (1 of 99 remaining) [2025-03-04 06:56:31,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (0 of 99 remaining) [2025-03-04 06:56:31,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 06:56:31,261 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:56:31,265 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 06:56:31,265 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 06:56:31,269 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 06:56:31 BasicIcfg [2025-03-04 06:56:31,269 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 06:56:31,270 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 06:56:31,270 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 06:56:31,270 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 06:56:31,272 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:56:24" (3/4) ... [2025-03-04 06:56:31,273 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 06:56:31,275 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-04 06:56:31,275 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-04 06:56:31,279 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2025-03-04 06:56:31,279 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-04 06:56:31,279 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 06:56:31,280 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 06:56:31,346 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 06:56:31,346 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 06:56:31,346 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 06:56:31,347 INFO L158 Benchmark]: Toolchain (without parser) took 7365.69ms. Allocated memory was 167.8MB in the beginning and 327.2MB in the end (delta: 159.4MB). Free memory was 122.1MB in the beginning and 119.1MB in the end (delta: 2.9MB). Peak memory consumption was 160.0MB. Max. memory is 16.1GB. [2025-03-04 06:56:31,347 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 201.3MB. Free memory is still 120.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 06:56:31,347 INFO L158 Benchmark]: CACSL2BoogieTranslator took 242.80ms. Allocated memory is still 167.8MB. Free memory was 121.6MB in the beginning and 109.0MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 06:56:31,347 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.71ms. Allocated memory is still 167.8MB. Free memory was 109.0MB in the beginning and 106.2MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 06:56:31,347 INFO L158 Benchmark]: Boogie Preprocessor took 36.54ms. Allocated memory is still 167.8MB. Free memory was 106.2MB in the beginning and 104.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 06:56:31,347 INFO L158 Benchmark]: IcfgBuilder took 613.67ms. Allocated memory is still 167.8MB. Free memory was 104.4MB in the beginning and 72.7MB in the end (delta: 31.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-04 06:56:31,348 INFO L158 Benchmark]: TraceAbstraction took 6345.26ms. Allocated memory was 167.8MB in the beginning and 327.2MB in the end (delta: 159.4MB). Free memory was 72.3MB in the beginning and 125.2MB in the end (delta: -52.9MB). Peak memory consumption was 101.3MB. Max. memory is 16.1GB. [2025-03-04 06:56:31,348 INFO L158 Benchmark]: Witness Printer took 76.36ms. Allocated memory is still 327.2MB. Free memory was 125.2MB in the beginning and 119.1MB in the end (delta: 6.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 06:56:31,349 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.28ms. Allocated memory is still 201.3MB. Free memory is still 120.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 242.80ms. Allocated memory is still 167.8MB. Free memory was 121.6MB in the beginning and 109.0MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.71ms. Allocated memory is still 167.8MB. Free memory was 109.0MB in the beginning and 106.2MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.54ms. Allocated memory is still 167.8MB. Free memory was 106.2MB in the beginning and 104.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 613.67ms. Allocated memory is still 167.8MB. Free memory was 104.4MB in the beginning and 72.7MB in the end (delta: 31.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 6345.26ms. Allocated memory was 167.8MB in the beginning and 327.2MB in the end (delta: 159.4MB). Free memory was 72.3MB in the beginning and 125.2MB in the end (delta: -52.9MB). Peak memory consumption was 101.3MB. Max. memory is 16.1GB. * Witness Printer took 76.36ms. Allocated memory is still 327.2MB. Free memory was 125.2MB in the beginning and 119.1MB in the end (delta: 6.0MB). 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: 50]: 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: 51]: 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: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: 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: 63]: 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: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: 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: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: 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: 88]: 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: 96]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 695 locations, 99 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: 6.2s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1726 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 734 mSDsluCounter, 117 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 22 mSDsCounter, 297 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1871 IncrementalHoareTripleChecker+Invalid, 2168 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 297 mSolverCounterUnsat, 95 mSDtfsCounter, 1871 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=850occurred in iteration=0, InterpolantAutomatonStates: 70, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 2090 NumberOfCodeBlocks, 2090 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 2071 ConstructedInterpolants, 0 QuantifiedInterpolants, 2790 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 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 53 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 06:56:31,365 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE