./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-name-comparator-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version f8ab0bd5 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-name-comparator-trans.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 362ca5c35cce683744d8d619a442f154ce469608d45ae43ff282ddf886694959 --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 22:23:17,810 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 22:23:17,870 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-13 22:23:17,876 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 22:23:17,877 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 22:23:17,898 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 22:23:17,899 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 22:23:17,900 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 22:23:17,900 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 22:23:17,900 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 22:23:17,901 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 22:23:17,901 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 22:23:17,901 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 22:23:17,901 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 22:23:17,901 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 22:23:17,902 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 22:23:17,902 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 22:23:17,902 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 22:23:17,902 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 22:23:17,902 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 22:23:17,902 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 22:23:17,902 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 22:23:17,903 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-13 22:23:17,903 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-13 22:23:17,903 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 22:23:17,903 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 22:23:17,903 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 22:23:17,903 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 22:23:17,903 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 22:23:17,903 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 22:23:17,903 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 22:23:17,903 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:23:17,903 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 22:23:17,903 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 22:23:17,904 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 22:23:17,904 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 22:23:17,904 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 22:23:17,904 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 22:23:17,904 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 22:23:17,904 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 22:23:17,904 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 22:23:17,904 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 22:23:17,905 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 -> 362ca5c35cce683744d8d619a442f154ce469608d45ae43ff282ddf886694959 [2025-03-13 22:23:18,149 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 22:23:18,155 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 22:23:18,158 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 22:23:18,159 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 22:23:18,159 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 22:23:18,161 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-name-comparator-trans.wvr.c [2025-03-13 22:23:19,330 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b032c772/d10bbdeb3a00404fb9d7e4b433ac682c/FLAG4a9f251d2 [2025-03-13 22:23:19,570 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 22:23:19,570 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-name-comparator-trans.wvr.c [2025-03-13 22:23:19,576 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b032c772/d10bbdeb3a00404fb9d7e4b433ac682c/FLAG4a9f251d2 [2025-03-13 22:23:19,908 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b032c772/d10bbdeb3a00404fb9d7e4b433ac682c [2025-03-13 22:23:19,910 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 22:23:19,911 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 22:23:19,913 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 22:23:19,913 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 22:23:19,916 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 22:23:19,917 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:23:19" (1/1) ... [2025-03-13 22:23:19,919 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54c7a50d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:23:19, skipping insertion in model container [2025-03-13 22:23:19,919 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:23:19" (1/1) ... [2025-03-13 22:23:19,933 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 22:23:20,060 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:23:20,068 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 22:23:20,110 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:23:20,124 INFO L204 MainTranslator]: Completed translation [2025-03-13 22:23:20,125 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:23:20 WrapperNode [2025-03-13 22:23:20,125 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 22:23:20,126 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 22:23:20,126 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 22:23:20,126 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 22:23:20,131 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:23:20" (1/1) ... [2025-03-13 22:23:20,145 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:23:20" (1/1) ... [2025-03-13 22:23:20,193 INFO L138 Inliner]: procedures = 25, calls = 30, calls flagged for inlining = 18, calls inlined = 22, statements flattened = 838 [2025-03-13 22:23:20,194 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 22:23:20,194 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 22:23:20,194 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 22:23:20,194 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 22:23:20,199 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:23:20" (1/1) ... [2025-03-13 22:23:20,203 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:23:20" (1/1) ... [2025-03-13 22:23:20,207 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:23:20" (1/1) ... [2025-03-13 22:23:20,210 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:23:20" (1/1) ... [2025-03-13 22:23:20,228 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:23:20" (1/1) ... [2025-03-13 22:23:20,233 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:23:20" (1/1) ... [2025-03-13 22:23:20,235 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:23:20" (1/1) ... [2025-03-13 22:23:20,240 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:23:20" (1/1) ... [2025-03-13 22:23:20,243 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 22:23:20,246 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 22:23:20,246 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 22:23:20,246 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 22:23:20,247 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:23:20" (1/1) ... [2025-03-13 22:23:20,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:23:20,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:23:20,277 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-13 22:23:20,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-13 22:23:20,298 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 22:23:20,299 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-13 22:23:20,299 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-13 22:23:20,299 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-13 22:23:20,299 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-13 22:23:20,299 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-13 22:23:20,299 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-13 22:23:20,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-13 22:23:20,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-13 22:23:20,300 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-13 22:23:20,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 22:23:20,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 22:23:20,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-13 22:23:20,301 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 22:23:20,418 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 22:23:20,420 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 22:23:21,228 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 22:23:21,229 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 22:23:21,229 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 22:23:21,272 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 22:23:21,273 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:23:21 BoogieIcfgContainer [2025-03-13 22:23:21,273 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 22:23:21,274 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 22:23:21,274 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 22:23:21,280 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 22:23:21,281 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 10:23:19" (1/3) ... [2025-03-13 22:23:21,281 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dafd5fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:23:21, skipping insertion in model container [2025-03-13 22:23:21,281 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:23:20" (2/3) ... [2025-03-13 22:23:21,281 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dafd5fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:23:21, skipping insertion in model container [2025-03-13 22:23:21,281 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:23:21" (3/3) ... [2025-03-13 22:23:21,282 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-name-comparator-trans.wvr.c [2025-03-13 22:23:21,296 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 22:23:21,298 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-name-comparator-trans.wvr.c that has 4 procedures, 1049 locations, 1 initial locations, 4 loop locations, and 149 error locations. [2025-03-13 22:23:21,299 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 22:23:21,453 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-13 22:23:21,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1058 places, 1105 transitions, 2231 flow [2025-03-13 22:23:21,945 INFO L124 PetriNetUnfolderBase]: 57/1102 cut-off events. [2025-03-13 22:23:21,946 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-13 22:23:21,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1115 conditions, 1102 events. 57/1102 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 3884 event pairs, 0 based on Foata normal form. 0/896 useless extension candidates. Maximal degree in co-relation 849. Up to 2 conditions per place. [2025-03-13 22:23:21,972 INFO L82 GeneralOperation]: Start removeDead. Operand has 1058 places, 1105 transitions, 2231 flow [2025-03-13 22:23:21,993 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1036 places, 1081 transitions, 2180 flow [2025-03-13 22:23:22,003 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:23:22,011 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;@6bf1cc43, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:23:22,011 INFO L334 AbstractCegarLoop]: Starting to check reachability of 281 error locations. [2025-03-13 22:23:22,017 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:23:22,017 INFO L124 PetriNetUnfolderBase]: 0/33 cut-off events. [2025-03-13 22:23:22,018 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:23:22,018 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:22,018 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:23:22,019 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-03-13 22:23:22,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:22,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1967604162, now seen corresponding path program 1 times [2025-03-13 22:23:22,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:22,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678230871] [2025-03-13 22:23:22,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:22,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:22,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-13 22:23:22,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-13 22:23:22,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:22,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:22,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:22,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:22,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678230871] [2025-03-13 22:23:22,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678230871] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:22,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:22,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:22,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510407124] [2025-03-13 22:23:22,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:22,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:22,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:22,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:22,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:22,270 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1063 out of 1105 [2025-03-13 22:23:22,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1036 places, 1081 transitions, 2180 flow. Second operand has 3 states, 3 states have (on average 1064.3333333333333) internal successors, (3193), 3 states have internal predecessors, (3193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:22,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:22,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1063 of 1105 [2025-03-13 22:23:22,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:23,641 INFO L124 PetriNetUnfolderBase]: 227/4391 cut-off events. [2025-03-13 22:23:23,641 INFO L125 PetriNetUnfolderBase]: For 54/61 co-relation queries the response was YES. [2025-03-13 22:23:23,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4546 conditions, 4391 events. 227/4391 cut-off events. For 54/61 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 33701 event pairs, 45 based on Foata normal form. 207/3682 useless extension candidates. Maximal degree in co-relation 3736. Up to 110 conditions per place. [2025-03-13 22:23:23,735 INFO L140 encePairwiseOnDemand]: 1085/1105 looper letters, 19 selfloop transitions, 2 changer transitions 2/1063 dead transitions. [2025-03-13 22:23:23,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1037 places, 1063 transitions, 2186 flow [2025-03-13 22:23:23,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:23,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:23,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3228 transitions. [2025-03-13 22:23:23,756 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9737556561085973 [2025-03-13 22:23:23,757 INFO L175 Difference]: Start difference. First operand has 1036 places, 1081 transitions, 2180 flow. Second operand 3 states and 3228 transitions. [2025-03-13 22:23:23,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1037 places, 1063 transitions, 2186 flow [2025-03-13 22:23:23,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1031 places, 1063 transitions, 2174 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-13 22:23:23,778 INFO L231 Difference]: Finished difference. Result has 1031 places, 1061 transitions, 2132 flow [2025-03-13 22:23:23,781 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1105, PETRI_DIFFERENCE_MINUEND_FLOW=2132, PETRI_DIFFERENCE_MINUEND_PLACES=1029, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1063, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1061, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2132, PETRI_PLACES=1031, PETRI_TRANSITIONS=1061} [2025-03-13 22:23:23,784 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -5 predicate places. [2025-03-13 22:23:23,784 INFO L471 AbstractCegarLoop]: Abstraction has has 1031 places, 1061 transitions, 2132 flow [2025-03-13 22:23:23,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1064.3333333333333) internal successors, (3193), 3 states have internal predecessors, (3193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:23,787 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:23,787 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] [2025-03-13 22:23:23,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 22:23:23,787 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-03-13 22:23:23,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:23,788 INFO L85 PathProgramCache]: Analyzing trace with hash -199227021, now seen corresponding path program 1 times [2025-03-13 22:23:23,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:23,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470883325] [2025-03-13 22:23:23,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:23,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:23,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-13 22:23:23,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-13 22:23:23,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:23,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:23,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:23,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:23,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470883325] [2025-03-13 22:23:23,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470883325] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:23,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:23,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:23,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65346382] [2025-03-13 22:23:23,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:23,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:23,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:23,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:23,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:23,907 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1063 out of 1105 [2025-03-13 22:23:23,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1031 places, 1061 transitions, 2132 flow. Second operand has 3 states, 3 states have (on average 1064.3333333333333) internal successors, (3193), 3 states have internal predecessors, (3193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:23,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:23,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1063 of 1105 [2025-03-13 22:23:23,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:26,219 INFO L124 PetriNetUnfolderBase]: 613/12175 cut-off events. [2025-03-13 22:23:26,219 INFO L125 PetriNetUnfolderBase]: For 6/24 co-relation queries the response was YES. [2025-03-13 22:23:26,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12409 conditions, 12175 events. 613/12175 cut-off events. For 6/24 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 120546 event pairs, 95 based on Foata normal form. 0/9562 useless extension candidates. Maximal degree in co-relation 12368. Up to 185 conditions per place. [2025-03-13 22:23:26,446 INFO L140 encePairwiseOnDemand]: 1102/1105 looper letters, 19 selfloop transitions, 2 changer transitions 0/1060 dead transitions. [2025-03-13 22:23:26,446 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1030 places, 1060 transitions, 2172 flow [2025-03-13 22:23:26,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:26,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:26,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3211 transitions. [2025-03-13 22:23:26,454 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9686274509803922 [2025-03-13 22:23:26,455 INFO L175 Difference]: Start difference. First operand has 1031 places, 1061 transitions, 2132 flow. Second operand 3 states and 3211 transitions. [2025-03-13 22:23:26,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1030 places, 1060 transitions, 2172 flow [2025-03-13 22:23:26,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1028 places, 1060 transitions, 2168 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:23:26,468 INFO L231 Difference]: Finished difference. Result has 1028 places, 1060 transitions, 2130 flow [2025-03-13 22:23:26,469 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1105, PETRI_DIFFERENCE_MINUEND_FLOW=2126, PETRI_DIFFERENCE_MINUEND_PLACES=1026, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1060, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1058, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2130, PETRI_PLACES=1028, PETRI_TRANSITIONS=1060} [2025-03-13 22:23:26,470 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -8 predicate places. [2025-03-13 22:23:26,470 INFO L471 AbstractCegarLoop]: Abstraction has has 1028 places, 1060 transitions, 2130 flow [2025-03-13 22:23:26,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1064.3333333333333) internal successors, (3193), 3 states have internal predecessors, (3193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:26,472 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:26,472 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] [2025-03-13 22:23:26,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 22:23:26,472 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-03-13 22:23:26,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:26,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1086768256, now seen corresponding path program 1 times [2025-03-13 22:23:26,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:26,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759832320] [2025-03-13 22:23:26,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:26,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:26,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-13 22:23:26,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-13 22:23:26,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:26,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:26,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:26,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:26,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759832320] [2025-03-13 22:23:26,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759832320] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:26,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:26,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:26,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766930862] [2025-03-13 22:23:26,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:26,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:26,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:26,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:26,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:26,598 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1063 out of 1105 [2025-03-13 22:23:26,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1028 places, 1060 transitions, 2130 flow. Second operand has 3 states, 3 states have (on average 1064.3333333333333) internal successors, (3193), 3 states have internal predecessors, (3193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:26,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:26,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1063 of 1105 [2025-03-13 22:23:26,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:27,488 INFO L124 PetriNetUnfolderBase]: 241/3573 cut-off events. [2025-03-13 22:23:27,489 INFO L125 PetriNetUnfolderBase]: For 42/75 co-relation queries the response was YES. [2025-03-13 22:23:27,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3772 conditions, 3573 events. 241/3573 cut-off events. For 42/75 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 27359 event pairs, 95 based on Foata normal form. 0/2832 useless extension candidates. Maximal degree in co-relation 3723. Up to 185 conditions per place. [2025-03-13 22:23:27,593 INFO L140 encePairwiseOnDemand]: 1102/1105 looper letters, 19 selfloop transitions, 2 changer transitions 0/1059 dead transitions. [2025-03-13 22:23:27,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1029 places, 1059 transitions, 2170 flow [2025-03-13 22:23:27,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:27,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:27,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3211 transitions. [2025-03-13 22:23:27,599 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9686274509803922 [2025-03-13 22:23:27,600 INFO L175 Difference]: Start difference. First operand has 1028 places, 1060 transitions, 2130 flow. Second operand 3 states and 3211 transitions. [2025-03-13 22:23:27,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1029 places, 1059 transitions, 2170 flow [2025-03-13 22:23:27,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1027 places, 1059 transitions, 2166 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:23:27,614 INFO L231 Difference]: Finished difference. Result has 1027 places, 1059 transitions, 2128 flow [2025-03-13 22:23:27,616 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1105, PETRI_DIFFERENCE_MINUEND_FLOW=2124, PETRI_DIFFERENCE_MINUEND_PLACES=1025, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1059, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1057, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2128, PETRI_PLACES=1027, PETRI_TRANSITIONS=1059} [2025-03-13 22:23:27,616 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -9 predicate places. [2025-03-13 22:23:27,617 INFO L471 AbstractCegarLoop]: Abstraction has has 1027 places, 1059 transitions, 2128 flow [2025-03-13 22:23:27,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1064.3333333333333) internal successors, (3193), 3 states have internal predecessors, (3193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:27,618 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:27,619 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] [2025-03-13 22:23:27,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 22:23:27,619 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-03-13 22:23:27,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:27,619 INFO L85 PathProgramCache]: Analyzing trace with hash 2100259461, now seen corresponding path program 1 times [2025-03-13 22:23:27,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:27,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583692898] [2025-03-13 22:23:27,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:27,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:27,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-13 22:23:27,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-13 22:23:27,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:27,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:27,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:27,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:27,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583692898] [2025-03-13 22:23:27,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583692898] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:27,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:27,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:27,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049432295] [2025-03-13 22:23:27,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:27,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:27,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:27,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:27,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:27,735 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1064 out of 1105 [2025-03-13 22:23:27,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1027 places, 1059 transitions, 2128 flow. Second operand has 3 states, 3 states have (on average 1065.3333333333333) internal successors, (3196), 3 states have internal predecessors, (3196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:27,739 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:27,739 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1064 of 1105 [2025-03-13 22:23:27,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:29,196 INFO L124 PetriNetUnfolderBase]: 246/5498 cut-off events. [2025-03-13 22:23:29,196 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-03-13 22:23:29,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5574 conditions, 5498 events. 246/5498 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 43702 event pairs, 16 based on Foata normal form. 0/4346 useless extension candidates. Maximal degree in co-relation 5517. Up to 51 conditions per place. [2025-03-13 22:23:29,310 INFO L140 encePairwiseOnDemand]: 1102/1105 looper letters, 18 selfloop transitions, 2 changer transitions 0/1058 dead transitions. [2025-03-13 22:23:29,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1028 places, 1058 transitions, 2166 flow [2025-03-13 22:23:29,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:29,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:29,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3213 transitions. [2025-03-13 22:23:29,315 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9692307692307692 [2025-03-13 22:23:29,316 INFO L175 Difference]: Start difference. First operand has 1027 places, 1059 transitions, 2128 flow. Second operand 3 states and 3213 transitions. [2025-03-13 22:23:29,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1028 places, 1058 transitions, 2166 flow [2025-03-13 22:23:29,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1026 places, 1058 transitions, 2162 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:23:29,326 INFO L231 Difference]: Finished difference. Result has 1026 places, 1058 transitions, 2126 flow [2025-03-13 22:23:29,328 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1105, PETRI_DIFFERENCE_MINUEND_FLOW=2122, PETRI_DIFFERENCE_MINUEND_PLACES=1024, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1058, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1056, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2126, PETRI_PLACES=1026, PETRI_TRANSITIONS=1058} [2025-03-13 22:23:29,328 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -10 predicate places. [2025-03-13 22:23:29,328 INFO L471 AbstractCegarLoop]: Abstraction has has 1026 places, 1058 transitions, 2126 flow [2025-03-13 22:23:29,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1065.3333333333333) internal successors, (3196), 3 states have internal predecessors, (3196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:29,330 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:29,331 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:23:29,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 22:23:29,331 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-03-13 22:23:29,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:29,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1894467969, now seen corresponding path program 1 times [2025-03-13 22:23:29,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:29,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782366785] [2025-03-13 22:23:29,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:29,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:29,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-13 22:23:29,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-13 22:23:29,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:29,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:29,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:29,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:29,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782366785] [2025-03-13 22:23:29,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782366785] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:29,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:29,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:29,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091605408] [2025-03-13 22:23:29,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:29,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:29,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:29,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:29,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:29,411 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1067 out of 1105 [2025-03-13 22:23:29,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1026 places, 1058 transitions, 2126 flow. Second operand has 3 states, 3 states have (on average 1068.3333333333333) internal successors, (3205), 3 states have internal predecessors, (3205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:29,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:29,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1067 of 1105 [2025-03-13 22:23:29,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:29,688 INFO L124 PetriNetUnfolderBase]: 74/1607 cut-off events. [2025-03-13 22:23:29,688 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 22:23:29,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1668 conditions, 1607 events. 74/1607 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 8226 event pairs, 12 based on Foata normal form. 0/1294 useless extension candidates. Maximal degree in co-relation 1603. Up to 40 conditions per place. [2025-03-13 22:23:29,735 INFO L140 encePairwiseOnDemand]: 1102/1105 looper letters, 15 selfloop transitions, 2 changer transitions 0/1057 dead transitions. [2025-03-13 22:23:29,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1027 places, 1057 transitions, 2158 flow [2025-03-13 22:23:29,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:29,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:29,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3219 transitions. [2025-03-13 22:23:29,740 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9710407239819004 [2025-03-13 22:23:29,740 INFO L175 Difference]: Start difference. First operand has 1026 places, 1058 transitions, 2126 flow. Second operand 3 states and 3219 transitions. [2025-03-13 22:23:29,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1027 places, 1057 transitions, 2158 flow [2025-03-13 22:23:29,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1025 places, 1057 transitions, 2154 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:23:29,751 INFO L231 Difference]: Finished difference. Result has 1025 places, 1057 transitions, 2124 flow [2025-03-13 22:23:29,753 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1105, PETRI_DIFFERENCE_MINUEND_FLOW=2120, PETRI_DIFFERENCE_MINUEND_PLACES=1023, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1057, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1055, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2124, PETRI_PLACES=1025, PETRI_TRANSITIONS=1057} [2025-03-13 22:23:29,753 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -11 predicate places. [2025-03-13 22:23:29,753 INFO L471 AbstractCegarLoop]: Abstraction has has 1025 places, 1057 transitions, 2124 flow [2025-03-13 22:23:29,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1068.3333333333333) internal successors, (3205), 3 states have internal predecessors, (3205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:29,755 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:29,756 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] [2025-03-13 22:23:29,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 22:23:29,756 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-03-13 22:23:29,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:29,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1994346920, now seen corresponding path program 1 times [2025-03-13 22:23:29,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:29,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200612409] [2025-03-13 22:23:29,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:29,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:29,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-13 22:23:29,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-13 22:23:29,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:29,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:29,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:29,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:29,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200612409] [2025-03-13 22:23:29,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200612409] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:29,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:29,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:29,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359678013] [2025-03-13 22:23:29,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:29,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:29,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:29,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:29,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:29,834 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1068 out of 1105 [2025-03-13 22:23:29,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1025 places, 1057 transitions, 2124 flow. Second operand has 3 states, 3 states have (on average 1069.3333333333333) internal successors, (3208), 3 states have internal predecessors, (3208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:29,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:29,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1068 of 1105 [2025-03-13 22:23:29,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:30,551 INFO L124 PetriNetUnfolderBase]: 168/3831 cut-off events. [2025-03-13 22:23:30,551 INFO L125 PetriNetUnfolderBase]: For 1/3 co-relation queries the response was YES. [2025-03-13 22:23:30,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3885 conditions, 3831 events. 168/3831 cut-off events. For 1/3 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 26026 event pairs, 10 based on Foata normal form. 0/3042 useless extension candidates. Maximal degree in co-relation 3812. Up to 35 conditions per place. [2025-03-13 22:23:30,640 INFO L140 encePairwiseOnDemand]: 1102/1105 looper letters, 14 selfloop transitions, 2 changer transitions 0/1056 dead transitions. [2025-03-13 22:23:30,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1026 places, 1056 transitions, 2154 flow [2025-03-13 22:23:30,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:30,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:30,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3221 transitions. [2025-03-13 22:23:30,644 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9716440422322775 [2025-03-13 22:23:30,644 INFO L175 Difference]: Start difference. First operand has 1025 places, 1057 transitions, 2124 flow. Second operand 3 states and 3221 transitions. [2025-03-13 22:23:30,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1026 places, 1056 transitions, 2154 flow [2025-03-13 22:23:30,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1024 places, 1056 transitions, 2150 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:23:30,654 INFO L231 Difference]: Finished difference. Result has 1024 places, 1056 transitions, 2122 flow [2025-03-13 22:23:30,655 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1105, PETRI_DIFFERENCE_MINUEND_FLOW=2118, PETRI_DIFFERENCE_MINUEND_PLACES=1022, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1056, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1054, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2122, PETRI_PLACES=1024, PETRI_TRANSITIONS=1056} [2025-03-13 22:23:30,655 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -12 predicate places. [2025-03-13 22:23:30,656 INFO L471 AbstractCegarLoop]: Abstraction has has 1024 places, 1056 transitions, 2122 flow [2025-03-13 22:23:30,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1069.3333333333333) internal successors, (3208), 3 states have internal predecessors, (3208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:30,657 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:30,657 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] [2025-03-13 22:23:30,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 22:23:30,657 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-03-13 22:23:30,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:30,658 INFO L85 PathProgramCache]: Analyzing trace with hash 706864020, now seen corresponding path program 1 times [2025-03-13 22:23:30,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:30,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837224229] [2025-03-13 22:23:30,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:30,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:30,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-13 22:23:30,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-13 22:23:30,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:30,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:30,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:30,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:30,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837224229] [2025-03-13 22:23:30,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837224229] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:30,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:30,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:30,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69656382] [2025-03-13 22:23:30,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:30,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:30,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:30,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:30,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:30,740 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1061 out of 1105 [2025-03-13 22:23:30,743 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1024 places, 1056 transitions, 2122 flow. Second operand has 3 states, 3 states have (on average 1062.3333333333333) internal successors, (3187), 3 states have internal predecessors, (3187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:30,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:30,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1061 of 1105 [2025-03-13 22:23:30,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:32,395 INFO L124 PetriNetUnfolderBase]: 350/7715 cut-off events. [2025-03-13 22:23:32,395 INFO L125 PetriNetUnfolderBase]: For 2/6 co-relation queries the response was YES. [2025-03-13 22:23:32,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7818 conditions, 7715 events. 350/7715 cut-off events. For 2/6 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 68347 event pairs, 24 based on Foata normal form. 0/6092 useless extension candidates. Maximal degree in co-relation 7737. Up to 70 conditions per place. [2025-03-13 22:23:32,562 INFO L140 encePairwiseOnDemand]: 1102/1105 looper letters, 21 selfloop transitions, 2 changer transitions 0/1055 dead transitions. [2025-03-13 22:23:32,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1025 places, 1055 transitions, 2166 flow [2025-03-13 22:23:32,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:32,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:32,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3207 transitions. [2025-03-13 22:23:32,566 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.967420814479638 [2025-03-13 22:23:32,566 INFO L175 Difference]: Start difference. First operand has 1024 places, 1056 transitions, 2122 flow. Second operand 3 states and 3207 transitions. [2025-03-13 22:23:32,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1025 places, 1055 transitions, 2166 flow [2025-03-13 22:23:32,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1023 places, 1055 transitions, 2162 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:23:32,575 INFO L231 Difference]: Finished difference. Result has 1023 places, 1055 transitions, 2120 flow [2025-03-13 22:23:32,577 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1105, PETRI_DIFFERENCE_MINUEND_FLOW=2116, PETRI_DIFFERENCE_MINUEND_PLACES=1021, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1055, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1053, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2120, PETRI_PLACES=1023, PETRI_TRANSITIONS=1055} [2025-03-13 22:23:32,577 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -13 predicate places. [2025-03-13 22:23:32,577 INFO L471 AbstractCegarLoop]: Abstraction has has 1023 places, 1055 transitions, 2120 flow [2025-03-13 22:23:32,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1062.3333333333333) internal successors, (3187), 3 states have internal predecessors, (3187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:32,579 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:32,579 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] [2025-03-13 22:23:32,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 22:23:32,579 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-03-13 22:23:32,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:32,580 INFO L85 PathProgramCache]: Analyzing trace with hash 837650549, now seen corresponding path program 1 times [2025-03-13 22:23:32,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:32,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891798838] [2025-03-13 22:23:32,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:32,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:32,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-13 22:23:32,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-13 22:23:32,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:32,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:32,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:32,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:32,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891798838] [2025-03-13 22:23:32,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891798838] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:32,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:32,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:32,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038928065] [2025-03-13 22:23:32,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:32,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:32,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:32,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:32,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:32,648 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1064 out of 1105 [2025-03-13 22:23:32,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1023 places, 1055 transitions, 2120 flow. Second operand has 3 states, 3 states have (on average 1065.3333333333333) internal successors, (3196), 3 states have internal predecessors, (3196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:32,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:32,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1064 of 1105 [2025-03-13 22:23:32,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:33,483 INFO L124 PetriNetUnfolderBase]: 150/3278 cut-off events. [2025-03-13 22:23:33,483 INFO L125 PetriNetUnfolderBase]: For 9/30 co-relation queries the response was YES. [2025-03-13 22:23:33,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3346 conditions, 3278 events. 150/3278 cut-off events. For 9/30 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 21625 event pairs, 16 based on Foata normal form. 0/2607 useless extension candidates. Maximal degree in co-relation 3257. Up to 51 conditions per place. [2025-03-13 22:23:33,593 INFO L140 encePairwiseOnDemand]: 1102/1105 looper letters, 18 selfloop transitions, 2 changer transitions 0/1054 dead transitions. [2025-03-13 22:23:33,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1024 places, 1054 transitions, 2158 flow [2025-03-13 22:23:33,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:33,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:33,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3213 transitions. [2025-03-13 22:23:33,597 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9692307692307692 [2025-03-13 22:23:33,597 INFO L175 Difference]: Start difference. First operand has 1023 places, 1055 transitions, 2120 flow. Second operand 3 states and 3213 transitions. [2025-03-13 22:23:33,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1024 places, 1054 transitions, 2158 flow [2025-03-13 22:23:33,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1022 places, 1054 transitions, 2154 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:23:33,610 INFO L231 Difference]: Finished difference. Result has 1022 places, 1054 transitions, 2118 flow [2025-03-13 22:23:33,612 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1105, PETRI_DIFFERENCE_MINUEND_FLOW=2114, PETRI_DIFFERENCE_MINUEND_PLACES=1020, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1054, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1052, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2118, PETRI_PLACES=1022, PETRI_TRANSITIONS=1054} [2025-03-13 22:23:33,612 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -14 predicate places. [2025-03-13 22:23:33,612 INFO L471 AbstractCegarLoop]: Abstraction has has 1022 places, 1054 transitions, 2118 flow [2025-03-13 22:23:33,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1065.3333333333333) internal successors, (3196), 3 states have internal predecessors, (3196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:33,614 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:33,614 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-13 22:23:33,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 22:23:33,614 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-03-13 22:23:33,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:33,615 INFO L85 PathProgramCache]: Analyzing trace with hash 761307749, now seen corresponding path program 1 times [2025-03-13 22:23:33,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:33,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868045280] [2025-03-13 22:23:33,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:33,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:33,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-13 22:23:33,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-13 22:23:33,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:33,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:33,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:33,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:33,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868045280] [2025-03-13 22:23:33,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868045280] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:33,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:33,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:33,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627101132] [2025-03-13 22:23:33,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:33,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:33,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:33,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:33,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:33,680 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1067 out of 1105 [2025-03-13 22:23:33,683 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1022 places, 1054 transitions, 2118 flow. Second operand has 3 states, 3 states have (on average 1068.3333333333333) internal successors, (3205), 3 states have internal predecessors, (3205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:33,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:33,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1067 of 1105 [2025-03-13 22:23:33,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:34,144 INFO L124 PetriNetUnfolderBase]: 74/1603 cut-off events. [2025-03-13 22:23:34,144 INFO L125 PetriNetUnfolderBase]: For 8/14 co-relation queries the response was YES. [2025-03-13 22:23:34,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1658 conditions, 1603 events. 74/1603 cut-off events. For 8/14 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 7802 event pairs, 12 based on Foata normal form. 0/1292 useless extension candidates. Maximal degree in co-relation 1561. Up to 40 conditions per place. [2025-03-13 22:23:34,204 INFO L140 encePairwiseOnDemand]: 1102/1105 looper letters, 15 selfloop transitions, 2 changer transitions 0/1053 dead transitions. [2025-03-13 22:23:34,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1023 places, 1053 transitions, 2150 flow [2025-03-13 22:23:34,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:34,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:34,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3219 transitions. [2025-03-13 22:23:34,209 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9710407239819004 [2025-03-13 22:23:34,209 INFO L175 Difference]: Start difference. First operand has 1022 places, 1054 transitions, 2118 flow. Second operand 3 states and 3219 transitions. [2025-03-13 22:23:34,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1023 places, 1053 transitions, 2150 flow [2025-03-13 22:23:34,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1021 places, 1053 transitions, 2146 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:23:34,221 INFO L231 Difference]: Finished difference. Result has 1021 places, 1053 transitions, 2116 flow [2025-03-13 22:23:34,222 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1105, PETRI_DIFFERENCE_MINUEND_FLOW=2112, PETRI_DIFFERENCE_MINUEND_PLACES=1019, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1053, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1051, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2116, PETRI_PLACES=1021, PETRI_TRANSITIONS=1053} [2025-03-13 22:23:34,223 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -15 predicate places. [2025-03-13 22:23:34,223 INFO L471 AbstractCegarLoop]: Abstraction has has 1021 places, 1053 transitions, 2116 flow [2025-03-13 22:23:34,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1068.3333333333333) internal successors, (3205), 3 states have internal predecessors, (3205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:34,225 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:34,225 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] [2025-03-13 22:23:34,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 22:23:34,225 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-03-13 22:23:34,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:34,225 INFO L85 PathProgramCache]: Analyzing trace with hash -868404506, now seen corresponding path program 1 times [2025-03-13 22:23:34,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:34,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499343067] [2025-03-13 22:23:34,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:34,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:34,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-13 22:23:34,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-13 22:23:34,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:34,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:34,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:34,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:34,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499343067] [2025-03-13 22:23:34,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499343067] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:34,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:34,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:34,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372713477] [2025-03-13 22:23:34,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:34,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:34,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:34,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:34,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:34,285 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1068 out of 1105 [2025-03-13 22:23:34,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1021 places, 1053 transitions, 2116 flow. Second operand has 3 states, 3 states have (on average 1069.3333333333333) internal successors, (3208), 3 states have internal predecessors, (3208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:34,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:34,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1068 of 1105 [2025-03-13 22:23:34,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:34,895 INFO L124 PetriNetUnfolderBase]: 108/2442 cut-off events. [2025-03-13 22:23:34,895 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2025-03-13 22:23:34,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2491 conditions, 2442 events. 108/2442 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 13642 event pairs, 10 based on Foata normal form. 0/1955 useless extension candidates. Maximal degree in co-relation 2386. Up to 35 conditions per place. [2025-03-13 22:23:34,999 INFO L140 encePairwiseOnDemand]: 1102/1105 looper letters, 14 selfloop transitions, 2 changer transitions 0/1052 dead transitions. [2025-03-13 22:23:35,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1022 places, 1052 transitions, 2146 flow [2025-03-13 22:23:35,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:35,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:35,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3221 transitions. [2025-03-13 22:23:35,003 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9716440422322775 [2025-03-13 22:23:35,003 INFO L175 Difference]: Start difference. First operand has 1021 places, 1053 transitions, 2116 flow. Second operand 3 states and 3221 transitions. [2025-03-13 22:23:35,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1022 places, 1052 transitions, 2146 flow [2025-03-13 22:23:35,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1020 places, 1052 transitions, 2142 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:23:35,014 INFO L231 Difference]: Finished difference. Result has 1020 places, 1052 transitions, 2114 flow [2025-03-13 22:23:35,015 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1105, PETRI_DIFFERENCE_MINUEND_FLOW=2110, PETRI_DIFFERENCE_MINUEND_PLACES=1018, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1052, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1050, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2114, PETRI_PLACES=1020, PETRI_TRANSITIONS=1052} [2025-03-13 22:23:35,015 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -16 predicate places. [2025-03-13 22:23:35,015 INFO L471 AbstractCegarLoop]: Abstraction has has 1020 places, 1052 transitions, 2114 flow [2025-03-13 22:23:35,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1069.3333333333333) internal successors, (3208), 3 states have internal predecessors, (3208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:35,017 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:35,017 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] [2025-03-13 22:23:35,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-13 22:23:35,018 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-03-13 22:23:35,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:35,018 INFO L85 PathProgramCache]: Analyzing trace with hash -200135885, now seen corresponding path program 1 times [2025-03-13 22:23:35,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:35,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975140842] [2025-03-13 22:23:35,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:35,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:35,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-13 22:23:35,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-13 22:23:35,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:35,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:35,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:35,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:35,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975140842] [2025-03-13 22:23:35,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975140842] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:35,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:35,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:35,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641237747] [2025-03-13 22:23:35,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:35,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:35,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:35,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:35,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:35,096 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1061 out of 1105 [2025-03-13 22:23:35,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1020 places, 1052 transitions, 2114 flow. Second operand has 3 states, 3 states have (on average 1062.3333333333333) internal successors, (3187), 3 states have internal predecessors, (3187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:35,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:35,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1061 of 1105 [2025-03-13 22:23:35,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:36,017 INFO L124 PetriNetUnfolderBase]: 206/4387 cut-off events. [2025-03-13 22:23:36,017 INFO L125 PetriNetUnfolderBase]: For 13/97 co-relation queries the response was YES. [2025-03-13 22:23:36,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4478 conditions, 4387 events. 206/4387 cut-off events. For 13/97 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 32370 event pairs, 24 based on Foata normal form. 0/3477 useless extension candidates. Maximal degree in co-relation 4365. Up to 70 conditions per place. [2025-03-13 22:23:36,173 INFO L140 encePairwiseOnDemand]: 1102/1105 looper letters, 21 selfloop transitions, 2 changer transitions 0/1051 dead transitions. [2025-03-13 22:23:36,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1021 places, 1051 transitions, 2158 flow [2025-03-13 22:23:36,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:36,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:36,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3207 transitions. [2025-03-13 22:23:36,176 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.967420814479638 [2025-03-13 22:23:36,176 INFO L175 Difference]: Start difference. First operand has 1020 places, 1052 transitions, 2114 flow. Second operand 3 states and 3207 transitions. [2025-03-13 22:23:36,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1021 places, 1051 transitions, 2158 flow [2025-03-13 22:23:36,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1019 places, 1051 transitions, 2154 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:23:36,185 INFO L231 Difference]: Finished difference. Result has 1019 places, 1051 transitions, 2112 flow [2025-03-13 22:23:36,186 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1105, PETRI_DIFFERENCE_MINUEND_FLOW=2108, PETRI_DIFFERENCE_MINUEND_PLACES=1017, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1051, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1049, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2112, PETRI_PLACES=1019, PETRI_TRANSITIONS=1051} [2025-03-13 22:23:36,186 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -17 predicate places. [2025-03-13 22:23:36,187 INFO L471 AbstractCegarLoop]: Abstraction has has 1019 places, 1051 transitions, 2112 flow [2025-03-13 22:23:36,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1062.3333333333333) internal successors, (3187), 3 states have internal predecessors, (3187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:36,188 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:36,188 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-13 22:23:36,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-13 22:23:36,188 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-03-13 22:23:36,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:36,188 INFO L85 PathProgramCache]: Analyzing trace with hash -976940540, now seen corresponding path program 1 times [2025-03-13 22:23:36,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:36,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915077830] [2025-03-13 22:23:36,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:36,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:36,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-13 22:23:36,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-13 22:23:36,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:36,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:36,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:36,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:36,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915077830] [2025-03-13 22:23:36,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915077830] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:36,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:36,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:36,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439408572] [2025-03-13 22:23:36,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:36,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:36,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:36,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:36,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:36,273 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1064 out of 1105 [2025-03-13 22:23:36,275 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1019 places, 1051 transitions, 2112 flow. Second operand has 3 states, 3 states have (on average 1065.3333333333333) internal successors, (3196), 3 states have internal predecessors, (3196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:36,275 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:36,275 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1064 of 1105 [2025-03-13 22:23:36,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:36,526 INFO L124 PetriNetUnfolderBase]: 78/1568 cut-off events. [2025-03-13 22:23:36,526 INFO L125 PetriNetUnfolderBase]: For 18/20 co-relation queries the response was YES. [2025-03-13 22:23:36,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1630 conditions, 1568 events. 78/1568 cut-off events. For 18/20 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 7397 event pairs, 16 based on Foata normal form. 0/1272 useless extension candidates. Maximal degree in co-relation 1509. Up to 53 conditions per place. [2025-03-13 22:23:36,569 INFO L140 encePairwiseOnDemand]: 1102/1105 looper letters, 18 selfloop transitions, 2 changer transitions 0/1050 dead transitions. [2025-03-13 22:23:36,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1020 places, 1050 transitions, 2150 flow [2025-03-13 22:23:36,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:36,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:36,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3213 transitions. [2025-03-13 22:23:36,572 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9692307692307692 [2025-03-13 22:23:36,572 INFO L175 Difference]: Start difference. First operand has 1019 places, 1051 transitions, 2112 flow. Second operand 3 states and 3213 transitions. [2025-03-13 22:23:36,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1020 places, 1050 transitions, 2150 flow [2025-03-13 22:23:36,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1018 places, 1050 transitions, 2146 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:23:36,582 INFO L231 Difference]: Finished difference. Result has 1018 places, 1050 transitions, 2110 flow [2025-03-13 22:23:36,583 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1105, PETRI_DIFFERENCE_MINUEND_FLOW=2106, PETRI_DIFFERENCE_MINUEND_PLACES=1016, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1050, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1048, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2110, PETRI_PLACES=1018, PETRI_TRANSITIONS=1050} [2025-03-13 22:23:36,584 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -18 predicate places. [2025-03-13 22:23:36,584 INFO L471 AbstractCegarLoop]: Abstraction has has 1018 places, 1050 transitions, 2110 flow [2025-03-13 22:23:36,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1065.3333333333333) internal successors, (3196), 3 states have internal predecessors, (3196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:36,585 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:36,585 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] [2025-03-13 22:23:36,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-13 22:23:36,585 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-03-13 22:23:36,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:36,585 INFO L85 PathProgramCache]: Analyzing trace with hash 946099618, now seen corresponding path program 1 times [2025-03-13 22:23:36,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:36,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367499978] [2025-03-13 22:23:36,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:36,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:36,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-13 22:23:36,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-13 22:23:36,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:36,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:36,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:36,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:36,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367499978] [2025-03-13 22:23:36,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367499978] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:36,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:36,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:36,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824858431] [2025-03-13 22:23:36,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:36,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:36,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:36,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:36,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:36,642 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1067 out of 1105 [2025-03-13 22:23:36,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1018 places, 1050 transitions, 2110 flow. Second operand has 3 states, 3 states have (on average 1068.3333333333333) internal successors, (3205), 3 states have internal predecessors, (3205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:36,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:36,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1067 of 1105 [2025-03-13 22:23:36,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:36,911 INFO L124 PetriNetUnfolderBase]: 74/1599 cut-off events. [2025-03-13 22:23:36,912 INFO L125 PetriNetUnfolderBase]: For 14/16 co-relation queries the response was YES. [2025-03-13 22:23:36,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1648 conditions, 1599 events. 74/1599 cut-off events. For 14/16 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 7297 event pairs, 12 based on Foata normal form. 0/1293 useless extension candidates. Maximal degree in co-relation 1519. Up to 40 conditions per place. [2025-03-13 22:23:36,954 INFO L140 encePairwiseOnDemand]: 1102/1105 looper letters, 15 selfloop transitions, 2 changer transitions 0/1049 dead transitions. [2025-03-13 22:23:36,954 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1019 places, 1049 transitions, 2142 flow [2025-03-13 22:23:36,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:36,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:36,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3219 transitions. [2025-03-13 22:23:36,958 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9710407239819004 [2025-03-13 22:23:36,958 INFO L175 Difference]: Start difference. First operand has 1018 places, 1050 transitions, 2110 flow. Second operand 3 states and 3219 transitions. [2025-03-13 22:23:36,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1019 places, 1049 transitions, 2142 flow [2025-03-13 22:23:36,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1017 places, 1049 transitions, 2138 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:23:36,969 INFO L231 Difference]: Finished difference. Result has 1017 places, 1049 transitions, 2108 flow [2025-03-13 22:23:36,970 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1105, PETRI_DIFFERENCE_MINUEND_FLOW=2104, PETRI_DIFFERENCE_MINUEND_PLACES=1015, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1049, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1047, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2108, PETRI_PLACES=1017, PETRI_TRANSITIONS=1049} [2025-03-13 22:23:36,971 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -19 predicate places. [2025-03-13 22:23:36,971 INFO L471 AbstractCegarLoop]: Abstraction has has 1017 places, 1049 transitions, 2108 flow [2025-03-13 22:23:36,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1068.3333333333333) internal successors, (3205), 3 states have internal predecessors, (3205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:36,973 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:36,973 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] [2025-03-13 22:23:36,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-13 22:23:36,973 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-03-13 22:23:36,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:36,974 INFO L85 PathProgramCache]: Analyzing trace with hash -844095121, now seen corresponding path program 1 times [2025-03-13 22:23:36,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:36,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065554184] [2025-03-13 22:23:36,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:36,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:36,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-13 22:23:36,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-13 22:23:36,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:36,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:37,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:37,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:37,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065554184] [2025-03-13 22:23:37,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065554184] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:37,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:37,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:37,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848600804] [2025-03-13 22:23:37,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:37,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:37,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:37,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:37,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:37,039 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1068 out of 1105 [2025-03-13 22:23:37,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1017 places, 1049 transitions, 2108 flow. Second operand has 3 states, 3 states have (on average 1069.3333333333333) internal successors, (3208), 3 states have internal predecessors, (3208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:37,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:37,041 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1068 of 1105 [2025-03-13 22:23:37,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:37,246 INFO L124 PetriNetUnfolderBase]: 48/1068 cut-off events. [2025-03-13 22:23:37,246 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2025-03-13 22:23:37,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1112 conditions, 1068 events. 48/1068 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 4385 event pairs, 10 based on Foata normal form. 0/884 useless extension candidates. Maximal degree in co-relation 975. Up to 35 conditions per place. [2025-03-13 22:23:37,270 INFO L140 encePairwiseOnDemand]: 1102/1105 looper letters, 14 selfloop transitions, 2 changer transitions 0/1048 dead transitions. [2025-03-13 22:23:37,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1018 places, 1048 transitions, 2138 flow [2025-03-13 22:23:37,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:37,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:37,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3221 transitions. [2025-03-13 22:23:37,274 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9716440422322775 [2025-03-13 22:23:37,274 INFO L175 Difference]: Start difference. First operand has 1017 places, 1049 transitions, 2108 flow. Second operand 3 states and 3221 transitions. [2025-03-13 22:23:37,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1018 places, 1048 transitions, 2138 flow [2025-03-13 22:23:37,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1016 places, 1048 transitions, 2134 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:23:37,284 INFO L231 Difference]: Finished difference. Result has 1016 places, 1048 transitions, 2106 flow [2025-03-13 22:23:37,286 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1105, PETRI_DIFFERENCE_MINUEND_FLOW=2102, PETRI_DIFFERENCE_MINUEND_PLACES=1014, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1048, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1046, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2106, PETRI_PLACES=1016, PETRI_TRANSITIONS=1048} [2025-03-13 22:23:37,286 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -20 predicate places. [2025-03-13 22:23:37,286 INFO L471 AbstractCegarLoop]: Abstraction has has 1016 places, 1048 transitions, 2106 flow [2025-03-13 22:23:37,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1069.3333333333333) internal successors, (3208), 3 states have internal predecessors, (3208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:37,287 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:37,287 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] [2025-03-13 22:23:37,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-13 22:23:37,287 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-03-13 22:23:37,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:37,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1727944915, now seen corresponding path program 1 times [2025-03-13 22:23:37,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:37,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366914914] [2025-03-13 22:23:37,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:37,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:37,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-13 22:23:37,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-13 22:23:37,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:37,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:37,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:37,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:37,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366914914] [2025-03-13 22:23:37,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366914914] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:37,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:37,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:37,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594693280] [2025-03-13 22:23:37,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:37,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:37,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:37,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:37,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:37,363 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1061 out of 1105 [2025-03-13 22:23:37,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1016 places, 1048 transitions, 2106 flow. Second operand has 3 states, 3 states have (on average 1062.3333333333333) internal successors, (3187), 3 states have internal predecessors, (3187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:37,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:37,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1061 of 1105 [2025-03-13 22:23:37,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:37,644 INFO L124 PetriNetUnfolderBase]: 86/1597 cut-off events. [2025-03-13 22:23:37,645 INFO L125 PetriNetUnfolderBase]: For 26/28 co-relation queries the response was YES. [2025-03-13 22:23:37,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1676 conditions, 1597 events. 86/1597 cut-off events. For 26/28 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 8269 event pairs, 24 based on Foata normal form. 0/1292 useless extension candidates. Maximal degree in co-relation 1531. Up to 70 conditions per place. [2025-03-13 22:23:37,691 INFO L140 encePairwiseOnDemand]: 1102/1105 looper letters, 21 selfloop transitions, 2 changer transitions 0/1047 dead transitions. [2025-03-13 22:23:37,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1017 places, 1047 transitions, 2150 flow [2025-03-13 22:23:37,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:37,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:37,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3207 transitions. [2025-03-13 22:23:37,695 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.967420814479638 [2025-03-13 22:23:37,695 INFO L175 Difference]: Start difference. First operand has 1016 places, 1048 transitions, 2106 flow. Second operand 3 states and 3207 transitions. [2025-03-13 22:23:37,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1017 places, 1047 transitions, 2150 flow [2025-03-13 22:23:37,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1015 places, 1047 transitions, 2146 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:23:37,710 INFO L231 Difference]: Finished difference. Result has 1015 places, 1047 transitions, 2104 flow [2025-03-13 22:23:37,713 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1105, PETRI_DIFFERENCE_MINUEND_FLOW=2100, PETRI_DIFFERENCE_MINUEND_PLACES=1013, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1047, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1045, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2104, PETRI_PLACES=1015, PETRI_TRANSITIONS=1047} [2025-03-13 22:23:37,713 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -21 predicate places. [2025-03-13 22:23:37,713 INFO L471 AbstractCegarLoop]: Abstraction has has 1015 places, 1047 transitions, 2104 flow [2025-03-13 22:23:37,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1062.3333333333333) internal successors, (3187), 3 states have internal predecessors, (3187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:37,714 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:37,714 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] [2025-03-13 22:23:37,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-13 22:23:37,715 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-03-13 22:23:37,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:37,715 INFO L85 PathProgramCache]: Analyzing trace with hash 232217380, now seen corresponding path program 1 times [2025-03-13 22:23:37,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:37,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169097232] [2025-03-13 22:23:37,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:37,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:37,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-13 22:23:37,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-13 22:23:37,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:37,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:37,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:37,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:37,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169097232] [2025-03-13 22:23:37,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169097232] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:37,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:37,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:37,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344064134] [2025-03-13 22:23:37,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:37,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:37,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:37,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:37,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:37,814 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1070 out of 1105 [2025-03-13 22:23:37,816 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1015 places, 1047 transitions, 2104 flow. Second operand has 3 states, 3 states have (on average 1071.3333333333333) internal successors, (3214), 3 states have internal predecessors, (3214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:37,816 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:37,816 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1070 of 1105 [2025-03-13 22:23:37,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:38,242 INFO L124 PetriNetUnfolderBase]: 122/2607 cut-off events. [2025-03-13 22:23:38,242 INFO L125 PetriNetUnfolderBase]: For 6/10 co-relation queries the response was YES. [2025-03-13 22:23:38,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2663 conditions, 2607 events. 122/2607 cut-off events. For 6/10 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 14366 event pairs, 15 based on Foata normal form. 0/2090 useless extension candidates. Maximal degree in co-relation 2510. Up to 43 conditions per place. [2025-03-13 22:23:38,312 INFO L140 encePairwiseOnDemand]: 1102/1105 looper letters, 12 selfloop transitions, 2 changer transitions 0/1046 dead transitions. [2025-03-13 22:23:38,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1016 places, 1046 transitions, 2130 flow [2025-03-13 22:23:38,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:38,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:38,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3225 transitions. [2025-03-13 22:23:38,316 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9728506787330317 [2025-03-13 22:23:38,316 INFO L175 Difference]: Start difference. First operand has 1015 places, 1047 transitions, 2104 flow. Second operand 3 states and 3225 transitions. [2025-03-13 22:23:38,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1016 places, 1046 transitions, 2130 flow [2025-03-13 22:23:38,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1014 places, 1046 transitions, 2126 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:23:38,325 INFO L231 Difference]: Finished difference. Result has 1014 places, 1046 transitions, 2102 flow [2025-03-13 22:23:38,326 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1105, PETRI_DIFFERENCE_MINUEND_FLOW=2098, PETRI_DIFFERENCE_MINUEND_PLACES=1012, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1046, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1044, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2102, PETRI_PLACES=1014, PETRI_TRANSITIONS=1046} [2025-03-13 22:23:38,327 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -22 predicate places. [2025-03-13 22:23:38,327 INFO L471 AbstractCegarLoop]: Abstraction has has 1014 places, 1046 transitions, 2102 flow [2025-03-13 22:23:38,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1071.3333333333333) internal successors, (3214), 3 states have internal predecessors, (3214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:38,328 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:38,328 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] [2025-03-13 22:23:38,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-13 22:23:38,328 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-03-13 22:23:38,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:38,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1957944692, now seen corresponding path program 1 times [2025-03-13 22:23:38,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:38,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206201942] [2025-03-13 22:23:38,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:38,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:38,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-13 22:23:38,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-13 22:23:38,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:38,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:38,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:38,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:38,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206201942] [2025-03-13 22:23:38,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206201942] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:38,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:38,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:23:38,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767878553] [2025-03-13 22:23:38,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:38,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:23:38,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:38,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:23:38,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:23:38,889 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1054 out of 1105 [2025-03-13 22:23:38,892 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1014 places, 1046 transitions, 2102 flow. Second operand has 6 states, 6 states have (on average 1055.5) internal successors, (6333), 6 states have internal predecessors, (6333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:38,892 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:38,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1054 of 1105 [2025-03-13 22:23:38,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:41,255 INFO L124 PetriNetUnfolderBase]: 894/12786 cut-off events. [2025-03-13 22:23:41,256 INFO L125 PetriNetUnfolderBase]: For 59/68 co-relation queries the response was YES. [2025-03-13 22:23:41,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13406 conditions, 12786 events. 894/12786 cut-off events. For 59/68 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 132227 event pairs, 264 based on Foata normal form. 0/10058 useless extension candidates. Maximal degree in co-relation 13194. Up to 580 conditions per place. [2025-03-13 22:23:41,553 INFO L140 encePairwiseOnDemand]: 1099/1105 looper letters, 26 selfloop transitions, 5 changer transitions 0/1045 dead transitions. [2025-03-13 22:23:41,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1018 places, 1045 transitions, 2162 flow [2025-03-13 22:23:41,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:23:41,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:23:41,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6356 transitions. [2025-03-13 22:23:41,559 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9586726998491705 [2025-03-13 22:23:41,560 INFO L175 Difference]: Start difference. First operand has 1014 places, 1046 transitions, 2102 flow. Second operand 6 states and 6356 transitions. [2025-03-13 22:23:41,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1018 places, 1045 transitions, 2162 flow [2025-03-13 22:23:41,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1016 places, 1045 transitions, 2158 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:23:41,567 INFO L231 Difference]: Finished difference. Result has 1016 places, 1045 transitions, 2106 flow [2025-03-13 22:23:41,568 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1105, PETRI_DIFFERENCE_MINUEND_FLOW=2096, PETRI_DIFFERENCE_MINUEND_PLACES=1011, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1045, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1040, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2106, PETRI_PLACES=1016, PETRI_TRANSITIONS=1045} [2025-03-13 22:23:41,568 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -20 predicate places. [2025-03-13 22:23:41,569 INFO L471 AbstractCegarLoop]: Abstraction has has 1016 places, 1045 transitions, 2106 flow [2025-03-13 22:23:41,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1055.5) internal successors, (6333), 6 states have internal predecessors, (6333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:41,570 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:41,570 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] [2025-03-13 22:23:41,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-13 22:23:41,570 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err42ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-03-13 22:23:41,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:41,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1257487860, now seen corresponding path program 1 times [2025-03-13 22:23:41,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:41,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140715350] [2025-03-13 22:23:41,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:41,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:41,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-13 22:23:41,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-13 22:23:41,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:41,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:41,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:41,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:41,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140715350] [2025-03-13 22:23:41,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140715350] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:41,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:41,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:41,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876987361] [2025-03-13 22:23:41,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:41,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:41,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:41,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:41,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:41,628 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1069 out of 1105 [2025-03-13 22:23:41,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1016 places, 1045 transitions, 2106 flow. Second operand has 3 states, 3 states have (on average 1070.6666666666667) internal successors, (3212), 3 states have internal predecessors, (3212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:41,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:41,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1069 of 1105 [2025-03-13 22:23:41,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:41,908 INFO L124 PetriNetUnfolderBase]: 80/1600 cut-off events. [2025-03-13 22:23:41,908 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 22:23:41,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1681 conditions, 1600 events. 80/1600 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 8251 event pairs, 14 based on Foata normal form. 0/1300 useless extension candidates. Maximal degree in co-relation 1663. Up to 43 conditions per place. [2025-03-13 22:23:41,954 INFO L140 encePairwiseOnDemand]: 1102/1105 looper letters, 16 selfloop transitions, 2 changer transitions 0/1046 dead transitions. [2025-03-13 22:23:41,954 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1017 places, 1046 transitions, 2146 flow [2025-03-13 22:23:41,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:41,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:41,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3226 transitions. [2025-03-13 22:23:41,959 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9731523378582202 [2025-03-13 22:23:41,959 INFO L175 Difference]: Start difference. First operand has 1016 places, 1045 transitions, 2106 flow. Second operand 3 states and 3226 transitions. [2025-03-13 22:23:41,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1017 places, 1046 transitions, 2146 flow [2025-03-13 22:23:41,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1012 places, 1046 transitions, 2136 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:23:41,969 INFO L231 Difference]: Finished difference. Result has 1012 places, 1044 transitions, 2098 flow [2025-03-13 22:23:41,970 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1105, PETRI_DIFFERENCE_MINUEND_FLOW=2094, PETRI_DIFFERENCE_MINUEND_PLACES=1010, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1044, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1042, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2098, PETRI_PLACES=1012, PETRI_TRANSITIONS=1044} [2025-03-13 22:23:41,971 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -24 predicate places. [2025-03-13 22:23:41,971 INFO L471 AbstractCegarLoop]: Abstraction has has 1012 places, 1044 transitions, 2098 flow [2025-03-13 22:23:41,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1070.6666666666667) internal successors, (3212), 3 states have internal predecessors, (3212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:41,971 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:41,972 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:23:41,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-13 22:23:41,972 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err41ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-03-13 22:23:41,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:41,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1022322689, now seen corresponding path program 1 times [2025-03-13 22:23:41,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:41,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175571309] [2025-03-13 22:23:41,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:41,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:41,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-13 22:23:41,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-13 22:23:41,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:41,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:42,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:42,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:42,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175571309] [2025-03-13 22:23:42,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175571309] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:42,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:42,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:42,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704749720] [2025-03-13 22:23:42,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:42,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:42,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:42,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:42,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:42,060 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1063 out of 1105 [2025-03-13 22:23:42,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1012 places, 1044 transitions, 2098 flow. Second operand has 3 states, 3 states have (on average 1064.6666666666667) internal successors, (3194), 3 states have internal predecessors, (3194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:42,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:42,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1063 of 1105 [2025-03-13 22:23:42,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:42,465 INFO L124 PetriNetUnfolderBase]: 116/2150 cut-off events. [2025-03-13 22:23:42,465 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 22:23:42,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2270 conditions, 2150 events. 116/2150 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 13232 event pairs, 26 based on Foata normal form. 0/1736 useless extension candidates. Maximal degree in co-relation 2058. Up to 73 conditions per place. [2025-03-13 22:23:42,531 INFO L140 encePairwiseOnDemand]: 1102/1105 looper letters, 22 selfloop transitions, 2 changer transitions 0/1045 dead transitions. [2025-03-13 22:23:42,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1013 places, 1045 transitions, 2150 flow [2025-03-13 22:23:42,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:42,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:42,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3214 transitions. [2025-03-13 22:23:42,534 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9695324283559578 [2025-03-13 22:23:42,534 INFO L175 Difference]: Start difference. First operand has 1012 places, 1044 transitions, 2098 flow. Second operand 3 states and 3214 transitions. [2025-03-13 22:23:42,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1013 places, 1045 transitions, 2150 flow [2025-03-13 22:23:42,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1011 places, 1045 transitions, 2146 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:23:42,546 INFO L231 Difference]: Finished difference. Result has 1011 places, 1043 transitions, 2096 flow [2025-03-13 22:23:42,547 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1105, PETRI_DIFFERENCE_MINUEND_FLOW=2092, PETRI_DIFFERENCE_MINUEND_PLACES=1009, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1043, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1041, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2096, PETRI_PLACES=1011, PETRI_TRANSITIONS=1043} [2025-03-13 22:23:42,547 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -25 predicate places. [2025-03-13 22:23:42,547 INFO L471 AbstractCegarLoop]: Abstraction has has 1011 places, 1043 transitions, 2096 flow [2025-03-13 22:23:42,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1064.6666666666667) internal successors, (3194), 3 states have internal predecessors, (3194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:42,548 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:42,548 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] [2025-03-13 22:23:42,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-13 22:23:42,548 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err42ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-03-13 22:23:42,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:42,549 INFO L85 PathProgramCache]: Analyzing trace with hash 967020205, now seen corresponding path program 1 times [2025-03-13 22:23:42,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:42,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341932029] [2025-03-13 22:23:42,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:42,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:42,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-13 22:23:42,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-13 22:23:42,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:42,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:42,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:42,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:42,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341932029] [2025-03-13 22:23:42,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341932029] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:42,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:42,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:42,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855051582] [2025-03-13 22:23:42,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:42,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:42,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:42,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:42,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:42,617 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1069 out of 1105 [2025-03-13 22:23:42,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1011 places, 1043 transitions, 2096 flow. Second operand has 3 states, 3 states have (on average 1071.0) internal successors, (3213), 3 states have internal predecessors, (3213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:42,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:42,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1069 of 1105 [2025-03-13 22:23:42,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:42,980 INFO L124 PetriNetUnfolderBase]: 92/1872 cut-off events. [2025-03-13 22:23:42,980 INFO L125 PetriNetUnfolderBase]: For 11/36 co-relation queries the response was YES. [2025-03-13 22:23:43,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1941 conditions, 1872 events. 92/1872 cut-off events. For 11/36 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 10177 event pairs, 4 based on Foata normal form. 0/1512 useless extension candidates. Maximal degree in co-relation 1724. Up to 43 conditions per place. [2025-03-13 22:23:43,043 INFO L140 encePairwiseOnDemand]: 1102/1105 looper letters, 16 selfloop transitions, 2 changer transitions 0/1044 dead transitions. [2025-03-13 22:23:43,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1012 places, 1044 transitions, 2136 flow [2025-03-13 22:23:43,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:43,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:43,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3226 transitions. [2025-03-13 22:23:43,046 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9731523378582202 [2025-03-13 22:23:43,046 INFO L175 Difference]: Start difference. First operand has 1011 places, 1043 transitions, 2096 flow. Second operand 3 states and 3226 transitions. [2025-03-13 22:23:43,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1012 places, 1044 transitions, 2136 flow [2025-03-13 22:23:43,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1010 places, 1044 transitions, 2132 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:23:43,054 INFO L231 Difference]: Finished difference. Result has 1010 places, 1042 transitions, 2094 flow [2025-03-13 22:23:43,055 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1105, PETRI_DIFFERENCE_MINUEND_FLOW=2090, PETRI_DIFFERENCE_MINUEND_PLACES=1008, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1042, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1040, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2094, PETRI_PLACES=1010, PETRI_TRANSITIONS=1042} [2025-03-13 22:23:43,055 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -26 predicate places. [2025-03-13 22:23:43,055 INFO L471 AbstractCegarLoop]: Abstraction has has 1010 places, 1042 transitions, 2094 flow [2025-03-13 22:23:43,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1071.0) internal successors, (3213), 3 states have internal predecessors, (3213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:43,056 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:43,056 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] [2025-03-13 22:23:43,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-13 22:23:43,056 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err40ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-03-13 22:23:43,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:43,057 INFO L85 PathProgramCache]: Analyzing trace with hash -399956367, now seen corresponding path program 1 times [2025-03-13 22:23:43,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:43,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641562777] [2025-03-13 22:23:43,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:43,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:43,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-13 22:23:43,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-13 22:23:43,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:43,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:43,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:43,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:43,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641562777] [2025-03-13 22:23:43,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641562777] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:43,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:43,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:43,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224704643] [2025-03-13 22:23:43,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:43,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:43,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:43,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:43,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:43,111 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1049 out of 1105 [2025-03-13 22:23:43,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1010 places, 1042 transitions, 2094 flow. Second operand has 3 states, 3 states have (on average 1050.3333333333333) internal successors, (3151), 3 states have internal predecessors, (3151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:43,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:43,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1049 of 1105 [2025-03-13 22:23:43,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:44,321 INFO L124 PetriNetUnfolderBase]: 431/5961 cut-off events. [2025-03-13 22:23:44,321 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2025-03-13 22:23:44,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6335 conditions, 5961 events. 431/5961 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 48682 event pairs, 110 based on Foata normal form. 0/4770 useless extension candidates. Maximal degree in co-relation 5821. Up to 342 conditions per place. [2025-03-13 22:23:44,526 INFO L140 encePairwiseOnDemand]: 1093/1105 looper letters, 29 selfloop transitions, 2 changer transitions 0/1036 dead transitions. [2025-03-13 22:23:44,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1002 places, 1036 transitions, 2146 flow [2025-03-13 22:23:44,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:44,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:44,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3188 transitions. [2025-03-13 22:23:44,528 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9616892911010558 [2025-03-13 22:23:44,528 INFO L175 Difference]: Start difference. First operand has 1010 places, 1042 transitions, 2094 flow. Second operand 3 states and 3188 transitions. [2025-03-13 22:23:44,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1002 places, 1036 transitions, 2146 flow [2025-03-13 22:23:44,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1000 places, 1036 transitions, 2142 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:23:44,537 INFO L231 Difference]: Finished difference. Result has 1001 places, 1034 transitions, 2084 flow [2025-03-13 22:23:44,538 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1105, PETRI_DIFFERENCE_MINUEND_FLOW=2070, PETRI_DIFFERENCE_MINUEND_PLACES=998, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1032, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1030, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2084, PETRI_PLACES=1001, PETRI_TRANSITIONS=1034} [2025-03-13 22:23:44,538 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -35 predicate places. [2025-03-13 22:23:44,538 INFO L471 AbstractCegarLoop]: Abstraction has has 1001 places, 1034 transitions, 2084 flow [2025-03-13 22:23:44,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1050.3333333333333) internal successors, (3151), 3 states have internal predecessors, (3151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:44,539 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:44,539 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] [2025-03-13 22:23:44,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-13 22:23:44,539 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err39ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-03-13 22:23:44,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:44,540 INFO L85 PathProgramCache]: Analyzing trace with hash -2105909102, now seen corresponding path program 1 times [2025-03-13 22:23:44,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:44,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670462534] [2025-03-13 22:23:44,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:44,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:44,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-13 22:23:44,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-13 22:23:44,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:44,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:44,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:44,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:44,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670462534] [2025-03-13 22:23:44,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670462534] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:44,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:44,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:44,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630441476] [2025-03-13 22:23:44,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:44,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:44,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:44,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:44,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:44,592 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1049 out of 1105 [2025-03-13 22:23:44,594 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1001 places, 1034 transitions, 2084 flow. Second operand has 3 states, 3 states have (on average 1050.3333333333333) internal successors, (3151), 3 states have internal predecessors, (3151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:44,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:44,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1049 of 1105 [2025-03-13 22:23:44,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:46,626 INFO L124 PetriNetUnfolderBase]: 859/10615 cut-off events. [2025-03-13 22:23:46,626 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-03-13 22:23:46,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11421 conditions, 10615 events. 859/10615 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 101407 event pairs, 190 based on Foata normal form. 0/8539 useless extension candidates. Maximal degree in co-relation 10945. Up to 660 conditions per place. [2025-03-13 22:23:46,894 INFO L140 encePairwiseOnDemand]: 1093/1105 looper letters, 29 selfloop transitions, 2 changer transitions 0/1028 dead transitions. [2025-03-13 22:23:46,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 993 places, 1028 transitions, 2136 flow [2025-03-13 22:23:46,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:46,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:46,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3188 transitions. [2025-03-13 22:23:46,896 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9616892911010558 [2025-03-13 22:23:46,896 INFO L175 Difference]: Start difference. First operand has 1001 places, 1034 transitions, 2084 flow. Second operand 3 states and 3188 transitions. [2025-03-13 22:23:46,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 993 places, 1028 transitions, 2136 flow [2025-03-13 22:23:46,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 993 places, 1028 transitions, 2136 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:23:46,905 INFO L231 Difference]: Finished difference. Result has 994 places, 1026 transitions, 2078 flow [2025-03-13 22:23:46,905 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1105, PETRI_DIFFERENCE_MINUEND_FLOW=2064, PETRI_DIFFERENCE_MINUEND_PLACES=991, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1024, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1022, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2078, PETRI_PLACES=994, PETRI_TRANSITIONS=1026} [2025-03-13 22:23:46,906 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -42 predicate places. [2025-03-13 22:23:46,906 INFO L471 AbstractCegarLoop]: Abstraction has has 994 places, 1026 transitions, 2078 flow [2025-03-13 22:23:46,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1050.3333333333333) internal successors, (3151), 3 states have internal predecessors, (3151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:46,907 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:46,907 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:23:46,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-13 22:23:46,907 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err41ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-03-13 22:23:46,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:46,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1470534611, now seen corresponding path program 1 times [2025-03-13 22:23:46,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:46,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656264677] [2025-03-13 22:23:46,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:46,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:46,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-03-13 22:23:46,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-03-13 22:23:46,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:46,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:46,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:46,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:46,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656264677] [2025-03-13 22:23:46,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656264677] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:46,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:46,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:46,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987859540] [2025-03-13 22:23:46,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:46,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:46,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:46,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:46,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:46,974 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1063 out of 1105 [2025-03-13 22:23:46,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 994 places, 1026 transitions, 2078 flow. Second operand has 3 states, 3 states have (on average 1065.0) internal successors, (3195), 3 states have internal predecessors, (3195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:46,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:46,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1063 of 1105 [2025-03-13 22:23:46,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:47,540 INFO L124 PetriNetUnfolderBase]: 167/2867 cut-off events. [2025-03-13 22:23:47,540 INFO L125 PetriNetUnfolderBase]: For 17/44 co-relation queries the response was YES. [2025-03-13 22:23:47,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3036 conditions, 2867 events. 167/2867 cut-off events. For 17/44 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 20454 event pairs, 26 based on Foata normal form. 0/2338 useless extension candidates. Maximal degree in co-relation 2301. Up to 106 conditions per place. [2025-03-13 22:23:47,604 INFO L140 encePairwiseOnDemand]: 1102/1105 looper letters, 22 selfloop transitions, 2 changer transitions 0/1027 dead transitions. [2025-03-13 22:23:47,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 995 places, 1027 transitions, 2130 flow [2025-03-13 22:23:47,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:47,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:47,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3214 transitions. [2025-03-13 22:23:47,606 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9695324283559578 [2025-03-13 22:23:47,606 INFO L175 Difference]: Start difference. First operand has 994 places, 1026 transitions, 2078 flow. Second operand 3 states and 3214 transitions. [2025-03-13 22:23:47,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 995 places, 1027 transitions, 2130 flow [2025-03-13 22:23:47,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 995 places, 1027 transitions, 2130 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:23:47,614 INFO L231 Difference]: Finished difference. Result has 995 places, 1025 transitions, 2080 flow [2025-03-13 22:23:47,615 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1105, PETRI_DIFFERENCE_MINUEND_FLOW=2076, PETRI_DIFFERENCE_MINUEND_PLACES=993, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1025, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1023, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2080, PETRI_PLACES=995, PETRI_TRANSITIONS=1025} [2025-03-13 22:23:47,615 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -41 predicate places. [2025-03-13 22:23:47,615 INFO L471 AbstractCegarLoop]: Abstraction has has 995 places, 1025 transitions, 2080 flow [2025-03-13 22:23:47,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1065.0) internal successors, (3195), 3 states have internal predecessors, (3195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:47,616 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:47,616 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] [2025-03-13 22:23:47,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-13 22:23:47,616 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread3Err42ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-03-13 22:23:47,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:47,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1891282210, now seen corresponding path program 1 times [2025-03-13 22:23:47,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:47,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449867264] [2025-03-13 22:23:47,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:47,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:47,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-13 22:23:47,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-13 22:23:47,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:47,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:47,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:47,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:47,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449867264] [2025-03-13 22:23:47,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449867264] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:47,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:47,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:47,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381242750] [2025-03-13 22:23:47,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:47,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:47,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:47,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:47,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:47,667 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1069 out of 1105 [2025-03-13 22:23:47,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 995 places, 1025 transitions, 2080 flow. Second operand has 3 states, 3 states have (on average 1071.3333333333333) internal successors, (3214), 3 states have internal predecessors, (3214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:47,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:47,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1069 of 1105 [2025-03-13 22:23:47,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:48,055 INFO L124 PetriNetUnfolderBase]: 106/2076 cut-off events. [2025-03-13 22:23:48,055 INFO L125 PetriNetUnfolderBase]: For 21/44 co-relation queries the response was YES. [2025-03-13 22:23:48,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2157 conditions, 2076 events. 106/2076 cut-off events. For 21/44 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 11762 event pairs, 4 based on Foata normal form. 0/1704 useless extension candidates. Maximal degree in co-relation 1930. Up to 48 conditions per place. [2025-03-13 22:23:48,120 INFO L140 encePairwiseOnDemand]: 1102/1105 looper letters, 16 selfloop transitions, 2 changer transitions 0/1026 dead transitions. [2025-03-13 22:23:48,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 996 places, 1026 transitions, 2120 flow [2025-03-13 22:23:48,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:48,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:48,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3226 transitions. [2025-03-13 22:23:48,122 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9731523378582202 [2025-03-13 22:23:48,122 INFO L175 Difference]: Start difference. First operand has 995 places, 1025 transitions, 2080 flow. Second operand 3 states and 3226 transitions. [2025-03-13 22:23:48,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 996 places, 1026 transitions, 2120 flow [2025-03-13 22:23:48,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 994 places, 1026 transitions, 2116 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:23:48,132 INFO L231 Difference]: Finished difference. Result has 994 places, 1024 transitions, 2078 flow [2025-03-13 22:23:48,132 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1105, PETRI_DIFFERENCE_MINUEND_FLOW=2074, PETRI_DIFFERENCE_MINUEND_PLACES=992, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1024, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1022, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2078, PETRI_PLACES=994, PETRI_TRANSITIONS=1024} [2025-03-13 22:23:48,133 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -42 predicate places. [2025-03-13 22:23:48,133 INFO L471 AbstractCegarLoop]: Abstraction has has 994 places, 1024 transitions, 2078 flow [2025-03-13 22:23:48,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1071.3333333333333) internal successors, (3214), 3 states have internal predecessors, (3214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:48,134 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:48,134 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] [2025-03-13 22:23:48,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-13 22:23:48,134 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err38ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-03-13 22:23:48,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:48,135 INFO L85 PathProgramCache]: Analyzing trace with hash -548581337, now seen corresponding path program 1 times [2025-03-13 22:23:48,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:48,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557718661] [2025-03-13 22:23:48,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:48,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:48,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-03-13 22:23:48,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-03-13 22:23:48,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:48,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:48,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:48,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:48,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557718661] [2025-03-13 22:23:48,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557718661] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:48,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:48,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:48,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365886770] [2025-03-13 22:23:48,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:48,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:48,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:48,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:48,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:48,193 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1060 out of 1105 [2025-03-13 22:23:48,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 994 places, 1024 transitions, 2078 flow. Second operand has 3 states, 3 states have (on average 1061.3333333333333) internal successors, (3184), 3 states have internal predecessors, (3184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:48,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:48,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1060 of 1105 [2025-03-13 22:23:48,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:48,915 INFO L124 PetriNetUnfolderBase]: 192/3769 cut-off events. [2025-03-13 22:23:48,915 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-03-13 22:23:48,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3912 conditions, 3769 events. 192/3769 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 25657 event pairs, 8 based on Foata normal form. 0/3078 useless extension candidates. Maximal degree in co-relation 3434. Up to 42 conditions per place. [2025-03-13 22:23:49,027 INFO L140 encePairwiseOnDemand]: 1091/1105 looper letters, 18 selfloop transitions, 9 changer transitions 0/1025 dead transitions. [2025-03-13 22:23:49,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 991 places, 1025 transitions, 2136 flow [2025-03-13 22:23:49,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:49,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:49,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3212 transitions. [2025-03-13 22:23:49,029 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9689291101055807 [2025-03-13 22:23:49,029 INFO L175 Difference]: Start difference. First operand has 994 places, 1024 transitions, 2078 flow. Second operand 3 states and 3212 transitions. [2025-03-13 22:23:49,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 991 places, 1025 transitions, 2136 flow [2025-03-13 22:23:49,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 989 places, 1025 transitions, 2132 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:23:49,038 INFO L231 Difference]: Finished difference. Result has 990 places, 1023 transitions, 2107 flow [2025-03-13 22:23:49,038 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1105, PETRI_DIFFERENCE_MINUEND_FLOW=2064, PETRI_DIFFERENCE_MINUEND_PLACES=987, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1019, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1010, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2107, PETRI_PLACES=990, PETRI_TRANSITIONS=1023} [2025-03-13 22:23:49,039 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -46 predicate places. [2025-03-13 22:23:49,039 INFO L471 AbstractCegarLoop]: Abstraction has has 990 places, 1023 transitions, 2107 flow [2025-03-13 22:23:49,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1061.3333333333333) internal successors, (3184), 3 states have internal predecessors, (3184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:49,040 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:49,040 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] [2025-03-13 22:23:49,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-13 22:23:49,040 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread1Err37ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-03-13 22:23:49,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:49,041 INFO L85 PathProgramCache]: Analyzing trace with hash -463442120, now seen corresponding path program 1 times [2025-03-13 22:23:49,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:49,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089407382] [2025-03-13 22:23:49,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:49,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:49,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-13 22:23:49,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-13 22:23:49,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:49,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:49,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:49,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:49,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089407382] [2025-03-13 22:23:49,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089407382] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:49,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:49,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:49,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188670103] [2025-03-13 22:23:49,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:49,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:49,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:49,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:49,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:49,103 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1066 out of 1105 [2025-03-13 22:23:49,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 990 places, 1023 transitions, 2107 flow. Second operand has 3 states, 3 states have (on average 1067.6666666666667) internal successors, (3203), 3 states have internal predecessors, (3203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:49,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:49,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1066 of 1105 [2025-03-13 22:23:49,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:49,737 INFO L124 PetriNetUnfolderBase]: 184/3664 cut-off events. [2025-03-13 22:23:49,737 INFO L125 PetriNetUnfolderBase]: For 61/77 co-relation queries the response was YES. [2025-03-13 22:23:49,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3844 conditions, 3664 events. 184/3664 cut-off events. For 61/77 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 28373 event pairs, 20 based on Foata normal form. 1/3008 useless extension candidates. Maximal degree in co-relation 3365. Up to 68 conditions per place. [2025-03-13 22:23:49,837 INFO L140 encePairwiseOnDemand]: 1102/1105 looper letters, 22 selfloop transitions, 3 changer transitions 0/1024 dead transitions. [2025-03-13 22:23:49,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 991 places, 1024 transitions, 2161 flow [2025-03-13 22:23:49,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:49,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:49,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3220 transitions. [2025-03-13 22:23:49,839 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.971342383107089 [2025-03-13 22:23:49,839 INFO L175 Difference]: Start difference. First operand has 990 places, 1023 transitions, 2107 flow. Second operand 3 states and 3220 transitions. [2025-03-13 22:23:49,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 991 places, 1024 transitions, 2161 flow [2025-03-13 22:23:49,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 990 places, 1024 transitions, 2152 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:23:49,848 INFO L231 Difference]: Finished difference. Result has 990 places, 1022 transitions, 2102 flow [2025-03-13 22:23:49,849 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1105, PETRI_DIFFERENCE_MINUEND_FLOW=2096, PETRI_DIFFERENCE_MINUEND_PLACES=988, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1022, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1019, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2102, PETRI_PLACES=990, PETRI_TRANSITIONS=1022} [2025-03-13 22:23:49,849 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -46 predicate places. [2025-03-13 22:23:49,849 INFO L471 AbstractCegarLoop]: Abstraction has has 990 places, 1022 transitions, 2102 flow [2025-03-13 22:23:49,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1067.6666666666667) internal successors, (3203), 3 states have internal predecessors, (3203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:49,850 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:49,850 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] [2025-03-13 22:23:49,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-13 22:23:49,850 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread2Err39ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-03-13 22:23:49,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:49,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1290679571, now seen corresponding path program 1 times [2025-03-13 22:23:49,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:49,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441914116] [2025-03-13 22:23:49,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:49,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:49,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-13 22:23:49,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-13 22:23:49,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:49,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:49,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:49,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:49,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441914116] [2025-03-13 22:23:49,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441914116] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:49,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:49,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:49,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765532597] [2025-03-13 22:23:49,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:49,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:49,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:49,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:49,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:49,912 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1049 out of 1105 [2025-03-13 22:23:49,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 990 places, 1022 transitions, 2102 flow. Second operand has 3 states, 3 states have (on average 1050.6666666666667) internal successors, (3152), 3 states have internal predecessors, (3152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:49,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:49,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1049 of 1105 [2025-03-13 22:23:49,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:53,215 INFO L124 PetriNetUnfolderBase]: 1561/19942 cut-off events. [2025-03-13 22:23:53,215 INFO L125 PetriNetUnfolderBase]: For 144/150 co-relation queries the response was YES. [2025-03-13 22:23:53,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21179 conditions, 19942 events. 1561/19942 cut-off events. For 144/150 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 223318 event pairs, 488 based on Foata normal form. 0/16094 useless extension candidates. Maximal degree in co-relation 16198. Up to 1175 conditions per place. [2025-03-13 22:23:53,780 INFO L140 encePairwiseOnDemand]: 1093/1105 looper letters, 29 selfloop transitions, 2 changer transitions 0/1016 dead transitions. [2025-03-13 22:23:53,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 982 places, 1016 transitions, 2154 flow [2025-03-13 22:23:53,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:53,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:53,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3188 transitions. [2025-03-13 22:23:53,783 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9616892911010558 [2025-03-13 22:23:53,783 INFO L175 Difference]: Start difference. First operand has 990 places, 1022 transitions, 2102 flow. Second operand 3 states and 3188 transitions. [2025-03-13 22:23:53,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 982 places, 1016 transitions, 2154 flow [2025-03-13 22:23:53,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 980 places, 1016 transitions, 2148 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:23:53,796 INFO L231 Difference]: Finished difference. Result has 981 places, 1014 transitions, 2090 flow [2025-03-13 22:23:53,797 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1105, PETRI_DIFFERENCE_MINUEND_FLOW=2076, PETRI_DIFFERENCE_MINUEND_PLACES=978, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1012, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1010, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2090, PETRI_PLACES=981, PETRI_TRANSITIONS=1014} [2025-03-13 22:23:53,798 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -55 predicate places. [2025-03-13 22:23:53,798 INFO L471 AbstractCegarLoop]: Abstraction has has 981 places, 1014 transitions, 2090 flow [2025-03-13 22:23:53,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1050.6666666666667) internal successors, (3152), 3 states have internal predecessors, (3152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:53,799 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:53,799 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:23:53,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-13 22:23:53,799 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread3Err41ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-03-13 22:23:53,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:53,800 INFO L85 PathProgramCache]: Analyzing trace with hash -4537773, now seen corresponding path program 1 times [2025-03-13 22:23:53,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:53,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614484790] [2025-03-13 22:23:53,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:53,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:53,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-13 22:23:53,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-13 22:23:53,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:53,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:53,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:53,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:53,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614484790] [2025-03-13 22:23:53,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614484790] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:53,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:53,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:53,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977456401] [2025-03-13 22:23:53,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:53,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:53,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:53,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:53,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:53,889 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1063 out of 1105 [2025-03-13 22:23:53,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 981 places, 1014 transitions, 2090 flow. Second operand has 3 states, 3 states have (on average 1065.3333333333333) internal successors, (3196), 3 states have internal predecessors, (3196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:53,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:53,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1063 of 1105 [2025-03-13 22:23:53,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:54,636 INFO L124 PetriNetUnfolderBase]: 181/3054 cut-off events. [2025-03-13 22:23:54,636 INFO L125 PetriNetUnfolderBase]: For 44/56 co-relation queries the response was YES. [2025-03-13 22:23:54,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3257 conditions, 3054 events. 181/3054 cut-off events. For 44/56 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 22176 event pairs, 37 based on Foata normal form. 1/2533 useless extension candidates. Maximal degree in co-relation 2509. Up to 139 conditions per place. [2025-03-13 22:23:54,718 INFO L140 encePairwiseOnDemand]: 1102/1105 looper letters, 22 selfloop transitions, 2 changer transitions 0/1015 dead transitions. [2025-03-13 22:23:54,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 982 places, 1015 transitions, 2142 flow [2025-03-13 22:23:54,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:54,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:54,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3214 transitions. [2025-03-13 22:23:54,722 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9695324283559578 [2025-03-13 22:23:54,722 INFO L175 Difference]: Start difference. First operand has 981 places, 1014 transitions, 2090 flow. Second operand 3 states and 3214 transitions. [2025-03-13 22:23:54,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 982 places, 1015 transitions, 2142 flow [2025-03-13 22:23:54,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 982 places, 1015 transitions, 2142 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:23:54,732 INFO L231 Difference]: Finished difference. Result has 982 places, 1013 transitions, 2092 flow [2025-03-13 22:23:54,733 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1105, PETRI_DIFFERENCE_MINUEND_FLOW=2088, PETRI_DIFFERENCE_MINUEND_PLACES=980, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1013, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1011, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2092, PETRI_PLACES=982, PETRI_TRANSITIONS=1013} [2025-03-13 22:23:54,734 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -54 predicate places. [2025-03-13 22:23:54,734 INFO L471 AbstractCegarLoop]: Abstraction has has 982 places, 1013 transitions, 2092 flow [2025-03-13 22:23:54,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1065.3333333333333) internal successors, (3196), 3 states have internal predecessors, (3196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:54,734 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:54,735 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] [2025-03-13 22:23:54,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-13 22:23:54,735 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread2Err38ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-03-13 22:23:54,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:54,736 INFO L85 PathProgramCache]: Analyzing trace with hash 2090324603, now seen corresponding path program 1 times [2025-03-13 22:23:54,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:54,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601107283] [2025-03-13 22:23:54,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:54,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:54,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-13 22:23:54,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-13 22:23:54,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:54,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:54,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:54,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:54,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601107283] [2025-03-13 22:23:54,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601107283] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:54,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:54,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:54,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71808151] [2025-03-13 22:23:54,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:54,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:54,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:54,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:54,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:54,795 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1060 out of 1105 [2025-03-13 22:23:54,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 982 places, 1013 transitions, 2092 flow. Second operand has 3 states, 3 states have (on average 1061.6666666666667) internal successors, (3185), 3 states have internal predecessors, (3185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:54,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:54,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1060 of 1105 [2025-03-13 22:23:54,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:55,782 INFO L124 PetriNetUnfolderBase]: 298/5501 cut-off events. [2025-03-13 22:23:55,783 INFO L125 PetriNetUnfolderBase]: For 14/28 co-relation queries the response was YES. [2025-03-13 22:23:55,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5749 conditions, 5501 events. 298/5501 cut-off events. For 14/28 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 45043 event pairs, 15 based on Foata normal form. 0/4550 useless extension candidates. Maximal degree in co-relation 5383. Up to 66 conditions per place. [2025-03-13 22:23:55,878 INFO L140 encePairwiseOnDemand]: 1091/1105 looper letters, 18 selfloop transitions, 9 changer transitions 0/1014 dead transitions. [2025-03-13 22:23:55,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 979 places, 1014 transitions, 2150 flow [2025-03-13 22:23:55,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:55,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:55,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3212 transitions. [2025-03-13 22:23:55,880 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9689291101055807 [2025-03-13 22:23:55,880 INFO L175 Difference]: Start difference. First operand has 982 places, 1013 transitions, 2092 flow. Second operand 3 states and 3212 transitions. [2025-03-13 22:23:55,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 979 places, 1014 transitions, 2150 flow [2025-03-13 22:23:55,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 977 places, 1014 transitions, 2146 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:23:55,895 INFO L231 Difference]: Finished difference. Result has 978 places, 1012 transitions, 2121 flow [2025-03-13 22:23:55,896 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1105, PETRI_DIFFERENCE_MINUEND_FLOW=2078, PETRI_DIFFERENCE_MINUEND_PLACES=975, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1008, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=999, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2121, PETRI_PLACES=978, PETRI_TRANSITIONS=1012} [2025-03-13 22:23:55,896 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -58 predicate places. [2025-03-13 22:23:55,896 INFO L471 AbstractCegarLoop]: Abstraction has has 978 places, 1012 transitions, 2121 flow [2025-03-13 22:23:55,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1061.6666666666667) internal successors, (3185), 3 states have internal predecessors, (3185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:55,897 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:55,897 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:23:55,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-13 22:23:55,897 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread2Err37ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-03-13 22:23:55,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:55,898 INFO L85 PathProgramCache]: Analyzing trace with hash 102305497, now seen corresponding path program 1 times [2025-03-13 22:23:55,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:55,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148760907] [2025-03-13 22:23:55,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:55,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:55,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-13 22:23:55,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-13 22:23:55,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:55,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:55,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:55,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:55,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148760907] [2025-03-13 22:23:55,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148760907] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:55,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:55,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:55,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749408693] [2025-03-13 22:23:55,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:55,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:55,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:55,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:55,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:55,973 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1066 out of 1105 [2025-03-13 22:23:55,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 978 places, 1012 transitions, 2121 flow. Second operand has 3 states, 3 states have (on average 1068.0) internal successors, (3204), 3 states have internal predecessors, (3204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:55,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:55,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1066 of 1105 [2025-03-13 22:23:55,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:56,889 INFO L124 PetriNetUnfolderBase]: 285/5369 cut-off events. [2025-03-13 22:23:56,889 INFO L125 PetriNetUnfolderBase]: For 113/166 co-relation queries the response was YES. [2025-03-13 22:23:56,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5672 conditions, 5369 events. 285/5369 cut-off events. For 113/166 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 47616 event pairs, 30 based on Foata normal form. 0/4449 useless extension candidates. Maximal degree in co-relation 5079. Up to 104 conditions per place. [2025-03-13 22:23:57,029 INFO L140 encePairwiseOnDemand]: 1102/1105 looper letters, 22 selfloop transitions, 3 changer transitions 0/1013 dead transitions. [2025-03-13 22:23:57,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 979 places, 1013 transitions, 2175 flow [2025-03-13 22:23:57,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:57,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:57,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3220 transitions. [2025-03-13 22:23:57,031 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.971342383107089 [2025-03-13 22:23:57,031 INFO L175 Difference]: Start difference. First operand has 978 places, 1012 transitions, 2121 flow. Second operand 3 states and 3220 transitions. [2025-03-13 22:23:57,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 979 places, 1013 transitions, 2175 flow [2025-03-13 22:23:57,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 978 places, 1013 transitions, 2166 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:23:57,041 INFO L231 Difference]: Finished difference. Result has 978 places, 1011 transitions, 2116 flow [2025-03-13 22:23:57,042 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1105, PETRI_DIFFERENCE_MINUEND_FLOW=2110, PETRI_DIFFERENCE_MINUEND_PLACES=976, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1011, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1008, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2116, PETRI_PLACES=978, PETRI_TRANSITIONS=1011} [2025-03-13 22:23:57,043 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -58 predicate places. [2025-03-13 22:23:57,043 INFO L471 AbstractCegarLoop]: Abstraction has has 978 places, 1011 transitions, 2116 flow [2025-03-13 22:23:57,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1068.0) internal successors, (3204), 3 states have internal predecessors, (3204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:57,043 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:57,043 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:23:57,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-13 22:23:57,043 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread1Err34ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-03-13 22:23:57,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:57,044 INFO L85 PathProgramCache]: Analyzing trace with hash -940251246, now seen corresponding path program 1 times [2025-03-13 22:23:57,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:57,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247267635] [2025-03-13 22:23:57,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:57,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:57,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-03-13 22:23:57,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-03-13 22:23:57,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:57,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:57,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:57,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:57,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247267635] [2025-03-13 22:23:57,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247267635] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:57,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:57,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 22:23:57,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353895957] [2025-03-13 22:23:57,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:57,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:57,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:57,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:57,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:57,107 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1072 out of 1105 [2025-03-13 22:23:57,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 978 places, 1011 transitions, 2116 flow. Second operand has 3 states, 3 states have (on average 1074.3333333333333) internal successors, (3223), 3 states have internal predecessors, (3223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:57,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:57,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1072 of 1105 [2025-03-13 22:23:57,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:58,087 INFO L124 PetriNetUnfolderBase]: 215/4587 cut-off events. [2025-03-13 22:23:58,087 INFO L125 PetriNetUnfolderBase]: For 12/22 co-relation queries the response was YES. [2025-03-13 22:23:58,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4789 conditions, 4587 events. 215/4587 cut-off events. For 12/22 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 38385 event pairs, 4 based on Foata normal form. 1/3825 useless extension candidates. Maximal degree in co-relation 4058. Up to 33 conditions per place. [2025-03-13 22:23:58,177 INFO L140 encePairwiseOnDemand]: 1102/1105 looper letters, 18 selfloop transitions, 2 changer transitions 0/1017 dead transitions. [2025-03-13 22:23:58,177 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 980 places, 1017 transitions, 2173 flow [2025-03-13 22:23:58,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:58,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:58,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3237 transitions. [2025-03-13 22:23:58,178 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9764705882352941 [2025-03-13 22:23:58,179 INFO L175 Difference]: Start difference. First operand has 978 places, 1011 transitions, 2116 flow. Second operand 3 states and 3237 transitions. [2025-03-13 22:23:58,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 980 places, 1017 transitions, 2173 flow [2025-03-13 22:23:58,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 978 places, 1017 transitions, 2167 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:23:58,187 INFO L231 Difference]: Finished difference. Result has 980 places, 1012 transitions, 2124 flow [2025-03-13 22:23:58,188 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1105, PETRI_DIFFERENCE_MINUEND_FLOW=2110, PETRI_DIFFERENCE_MINUEND_PLACES=976, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1011, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1009, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2124, PETRI_PLACES=980, PETRI_TRANSITIONS=1012} [2025-03-13 22:23:58,188 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -56 predicate places. [2025-03-13 22:23:58,188 INFO L471 AbstractCegarLoop]: Abstraction has has 980 places, 1012 transitions, 2124 flow [2025-03-13 22:23:58,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1074.3333333333333) internal successors, (3223), 3 states have internal predecessors, (3223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:58,189 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:58,189 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:23:58,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-13 22:23:58,189 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread3Err38ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-03-13 22:23:58,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:58,189 INFO L85 PathProgramCache]: Analyzing trace with hash -888595589, now seen corresponding path program 1 times [2025-03-13 22:23:58,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:58,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551906231] [2025-03-13 22:23:58,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:58,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:58,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-03-13 22:23:58,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-03-13 22:23:58,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:58,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:58,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:58,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:58,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551906231] [2025-03-13 22:23:58,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551906231] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:58,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:58,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:58,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167233495] [2025-03-13 22:23:58,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:58,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:58,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:58,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:58,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:58,245 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1060 out of 1105 [2025-03-13 22:23:58,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 980 places, 1012 transitions, 2124 flow. Second operand has 3 states, 3 states have (on average 1062.0) internal successors, (3186), 3 states have internal predecessors, (3186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:58,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:58,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1060 of 1105 [2025-03-13 22:23:58,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:59,026 INFO L124 PetriNetUnfolderBase]: 255/4099 cut-off events. [2025-03-13 22:23:59,026 INFO L125 PetriNetUnfolderBase]: For 70/86 co-relation queries the response was YES. [2025-03-13 22:23:59,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4454 conditions, 4099 events. 255/4099 cut-off events. For 70/86 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 32529 event pairs, 42 based on Foata normal form. 5/3438 useless extension candidates. Maximal degree in co-relation 3677. Up to 140 conditions per place. [2025-03-13 22:23:59,143 INFO L140 encePairwiseOnDemand]: 1091/1105 looper letters, 16 selfloop transitions, 8 changer transitions 12/1013 dead transitions. [2025-03-13 22:23:59,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 977 places, 1013 transitions, 2180 flow [2025-03-13 22:23:59,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:59,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:59,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3211 transitions. [2025-03-13 22:23:59,145 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9686274509803922 [2025-03-13 22:23:59,145 INFO L175 Difference]: Start difference. First operand has 980 places, 1012 transitions, 2124 flow. Second operand 3 states and 3211 transitions. [2025-03-13 22:23:59,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 977 places, 1013 transitions, 2180 flow [2025-03-13 22:23:59,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 976 places, 1013 transitions, 2178 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:23:59,154 INFO L231 Difference]: Finished difference. Result has 977 places, 999 transitions, 2123 flow [2025-03-13 22:23:59,154 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1105, PETRI_DIFFERENCE_MINUEND_FLOW=2112, PETRI_DIFFERENCE_MINUEND_PLACES=974, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1007, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=999, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2123, PETRI_PLACES=977, PETRI_TRANSITIONS=999} [2025-03-13 22:23:59,155 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -59 predicate places. [2025-03-13 22:23:59,155 INFO L471 AbstractCegarLoop]: Abstraction has has 977 places, 999 transitions, 2123 flow [2025-03-13 22:23:59,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1062.0) internal successors, (3186), 3 states have internal predecessors, (3186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:59,156 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:59,156 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-13 22:23:59,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-13 22:23:59,156 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting thread1Err34ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-03-13 22:23:59,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:59,156 INFO L85 PathProgramCache]: Analyzing trace with hash 348761583, now seen corresponding path program 1 times [2025-03-13 22:23:59,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:59,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424913930] [2025-03-13 22:23:59,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:59,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:59,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-13 22:23:59,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-13 22:23:59,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:59,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:59,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:59,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:59,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424913930] [2025-03-13 22:23:59,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424913930] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:59,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:59,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:59,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212657805] [2025-03-13 22:23:59,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:59,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:59,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:59,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:59,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:59,218 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1051 out of 1105 [2025-03-13 22:23:59,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 977 places, 999 transitions, 2123 flow. Second operand has 3 states, 3 states have (on average 1052.6666666666667) internal successors, (3158), 3 states have internal predecessors, (3158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:59,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:59,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1051 of 1105 [2025-03-13 22:23:59,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:01,016 INFO L124 PetriNetUnfolderBase]: 488/9044 cut-off events. [2025-03-13 22:24:01,016 INFO L125 PetriNetUnfolderBase]: For 80/116 co-relation queries the response was YES. [2025-03-13 22:24:01,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9907 conditions, 9044 events. 488/9044 cut-off events. For 80/116 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 83211 event pairs, 14 based on Foata normal form. 2/7652 useless extension candidates. Maximal degree in co-relation 9080. Up to 166 conditions per place. [2025-03-13 22:24:01,194 INFO L140 encePairwiseOnDemand]: 1088/1105 looper letters, 23 selfloop transitions, 9 changer transitions 0/997 dead transitions. [2025-03-13 22:24:01,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 960 places, 997 transitions, 2185 flow [2025-03-13 22:24:01,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:24:01,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:24:01,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3193 transitions. [2025-03-13 22:24:01,196 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9631975867269985 [2025-03-13 22:24:01,196 INFO L175 Difference]: Start difference. First operand has 977 places, 999 transitions, 2123 flow. Second operand 3 states and 3193 transitions. [2025-03-13 22:24:01,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 960 places, 997 transitions, 2185 flow [2025-03-13 22:24:01,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 959 places, 997 transitions, 2177 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:24:01,206 INFO L231 Difference]: Finished difference. Result has 961 places, 995 transitions, 2151 flow [2025-03-13 22:24:01,207 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1105, PETRI_DIFFERENCE_MINUEND_FLOW=2099, PETRI_DIFFERENCE_MINUEND_PLACES=957, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=991, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=982, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2151, PETRI_PLACES=961, PETRI_TRANSITIONS=995} [2025-03-13 22:24:01,207 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -75 predicate places. [2025-03-13 22:24:01,207 INFO L471 AbstractCegarLoop]: Abstraction has has 961 places, 995 transitions, 2151 flow [2025-03-13 22:24:01,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1052.6666666666667) internal successors, (3158), 3 states have internal predecessors, (3158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:01,207 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:01,208 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:24:01,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-13 22:24:01,208 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting thread1Err33ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-03-13 22:24:01,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:01,208 INFO L85 PathProgramCache]: Analyzing trace with hash 724461953, now seen corresponding path program 1 times [2025-03-13 22:24:01,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:01,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13342560] [2025-03-13 22:24:01,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:01,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:01,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-13 22:24:01,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-13 22:24:01,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:01,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:01,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:24:01,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:01,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13342560] [2025-03-13 22:24:01,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13342560] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:01,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:01,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:24:01,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988293615] [2025-03-13 22:24:01,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:01,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:24:01,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:01,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:24:01,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:24:01,277 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1063 out of 1105 [2025-03-13 22:24:01,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 961 places, 995 transitions, 2151 flow. Second operand has 3 states, 3 states have (on average 1065.0) internal successors, (3195), 3 states have internal predecessors, (3195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:01,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:01,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1063 of 1105 [2025-03-13 22:24:01,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:02,782 INFO L124 PetriNetUnfolderBase]: 367/7058 cut-off events. [2025-03-13 22:24:02,783 INFO L125 PetriNetUnfolderBase]: For 166/204 co-relation queries the response was YES. [2025-03-13 22:24:02,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7780 conditions, 7058 events. 367/7058 cut-off events. For 166/204 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 68175 event pairs, 48 based on Foata normal form. 2/5984 useless extension candidates. Maximal degree in co-relation 6211. Up to 147 conditions per place. [2025-03-13 22:24:03,109 INFO L140 encePairwiseOnDemand]: 1102/1105 looper letters, 24 selfloop transitions, 3 changer transitions 0/996 dead transitions. [2025-03-13 22:24:03,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 962 places, 996 transitions, 2209 flow [2025-03-13 22:24:03,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:24:03,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:24:03,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3213 transitions. [2025-03-13 22:24:03,112 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9692307692307692 [2025-03-13 22:24:03,112 INFO L175 Difference]: Start difference. First operand has 961 places, 995 transitions, 2151 flow. Second operand 3 states and 3213 transitions. [2025-03-13 22:24:03,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 962 places, 996 transitions, 2209 flow [2025-03-13 22:24:03,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 960 places, 996 transitions, 2191 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:24:03,123 INFO L231 Difference]: Finished difference. Result has 960 places, 994 transitions, 2137 flow [2025-03-13 22:24:03,124 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1105, PETRI_DIFFERENCE_MINUEND_FLOW=2131, PETRI_DIFFERENCE_MINUEND_PLACES=958, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=994, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=991, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2137, PETRI_PLACES=960, PETRI_TRANSITIONS=994} [2025-03-13 22:24:03,124 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -76 predicate places. [2025-03-13 22:24:03,124 INFO L471 AbstractCegarLoop]: Abstraction has has 960 places, 994 transitions, 2137 flow [2025-03-13 22:24:03,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1065.0) internal successors, (3195), 3 states have internal predecessors, (3195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:03,125 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:03,125 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:24:03,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-13 22:24:03,125 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting thread3Err37ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-03-13 22:24:03,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:03,126 INFO L85 PathProgramCache]: Analyzing trace with hash 2000377934, now seen corresponding path program 1 times [2025-03-13 22:24:03,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:03,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143631259] [2025-03-13 22:24:03,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:03,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:03,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-13 22:24:03,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-13 22:24:03,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:03,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:03,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:24:03,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:03,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143631259] [2025-03-13 22:24:03,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143631259] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:03,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:03,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:24:03,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088819201] [2025-03-13 22:24:03,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:03,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:24:03,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:03,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:24:03,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:24:03,196 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1066 out of 1105 [2025-03-13 22:24:03,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 960 places, 994 transitions, 2137 flow. Second operand has 3 states, 3 states have (on average 1068.3333333333333) internal successors, (3205), 3 states have internal predecessors, (3205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:03,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:03,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1066 of 1105 [2025-03-13 22:24:03,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:04,378 INFO L124 PetriNetUnfolderBase]: 243/3757 cut-off events. [2025-03-13 22:24:04,378 INFO L125 PetriNetUnfolderBase]: For 186/208 co-relation queries the response was YES. [2025-03-13 22:24:04,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4269 conditions, 3757 events. 243/3757 cut-off events. For 186/208 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 30727 event pairs, 36 based on Foata normal form. 1/3171 useless extension candidates. Maximal degree in co-relation 3592. Up to 212 conditions per place. [2025-03-13 22:24:04,522 INFO L140 encePairwiseOnDemand]: 1102/1105 looper letters, 20 selfloop transitions, 3 changer transitions 0/995 dead transitions. [2025-03-13 22:24:04,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 961 places, 995 transitions, 2187 flow [2025-03-13 22:24:04,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:24:04,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:24:04,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3218 transitions. [2025-03-13 22:24:04,525 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9707390648567119 [2025-03-13 22:24:04,525 INFO L175 Difference]: Start difference. First operand has 960 places, 994 transitions, 2137 flow. Second operand 3 states and 3218 transitions. [2025-03-13 22:24:04,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 961 places, 995 transitions, 2187 flow [2025-03-13 22:24:04,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 959 places, 995 transitions, 2181 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:24:04,535 INFO L231 Difference]: Finished difference. Result has 959 places, 993 transitions, 2135 flow [2025-03-13 22:24:04,536 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1105, PETRI_DIFFERENCE_MINUEND_FLOW=2129, PETRI_DIFFERENCE_MINUEND_PLACES=957, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=993, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=990, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2135, PETRI_PLACES=959, PETRI_TRANSITIONS=993} [2025-03-13 22:24:04,536 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -77 predicate places. [2025-03-13 22:24:04,536 INFO L471 AbstractCegarLoop]: Abstraction has has 959 places, 993 transitions, 2135 flow [2025-03-13 22:24:04,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1068.3333333333333) internal successors, (3205), 3 states have internal predecessors, (3205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:04,536 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:04,536 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] [2025-03-13 22:24:04,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-13 22:24:04,537 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting thread2Err34ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-03-13 22:24:04,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:04,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1324286886, now seen corresponding path program 1 times [2025-03-13 22:24:04,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:04,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736681440] [2025-03-13 22:24:04,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:04,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:04,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-13 22:24:04,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-13 22:24:04,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:04,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:04,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:24:04,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:04,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736681440] [2025-03-13 22:24:04,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736681440] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:04,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:04,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 22:24:04,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306016490] [2025-03-13 22:24:04,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:04,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:24:04,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:04,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:24:04,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:24:04,609 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1072 out of 1105 [2025-03-13 22:24:04,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 959 places, 993 transitions, 2135 flow. Second operand has 3 states, 3 states have (on average 1074.6666666666667) internal successors, (3224), 3 states have internal predecessors, (3224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:04,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:04,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1072 of 1105 [2025-03-13 22:24:04,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:06,458 INFO L124 PetriNetUnfolderBase]: 267/5679 cut-off events. [2025-03-13 22:24:06,458 INFO L125 PetriNetUnfolderBase]: For 34/90 co-relation queries the response was YES. [2025-03-13 22:24:06,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6103 conditions, 5679 events. 267/5679 cut-off events. For 34/90 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 50528 event pairs, 10 based on Foata normal form. 0/4793 useless extension candidates. Maximal degree in co-relation 4948. Up to 89 conditions per place. [2025-03-13 22:24:06,720 INFO L140 encePairwiseOnDemand]: 1102/1105 looper letters, 15 selfloop transitions, 2 changer transitions 0/997 dead transitions. [2025-03-13 22:24:06,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 961 places, 997 transitions, 2180 flow [2025-03-13 22:24:06,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:24:06,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:24:06,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3234 transitions. [2025-03-13 22:24:06,722 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9755656108597285 [2025-03-13 22:24:06,722 INFO L175 Difference]: Start difference. First operand has 959 places, 993 transitions, 2135 flow. Second operand 3 states and 3234 transitions. [2025-03-13 22:24:06,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 961 places, 997 transitions, 2180 flow [2025-03-13 22:24:06,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 959 places, 997 transitions, 2174 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:24:06,731 INFO L231 Difference]: Finished difference. Result has 961 places, 994 transitions, 2143 flow [2025-03-13 22:24:06,732 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1105, PETRI_DIFFERENCE_MINUEND_FLOW=2129, PETRI_DIFFERENCE_MINUEND_PLACES=957, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=993, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=991, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2143, PETRI_PLACES=961, PETRI_TRANSITIONS=994} [2025-03-13 22:24:06,732 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -75 predicate places. [2025-03-13 22:24:06,732 INFO L471 AbstractCegarLoop]: Abstraction has has 961 places, 994 transitions, 2143 flow [2025-03-13 22:24:06,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1074.6666666666667) internal successors, (3224), 3 states have internal predecessors, (3224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:06,733 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:06,733 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:24:06,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-13 22:24:06,733 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting thread2Err34ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-03-13 22:24:06,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:06,734 INFO L85 PathProgramCache]: Analyzing trace with hash -978503773, now seen corresponding path program 1 times [2025-03-13 22:24:06,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:06,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129027100] [2025-03-13 22:24:06,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:06,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:06,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-03-13 22:24:06,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-03-13 22:24:06,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:06,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:06,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:24:06,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:06,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129027100] [2025-03-13 22:24:06,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129027100] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:06,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:06,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:24:06,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089026107] [2025-03-13 22:24:06,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:06,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:24:06,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:06,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:24:06,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:24:06,799 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1051 out of 1105 [2025-03-13 22:24:06,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 961 places, 994 transitions, 2143 flow. Second operand has 3 states, 3 states have (on average 1053.0) internal successors, (3159), 3 states have internal predecessors, (3159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:06,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:06,801 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1051 of 1105 [2025-03-13 22:24:06,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:09,638 INFO L124 PetriNetUnfolderBase]: 631/10693 cut-off events. [2025-03-13 22:24:09,638 INFO L125 PetriNetUnfolderBase]: For 84/224 co-relation queries the response was YES. [2025-03-13 22:24:09,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11792 conditions, 10693 events. 631/10693 cut-off events. For 84/224 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 110508 event pairs, 67 based on Foata normal form. 0/9062 useless extension candidates. Maximal degree in co-relation 9698. Up to 336 conditions per place. [2025-03-13 22:24:10,135 INFO L140 encePairwiseOnDemand]: 1088/1105 looper letters, 23 selfloop transitions, 9 changer transitions 0/992 dead transitions. [2025-03-13 22:24:10,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 955 places, 992 transitions, 2205 flow [2025-03-13 22:24:10,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:24:10,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:24:10,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3193 transitions. [2025-03-13 22:24:10,136 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9631975867269985 [2025-03-13 22:24:10,136 INFO L175 Difference]: Start difference. First operand has 961 places, 994 transitions, 2143 flow. Second operand 3 states and 3193 transitions. [2025-03-13 22:24:10,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 955 places, 992 transitions, 2205 flow [2025-03-13 22:24:10,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 954 places, 992 transitions, 2203 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:24:10,146 INFO L231 Difference]: Finished difference. Result has 956 places, 990 transitions, 2177 flow [2025-03-13 22:24:10,147 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1105, PETRI_DIFFERENCE_MINUEND_FLOW=2125, PETRI_DIFFERENCE_MINUEND_PLACES=952, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=986, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=977, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2177, PETRI_PLACES=956, PETRI_TRANSITIONS=990} [2025-03-13 22:24:10,147 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -80 predicate places. [2025-03-13 22:24:10,147 INFO L471 AbstractCegarLoop]: Abstraction has has 956 places, 990 transitions, 2177 flow [2025-03-13 22:24:10,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1053.0) internal successors, (3159), 3 states have internal predecessors, (3159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:10,147 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:10,148 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] [2025-03-13 22:24:10,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-13 22:24:10,148 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting thread2Err33ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-03-13 22:24:10,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:10,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1766058142, now seen corresponding path program 1 times [2025-03-13 22:24:10,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:10,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704868532] [2025-03-13 22:24:10,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:10,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:10,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-03-13 22:24:10,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-03-13 22:24:10,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:10,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:10,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:24:10,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:10,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704868532] [2025-03-13 22:24:10,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704868532] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:10,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:10,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:24:10,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67577620] [2025-03-13 22:24:10,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:10,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:24:10,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:10,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:24:10,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:24:10,215 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1063 out of 1105 [2025-03-13 22:24:10,217 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 956 places, 990 transitions, 2177 flow. Second operand has 3 states, 3 states have (on average 1065.3333333333333) internal successors, (3196), 3 states have internal predecessors, (3196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:10,217 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:10,217 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1063 of 1105 [2025-03-13 22:24:10,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:12,588 INFO L124 PetriNetUnfolderBase]: 484/8694 cut-off events. [2025-03-13 22:24:12,588 INFO L125 PetriNetUnfolderBase]: For 386/624 co-relation queries the response was YES. [2025-03-13 22:24:12,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9790 conditions, 8694 events. 484/8694 cut-off events. For 386/624 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 92226 event pairs, 95 based on Foata normal form. 0/7387 useless extension candidates. Maximal degree in co-relation 7926. Up to 284 conditions per place. [2025-03-13 22:24:12,964 INFO L140 encePairwiseOnDemand]: 1102/1105 looper letters, 24 selfloop transitions, 3 changer transitions 0/991 dead transitions. [2025-03-13 22:24:12,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 957 places, 991 transitions, 2235 flow [2025-03-13 22:24:12,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:24:12,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:24:12,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3213 transitions. [2025-03-13 22:24:12,966 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9692307692307692 [2025-03-13 22:24:12,966 INFO L175 Difference]: Start difference. First operand has 956 places, 990 transitions, 2177 flow. Second operand 3 states and 3213 transitions. [2025-03-13 22:24:12,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 957 places, 991 transitions, 2235 flow [2025-03-13 22:24:12,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 955 places, 991 transitions, 2217 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:24:12,975 INFO L231 Difference]: Finished difference. Result has 955 places, 989 transitions, 2163 flow [2025-03-13 22:24:12,976 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1105, PETRI_DIFFERENCE_MINUEND_FLOW=2157, PETRI_DIFFERENCE_MINUEND_PLACES=953, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=989, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=986, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2163, PETRI_PLACES=955, PETRI_TRANSITIONS=989} [2025-03-13 22:24:12,976 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -81 predicate places. [2025-03-13 22:24:12,976 INFO L471 AbstractCegarLoop]: Abstraction has has 955 places, 989 transitions, 2163 flow [2025-03-13 22:24:12,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1065.3333333333333) internal successors, (3196), 3 states have internal predecessors, (3196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:12,976 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:12,977 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] [2025-03-13 22:24:12,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-13 22:24:12,977 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting thread1Err32ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-03-13 22:24:12,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:12,977 INFO L85 PathProgramCache]: Analyzing trace with hash 720420715, now seen corresponding path program 1 times [2025-03-13 22:24:12,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:12,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579063753] [2025-03-13 22:24:12,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:12,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:12,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-03-13 22:24:12,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-03-13 22:24:12,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:12,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:13,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:24:13,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:13,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579063753] [2025-03-13 22:24:13,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579063753] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:13,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:13,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:24:13,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405373751] [2025-03-13 22:24:13,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:13,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:24:13,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:13,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:24:13,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:24:13,020 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1065 out of 1105 [2025-03-13 22:24:13,022 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 955 places, 989 transitions, 2163 flow. Second operand has 3 states, 3 states have (on average 1066.6666666666667) internal successors, (3200), 3 states have internal predecessors, (3200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:13,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:13,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1065 of 1105 [2025-03-13 22:24:13,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:14,648 INFO L124 PetriNetUnfolderBase]: 263/5241 cut-off events. [2025-03-13 22:24:14,648 INFO L125 PetriNetUnfolderBase]: For 12/84 co-relation queries the response was YES. [2025-03-13 22:24:14,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5874 conditions, 5241 events. 263/5241 cut-off events. For 12/84 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 48295 event pairs, 6 based on Foata normal form. 2/4548 useless extension candidates. Maximal degree in co-relation 4566. Up to 106 conditions per place. [2025-03-13 22:24:14,781 INFO L140 encePairwiseOnDemand]: 1098/1105 looper letters, 15 selfloop transitions, 3 changer transitions 0/987 dead transitions. [2025-03-13 22:24:14,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 953 places, 987 transitions, 2197 flow [2025-03-13 22:24:14,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:24:14,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:24:14,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3217 transitions. [2025-03-13 22:24:14,782 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704374057315234 [2025-03-13 22:24:14,782 INFO L175 Difference]: Start difference. First operand has 955 places, 989 transitions, 2163 flow. Second operand 3 states and 3217 transitions. [2025-03-13 22:24:14,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 953 places, 987 transitions, 2197 flow [2025-03-13 22:24:14,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 951 places, 987 transitions, 2191 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:24:14,790 INFO L231 Difference]: Finished difference. Result has 951 places, 985 transitions, 2155 flow [2025-03-13 22:24:14,791 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1105, PETRI_DIFFERENCE_MINUEND_FLOW=2149, PETRI_DIFFERENCE_MINUEND_PLACES=949, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=985, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=982, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2155, PETRI_PLACES=951, PETRI_TRANSITIONS=985} [2025-03-13 22:24:14,791 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -85 predicate places. [2025-03-13 22:24:14,791 INFO L471 AbstractCegarLoop]: Abstraction has has 951 places, 985 transitions, 2155 flow [2025-03-13 22:24:14,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1066.6666666666667) internal successors, (3200), 3 states have internal predecessors, (3200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:14,791 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:14,792 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:24:14,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-13 22:24:14,792 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting thread3Err34ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-03-13 22:24:14,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:14,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1793112986, now seen corresponding path program 1 times [2025-03-13 22:24:14,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:14,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338067908] [2025-03-13 22:24:14,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:14,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:14,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-03-13 22:24:14,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-03-13 22:24:14,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:14,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:14,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:24:14,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:14,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338067908] [2025-03-13 22:24:14,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338067908] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:14,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:14,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 22:24:14,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362282873] [2025-03-13 22:24:14,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:14,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:24:14,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:14,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:24:14,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:24:14,853 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1072 out of 1105 [2025-03-13 22:24:14,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 951 places, 985 transitions, 2155 flow. Second operand has 3 states, 3 states have (on average 1075.0) internal successors, (3225), 3 states have internal predecessors, (3225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:14,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:14,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1072 of 1105 [2025-03-13 22:24:14,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:17,205 INFO L124 PetriNetUnfolderBase]: 386/8361 cut-off events. [2025-03-13 22:24:17,205 INFO L125 PetriNetUnfolderBase]: For 34/66 co-relation queries the response was YES. [2025-03-13 22:24:17,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8952 conditions, 8361 events. 386/8361 cut-off events. For 34/66 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 76330 event pairs, 24 based on Foata normal form. 2/7038 useless extension candidates. Maximal degree in co-relation 7682. Up to 175 conditions per place. [2025-03-13 22:24:17,583 INFO L140 encePairwiseOnDemand]: 1102/1105 looper letters, 14 selfloop transitions, 2 changer transitions 0/988 dead transitions. [2025-03-13 22:24:17,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 953 places, 988 transitions, 2195 flow [2025-03-13 22:24:17,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:24:17,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:24:17,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3233 transitions. [2025-03-13 22:24:17,585 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.97526395173454 [2025-03-13 22:24:17,585 INFO L175 Difference]: Start difference. First operand has 951 places, 985 transitions, 2155 flow. Second operand 3 states and 3233 transitions. [2025-03-13 22:24:17,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 953 places, 988 transitions, 2195 flow [2025-03-13 22:24:17,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 951 places, 988 transitions, 2189 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:24:17,595 INFO L231 Difference]: Finished difference. Result has 953 places, 986 transitions, 2163 flow [2025-03-13 22:24:17,596 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1105, PETRI_DIFFERENCE_MINUEND_FLOW=2149, PETRI_DIFFERENCE_MINUEND_PLACES=949, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=985, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=983, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2163, PETRI_PLACES=953, PETRI_TRANSITIONS=986} [2025-03-13 22:24:17,596 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -83 predicate places. [2025-03-13 22:24:17,596 INFO L471 AbstractCegarLoop]: Abstraction has has 953 places, 986 transitions, 2163 flow [2025-03-13 22:24:17,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1075.0) internal successors, (3225), 3 states have internal predecessors, (3225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:17,597 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:17,597 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] [2025-03-13 22:24:17,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-13 22:24:17,597 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting thread3Err34ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-03-13 22:24:17,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:17,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1087400707, now seen corresponding path program 1 times [2025-03-13 22:24:17,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:17,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105048448] [2025-03-13 22:24:17,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:17,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:17,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-13 22:24:17,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-13 22:24:17,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:17,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:17,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:24:17,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:17,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105048448] [2025-03-13 22:24:17,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105048448] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:17,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:17,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:24:17,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557800298] [2025-03-13 22:24:17,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:17,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:24:17,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:17,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:24:17,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:24:17,658 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1051 out of 1105 [2025-03-13 22:24:17,659 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 953 places, 986 transitions, 2163 flow. Second operand has 3 states, 3 states have (on average 1053.3333333333333) internal successors, (3160), 3 states have internal predecessors, (3160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:17,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:17,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1051 of 1105 [2025-03-13 22:24:17,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:20,447 INFO L124 PetriNetUnfolderBase]: 702/10384 cut-off events. [2025-03-13 22:24:20,447 INFO L125 PetriNetUnfolderBase]: For 326/386 co-relation queries the response was YES. [2025-03-13 22:24:20,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11899 conditions, 10384 events. 702/10384 cut-off events. For 326/386 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 115871 event pairs, 54 based on Foata normal form. 2/8868 useless extension candidates. Maximal degree in co-relation 10283. Up to 682 conditions per place. [2025-03-13 22:24:20,922 INFO L140 encePairwiseOnDemand]: 1088/1105 looper letters, 23 selfloop transitions, 9 changer transitions 0/984 dead transitions. [2025-03-13 22:24:20,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 947 places, 984 transitions, 2225 flow [2025-03-13 22:24:20,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:24:20,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:24:20,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3193 transitions. [2025-03-13 22:24:20,924 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9631975867269985 [2025-03-13 22:24:20,924 INFO L175 Difference]: Start difference. First operand has 953 places, 986 transitions, 2163 flow. Second operand 3 states and 3193 transitions. [2025-03-13 22:24:20,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 947 places, 984 transitions, 2225 flow [2025-03-13 22:24:20,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 946 places, 984 transitions, 2223 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:24:20,933 INFO L231 Difference]: Finished difference. Result has 948 places, 982 transitions, 2197 flow [2025-03-13 22:24:20,933 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1105, PETRI_DIFFERENCE_MINUEND_FLOW=2145, PETRI_DIFFERENCE_MINUEND_PLACES=944, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=978, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=969, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2197, PETRI_PLACES=948, PETRI_TRANSITIONS=982} [2025-03-13 22:24:20,933 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -88 predicate places. [2025-03-13 22:24:20,933 INFO L471 AbstractCegarLoop]: Abstraction has has 948 places, 982 transitions, 2197 flow [2025-03-13 22:24:20,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1053.3333333333333) internal successors, (3160), 3 states have internal predecessors, (3160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:20,934 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:20,934 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] [2025-03-13 22:24:20,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-13 22:24:20,934 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting thread3Err33ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-03-13 22:24:20,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:20,935 INFO L85 PathProgramCache]: Analyzing trace with hash 2147438871, now seen corresponding path program 1 times [2025-03-13 22:24:20,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:20,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785107924] [2025-03-13 22:24:20,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:20,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:20,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-13 22:24:20,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-13 22:24:20,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:20,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:20,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:24:20,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:20,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785107924] [2025-03-13 22:24:20,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785107924] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:20,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:20,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:24:20,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509601475] [2025-03-13 22:24:20,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:20,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:24:20,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:20,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:24:20,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:24:21,011 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1063 out of 1105 [2025-03-13 22:24:21,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 948 places, 982 transitions, 2197 flow. Second operand has 3 states, 3 states have (on average 1065.6666666666667) internal successors, (3197), 3 states have internal predecessors, (3197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:21,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:21,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1063 of 1105 [2025-03-13 22:24:21,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:23,926 INFO L124 PetriNetUnfolderBase]: 630/10286 cut-off events. [2025-03-13 22:24:23,926 INFO L125 PetriNetUnfolderBase]: For 904/972 co-relation queries the response was YES. [2025-03-13 22:24:24,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12120 conditions, 10286 events. 630/10286 cut-off events. For 904/972 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 113108 event pairs, 190 based on Foata normal form. 2/8814 useless extension candidates. Maximal degree in co-relation 10447. Up to 585 conditions per place. [2025-03-13 22:24:24,363 INFO L140 encePairwiseOnDemand]: 1102/1105 looper letters, 24 selfloop transitions, 3 changer transitions 0/983 dead transitions. [2025-03-13 22:24:24,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 949 places, 983 transitions, 2255 flow [2025-03-13 22:24:24,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:24:24,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:24:24,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3213 transitions. [2025-03-13 22:24:24,364 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9692307692307692 [2025-03-13 22:24:24,364 INFO L175 Difference]: Start difference. First operand has 948 places, 982 transitions, 2197 flow. Second operand 3 states and 3213 transitions. [2025-03-13 22:24:24,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 949 places, 983 transitions, 2255 flow [2025-03-13 22:24:24,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 947 places, 983 transitions, 2237 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:24:24,374 INFO L231 Difference]: Finished difference. Result has 947 places, 981 transitions, 2183 flow [2025-03-13 22:24:24,375 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1105, PETRI_DIFFERENCE_MINUEND_FLOW=2177, PETRI_DIFFERENCE_MINUEND_PLACES=945, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=981, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=978, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2183, PETRI_PLACES=947, PETRI_TRANSITIONS=981} [2025-03-13 22:24:24,375 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -89 predicate places. [2025-03-13 22:24:24,375 INFO L471 AbstractCegarLoop]: Abstraction has has 947 places, 981 transitions, 2183 flow [2025-03-13 22:24:24,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1065.6666666666667) internal successors, (3197), 3 states have internal predecessors, (3197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:24,376 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:24,376 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:24:24,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-13 22:24:24,376 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting thread2Err32ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-03-13 22:24:24,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:24,376 INFO L85 PathProgramCache]: Analyzing trace with hash -723872052, now seen corresponding path program 1 times [2025-03-13 22:24:24,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:24,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343697571] [2025-03-13 22:24:24,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:24,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:24,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-13 22:24:24,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-13 22:24:24,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:24,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:24,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:24:24,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:24,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343697571] [2025-03-13 22:24:24,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343697571] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:24,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:24,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:24:24,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081322885] [2025-03-13 22:24:24,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:24,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:24:24,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:24,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:24:24,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:24:24,419 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1065 out of 1105 [2025-03-13 22:24:24,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 947 places, 981 transitions, 2183 flow. Second operand has 3 states, 3 states have (on average 1067.0) internal successors, (3201), 3 states have internal predecessors, (3201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:24,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:24,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1065 of 1105 [2025-03-13 22:24:24,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:27,338 INFO L124 PetriNetUnfolderBase]: 450/8876 cut-off events. [2025-03-13 22:24:27,338 INFO L125 PetriNetUnfolderBase]: For 66/88 co-relation queries the response was YES. [2025-03-13 22:24:27,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10032 conditions, 8876 events. 450/8876 cut-off events. For 66/88 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 92214 event pairs, 11 based on Foata normal form. 1/7732 useless extension candidates. Maximal degree in co-relation 8449. Up to 204 conditions per place. [2025-03-13 22:24:27,781 INFO L140 encePairwiseOnDemand]: 1098/1105 looper letters, 15 selfloop transitions, 3 changer transitions 0/979 dead transitions. [2025-03-13 22:24:27,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 945 places, 979 transitions, 2217 flow [2025-03-13 22:24:27,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:24:27,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:24:27,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3217 transitions. [2025-03-13 22:24:27,782 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704374057315234 [2025-03-13 22:24:27,782 INFO L175 Difference]: Start difference. First operand has 947 places, 981 transitions, 2183 flow. Second operand 3 states and 3217 transitions. [2025-03-13 22:24:27,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 945 places, 979 transitions, 2217 flow [2025-03-13 22:24:27,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 943 places, 979 transitions, 2211 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:24:27,792 INFO L231 Difference]: Finished difference. Result has 943 places, 977 transitions, 2175 flow [2025-03-13 22:24:27,793 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1105, PETRI_DIFFERENCE_MINUEND_FLOW=2169, PETRI_DIFFERENCE_MINUEND_PLACES=941, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=977, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=974, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2175, PETRI_PLACES=943, PETRI_TRANSITIONS=977} [2025-03-13 22:24:27,794 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -93 predicate places. [2025-03-13 22:24:27,794 INFO L471 AbstractCegarLoop]: Abstraction has has 943 places, 977 transitions, 2175 flow [2025-03-13 22:24:27,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1067.0) internal successors, (3201), 3 states have internal predecessors, (3201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:27,794 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:27,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:24:27,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-13 22:24:27,794 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting thread1Err30ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-03-13 22:24:27,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:27,795 INFO L85 PathProgramCache]: Analyzing trace with hash 692676944, now seen corresponding path program 1 times [2025-03-13 22:24:27,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:27,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207750421] [2025-03-13 22:24:27,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:27,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:27,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-03-13 22:24:27,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-03-13 22:24:27,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:27,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:27,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:24:27,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:27,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207750421] [2025-03-13 22:24:27,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207750421] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:27,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:27,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:24:27,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570501570] [2025-03-13 22:24:27,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:27,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:24:27,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:27,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:24:27,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:24:27,835 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1070 out of 1105 [2025-03-13 22:24:27,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 943 places, 977 transitions, 2175 flow. Second operand has 3 states, 3 states have (on average 1071.3333333333333) internal successors, (3214), 3 states have internal predecessors, (3214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:27,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:27,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1070 of 1105 [2025-03-13 22:24:27,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand