./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-array-int-subst.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 8fc3dc66 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-array-int-subst.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 779f57e464f50d458e1b66270e0c9f2866c6247d4d7f63a3096c6ac13e286657 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 11:11:00,806 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 11:11:00,850 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-17 11:11:00,854 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 11:11:00,854 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 11:11:00,870 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 11:11:00,870 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 11:11:00,870 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 11:11:00,871 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 11:11:00,871 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 11:11:00,871 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 11:11:00,871 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 11:11:00,871 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 11:11:00,871 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 11:11:00,872 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 11:11:00,872 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 11:11:00,872 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 11:11:00,872 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 11:11:00,872 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 11:11:00,872 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 11:11:00,872 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 11:11:00,872 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 11:11:00,872 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-17 11:11:00,872 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 11:11:00,872 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 11:11:00,872 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 11:11:00,873 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 11:11:00,873 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 11:11:00,873 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 11:11:00,873 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 11:11:00,873 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 11:11:00,873 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:11:00,873 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 11:11:00,873 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 11:11:00,873 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 11:11:00,873 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 11:11:00,874 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 11:11:00,874 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 11:11:00,874 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 11:11:00,874 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 11:11:00,874 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 11:11:00,874 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 11:11:00,874 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 -> 779f57e464f50d458e1b66270e0c9f2866c6247d4d7f63a3096c6ac13e286657 [2025-03-17 11:11:01,098 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 11:11:01,106 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 11:11:01,107 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 11:11:01,108 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 11:11:01,109 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 11:11:01,110 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-array-int-subst.wvr.c [2025-03-17 11:11:02,262 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e72882dd7/7dda82cd1da644debeba5e8aae15d9eb/FLAG8f0d4072f [2025-03-17 11:11:02,497 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 11:11:02,497 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-array-int-subst.wvr.c [2025-03-17 11:11:02,504 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e72882dd7/7dda82cd1da644debeba5e8aae15d9eb/FLAG8f0d4072f [2025-03-17 11:11:02,841 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e72882dd7/7dda82cd1da644debeba5e8aae15d9eb [2025-03-17 11:11:02,843 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 11:11:02,844 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 11:11:02,845 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 11:11:02,845 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 11:11:02,848 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 11:11:02,848 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:11:02" (1/1) ... [2025-03-17 11:11:02,849 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@218c6182 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:02, skipping insertion in model container [2025-03-17 11:11:02,849 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:11:02" (1/1) ... [2025-03-17 11:11:02,860 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:11:02,996 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:11:03,002 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 11:11:03,029 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:11:03,042 INFO L204 MainTranslator]: Completed translation [2025-03-17 11:11:03,042 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:03 WrapperNode [2025-03-17 11:11:03,043 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 11:11:03,043 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 11:11:03,043 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 11:11:03,043 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 11:11:03,047 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:03" (1/1) ... [2025-03-17 11:11:03,055 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:03" (1/1) ... [2025-03-17 11:11:03,084 INFO L138 Inliner]: procedures = 25, calls = 36, calls flagged for inlining = 15, calls inlined = 23, statements flattened = 476 [2025-03-17 11:11:03,084 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 11:11:03,085 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 11:11:03,085 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 11:11:03,085 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 11:11:03,096 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:03" (1/1) ... [2025-03-17 11:11:03,096 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:03" (1/1) ... [2025-03-17 11:11:03,100 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:03" (1/1) ... [2025-03-17 11:11:03,100 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:03" (1/1) ... [2025-03-17 11:11:03,112 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:03" (1/1) ... [2025-03-17 11:11:03,114 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:03" (1/1) ... [2025-03-17 11:11:03,119 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:03" (1/1) ... [2025-03-17 11:11:03,122 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:03" (1/1) ... [2025-03-17 11:11:03,128 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 11:11:03,129 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 11:11:03,129 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 11:11:03,129 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 11:11:03,133 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:03" (1/1) ... [2025-03-17 11:11:03,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:11:03,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:11:03,167 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-17 11:11:03,170 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-17 11:11:03,191 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 11:11:03,192 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-17 11:11:03,192 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-17 11:11:03,192 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-17 11:11:03,192 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-17 11:11:03,192 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-17 11:11:03,192 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-17 11:11:03,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 11:11:03,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 11:11:03,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 11:11:03,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 11:11:03,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 11:11:03,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 11:11:03,194 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 11:11:03,301 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 11:11:03,302 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 11:11:03,915 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 11:11:03,915 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 11:11:03,941 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 11:11:03,944 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 11:11:03,944 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:11:03 BoogieIcfgContainer [2025-03-17 11:11:03,945 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 11:11:03,947 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 11:11:03,948 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 11:11:03,951 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 11:11:03,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:11:02" (1/3) ... [2025-03-17 11:11:03,952 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e810d0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:11:03, skipping insertion in model container [2025-03-17 11:11:03,952 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:03" (2/3) ... [2025-03-17 11:11:03,952 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e810d0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:11:03, skipping insertion in model container [2025-03-17 11:11:03,953 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:11:03" (3/3) ... [2025-03-17 11:11:03,954 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-array-int-subst.wvr.c [2025-03-17 11:11:03,965 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 11:11:03,967 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-array-int-subst.wvr.c that has 4 procedures, 599 locations, 1 initial locations, 6 loop locations, and 59 error locations. [2025-03-17 11:11:03,968 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 11:11:04,096 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-17 11:11:04,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 608 places, 628 transitions, 1277 flow [2025-03-17 11:11:04,329 INFO L124 PetriNetUnfolderBase]: 30/625 cut-off events. [2025-03-17 11:11:04,332 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-17 11:11:04,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 638 conditions, 625 events. 30/625 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1551 event pairs, 0 based on Foata normal form. 0/536 useless extension candidates. Maximal degree in co-relation 464. Up to 3 conditions per place. [2025-03-17 11:11:04,349 INFO L82 GeneralOperation]: Start removeDead. Operand has 608 places, 628 transitions, 1277 flow [2025-03-17 11:11:04,362 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 587 places, 605 transitions, 1228 flow [2025-03-17 11:11:04,372 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:11:04,381 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;@4a05733e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:11:04,384 INFO L334 AbstractCegarLoop]: Starting to check reachability of 104 error locations. [2025-03-17 11:11:04,389 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:11:04,389 INFO L124 PetriNetUnfolderBase]: 0/26 cut-off events. [2025-03-17 11:11:04,389 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:11:04,390 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:04,390 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:11:04,391 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-03-17 11:11:04,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:04,395 INFO L85 PathProgramCache]: Analyzing trace with hash -498976999, now seen corresponding path program 1 times [2025-03-17 11:11:04,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:04,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235944130] [2025-03-17 11:11:04,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:04,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:04,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 11:11:04,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 11:11:04,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:04,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:04,548 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-17 11:11:04,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:04,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235944130] [2025-03-17 11:11:04,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235944130] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:04,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:04,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:04,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543427188] [2025-03-17 11:11:04,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:04,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:04,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:04,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:04,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:04,620 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 592 out of 628 [2025-03-17 11:11:04,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 587 places, 605 transitions, 1228 flow. Second operand has 3 states, 3 states have (on average 593.3333333333334) internal successors, (1780), 3 states have internal predecessors, (1780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:04,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:04,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 592 of 628 [2025-03-17 11:11:04,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:04,918 INFO L124 PetriNetUnfolderBase]: 56/1488 cut-off events. [2025-03-17 11:11:04,919 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-03-17 11:11:04,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1576 conditions, 1488 events. 56/1488 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 8350 event pairs, 20 based on Foata normal form. 39/1287 useless extension candidates. Maximal degree in co-relation 1200. Up to 51 conditions per place. [2025-03-17 11:11:04,945 INFO L140 encePairwiseOnDemand]: 609/628 looper letters, 14 selfloop transitions, 2 changer transitions 7/588 dead transitions. [2025-03-17 11:11:04,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 588 places, 588 transitions, 1226 flow [2025-03-17 11:11:04,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:04,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:04,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1809 transitions. [2025-03-17 11:11:04,962 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9601910828025477 [2025-03-17 11:11:04,964 INFO L175 Difference]: Start difference. First operand has 587 places, 605 transitions, 1228 flow. Second operand 3 states and 1809 transitions. [2025-03-17 11:11:04,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 588 places, 588 transitions, 1226 flow [2025-03-17 11:11:04,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 582 places, 588 transitions, 1214 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-17 11:11:04,982 INFO L231 Difference]: Finished difference. Result has 582 places, 581 transitions, 1172 flow [2025-03-17 11:11:04,985 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1182, PETRI_DIFFERENCE_MINUEND_PLACES=580, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=588, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=586, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1172, PETRI_PLACES=582, PETRI_TRANSITIONS=581} [2025-03-17 11:11:04,987 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -5 predicate places. [2025-03-17 11:11:04,988 INFO L471 AbstractCegarLoop]: Abstraction has has 582 places, 581 transitions, 1172 flow [2025-03-17 11:11:04,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 593.3333333333334) internal successors, (1780), 3 states have internal predecessors, (1780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:04,990 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:04,990 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:11:04,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 11:11:04,991 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-03-17 11:11:04,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:04,992 INFO L85 PathProgramCache]: Analyzing trace with hash 318820756, now seen corresponding path program 1 times [2025-03-17 11:11:04,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:04,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143217543] [2025-03-17 11:11:04,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:04,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:05,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 11:11:05,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 11:11:05,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:05,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:05,052 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-17 11:11:05,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:05,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143217543] [2025-03-17 11:11:05,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143217543] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:05,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:05,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:05,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236600755] [2025-03-17 11:11:05,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:05,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:05,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:05,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:05,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:05,092 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 592 out of 628 [2025-03-17 11:11:05,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 582 places, 581 transitions, 1172 flow. Second operand has 3 states, 3 states have (on average 593.3333333333334) internal successors, (1780), 3 states have internal predecessors, (1780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:05,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:05,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 592 of 628 [2025-03-17 11:11:05,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:05,260 INFO L124 PetriNetUnfolderBase]: 36/1024 cut-off events. [2025-03-17 11:11:05,260 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-17 11:11:05,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1076 conditions, 1024 events. 36/1024 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 4622 event pairs, 12 based on Foata normal form. 0/875 useless extension candidates. Maximal degree in co-relation 1042. Up to 39 conditions per place. [2025-03-17 11:11:05,281 INFO L140 encePairwiseOnDemand]: 625/628 looper letters, 14 selfloop transitions, 2 changer transitions 0/580 dead transitions. [2025-03-17 11:11:05,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 576 places, 580 transitions, 1202 flow [2025-03-17 11:11:05,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:05,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:05,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1793 transitions. [2025-03-17 11:11:05,287 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9516985138004246 [2025-03-17 11:11:05,289 INFO L175 Difference]: Start difference. First operand has 582 places, 581 transitions, 1172 flow. Second operand 3 states and 1793 transitions. [2025-03-17 11:11:05,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 576 places, 580 transitions, 1202 flow [2025-03-17 11:11:05,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 574 places, 580 transitions, 1198 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:05,298 INFO L231 Difference]: Finished difference. Result has 574 places, 580 transitions, 1170 flow [2025-03-17 11:11:05,299 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1166, PETRI_DIFFERENCE_MINUEND_PLACES=572, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=580, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=578, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1170, PETRI_PLACES=574, PETRI_TRANSITIONS=580} [2025-03-17 11:11:05,300 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -13 predicate places. [2025-03-17 11:11:05,300 INFO L471 AbstractCegarLoop]: Abstraction has has 574 places, 580 transitions, 1170 flow [2025-03-17 11:11:05,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 593.3333333333334) internal successors, (1780), 3 states have internal predecessors, (1780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:05,301 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:05,301 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:11:05,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 11:11:05,301 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-03-17 11:11:05,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:05,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1943488051, now seen corresponding path program 1 times [2025-03-17 11:11:05,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:05,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482152985] [2025-03-17 11:11:05,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:05,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:05,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-17 11:11:05,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-17 11:11:05,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:05,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:05,353 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-17 11:11:05,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:05,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482152985] [2025-03-17 11:11:05,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482152985] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:05,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:05,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:05,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150070531] [2025-03-17 11:11:05,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:05,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:05,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:05,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:05,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:05,385 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 592 out of 628 [2025-03-17 11:11:05,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 574 places, 580 transitions, 1170 flow. Second operand has 3 states, 3 states have (on average 593.3333333333334) internal successors, (1780), 3 states have internal predecessors, (1780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:05,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:05,387 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 592 of 628 [2025-03-17 11:11:05,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:05,596 INFO L124 PetriNetUnfolderBase]: 56/1455 cut-off events. [2025-03-17 11:11:05,596 INFO L125 PetriNetUnfolderBase]: For 13/16 co-relation queries the response was YES. [2025-03-17 11:11:05,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1517 conditions, 1455 events. 56/1455 cut-off events. For 13/16 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 7802 event pairs, 20 based on Foata normal form. 0/1232 useless extension candidates. Maximal degree in co-relation 1475. Up to 51 conditions per place. [2025-03-17 11:11:05,621 INFO L140 encePairwiseOnDemand]: 625/628 looper letters, 14 selfloop transitions, 2 changer transitions 0/579 dead transitions. [2025-03-17 11:11:05,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 575 places, 579 transitions, 1200 flow [2025-03-17 11:11:05,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:05,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:05,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1793 transitions. [2025-03-17 11:11:05,625 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9516985138004246 [2025-03-17 11:11:05,625 INFO L175 Difference]: Start difference. First operand has 574 places, 580 transitions, 1170 flow. Second operand 3 states and 1793 transitions. [2025-03-17 11:11:05,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 575 places, 579 transitions, 1200 flow [2025-03-17 11:11:05,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 573 places, 579 transitions, 1196 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:05,634 INFO L231 Difference]: Finished difference. Result has 573 places, 579 transitions, 1168 flow [2025-03-17 11:11:05,635 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1164, PETRI_DIFFERENCE_MINUEND_PLACES=571, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=579, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=577, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1168, PETRI_PLACES=573, PETRI_TRANSITIONS=579} [2025-03-17 11:11:05,636 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -14 predicate places. [2025-03-17 11:11:05,636 INFO L471 AbstractCegarLoop]: Abstraction has has 573 places, 579 transitions, 1168 flow [2025-03-17 11:11:05,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 593.3333333333334) internal successors, (1780), 3 states have internal predecessors, (1780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:05,637 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:05,637 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] [2025-03-17 11:11:05,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 11:11:05,638 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-03-17 11:11:05,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:05,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1897374349, now seen corresponding path program 1 times [2025-03-17 11:11:05,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:05,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302263312] [2025-03-17 11:11:05,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:05,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:05,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-17 11:11:05,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-17 11:11:05,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:05,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:05,692 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-17 11:11:05,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:05,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302263312] [2025-03-17 11:11:05,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302263312] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:05,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:05,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:05,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823608163] [2025-03-17 11:11:05,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:05,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:05,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:05,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:05,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:05,722 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 588 out of 628 [2025-03-17 11:11:05,725 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 573 places, 579 transitions, 1168 flow. Second operand has 3 states, 3 states have (on average 589.0) internal successors, (1767), 3 states have internal predecessors, (1767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:05,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:05,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 588 of 628 [2025-03-17 11:11:05,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:06,049 INFO L124 PetriNetUnfolderBase]: 132/2496 cut-off events. [2025-03-17 11:11:06,050 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-17 11:11:06,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2671 conditions, 2496 events. 132/2496 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 18554 event pairs, 64 based on Foata normal form. 0/2124 useless extension candidates. Maximal degree in co-relation 2621. Up to 138 conditions per place. [2025-03-17 11:11:06,082 INFO L140 encePairwiseOnDemand]: 622/628 looper letters, 16 selfloop transitions, 1 changer transitions 0/574 dead transitions. [2025-03-17 11:11:06,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 570 places, 574 transitions, 1192 flow [2025-03-17 11:11:06,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:06,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:06,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1786 transitions. [2025-03-17 11:11:06,106 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9479830148619958 [2025-03-17 11:11:06,106 INFO L175 Difference]: Start difference. First operand has 573 places, 579 transitions, 1168 flow. Second operand 3 states and 1786 transitions. [2025-03-17 11:11:06,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 570 places, 574 transitions, 1192 flow [2025-03-17 11:11:06,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 568 places, 574 transitions, 1188 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:06,116 INFO L231 Difference]: Finished difference. Result has 568 places, 574 transitions, 1156 flow [2025-03-17 11:11:06,117 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1154, PETRI_DIFFERENCE_MINUEND_PLACES=566, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=574, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=573, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1156, PETRI_PLACES=568, PETRI_TRANSITIONS=574} [2025-03-17 11:11:06,117 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -19 predicate places. [2025-03-17 11:11:06,117 INFO L471 AbstractCegarLoop]: Abstraction has has 568 places, 574 transitions, 1156 flow [2025-03-17 11:11:06,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 589.0) internal successors, (1767), 3 states have internal predecessors, (1767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:06,118 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:06,119 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] [2025-03-17 11:11:06,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 11:11:06,119 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-03-17 11:11:06,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:06,120 INFO L85 PathProgramCache]: Analyzing trace with hash -236714896, now seen corresponding path program 1 times [2025-03-17 11:11:06,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:06,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93192230] [2025-03-17 11:11:06,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:06,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:06,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-17 11:11:06,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-17 11:11:06,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:06,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:06,593 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-17 11:11:06,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:06,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93192230] [2025-03-17 11:11:06,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93192230] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:06,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:06,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:11:06,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339785303] [2025-03-17 11:11:06,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:06,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:11:06,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:06,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:11:06,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:11:07,050 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 514 out of 628 [2025-03-17 11:11:07,053 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 568 places, 574 transitions, 1156 flow. Second operand has 6 states, 6 states have (on average 515.5) internal successors, (3093), 6 states have internal predecessors, (3093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:07,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:07,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 514 of 628 [2025-03-17 11:11:07,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:13,432 INFO L124 PetriNetUnfolderBase]: 12107/56350 cut-off events. [2025-03-17 11:11:13,432 INFO L125 PetriNetUnfolderBase]: For 899/901 co-relation queries the response was YES. [2025-03-17 11:11:13,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73831 conditions, 56350 events. 12107/56350 cut-off events. For 899/901 co-relation queries the response was YES. Maximal size of possible extension queue 1058. Compared 788075 event pairs, 10080 based on Foata normal form. 0/49064 useless extension candidates. Maximal degree in co-relation 73782. Up to 17156 conditions per place. [2025-03-17 11:11:13,834 INFO L140 encePairwiseOnDemand]: 610/628 looper letters, 78 selfloop transitions, 15 changer transitions 0/571 dead transitions. [2025-03-17 11:11:13,835 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 570 places, 571 transitions, 1336 flow [2025-03-17 11:11:13,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:11:13,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:11:13,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3180 transitions. [2025-03-17 11:11:13,839 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8439490445859873 [2025-03-17 11:11:13,839 INFO L175 Difference]: Start difference. First operand has 568 places, 574 transitions, 1156 flow. Second operand 6 states and 3180 transitions. [2025-03-17 11:11:13,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 570 places, 571 transitions, 1336 flow [2025-03-17 11:11:13,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 569 places, 571 transitions, 1335 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:11:13,846 INFO L231 Difference]: Finished difference. Result has 569 places, 571 transitions, 1179 flow [2025-03-17 11:11:13,847 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1149, PETRI_DIFFERENCE_MINUEND_PLACES=564, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=571, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=556, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1179, PETRI_PLACES=569, PETRI_TRANSITIONS=571} [2025-03-17 11:11:13,847 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -18 predicate places. [2025-03-17 11:11:13,847 INFO L471 AbstractCegarLoop]: Abstraction has has 569 places, 571 transitions, 1179 flow [2025-03-17 11:11:13,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 515.5) internal successors, (3093), 6 states have internal predecessors, (3093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:13,849 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:13,849 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] [2025-03-17 11:11:13,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 11:11:13,849 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-03-17 11:11:13,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:13,850 INFO L85 PathProgramCache]: Analyzing trace with hash -154479918, now seen corresponding path program 1 times [2025-03-17 11:11:13,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:13,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870735924] [2025-03-17 11:11:13,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:13,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:13,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-17 11:11:13,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-17 11:11:13,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:13,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:13,893 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-17 11:11:13,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:13,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870735924] [2025-03-17 11:11:13,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870735924] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:13,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:13,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:13,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688180921] [2025-03-17 11:11:13,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:13,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:13,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:13,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:13,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:13,923 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 593 out of 628 [2025-03-17 11:11:13,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 569 places, 571 transitions, 1179 flow. Second operand has 3 states, 3 states have (on average 594.3333333333334) internal successors, (1783), 3 states have internal predecessors, (1783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:13,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:13,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 593 of 628 [2025-03-17 11:11:13,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:14,207 INFO L124 PetriNetUnfolderBase]: 62/1744 cut-off events. [2025-03-17 11:11:14,208 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2025-03-17 11:11:14,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1827 conditions, 1744 events. 62/1744 cut-off events. For 3/5 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 9905 event pairs, 20 based on Foata normal form. 0/1484 useless extension candidates. Maximal degree in co-relation 1779. Up to 50 conditions per place. [2025-03-17 11:11:14,223 INFO L140 encePairwiseOnDemand]: 625/628 looper letters, 13 selfloop transitions, 2 changer transitions 0/570 dead transitions. [2025-03-17 11:11:14,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 570 places, 570 transitions, 1207 flow [2025-03-17 11:11:14,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:14,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:14,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1795 transitions. [2025-03-17 11:11:14,226 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.95276008492569 [2025-03-17 11:11:14,226 INFO L175 Difference]: Start difference. First operand has 569 places, 571 transitions, 1179 flow. Second operand 3 states and 1795 transitions. [2025-03-17 11:11:14,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 570 places, 570 transitions, 1207 flow [2025-03-17 11:11:14,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 565 places, 570 transitions, 1177 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:11:14,232 INFO L231 Difference]: Finished difference. Result has 565 places, 570 transitions, 1151 flow [2025-03-17 11:11:14,233 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1147, PETRI_DIFFERENCE_MINUEND_PLACES=563, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=570, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=568, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1151, PETRI_PLACES=565, PETRI_TRANSITIONS=570} [2025-03-17 11:11:14,235 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -22 predicate places. [2025-03-17 11:11:14,235 INFO L471 AbstractCegarLoop]: Abstraction has has 565 places, 570 transitions, 1151 flow [2025-03-17 11:11:14,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 594.3333333333334) internal successors, (1783), 3 states have internal predecessors, (1783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:14,236 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:14,236 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] [2025-03-17 11:11:14,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 11:11:14,237 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-03-17 11:11:14,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:14,237 INFO L85 PathProgramCache]: Analyzing trace with hash 511383526, now seen corresponding path program 1 times [2025-03-17 11:11:14,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:14,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944267925] [2025-03-17 11:11:14,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:14,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:14,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-17 11:11:14,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-17 11:11:14,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:14,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:14,263 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-17 11:11:14,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:14,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944267925] [2025-03-17 11:11:14,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944267925] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:14,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:14,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:14,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217701368] [2025-03-17 11:11:14,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:14,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:14,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:14,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:14,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:14,281 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 588 out of 628 [2025-03-17 11:11:14,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 565 places, 570 transitions, 1151 flow. Second operand has 3 states, 3 states have (on average 589.0) internal successors, (1767), 3 states have internal predecessors, (1767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:14,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:14,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 588 of 628 [2025-03-17 11:11:14,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:14,466 INFO L124 PetriNetUnfolderBase]: 78/1635 cut-off events. [2025-03-17 11:11:14,467 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-03-17 11:11:14,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1740 conditions, 1635 events. 78/1635 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 9856 event pairs, 32 based on Foata normal form. 0/1411 useless extension candidates. Maximal degree in co-relation 1690. Up to 87 conditions per place. [2025-03-17 11:11:14,499 INFO L140 encePairwiseOnDemand]: 622/628 looper letters, 16 selfloop transitions, 1 changer transitions 0/565 dead transitions. [2025-03-17 11:11:14,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 562 places, 565 transitions, 1175 flow [2025-03-17 11:11:14,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:14,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:14,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1786 transitions. [2025-03-17 11:11:14,502 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9479830148619958 [2025-03-17 11:11:14,502 INFO L175 Difference]: Start difference. First operand has 565 places, 570 transitions, 1151 flow. Second operand 3 states and 1786 transitions. [2025-03-17 11:11:14,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 562 places, 565 transitions, 1175 flow [2025-03-17 11:11:14,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 560 places, 565 transitions, 1171 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:14,508 INFO L231 Difference]: Finished difference. Result has 560 places, 565 transitions, 1139 flow [2025-03-17 11:11:14,508 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1137, PETRI_DIFFERENCE_MINUEND_PLACES=558, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=565, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=564, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1139, PETRI_PLACES=560, PETRI_TRANSITIONS=565} [2025-03-17 11:11:14,509 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -27 predicate places. [2025-03-17 11:11:14,509 INFO L471 AbstractCegarLoop]: Abstraction has has 560 places, 565 transitions, 1139 flow [2025-03-17 11:11:14,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 589.0) internal successors, (1767), 3 states have internal predecessors, (1767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:14,510 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:14,510 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:11:14,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 11:11:14,510 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-03-17 11:11:14,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:14,511 INFO L85 PathProgramCache]: Analyzing trace with hash 127058322, now seen corresponding path program 1 times [2025-03-17 11:11:14,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:14,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557900489] [2025-03-17 11:11:14,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:14,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:14,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-17 11:11:14,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-17 11:11:14,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:14,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:14,564 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-17 11:11:14,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:14,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557900489] [2025-03-17 11:11:14,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557900489] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:14,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:14,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:14,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157013457] [2025-03-17 11:11:14,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:14,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:14,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:14,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:14,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:14,588 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 593 out of 628 [2025-03-17 11:11:14,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 560 places, 565 transitions, 1139 flow. Second operand has 3 states, 3 states have (on average 594.3333333333334) internal successors, (1783), 3 states have internal predecessors, (1783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:14,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:14,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 593 of 628 [2025-03-17 11:11:14,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:14,686 INFO L124 PetriNetUnfolderBase]: 36/1038 cut-off events. [2025-03-17 11:11:14,686 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2025-03-17 11:11:14,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1089 conditions, 1038 events. 36/1038 cut-off events. For 3/5 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 4394 event pairs, 12 based on Foata normal form. 0/908 useless extension candidates. Maximal degree in co-relation 1039. Up to 38 conditions per place. [2025-03-17 11:11:14,701 INFO L140 encePairwiseOnDemand]: 625/628 looper letters, 13 selfloop transitions, 2 changer transitions 0/564 dead transitions. [2025-03-17 11:11:14,703 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 561 places, 564 transitions, 1167 flow [2025-03-17 11:11:14,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:14,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:14,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1795 transitions. [2025-03-17 11:11:14,706 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.95276008492569 [2025-03-17 11:11:14,706 INFO L175 Difference]: Start difference. First operand has 560 places, 565 transitions, 1139 flow. Second operand 3 states and 1795 transitions. [2025-03-17 11:11:14,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 561 places, 564 transitions, 1167 flow [2025-03-17 11:11:14,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 560 places, 564 transitions, 1166 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:11:14,714 INFO L231 Difference]: Finished difference. Result has 560 places, 564 transitions, 1140 flow [2025-03-17 11:11:14,715 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1136, PETRI_DIFFERENCE_MINUEND_PLACES=558, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=564, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=562, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1140, PETRI_PLACES=560, PETRI_TRANSITIONS=564} [2025-03-17 11:11:14,717 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -27 predicate places. [2025-03-17 11:11:14,718 INFO L471 AbstractCegarLoop]: Abstraction has has 560 places, 564 transitions, 1140 flow [2025-03-17 11:11:14,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 594.3333333333334) internal successors, (1783), 3 states have internal predecessors, (1783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:14,719 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:14,719 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:11:14,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 11:11:14,719 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-03-17 11:11:14,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:14,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1748668144, now seen corresponding path program 1 times [2025-03-17 11:11:14,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:14,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506985956] [2025-03-17 11:11:14,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:14,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:14,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-17 11:11:14,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-17 11:11:14,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:14,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:14,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-17 11:11:14,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:14,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506985956] [2025-03-17 11:11:14,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506985956] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:14,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:14,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:14,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254359924] [2025-03-17 11:11:14,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:14,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:14,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:14,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:14,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:14,785 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 588 out of 628 [2025-03-17 11:11:14,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 560 places, 564 transitions, 1140 flow. Second operand has 3 states, 3 states have (on average 589.0) internal successors, (1767), 3 states have internal predecessors, (1767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:14,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:14,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 588 of 628 [2025-03-17 11:11:14,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:15,065 INFO L124 PetriNetUnfolderBase]: 136/2442 cut-off events. [2025-03-17 11:11:15,065 INFO L125 PetriNetUnfolderBase]: For 35/39 co-relation queries the response was YES. [2025-03-17 11:11:15,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2598 conditions, 2442 events. 136/2442 cut-off events. For 35/39 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 17733 event pairs, 64 based on Foata normal form. 0/2111 useless extension candidates. Maximal degree in co-relation 2548. Up to 141 conditions per place. [2025-03-17 11:11:15,167 INFO L140 encePairwiseOnDemand]: 622/628 looper letters, 16 selfloop transitions, 1 changer transitions 0/559 dead transitions. [2025-03-17 11:11:15,175 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 557 places, 559 transitions, 1164 flow [2025-03-17 11:11:15,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:15,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:15,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1786 transitions. [2025-03-17 11:11:15,179 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9479830148619958 [2025-03-17 11:11:15,179 INFO L175 Difference]: Start difference. First operand has 560 places, 564 transitions, 1140 flow. Second operand 3 states and 1786 transitions. [2025-03-17 11:11:15,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 557 places, 559 transitions, 1164 flow [2025-03-17 11:11:15,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 555 places, 559 transitions, 1160 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:15,189 INFO L231 Difference]: Finished difference. Result has 555 places, 559 transitions, 1128 flow [2025-03-17 11:11:15,189 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1126, PETRI_DIFFERENCE_MINUEND_PLACES=553, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=559, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=558, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1128, PETRI_PLACES=555, PETRI_TRANSITIONS=559} [2025-03-17 11:11:15,191 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -32 predicate places. [2025-03-17 11:11:15,191 INFO L471 AbstractCegarLoop]: Abstraction has has 555 places, 559 transitions, 1128 flow [2025-03-17 11:11:15,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 589.0) internal successors, (1767), 3 states have internal predecessors, (1767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:15,192 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:15,192 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] [2025-03-17 11:11:15,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 11:11:15,192 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-03-17 11:11:15,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:15,196 INFO L85 PathProgramCache]: Analyzing trace with hash -953123105, now seen corresponding path program 1 times [2025-03-17 11:11:15,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:15,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520613504] [2025-03-17 11:11:15,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:15,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:15,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-17 11:11:15,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-17 11:11:15,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:15,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:15,279 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-17 11:11:15,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:15,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520613504] [2025-03-17 11:11:15,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520613504] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:15,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:15,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:15,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596316781] [2025-03-17 11:11:15,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:15,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:15,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:15,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:15,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:15,323 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 593 out of 628 [2025-03-17 11:11:15,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 555 places, 559 transitions, 1128 flow. Second operand has 3 states, 3 states have (on average 594.3333333333334) internal successors, (1783), 3 states have internal predecessors, (1783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:15,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:15,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 593 of 628 [2025-03-17 11:11:15,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:15,507 INFO L124 PetriNetUnfolderBase]: 38/810 cut-off events. [2025-03-17 11:11:15,508 INFO L125 PetriNetUnfolderBase]: For 9/11 co-relation queries the response was YES. [2025-03-17 11:11:15,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 872 conditions, 810 events. 38/810 cut-off events. For 9/11 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 3022 event pairs, 20 based on Foata normal form. 0/723 useless extension candidates. Maximal degree in co-relation 822. Up to 50 conditions per place. [2025-03-17 11:11:15,527 INFO L140 encePairwiseOnDemand]: 625/628 looper letters, 13 selfloop transitions, 2 changer transitions 0/558 dead transitions. [2025-03-17 11:11:15,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 556 places, 558 transitions, 1156 flow [2025-03-17 11:11:15,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:15,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:15,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1795 transitions. [2025-03-17 11:11:15,530 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.95276008492569 [2025-03-17 11:11:15,530 INFO L175 Difference]: Start difference. First operand has 555 places, 559 transitions, 1128 flow. Second operand 3 states and 1795 transitions. [2025-03-17 11:11:15,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 556 places, 558 transitions, 1156 flow [2025-03-17 11:11:15,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 555 places, 558 transitions, 1155 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:11:15,544 INFO L231 Difference]: Finished difference. Result has 555 places, 558 transitions, 1129 flow [2025-03-17 11:11:15,545 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1125, PETRI_DIFFERENCE_MINUEND_PLACES=553, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=558, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=556, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1129, PETRI_PLACES=555, PETRI_TRANSITIONS=558} [2025-03-17 11:11:15,546 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -32 predicate places. [2025-03-17 11:11:15,546 INFO L471 AbstractCegarLoop]: Abstraction has has 555 places, 558 transitions, 1129 flow [2025-03-17 11:11:15,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 594.3333333333334) internal successors, (1783), 3 states have internal predecessors, (1783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:15,547 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:15,547 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:11:15,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 11:11:15,547 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-03-17 11:11:15,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:15,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1507258334, now seen corresponding path program 1 times [2025-03-17 11:11:15,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:15,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185748099] [2025-03-17 11:11:15,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:15,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:15,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-17 11:11:15,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-17 11:11:15,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:15,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:15,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:11:15,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:15,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185748099] [2025-03-17 11:11:15,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185748099] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:15,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:15,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:15,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191171867] [2025-03-17 11:11:15,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:15,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:15,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:15,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:15,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:15,656 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 597 out of 628 [2025-03-17 11:11:15,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 555 places, 558 transitions, 1129 flow. Second operand has 3 states, 3 states have (on average 598.3333333333334) internal successors, (1795), 3 states have internal predecessors, (1795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:15,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:15,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 597 of 628 [2025-03-17 11:11:15,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:15,871 INFO L124 PetriNetUnfolderBase]: 34/990 cut-off events. [2025-03-17 11:11:15,871 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 11:11:15,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1043 conditions, 990 events. 34/990 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 4362 event pairs, 6 based on Foata normal form. 0/878 useless extension candidates. Maximal degree in co-relation 994. Up to 23 conditions per place. [2025-03-17 11:11:15,884 INFO L140 encePairwiseOnDemand]: 625/628 looper letters, 12 selfloop transitions, 2 changer transitions 0/559 dead transitions. [2025-03-17 11:11:15,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 556 places, 559 transitions, 1161 flow [2025-03-17 11:11:15,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:15,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:15,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1806 transitions. [2025-03-17 11:11:15,890 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9585987261146497 [2025-03-17 11:11:15,890 INFO L175 Difference]: Start difference. First operand has 555 places, 558 transitions, 1129 flow. Second operand 3 states and 1806 transitions. [2025-03-17 11:11:15,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 556 places, 559 transitions, 1161 flow [2025-03-17 11:11:15,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 554 places, 559 transitions, 1157 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:15,896 INFO L231 Difference]: Finished difference. Result has 554 places, 557 transitions, 1127 flow [2025-03-17 11:11:15,897 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1123, PETRI_DIFFERENCE_MINUEND_PLACES=552, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=557, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=555, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1127, PETRI_PLACES=554, PETRI_TRANSITIONS=557} [2025-03-17 11:11:15,898 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -33 predicate places. [2025-03-17 11:11:15,898 INFO L471 AbstractCegarLoop]: Abstraction has has 554 places, 557 transitions, 1127 flow [2025-03-17 11:11:15,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 598.3333333333334) internal successors, (1795), 3 states have internal predecessors, (1795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:15,899 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:15,899 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:11:15,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 11:11:15,899 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-03-17 11:11:15,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:15,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1240664279, now seen corresponding path program 1 times [2025-03-17 11:11:15,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:15,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213652923] [2025-03-17 11:11:15,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:15,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:15,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-17 11:11:15,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-17 11:11:15,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:15,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:15,977 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-17 11:11:15,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:15,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213652923] [2025-03-17 11:11:15,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213652923] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:15,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:15,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:15,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725592921] [2025-03-17 11:11:15,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:15,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:15,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:15,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:15,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:16,006 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 596 out of 628 [2025-03-17 11:11:16,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 554 places, 557 transitions, 1127 flow. Second operand has 3 states, 3 states have (on average 597.6666666666666) internal successors, (1793), 3 states have internal predecessors, (1793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:16,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:16,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 596 of 628 [2025-03-17 11:11:16,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:16,205 INFO L124 PetriNetUnfolderBase]: 31/876 cut-off events. [2025-03-17 11:11:16,205 INFO L125 PetriNetUnfolderBase]: For 7/13 co-relation queries the response was YES. [2025-03-17 11:11:16,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 925 conditions, 876 events. 31/876 cut-off events. For 7/13 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 3404 event pairs, 6 based on Foata normal form. 1/783 useless extension candidates. Maximal degree in co-relation 876. Up to 24 conditions per place. [2025-03-17 11:11:16,235 INFO L140 encePairwiseOnDemand]: 625/628 looper letters, 13 selfloop transitions, 2 changer transitions 0/558 dead transitions. [2025-03-17 11:11:16,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 555 places, 558 transitions, 1161 flow [2025-03-17 11:11:16,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:16,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:16,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1804 transitions. [2025-03-17 11:11:16,241 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9575371549893843 [2025-03-17 11:11:16,241 INFO L175 Difference]: Start difference. First operand has 554 places, 557 transitions, 1127 flow. Second operand 3 states and 1804 transitions. [2025-03-17 11:11:16,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 555 places, 558 transitions, 1161 flow [2025-03-17 11:11:16,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 553 places, 558 transitions, 1157 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:16,257 INFO L231 Difference]: Finished difference. Result has 553 places, 556 transitions, 1125 flow [2025-03-17 11:11:16,258 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1121, PETRI_DIFFERENCE_MINUEND_PLACES=551, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=556, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=554, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1125, PETRI_PLACES=553, PETRI_TRANSITIONS=556} [2025-03-17 11:11:16,259 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -34 predicate places. [2025-03-17 11:11:16,259 INFO L471 AbstractCegarLoop]: Abstraction has has 553 places, 556 transitions, 1125 flow [2025-03-17 11:11:16,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 597.6666666666666) internal successors, (1793), 3 states have internal predecessors, (1793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:16,263 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:16,264 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:11:16,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 11:11:16,264 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-03-17 11:11:16,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:16,264 INFO L85 PathProgramCache]: Analyzing trace with hash 173003513, now seen corresponding path program 1 times [2025-03-17 11:11:16,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:16,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402550117] [2025-03-17 11:11:16,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:16,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:16,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-17 11:11:16,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-17 11:11:16,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:16,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:16,314 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-17 11:11:16,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:16,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402550117] [2025-03-17 11:11:16,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402550117] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:16,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:16,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:11:16,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444168665] [2025-03-17 11:11:16,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:16,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:16,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:16,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:16,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:16,323 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 596 out of 628 [2025-03-17 11:11:16,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 553 places, 556 transitions, 1125 flow. Second operand has 3 states, 3 states have (on average 597.6666666666666) internal successors, (1793), 3 states have internal predecessors, (1793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:16,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:16,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 596 of 628 [2025-03-17 11:11:16,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:16,514 INFO L124 PetriNetUnfolderBase]: 40/991 cut-off events. [2025-03-17 11:11:16,514 INFO L125 PetriNetUnfolderBase]: For 2/18 co-relation queries the response was YES. [2025-03-17 11:11:16,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1071 conditions, 991 events. 40/991 cut-off events. For 2/18 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 4305 event pairs, 12 based on Foata normal form. 1/879 useless extension candidates. Maximal degree in co-relation 1022. Up to 39 conditions per place. [2025-03-17 11:11:16,527 INFO L140 encePairwiseOnDemand]: 624/628 looper letters, 14 selfloop transitions, 3 changer transitions 0/559 dead transitions. [2025-03-17 11:11:16,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 555 places, 559 transitions, 1167 flow [2025-03-17 11:11:16,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:16,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:16,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1806 transitions. [2025-03-17 11:11:16,530 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9585987261146497 [2025-03-17 11:11:16,530 INFO L175 Difference]: Start difference. First operand has 553 places, 556 transitions, 1125 flow. Second operand 3 states and 1806 transitions. [2025-03-17 11:11:16,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 555 places, 559 transitions, 1167 flow [2025-03-17 11:11:16,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 553 places, 559 transitions, 1163 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:16,538 INFO L231 Difference]: Finished difference. Result has 555 places, 557 transitions, 1139 flow [2025-03-17 11:11:16,539 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1121, PETRI_DIFFERENCE_MINUEND_PLACES=551, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=556, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=553, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1139, PETRI_PLACES=555, PETRI_TRANSITIONS=557} [2025-03-17 11:11:16,540 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -32 predicate places. [2025-03-17 11:11:16,540 INFO L471 AbstractCegarLoop]: Abstraction has has 555 places, 557 transitions, 1139 flow [2025-03-17 11:11:16,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 597.6666666666666) internal successors, (1793), 3 states have internal predecessors, (1793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:16,541 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:16,541 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] [2025-03-17 11:11:16,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 11:11:16,541 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-03-17 11:11:16,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:16,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1594373073, now seen corresponding path program 1 times [2025-03-17 11:11:16,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:16,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177037126] [2025-03-17 11:11:16,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:16,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:16,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-17 11:11:16,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-17 11:11:16,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:16,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:16,586 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-17 11:11:16,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:16,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177037126] [2025-03-17 11:11:16,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177037126] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:16,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:16,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:16,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361997558] [2025-03-17 11:11:16,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:16,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:16,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:16,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:16,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:16,599 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 591 out of 628 [2025-03-17 11:11:16,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 555 places, 557 transitions, 1139 flow. Second operand has 3 states, 3 states have (on average 592.3333333333334) internal successors, (1777), 3 states have internal predecessors, (1777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:16,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:16,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 591 of 628 [2025-03-17 11:11:16,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:16,877 INFO L124 PetriNetUnfolderBase]: 131/2146 cut-off events. [2025-03-17 11:11:16,877 INFO L125 PetriNetUnfolderBase]: For 26/28 co-relation queries the response was YES. [2025-03-17 11:11:16,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2393 conditions, 2146 events. 131/2146 cut-off events. For 26/28 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 14851 event pairs, 24 based on Foata normal form. 0/1905 useless extension candidates. Maximal degree in co-relation 2343. Up to 154 conditions per place. [2025-03-17 11:11:16,898 INFO L140 encePairwiseOnDemand]: 622/628 looper letters, 20 selfloop transitions, 2 changer transitions 0/560 dead transitions. [2025-03-17 11:11:16,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 553 places, 560 transitions, 1194 flow [2025-03-17 11:11:16,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:16,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:16,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1799 transitions. [2025-03-17 11:11:16,901 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9548832271762208 [2025-03-17 11:11:16,901 INFO L175 Difference]: Start difference. First operand has 555 places, 557 transitions, 1139 flow. Second operand 3 states and 1799 transitions. [2025-03-17 11:11:16,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 553 places, 560 transitions, 1194 flow [2025-03-17 11:11:16,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 551 places, 560 transitions, 1188 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:16,908 INFO L231 Difference]: Finished difference. Result has 552 places, 555 transitions, 1139 flow [2025-03-17 11:11:16,908 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1125, PETRI_DIFFERENCE_MINUEND_PLACES=549, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=553, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=551, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1139, PETRI_PLACES=552, PETRI_TRANSITIONS=555} [2025-03-17 11:11:16,909 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -35 predicate places. [2025-03-17 11:11:16,909 INFO L471 AbstractCegarLoop]: Abstraction has has 552 places, 555 transitions, 1139 flow [2025-03-17 11:11:16,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 592.3333333333334) internal successors, (1777), 3 states have internal predecessors, (1777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:16,910 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:16,910 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] [2025-03-17 11:11:16,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 11:11:16,911 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread3Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-03-17 11:11:16,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:16,911 INFO L85 PathProgramCache]: Analyzing trace with hash 718375030, now seen corresponding path program 1 times [2025-03-17 11:11:16,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:16,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80668354] [2025-03-17 11:11:16,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:16,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:16,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-17 11:11:16,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-17 11:11:16,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:16,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:16,951 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-17 11:11:16,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:16,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80668354] [2025-03-17 11:11:16,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80668354] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:16,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:16,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:16,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370182039] [2025-03-17 11:11:16,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:16,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:16,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:16,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:16,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:16,968 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 596 out of 628 [2025-03-17 11:11:16,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 552 places, 555 transitions, 1139 flow. Second operand has 3 states, 3 states have (on average 598.0) internal successors, (1794), 3 states have internal predecessors, (1794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:16,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:16,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 596 of 628 [2025-03-17 11:11:16,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:17,097 INFO L124 PetriNetUnfolderBase]: 63/1137 cut-off events. [2025-03-17 11:11:17,097 INFO L125 PetriNetUnfolderBase]: For 36/52 co-relation queries the response was YES. [2025-03-17 11:11:17,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1237 conditions, 1137 events. 63/1137 cut-off events. For 36/52 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 5441 event pairs, 12 based on Foata normal form. 1/1005 useless extension candidates. Maximal degree in co-relation 1187. Up to 49 conditions per place. [2025-03-17 11:11:17,115 INFO L140 encePairwiseOnDemand]: 625/628 looper letters, 13 selfloop transitions, 2 changer transitions 0/556 dead transitions. [2025-03-17 11:11:17,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 553 places, 556 transitions, 1173 flow [2025-03-17 11:11:17,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:17,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:17,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1804 transitions. [2025-03-17 11:11:17,118 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9575371549893843 [2025-03-17 11:11:17,118 INFO L175 Difference]: Start difference. First operand has 552 places, 555 transitions, 1139 flow. Second operand 3 states and 1804 transitions. [2025-03-17 11:11:17,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 553 places, 556 transitions, 1173 flow [2025-03-17 11:11:17,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 553 places, 556 transitions, 1173 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:11:17,123 INFO L231 Difference]: Finished difference. Result has 553 places, 554 transitions, 1141 flow [2025-03-17 11:11:17,124 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1137, PETRI_DIFFERENCE_MINUEND_PLACES=551, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=554, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=552, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1141, PETRI_PLACES=553, PETRI_TRANSITIONS=554} [2025-03-17 11:11:17,124 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -34 predicate places. [2025-03-17 11:11:17,124 INFO L471 AbstractCegarLoop]: Abstraction has has 553 places, 554 transitions, 1141 flow [2025-03-17 11:11:17,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 598.0) internal successors, (1794), 3 states have internal predecessors, (1794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:17,125 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:17,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] [2025-03-17 11:11:17,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 11:11:17,126 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-03-17 11:11:17,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:17,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1442011820, now seen corresponding path program 1 times [2025-03-17 11:11:17,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:17,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616079692] [2025-03-17 11:11:17,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:17,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:17,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-17 11:11:17,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-17 11:11:17,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:17,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:17,314 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-17 11:11:17,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:17,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616079692] [2025-03-17 11:11:17,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616079692] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:17,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:17,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 11:11:17,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7769613] [2025-03-17 11:11:17,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:17,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 11:11:17,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:17,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 11:11:17,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 11:11:17,761 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 565 out of 628 [2025-03-17 11:11:17,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 553 places, 554 transitions, 1141 flow. Second operand has 8 states, 8 states have (on average 569.125) internal successors, (4553), 8 states have internal predecessors, (4553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:17,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:17,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 565 of 628 [2025-03-17 11:11:17,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:18,020 INFO L124 PetriNetUnfolderBase]: 98/1577 cut-off events. [2025-03-17 11:11:18,020 INFO L125 PetriNetUnfolderBase]: For 6/38 co-relation queries the response was YES. [2025-03-17 11:11:18,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1946 conditions, 1577 events. 98/1577 cut-off events. For 6/38 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 8565 event pairs, 45 based on Foata normal form. 5/1448 useless extension candidates. Maximal degree in co-relation 1893. Up to 158 conditions per place. [2025-03-17 11:11:18,041 INFO L140 encePairwiseOnDemand]: 614/628 looper letters, 69 selfloop transitions, 15 changer transitions 0/592 dead transitions. [2025-03-17 11:11:18,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 563 places, 592 transitions, 1401 flow [2025-03-17 11:11:18,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 11:11:18,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-17 11:11:18,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6299 transitions. [2025-03-17 11:11:18,048 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9118413433700058 [2025-03-17 11:11:18,048 INFO L175 Difference]: Start difference. First operand has 553 places, 554 transitions, 1141 flow. Second operand 11 states and 6299 transitions. [2025-03-17 11:11:18,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 563 places, 592 transitions, 1401 flow [2025-03-17 11:11:18,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 561 places, 592 transitions, 1397 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:18,054 INFO L231 Difference]: Finished difference. Result has 566 places, 562 transitions, 1213 flow [2025-03-17 11:11:18,055 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1137, PETRI_DIFFERENCE_MINUEND_PLACES=551, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=554, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=541, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1213, PETRI_PLACES=566, PETRI_TRANSITIONS=562} [2025-03-17 11:11:18,055 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -21 predicate places. [2025-03-17 11:11:18,055 INFO L471 AbstractCegarLoop]: Abstraction has has 566 places, 562 transitions, 1213 flow [2025-03-17 11:11:18,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 569.125) internal successors, (4553), 8 states have internal predecessors, (4553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:18,057 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:18,057 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] [2025-03-17 11:11:18,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 11:11:18,057 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-03-17 11:11:18,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:18,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1548593926, now seen corresponding path program 1 times [2025-03-17 11:11:18,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:18,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259760218] [2025-03-17 11:11:18,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:18,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:18,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-17 11:11:18,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-17 11:11:18,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:18,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:18,105 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-17 11:11:18,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:18,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259760218] [2025-03-17 11:11:18,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259760218] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:18,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:18,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:11:18,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100761990] [2025-03-17 11:11:18,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:18,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:18,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:18,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:18,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:18,114 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 596 out of 628 [2025-03-17 11:11:18,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 566 places, 562 transitions, 1213 flow. Second operand has 3 states, 3 states have (on average 598.0) internal successors, (1794), 3 states have internal predecessors, (1794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:18,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:18,116 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 596 of 628 [2025-03-17 11:11:18,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:18,361 INFO L124 PetriNetUnfolderBase]: 137/1981 cut-off events. [2025-03-17 11:11:18,362 INFO L125 PetriNetUnfolderBase]: For 61/94 co-relation queries the response was YES. [2025-03-17 11:11:18,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2331 conditions, 1981 events. 137/1981 cut-off events. For 61/94 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 13000 event pairs, 48 based on Foata normal form. 0/1767 useless extension candidates. Maximal degree in co-relation 2272. Up to 152 conditions per place. [2025-03-17 11:11:18,465 INFO L140 encePairwiseOnDemand]: 624/628 looper letters, 14 selfloop transitions, 3 changer transitions 0/565 dead transitions. [2025-03-17 11:11:18,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 568 places, 565 transitions, 1255 flow [2025-03-17 11:11:18,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:18,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:18,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1806 transitions. [2025-03-17 11:11:18,473 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9585987261146497 [2025-03-17 11:11:18,473 INFO L175 Difference]: Start difference. First operand has 566 places, 562 transitions, 1213 flow. Second operand 3 states and 1806 transitions. [2025-03-17 11:11:18,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 568 places, 565 transitions, 1255 flow [2025-03-17 11:11:18,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 567 places, 565 transitions, 1251 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:11:18,479 INFO L231 Difference]: Finished difference. Result has 569 places, 563 transitions, 1227 flow [2025-03-17 11:11:18,480 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1209, PETRI_DIFFERENCE_MINUEND_PLACES=565, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=562, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=559, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1227, PETRI_PLACES=569, PETRI_TRANSITIONS=563} [2025-03-17 11:11:18,480 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -18 predicate places. [2025-03-17 11:11:18,480 INFO L471 AbstractCegarLoop]: Abstraction has has 569 places, 563 transitions, 1227 flow [2025-03-17 11:11:18,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 598.0) internal successors, (1794), 3 states have internal predecessors, (1794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:18,482 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:18,482 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:11:18,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 11:11:18,482 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread3Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-03-17 11:11:18,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:18,483 INFO L85 PathProgramCache]: Analyzing trace with hash 2113570571, now seen corresponding path program 1 times [2025-03-17 11:11:18,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:18,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436557067] [2025-03-17 11:11:18,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:18,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:18,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-17 11:11:18,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-17 11:11:18,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:18,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:18,540 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-17 11:11:18,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:18,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436557067] [2025-03-17 11:11:18,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436557067] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:18,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:18,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:11:18,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20796027] [2025-03-17 11:11:18,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:18,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:18,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:18,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:18,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:18,554 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 596 out of 628 [2025-03-17 11:11:18,556 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 569 places, 563 transitions, 1227 flow. Second operand has 3 states, 3 states have (on average 598.3333333333334) internal successors, (1795), 3 states have internal predecessors, (1795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:18,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:18,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 596 of 628 [2025-03-17 11:11:18,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:18,842 INFO L124 PetriNetUnfolderBase]: 131/1752 cut-off events. [2025-03-17 11:11:18,842 INFO L125 PetriNetUnfolderBase]: For 97/162 co-relation queries the response was YES. [2025-03-17 11:11:18,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2068 conditions, 1752 events. 131/1752 cut-off events. For 97/162 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 10359 event pairs, 48 based on Foata normal form. 0/1553 useless extension candidates. Maximal degree in co-relation 2009. Up to 149 conditions per place. [2025-03-17 11:11:18,868 INFO L140 encePairwiseOnDemand]: 624/628 looper letters, 14 selfloop transitions, 3 changer transitions 0/566 dead transitions. [2025-03-17 11:11:18,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 571 places, 566 transitions, 1269 flow [2025-03-17 11:11:18,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:18,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:18,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1806 transitions. [2025-03-17 11:11:18,870 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9585987261146497 [2025-03-17 11:11:18,871 INFO L175 Difference]: Start difference. First operand has 569 places, 563 transitions, 1227 flow. Second operand 3 states and 1806 transitions. [2025-03-17 11:11:18,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 571 places, 566 transitions, 1269 flow [2025-03-17 11:11:18,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 569 places, 566 transitions, 1263 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:18,877 INFO L231 Difference]: Finished difference. Result has 571 places, 564 transitions, 1239 flow [2025-03-17 11:11:18,878 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1221, PETRI_DIFFERENCE_MINUEND_PLACES=567, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=563, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=560, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1239, PETRI_PLACES=571, PETRI_TRANSITIONS=564} [2025-03-17 11:11:18,878 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -16 predicate places. [2025-03-17 11:11:18,878 INFO L471 AbstractCegarLoop]: Abstraction has has 571 places, 564 transitions, 1239 flow [2025-03-17 11:11:18,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 598.3333333333334) internal successors, (1795), 3 states have internal predecessors, (1795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:18,878 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:18,878 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] [2025-03-17 11:11:18,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 11:11:18,879 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-03-17 11:11:18,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:18,879 INFO L85 PathProgramCache]: Analyzing trace with hash -2066949079, now seen corresponding path program 1 times [2025-03-17 11:11:18,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:18,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756031310] [2025-03-17 11:11:18,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:18,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:18,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-17 11:11:18,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-17 11:11:18,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:18,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:19,088 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-17 11:11:19,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:19,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756031310] [2025-03-17 11:11:19,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756031310] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:19,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:19,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 11:11:19,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090216498] [2025-03-17 11:11:19,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:19,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 11:11:19,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:19,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 11:11:19,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 11:11:19,524 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 565 out of 628 [2025-03-17 11:11:19,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 571 places, 564 transitions, 1239 flow. Second operand has 8 states, 8 states have (on average 569.25) internal successors, (4554), 8 states have internal predecessors, (4554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:19,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:19,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 565 of 628 [2025-03-17 11:11:19,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:19,881 INFO L124 PetriNetUnfolderBase]: 111/1481 cut-off events. [2025-03-17 11:11:19,881 INFO L125 PetriNetUnfolderBase]: For 64/81 co-relation queries the response was YES. [2025-03-17 11:11:19,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1900 conditions, 1481 events. 111/1481 cut-off events. For 64/81 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 8051 event pairs, 46 based on Foata normal form. 3/1366 useless extension candidates. Maximal degree in co-relation 1838. Up to 174 conditions per place. [2025-03-17 11:11:19,906 INFO L140 encePairwiseOnDemand]: 614/628 looper letters, 69 selfloop transitions, 15 changer transitions 0/597 dead transitions. [2025-03-17 11:11:19,906 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 581 places, 597 transitions, 1489 flow [2025-03-17 11:11:19,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 11:11:19,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-17 11:11:19,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6299 transitions. [2025-03-17 11:11:19,914 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9118413433700058 [2025-03-17 11:11:19,914 INFO L175 Difference]: Start difference. First operand has 571 places, 564 transitions, 1239 flow. Second operand 11 states and 6299 transitions. [2025-03-17 11:11:19,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 581 places, 597 transitions, 1489 flow [2025-03-17 11:11:19,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 579 places, 597 transitions, 1483 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:19,922 INFO L231 Difference]: Finished difference. Result has 582 places, 567 transitions, 1288 flow [2025-03-17 11:11:19,922 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1233, PETRI_DIFFERENCE_MINUEND_PLACES=569, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=564, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=549, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1288, PETRI_PLACES=582, PETRI_TRANSITIONS=567} [2025-03-17 11:11:19,922 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -5 predicate places. [2025-03-17 11:11:19,922 INFO L471 AbstractCegarLoop]: Abstraction has has 582 places, 567 transitions, 1288 flow [2025-03-17 11:11:19,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 569.25) internal successors, (4554), 8 states have internal predecessors, (4554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:19,923 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:19,923 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] [2025-03-17 11:11:19,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 11:11:19,923 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread3Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-03-17 11:11:19,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:19,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1526945115, now seen corresponding path program 1 times [2025-03-17 11:11:19,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:19,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409556369] [2025-03-17 11:11:19,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:19,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:19,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-17 11:11:19,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-17 11:11:19,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:19,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:19,971 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-17 11:11:19,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:19,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409556369] [2025-03-17 11:11:19,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409556369] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:19,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:19,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:19,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618225908] [2025-03-17 11:11:19,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:19,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:19,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:19,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:19,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:19,985 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 591 out of 628 [2025-03-17 11:11:19,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 582 places, 567 transitions, 1288 flow. Second operand has 3 states, 3 states have (on average 593.0) internal successors, (1779), 3 states have internal predecessors, (1779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:19,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:19,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 591 of 628 [2025-03-17 11:11:19,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:20,458 INFO L124 PetriNetUnfolderBase]: 140/2795 cut-off events. [2025-03-17 11:11:20,459 INFO L125 PetriNetUnfolderBase]: For 53/82 co-relation queries the response was YES. [2025-03-17 11:11:20,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3229 conditions, 2795 events. 140/2795 cut-off events. For 53/82 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 19598 event pairs, 23 based on Foata normal form. 1/2520 useless extension candidates. Maximal degree in co-relation 3163. Up to 145 conditions per place. [2025-03-17 11:11:20,506 INFO L140 encePairwiseOnDemand]: 622/628 looper letters, 20 selfloop transitions, 2 changer transitions 0/570 dead transitions. [2025-03-17 11:11:20,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 580 places, 570 transitions, 1343 flow [2025-03-17 11:11:20,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:20,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:20,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1799 transitions. [2025-03-17 11:11:20,509 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9548832271762208 [2025-03-17 11:11:20,509 INFO L175 Difference]: Start difference. First operand has 582 places, 567 transitions, 1288 flow. Second operand 3 states and 1799 transitions. [2025-03-17 11:11:20,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 580 places, 570 transitions, 1343 flow [2025-03-17 11:11:20,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 573 places, 570 transitions, 1322 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-03-17 11:11:20,518 INFO L231 Difference]: Finished difference. Result has 574 places, 565 transitions, 1273 flow [2025-03-17 11:11:20,518 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1259, PETRI_DIFFERENCE_MINUEND_PLACES=571, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=563, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=561, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1273, PETRI_PLACES=574, PETRI_TRANSITIONS=565} [2025-03-17 11:11:20,518 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -13 predicate places. [2025-03-17 11:11:20,518 INFO L471 AbstractCegarLoop]: Abstraction has has 574 places, 565 transitions, 1273 flow [2025-03-17 11:11:20,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 593.0) internal successors, (1779), 3 states have internal predecessors, (1779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:20,519 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:20,519 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] [2025-03-17 11:11:20,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 11:11:20,519 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread3Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-03-17 11:11:20,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:20,520 INFO L85 PathProgramCache]: Analyzing trace with hash 747205480, now seen corresponding path program 1 times [2025-03-17 11:11:20,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:20,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142691497] [2025-03-17 11:11:20,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:20,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:20,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-17 11:11:20,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-17 11:11:20,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:20,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:20,705 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-17 11:11:20,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:20,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142691497] [2025-03-17 11:11:20,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142691497] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:20,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:20,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 11:11:20,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562120787] [2025-03-17 11:11:20,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:20,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 11:11:20,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:20,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 11:11:20,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 11:11:21,095 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 565 out of 628 [2025-03-17 11:11:21,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 574 places, 565 transitions, 1273 flow. Second operand has 8 states, 8 states have (on average 569.375) internal successors, (4555), 8 states have internal predecessors, (4555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:21,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:21,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 565 of 628 [2025-03-17 11:11:21,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:21,722 INFO L124 PetriNetUnfolderBase]: 245/3127 cut-off events. [2025-03-17 11:11:21,722 INFO L125 PetriNetUnfolderBase]: For 214/272 co-relation queries the response was YES. [2025-03-17 11:11:21,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3973 conditions, 3127 events. 245/3127 cut-off events. For 214/272 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 24320 event pairs, 103 based on Foata normal form. 10/2849 useless extension candidates. Maximal degree in co-relation 3906. Up to 347 conditions per place. [2025-03-17 11:11:21,770 INFO L140 encePairwiseOnDemand]: 614/628 looper letters, 65 selfloop transitions, 15 changer transitions 0/594 dead transitions. [2025-03-17 11:11:21,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 584 places, 594 transitions, 1507 flow [2025-03-17 11:11:21,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 11:11:21,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-17 11:11:21,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6290 transitions. [2025-03-17 11:11:21,778 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9105385060799074 [2025-03-17 11:11:21,778 INFO L175 Difference]: Start difference. First operand has 574 places, 565 transitions, 1273 flow. Second operand 11 states and 6290 transitions. [2025-03-17 11:11:21,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 584 places, 594 transitions, 1507 flow [2025-03-17 11:11:21,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 584 places, 594 transitions, 1507 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:11:21,787 INFO L231 Difference]: Finished difference. Result has 589 places, 573 transitions, 1349 flow [2025-03-17 11:11:21,788 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1273, PETRI_DIFFERENCE_MINUEND_PLACES=574, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=565, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=552, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1349, PETRI_PLACES=589, PETRI_TRANSITIONS=573} [2025-03-17 11:11:21,788 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, 2 predicate places. [2025-03-17 11:11:21,788 INFO L471 AbstractCegarLoop]: Abstraction has has 589 places, 573 transitions, 1349 flow [2025-03-17 11:11:21,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 569.375) internal successors, (4555), 8 states have internal predecessors, (4555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:21,789 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:21,789 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-17 11:11:21,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 11:11:21,789 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-03-17 11:11:21,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:21,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1763143433, now seen corresponding path program 1 times [2025-03-17 11:11:21,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:21,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068117079] [2025-03-17 11:11:21,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:21,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:21,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-17 11:11:21,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-17 11:11:21,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:21,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:21,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:11:21,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:21,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068117079] [2025-03-17 11:11:21,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068117079] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:21,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:21,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 11:11:21,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379550490] [2025-03-17 11:11:21,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:21,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 11:11:21,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:21,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 11:11:21,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 11:11:22,409 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 565 out of 628 [2025-03-17 11:11:22,412 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 589 places, 573 transitions, 1349 flow. Second operand has 8 states, 8 states have (on average 569.25) internal successors, (4554), 8 states have internal predecessors, (4554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:22,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:22,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 565 of 628 [2025-03-17 11:11:22,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:22,897 INFO L124 PetriNetUnfolderBase]: 147/2380 cut-off events. [2025-03-17 11:11:22,897 INFO L125 PetriNetUnfolderBase]: For 118/172 co-relation queries the response was YES. [2025-03-17 11:11:22,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3233 conditions, 2380 events. 147/2380 cut-off events. For 118/172 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 15203 event pairs, 55 based on Foata normal form. 2/2219 useless extension candidates. Maximal degree in co-relation 3157. Up to 233 conditions per place. [2025-03-17 11:11:22,929 INFO L140 encePairwiseOnDemand]: 613/628 looper letters, 71 selfloop transitions, 18 changer transitions 0/603 dead transitions. [2025-03-17 11:11:22,929 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 599 places, 603 transitions, 1627 flow [2025-03-17 11:11:22,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 11:11:22,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-17 11:11:22,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6292 transitions. [2025-03-17 11:11:22,937 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.910828025477707 [2025-03-17 11:11:22,937 INFO L175 Difference]: Start difference. First operand has 589 places, 573 transitions, 1349 flow. Second operand 11 states and 6292 transitions. [2025-03-17 11:11:22,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 599 places, 603 transitions, 1627 flow [2025-03-17 11:11:22,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 598 places, 603 transitions, 1623 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:11:22,946 INFO L231 Difference]: Finished difference. Result has 601 places, 579 transitions, 1440 flow [2025-03-17 11:11:22,946 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1345, PETRI_DIFFERENCE_MINUEND_PLACES=588, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=573, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=555, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1440, PETRI_PLACES=601, PETRI_TRANSITIONS=579} [2025-03-17 11:11:22,946 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, 14 predicate places. [2025-03-17 11:11:22,946 INFO L471 AbstractCegarLoop]: Abstraction has has 601 places, 579 transitions, 1440 flow [2025-03-17 11:11:22,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 569.25) internal successors, (4554), 8 states have internal predecessors, (4554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:22,947 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:22,947 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-17 11:11:22,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 11:11:22,947 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-03-17 11:11:22,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:22,948 INFO L85 PathProgramCache]: Analyzing trace with hash 677659020, now seen corresponding path program 1 times [2025-03-17 11:11:22,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:22,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490993121] [2025-03-17 11:11:22,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:22,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:22,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-03-17 11:11:22,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-03-17 11:11:22,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:22,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:23,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:11:23,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:23,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490993121] [2025-03-17 11:11:23,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490993121] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:23,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:23,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 11:11:23,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651374043] [2025-03-17 11:11:23,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:23,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 11:11:23,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:23,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 11:11:23,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 11:11:23,493 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 565 out of 628 [2025-03-17 11:11:23,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 601 places, 579 transitions, 1440 flow. Second operand has 8 states, 8 states have (on average 569.375) internal successors, (4555), 8 states have internal predecessors, (4555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:23,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:23,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 565 of 628 [2025-03-17 11:11:23,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:24,201 INFO L124 PetriNetUnfolderBase]: 338/4947 cut-off events. [2025-03-17 11:11:24,202 INFO L125 PetriNetUnfolderBase]: For 466/624 co-relation queries the response was YES. [2025-03-17 11:11:24,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6675 conditions, 4947 events. 338/4947 cut-off events. For 466/624 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 42823 event pairs, 159 based on Foata normal form. 2/4532 useless extension candidates. Maximal degree in co-relation 6594. Up to 453 conditions per place. [2025-03-17 11:11:24,274 INFO L140 encePairwiseOnDemand]: 613/628 looper letters, 67 selfloop transitions, 18 changer transitions 0/605 dead transitions. [2025-03-17 11:11:24,274 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 611 places, 605 transitions, 1702 flow [2025-03-17 11:11:24,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 11:11:24,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-17 11:11:24,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6283 transitions. [2025-03-17 11:11:24,280 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9095251881876085 [2025-03-17 11:11:24,280 INFO L175 Difference]: Start difference. First operand has 601 places, 579 transitions, 1440 flow. Second operand 11 states and 6283 transitions. [2025-03-17 11:11:24,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 611 places, 605 transitions, 1702 flow [2025-03-17 11:11:24,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 604 places, 605 transitions, 1681 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-03-17 11:11:24,291 INFO L231 Difference]: Finished difference. Result has 609 places, 590 transitions, 1535 flow [2025-03-17 11:11:24,292 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1419, PETRI_DIFFERENCE_MINUEND_PLACES=594, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=579, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=563, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1535, PETRI_PLACES=609, PETRI_TRANSITIONS=590} [2025-03-17 11:11:24,292 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, 22 predicate places. [2025-03-17 11:11:24,292 INFO L471 AbstractCegarLoop]: Abstraction has has 609 places, 590 transitions, 1535 flow [2025-03-17 11:11:24,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 569.375) internal successors, (4555), 8 states have internal predecessors, (4555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:24,293 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:24,293 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-17 11:11:24,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 11:11:24,293 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread3Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-03-17 11:11:24,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:24,294 INFO L85 PathProgramCache]: Analyzing trace with hash -818326443, now seen corresponding path program 1 times [2025-03-17 11:11:24,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:24,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921923157] [2025-03-17 11:11:24,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:24,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:24,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-17 11:11:24,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-17 11:11:24,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:24,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:24,421 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:11:24,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:24,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921923157] [2025-03-17 11:11:24,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921923157] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:24,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:24,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 11:11:24,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917691590] [2025-03-17 11:11:24,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:24,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 11:11:24,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:24,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 11:11:24,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 11:11:24,797 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 565 out of 628 [2025-03-17 11:11:24,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 609 places, 590 transitions, 1535 flow. Second operand has 8 states, 8 states have (on average 569.5) internal successors, (4556), 8 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:24,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:24,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 565 of 628 [2025-03-17 11:11:24,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:25,341 INFO L124 PetriNetUnfolderBase]: 296/3695 cut-off events. [2025-03-17 11:11:25,341 INFO L125 PetriNetUnfolderBase]: For 622/681 co-relation queries the response was YES. [2025-03-17 11:11:25,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5215 conditions, 3695 events. 296/3695 cut-off events. For 622/681 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 30350 event pairs, 127 based on Foata normal form. 0/3423 useless extension candidates. Maximal degree in co-relation 5127. Up to 433 conditions per place. [2025-03-17 11:11:25,390 INFO L140 encePairwiseOnDemand]: 613/628 looper letters, 67 selfloop transitions, 18 changer transitions 0/611 dead transitions. [2025-03-17 11:11:25,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 619 places, 611 transitions, 1787 flow [2025-03-17 11:11:25,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 11:11:25,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-17 11:11:25,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6283 transitions. [2025-03-17 11:11:25,393 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9095251881876085 [2025-03-17 11:11:25,393 INFO L175 Difference]: Start difference. First operand has 609 places, 590 transitions, 1535 flow. Second operand 11 states and 6283 transitions. [2025-03-17 11:11:25,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 619 places, 611 transitions, 1787 flow [2025-03-17 11:11:25,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 618 places, 611 transitions, 1783 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:11:25,402 INFO L231 Difference]: Finished difference. Result has 621 places, 596 transitions, 1626 flow [2025-03-17 11:11:25,403 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1531, PETRI_DIFFERENCE_MINUEND_PLACES=608, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=590, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=572, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1626, PETRI_PLACES=621, PETRI_TRANSITIONS=596} [2025-03-17 11:11:25,403 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, 34 predicate places. [2025-03-17 11:11:25,403 INFO L471 AbstractCegarLoop]: Abstraction has has 621 places, 596 transitions, 1626 flow [2025-03-17 11:11:25,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 569.5) internal successors, (4556), 8 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:25,404 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:25,404 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] [2025-03-17 11:11:25,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-17 11:11:25,404 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-03-17 11:11:25,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:25,405 INFO L85 PathProgramCache]: Analyzing trace with hash 445496254, now seen corresponding path program 1 times [2025-03-17 11:11:25,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:25,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344859126] [2025-03-17 11:11:25,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:25,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:25,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-17 11:11:25,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-17 11:11:25,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:25,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:25,715 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 11:11:25,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:25,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344859126] [2025-03-17 11:11:25,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344859126] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:25,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:25,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:11:25,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893983073] [2025-03-17 11:11:25,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:25,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:11:25,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:25,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:11:25,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:11:26,071 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 576 out of 628 [2025-03-17 11:11:26,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 621 places, 596 transitions, 1626 flow. Second operand has 6 states, 6 states have (on average 578.8333333333334) internal successors, (3473), 6 states have internal predecessors, (3473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:26,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:26,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 576 of 628 [2025-03-17 11:11:26,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:26,532 INFO L124 PetriNetUnfolderBase]: 157/3538 cut-off events. [2025-03-17 11:11:26,532 INFO L125 PetriNetUnfolderBase]: For 561/605 co-relation queries the response was YES. [2025-03-17 11:11:26,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4986 conditions, 3538 events. 157/3538 cut-off events. For 561/605 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 25901 event pairs, 22 based on Foata normal form. 12/3338 useless extension candidates. Maximal degree in co-relation 4894. Up to 173 conditions per place. [2025-03-17 11:11:26,579 INFO L140 encePairwiseOnDemand]: 621/628 looper letters, 41 selfloop transitions, 5 changer transitions 0/605 dead transitions. [2025-03-17 11:11:26,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 624 places, 605 transitions, 1747 flow [2025-03-17 11:11:26,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:11:26,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:11:26,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3501 transitions. [2025-03-17 11:11:26,582 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.929140127388535 [2025-03-17 11:11:26,582 INFO L175 Difference]: Start difference. First operand has 621 places, 596 transitions, 1626 flow. Second operand 6 states and 3501 transitions. [2025-03-17 11:11:26,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 624 places, 605 transitions, 1747 flow [2025-03-17 11:11:26,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 617 places, 605 transitions, 1726 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-03-17 11:11:26,593 INFO L231 Difference]: Finished difference. Result has 617 places, 594 transitions, 1611 flow [2025-03-17 11:11:26,594 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1601, PETRI_DIFFERENCE_MINUEND_PLACES=612, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=594, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=589, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1611, PETRI_PLACES=617, PETRI_TRANSITIONS=594} [2025-03-17 11:11:26,594 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, 30 predicate places. [2025-03-17 11:11:26,594 INFO L471 AbstractCegarLoop]: Abstraction has has 617 places, 594 transitions, 1611 flow [2025-03-17 11:11:26,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 578.8333333333334) internal successors, (3473), 6 states have internal predecessors, (3473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:26,595 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:26,595 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] [2025-03-17 11:11:26,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-17 11:11:26,595 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-03-17 11:11:26,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:26,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1430883235, now seen corresponding path program 1 times [2025-03-17 11:11:26,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:26,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180135643] [2025-03-17 11:11:26,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:26,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:26,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-17 11:11:26,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-17 11:11:26,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:26,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:26,907 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 11:11:26,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:26,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180135643] [2025-03-17 11:11:26,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180135643] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:26,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:26,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:11:26,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275914746] [2025-03-17 11:11:26,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:26,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:11:26,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:26,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:11:26,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:11:27,355 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 576 out of 628 [2025-03-17 11:11:27,357 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 617 places, 594 transitions, 1611 flow. Second operand has 6 states, 6 states have (on average 579.0) internal successors, (3474), 6 states have internal predecessors, (3474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:27,357 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:27,357 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 576 of 628 [2025-03-17 11:11:27,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:27,907 INFO L124 PetriNetUnfolderBase]: 186/3895 cut-off events. [2025-03-17 11:11:27,907 INFO L125 PetriNetUnfolderBase]: For 644/742 co-relation queries the response was YES. [2025-03-17 11:11:27,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5423 conditions, 3895 events. 186/3895 cut-off events. For 644/742 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 30183 event pairs, 30 based on Foata normal form. 8/3651 useless extension candidates. Maximal degree in co-relation 5332. Up to 197 conditions per place. [2025-03-17 11:11:27,962 INFO L140 encePairwiseOnDemand]: 621/628 looper letters, 40 selfloop transitions, 5 changer transitions 0/602 dead transitions. [2025-03-17 11:11:27,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 620 places, 602 transitions, 1727 flow [2025-03-17 11:11:27,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:11:27,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:11:27,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3500 transitions. [2025-03-17 11:11:27,965 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9288747346072187 [2025-03-17 11:11:27,965 INFO L175 Difference]: Start difference. First operand has 617 places, 594 transitions, 1611 flow. Second operand 6 states and 3500 transitions. [2025-03-17 11:11:27,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 620 places, 602 transitions, 1727 flow [2025-03-17 11:11:27,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 615 places, 602 transitions, 1717 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:11:27,975 INFO L231 Difference]: Finished difference. Result has 615 places, 592 transitions, 1607 flow [2025-03-17 11:11:27,975 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1597, PETRI_DIFFERENCE_MINUEND_PLACES=610, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=592, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=587, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1607, PETRI_PLACES=615, PETRI_TRANSITIONS=592} [2025-03-17 11:11:27,976 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, 28 predicate places. [2025-03-17 11:11:27,976 INFO L471 AbstractCegarLoop]: Abstraction has has 615 places, 592 transitions, 1607 flow [2025-03-17 11:11:27,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 579.0) internal successors, (3474), 6 states have internal predecessors, (3474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:27,976 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:27,976 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-17 11:11:27,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-17 11:11:27,976 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-03-17 11:11:27,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:27,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1903273122, now seen corresponding path program 1 times [2025-03-17 11:11:27,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:27,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055881999] [2025-03-17 11:11:27,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:27,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:27,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-17 11:11:27,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-17 11:11:27,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:27,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:28,240 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 11:11:28,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:28,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055881999] [2025-03-17 11:11:28,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055881999] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:28,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:28,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:11:28,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016896201] [2025-03-17 11:11:28,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:28,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:11:28,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:28,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:11:28,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:11:28,673 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 576 out of 628 [2025-03-17 11:11:28,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 615 places, 592 transitions, 1607 flow. Second operand has 6 states, 6 states have (on average 578.8333333333334) internal successors, (3473), 6 states have internal predecessors, (3473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:28,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:28,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 576 of 628 [2025-03-17 11:11:28,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:29,185 INFO L124 PetriNetUnfolderBase]: 134/3605 cut-off events. [2025-03-17 11:11:29,185 INFO L125 PetriNetUnfolderBase]: For 539/612 co-relation queries the response was YES. [2025-03-17 11:11:29,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4989 conditions, 3605 events. 134/3605 cut-off events. For 539/612 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 26300 event pairs, 22 based on Foata normal form. 11/3409 useless extension candidates. Maximal degree in co-relation 4898. Up to 183 conditions per place. [2025-03-17 11:11:29,227 INFO L140 encePairwiseOnDemand]: 621/628 looper letters, 41 selfloop transitions, 5 changer transitions 0/601 dead transitions. [2025-03-17 11:11:29,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 618 places, 601 transitions, 1728 flow [2025-03-17 11:11:29,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:11:29,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:11:29,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3501 transitions. [2025-03-17 11:11:29,230 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.929140127388535 [2025-03-17 11:11:29,230 INFO L175 Difference]: Start difference. First operand has 615 places, 592 transitions, 1607 flow. Second operand 6 states and 3501 transitions. [2025-03-17 11:11:29,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 618 places, 601 transitions, 1728 flow [2025-03-17 11:11:29,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 613 places, 601 transitions, 1718 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:11:29,239 INFO L231 Difference]: Finished difference. Result has 613 places, 590 transitions, 1603 flow [2025-03-17 11:11:29,240 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1593, PETRI_DIFFERENCE_MINUEND_PLACES=608, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=590, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=585, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1603, PETRI_PLACES=613, PETRI_TRANSITIONS=590} [2025-03-17 11:11:29,240 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, 26 predicate places. [2025-03-17 11:11:29,241 INFO L471 AbstractCegarLoop]: Abstraction has has 613 places, 590 transitions, 1603 flow [2025-03-17 11:11:29,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 578.8333333333334) internal successors, (3473), 6 states have internal predecessors, (3473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:29,241 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:29,241 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-17 11:11:29,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-17 11:11:29,241 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-03-17 11:11:29,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:29,242 INFO L85 PathProgramCache]: Analyzing trace with hash 689298148, now seen corresponding path program 1 times [2025-03-17 11:11:29,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:29,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687409046] [2025-03-17 11:11:29,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:29,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:29,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-17 11:11:29,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-17 11:11:29,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:29,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:29,275 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 11:11:29,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:29,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687409046] [2025-03-17 11:11:29,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687409046] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:29,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:29,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:29,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877144432] [2025-03-17 11:11:29,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:29,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:29,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:29,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:29,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:29,288 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 591 out of 628 [2025-03-17 11:11:29,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 613 places, 590 transitions, 1603 flow. Second operand has 3 states, 3 states have (on average 592.6666666666666) internal successors, (1778), 3 states have internal predecessors, (1778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:29,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:29,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 591 of 628 [2025-03-17 11:11:29,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:30,183 INFO L124 PetriNetUnfolderBase]: 411/6715 cut-off events. [2025-03-17 11:11:30,183 INFO L125 PetriNetUnfolderBase]: For 510/538 co-relation queries the response was YES. [2025-03-17 11:11:30,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8428 conditions, 6715 events. 411/6715 cut-off events. For 510/538 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 61469 event pairs, 63 based on Foata normal form. 0/6202 useless extension candidates. Maximal degree in co-relation 8338. Up to 469 conditions per place. [2025-03-17 11:11:30,271 INFO L140 encePairwiseOnDemand]: 622/628 looper letters, 19 selfloop transitions, 2 changer transitions 0/592 dead transitions. [2025-03-17 11:11:30,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 611 places, 592 transitions, 1653 flow [2025-03-17 11:11:30,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:30,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:30,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1798 transitions. [2025-03-17 11:11:30,272 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9543524416135881 [2025-03-17 11:11:30,272 INFO L175 Difference]: Start difference. First operand has 613 places, 590 transitions, 1603 flow. Second operand 3 states and 1798 transitions. [2025-03-17 11:11:30,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 611 places, 592 transitions, 1653 flow [2025-03-17 11:11:30,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 606 places, 592 transitions, 1643 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:11:30,282 INFO L231 Difference]: Finished difference. Result has 607 places, 588 transitions, 1599 flow [2025-03-17 11:11:30,282 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1585, PETRI_DIFFERENCE_MINUEND_PLACES=604, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=586, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=584, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1599, PETRI_PLACES=607, PETRI_TRANSITIONS=588} [2025-03-17 11:11:30,283 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, 20 predicate places. [2025-03-17 11:11:30,283 INFO L471 AbstractCegarLoop]: Abstraction has has 607 places, 588 transitions, 1599 flow [2025-03-17 11:11:30,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 592.6666666666666) internal successors, (1778), 3 states have internal predecessors, (1778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:30,283 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:30,283 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] [2025-03-17 11:11:30,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-17 11:11:30,283 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread3Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-03-17 11:11:30,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:30,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1857863768, now seen corresponding path program 1 times [2025-03-17 11:11:30,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:30,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498807605] [2025-03-17 11:11:30,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:30,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:30,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-03-17 11:11:30,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-03-17 11:11:30,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:30,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:30,548 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 11:11:30,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:30,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498807605] [2025-03-17 11:11:30,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498807605] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:30,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:30,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:11:30,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285599265] [2025-03-17 11:11:30,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:30,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:11:30,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:30,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:11:30,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:11:31,015 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 576 out of 628 [2025-03-17 11:11:31,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 607 places, 588 transitions, 1599 flow. Second operand has 6 states, 6 states have (on average 579.1666666666666) internal successors, (3475), 6 states have internal predecessors, (3475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:31,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:31,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 576 of 628 [2025-03-17 11:11:31,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:31,509 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1602] thread2EXIT-->L105: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][477], [Black: 754#(<= ~n2~0 0), Black: 755#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n2~0 0)), Black: 768#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (not |thread1Thread1of1ForFork0_#t~short2#1|) (<= ~n2~0 0)), 722#(= |#race~a2~0| 0), Black: 838#true, 622#(= |#race~n1~0| 0), Black: 652#(not |thread1Thread1of1ForFork0_#t~short2#1|), Black: 716#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 702#(<= ~n1~0 0), Black: 703#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0)), 588#L79-16true, 840#(= |#race~a3~0| 0), Black: 655#true, Black: 720#true, 634#(= |#race~n2~0| 0), Black: 778#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), Black: 791#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 783#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 785#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 777#(<= ~n3~0 0), Black: 735#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 640#(= |#race~n3~0| 0), Black: 729#(<= ~n2~0 0), Black: 673#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 730#(and (= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= ~n2~0 0)), Black: 667#(<= ~n1~0 0), Black: 743#(and (not |thread3Thread1of1ForFork1_#t~short20#1|) (= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= ~n2~0 0)), Black: 737#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 681#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (not |thread1Thread1of1ForFork0_#t~short2#1|) (<= ~n1~0 0)), Black: 668#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n1~0 0)), Black: 675#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 802#(<= ~n3~0 0), 657#(= |#race~a1~0| 0), Black: 816#(and (not |thread3Thread1of1ForFork1_#t~short20#1|) (= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= ~n3~0 0)), Black: 689#(not |thread2Thread1of1ForFork2_#t~short11#1|), Black: 803#(and (= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= ~n3~0 0)), 844#(= (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 0), Black: 694#(not |thread3Thread1of1ForFork1_#t~short20#1|), 464#L105true]) [2025-03-17 11:11:31,510 INFO L294 olderBase$Statistics]: this new event has 335 ancestors and is cut-off event [2025-03-17 11:11:31,510 INFO L297 olderBase$Statistics]: existing Event has 335 ancestors and is cut-off event [2025-03-17 11:11:31,510 INFO L297 olderBase$Statistics]: existing Event has 335 ancestors and is cut-off event [2025-03-17 11:11:31,510 INFO L297 olderBase$Statistics]: existing Event has 304 ancestors and is cut-off event [2025-03-17 11:11:31,515 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1602] thread2EXIT-->L105: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][482], [Black: 754#(<= ~n2~0 0), Black: 755#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n2~0 0)), Black: 768#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (not |thread1Thread1of1ForFork0_#t~short2#1|) (<= ~n2~0 0)), 722#(= |#race~a2~0| 0), Black: 838#true, 622#(= |#race~n1~0| 0), Black: 652#(not |thread1Thread1of1ForFork0_#t~short2#1|), Black: 716#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 702#(<= ~n1~0 0), Black: 703#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0)), 840#(= |#race~a3~0| 0), Black: 655#true, Black: 720#true, 634#(= |#race~n2~0| 0), 180#L79-15true, 845#(and (= (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 0) (= (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|) 1)) 0)), Black: 778#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), Black: 791#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 783#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 785#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 777#(<= ~n3~0 0), Black: 735#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 640#(= |#race~n3~0| 0), Black: 729#(<= ~n2~0 0), Black: 673#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 730#(and (= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= ~n2~0 0)), Black: 667#(<= ~n1~0 0), Black: 743#(and (not |thread3Thread1of1ForFork1_#t~short20#1|) (= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= ~n2~0 0)), Black: 737#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 681#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (not |thread1Thread1of1ForFork0_#t~short2#1|) (<= ~n1~0 0)), Black: 668#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n1~0 0)), Black: 675#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 802#(<= ~n3~0 0), 657#(= |#race~a1~0| 0), Black: 816#(and (not |thread3Thread1of1ForFork1_#t~short20#1|) (= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= ~n3~0 0)), Black: 689#(not |thread2Thread1of1ForFork2_#t~short11#1|), Black: 803#(and (= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= ~n3~0 0)), Black: 694#(not |thread3Thread1of1ForFork1_#t~short20#1|), 464#L105true]) [2025-03-17 11:11:31,515 INFO L294 olderBase$Statistics]: this new event has 336 ancestors and is cut-off event [2025-03-17 11:11:31,515 INFO L297 olderBase$Statistics]: existing Event has 336 ancestors and is cut-off event [2025-03-17 11:11:31,515 INFO L297 olderBase$Statistics]: existing Event has 336 ancestors and is cut-off event [2025-03-17 11:11:31,515 INFO L297 olderBase$Statistics]: existing Event has 305 ancestors and is cut-off event [2025-03-17 11:11:31,519 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1602] thread2EXIT-->L105: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][489], [Black: 754#(<= ~n2~0 0), Black: 755#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n2~0 0)), Black: 768#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (not |thread1Thread1of1ForFork0_#t~short2#1|) (<= ~n2~0 0)), 722#(= |#race~a2~0| 0), Black: 838#true, 622#(= |#race~n1~0| 0), Black: 652#(not |thread1Thread1of1ForFork0_#t~short2#1|), Black: 716#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 702#(<= ~n1~0 0), Black: 703#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0)), 840#(= |#race~a3~0| 0), Black: 655#true, Black: 720#true, 634#(= |#race~n2~0| 0), Black: 778#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), Black: 791#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 783#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 785#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 777#(<= ~n3~0 0), Black: 735#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 640#(= |#race~n3~0| 0), Black: 729#(<= ~n2~0 0), Black: 673#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 730#(and (= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= ~n2~0 0)), Black: 667#(<= ~n1~0 0), Black: 743#(and (not |thread3Thread1of1ForFork1_#t~short20#1|) (= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= ~n2~0 0)), Black: 737#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 681#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (not |thread1Thread1of1ForFork0_#t~short2#1|) (<= ~n1~0 0)), Black: 668#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n1~0 0)), Black: 675#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 802#(<= ~n3~0 0), 657#(= |#race~a1~0| 0), Black: 816#(and (not |thread3Thread1of1ForFork1_#t~short20#1|) (= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= ~n3~0 0)), Black: 689#(not |thread2Thread1of1ForFork2_#t~short11#1|), Black: 803#(and (= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= ~n3~0 0)), 846#(and (= (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 0) (= (select (select |#race| ~a2~0.base) (+ ~a2~0.offset 2 (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 0) (= (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|) 1)) 0)), Black: 694#(not |thread3Thread1of1ForFork1_#t~short20#1|), 360#L79-14true, 464#L105true]) [2025-03-17 11:11:31,519 INFO L294 olderBase$Statistics]: this new event has 337 ancestors and is cut-off event [2025-03-17 11:11:31,519 INFO L297 olderBase$Statistics]: existing Event has 337 ancestors and is cut-off event [2025-03-17 11:11:31,519 INFO L297 olderBase$Statistics]: existing Event has 306 ancestors and is cut-off event [2025-03-17 11:11:31,519 INFO L297 olderBase$Statistics]: existing Event has 337 ancestors and is cut-off event [2025-03-17 11:11:31,523 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1602] thread2EXIT-->L105: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][494], [Black: 754#(<= ~n2~0 0), Black: 755#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n2~0 0)), Black: 768#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (not |thread1Thread1of1ForFork0_#t~short2#1|) (<= ~n2~0 0)), 722#(= |#race~a2~0| 0), Black: 838#true, 622#(= |#race~n1~0| 0), Black: 652#(not |thread1Thread1of1ForFork0_#t~short2#1|), Black: 716#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 702#(<= ~n1~0 0), Black: 703#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0)), 840#(= |#race~a3~0| 0), Black: 655#true, Black: 720#true, 634#(= |#race~n2~0| 0), Black: 778#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), Black: 791#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 783#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 785#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 777#(<= ~n3~0 0), 847#(and (= (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 0) (= (select (select |#race| ~a2~0.base) (+ ~a2~0.offset 3 (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 0) (= (select (select |#race| ~a2~0.base) (+ ~a2~0.offset 2 (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 0) (= (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|) 1)) 0)), 403#L79-12true, Black: 735#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 640#(= |#race~n3~0| 0), Black: 729#(<= ~n2~0 0), Black: 673#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 730#(and (= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= ~n2~0 0)), Black: 667#(<= ~n1~0 0), Black: 743#(and (not |thread3Thread1of1ForFork1_#t~short20#1|) (= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= ~n2~0 0)), Black: 737#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 681#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (not |thread1Thread1of1ForFork0_#t~short2#1|) (<= ~n1~0 0)), Black: 668#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n1~0 0)), Black: 675#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 802#(<= ~n3~0 0), 657#(= |#race~a1~0| 0), Black: 816#(and (not |thread3Thread1of1ForFork1_#t~short20#1|) (= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= ~n3~0 0)), Black: 689#(not |thread2Thread1of1ForFork2_#t~short11#1|), Black: 803#(and (= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= ~n3~0 0)), Black: 694#(not |thread3Thread1of1ForFork1_#t~short20#1|), 464#L105true]) [2025-03-17 11:11:31,523 INFO L294 olderBase$Statistics]: this new event has 338 ancestors and is cut-off event [2025-03-17 11:11:31,523 INFO L297 olderBase$Statistics]: existing Event has 338 ancestors and is cut-off event [2025-03-17 11:11:31,523 INFO L297 olderBase$Statistics]: existing Event has 338 ancestors and is cut-off event [2025-03-17 11:11:31,523 INFO L297 olderBase$Statistics]: existing Event has 307 ancestors and is cut-off event [2025-03-17 11:11:31,526 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1602] thread2EXIT-->L105: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][494], [Black: 754#(<= ~n2~0 0), Black: 755#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n2~0 0)), Black: 768#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (not |thread1Thread1of1ForFork0_#t~short2#1|) (<= ~n2~0 0)), 722#(= |#race~a2~0| 0), Black: 838#true, 622#(= |#race~n1~0| 0), Black: 652#(not |thread1Thread1of1ForFork0_#t~short2#1|), Black: 716#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 702#(<= ~n1~0 0), Black: 703#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0)), 840#(= |#race~a3~0| 0), Black: 655#true, Black: 720#true, 489#L79-13true, 634#(= |#race~n2~0| 0), Black: 778#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), Black: 791#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 783#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 785#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 777#(<= ~n3~0 0), 847#(and (= (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 0) (= (select (select |#race| ~a2~0.base) (+ ~a2~0.offset 3 (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 0) (= (select (select |#race| ~a2~0.base) (+ ~a2~0.offset 2 (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 0) (= (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|) 1)) 0)), Black: 735#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 640#(= |#race~n3~0| 0), Black: 729#(<= ~n2~0 0), Black: 673#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 730#(and (= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= ~n2~0 0)), Black: 667#(<= ~n1~0 0), Black: 743#(and (not |thread3Thread1of1ForFork1_#t~short20#1|) (= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= ~n2~0 0)), Black: 737#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 681#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (not |thread1Thread1of1ForFork0_#t~short2#1|) (<= ~n1~0 0)), Black: 668#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n1~0 0)), Black: 675#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 802#(<= ~n3~0 0), 657#(= |#race~a1~0| 0), Black: 816#(and (not |thread3Thread1of1ForFork1_#t~short20#1|) (= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= ~n3~0 0)), Black: 689#(not |thread2Thread1of1ForFork2_#t~short11#1|), Black: 803#(and (= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= ~n3~0 0)), Black: 694#(not |thread3Thread1of1ForFork1_#t~short20#1|), 464#L105true]) [2025-03-17 11:11:31,526 INFO L294 olderBase$Statistics]: this new event has 339 ancestors and is cut-off event [2025-03-17 11:11:31,526 INFO L297 olderBase$Statistics]: existing Event has 339 ancestors and is cut-off event [2025-03-17 11:11:31,526 INFO L297 olderBase$Statistics]: existing Event has 339 ancestors and is cut-off event [2025-03-17 11:11:31,526 INFO L297 olderBase$Statistics]: existing Event has 308 ancestors and is cut-off event [2025-03-17 11:11:31,578 INFO L124 PetriNetUnfolderBase]: 260/4215 cut-off events. [2025-03-17 11:11:31,578 INFO L125 PetriNetUnfolderBase]: For 772/816 co-relation queries the response was YES. [2025-03-17 11:11:31,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5902 conditions, 4215 events. 260/4215 cut-off events. For 772/816 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 34337 event pairs, 32 based on Foata normal form. 8/4017 useless extension candidates. Maximal degree in co-relation 5811. Up to 200 conditions per place. [2025-03-17 11:11:31,627 INFO L140 encePairwiseOnDemand]: 621/628 looper letters, 39 selfloop transitions, 5 changer transitions 0/595 dead transitions. [2025-03-17 11:11:31,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 610 places, 595 transitions, 1710 flow [2025-03-17 11:11:31,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:11:31,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:11:31,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3499 transitions. [2025-03-17 11:11:31,629 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9286093418259024 [2025-03-17 11:11:31,629 INFO L175 Difference]: Start difference. First operand has 607 places, 588 transitions, 1599 flow. Second operand 6 states and 3499 transitions. [2025-03-17 11:11:31,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 610 places, 595 transitions, 1710 flow [2025-03-17 11:11:31,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 610 places, 595 transitions, 1710 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:11:31,637 INFO L231 Difference]: Finished difference. Result has 610 places, 586 transitions, 1605 flow [2025-03-17 11:11:31,638 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1595, PETRI_DIFFERENCE_MINUEND_PLACES=605, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=586, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=581, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1605, PETRI_PLACES=610, PETRI_TRANSITIONS=586} [2025-03-17 11:11:31,638 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, 23 predicate places. [2025-03-17 11:11:31,639 INFO L471 AbstractCegarLoop]: Abstraction has has 610 places, 586 transitions, 1605 flow [2025-03-17 11:11:31,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 579.1666666666666) internal successors, (3475), 6 states have internal predecessors, (3475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:31,639 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:31,639 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-17 11:11:31,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-17 11:11:31,639 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-03-17 11:11:31,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:31,640 INFO L85 PathProgramCache]: Analyzing trace with hash -259954425, now seen corresponding path program 1 times [2025-03-17 11:11:31,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:31,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706575131] [2025-03-17 11:11:31,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:31,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:31,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-03-17 11:11:31,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-03-17 11:11:31,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:31,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:31,908 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 11:11:31,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:31,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706575131] [2025-03-17 11:11:31,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706575131] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:31,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:31,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:11:31,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946377644] [2025-03-17 11:11:31,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:31,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:11:31,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:31,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:11:31,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:11:32,248 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 576 out of 628 [2025-03-17 11:11:32,249 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 610 places, 586 transitions, 1605 flow. Second operand has 6 states, 6 states have (on average 579.0) internal successors, (3474), 6 states have internal predecessors, (3474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:32,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:32,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 576 of 628 [2025-03-17 11:11:32,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:32,841 INFO L124 PetriNetUnfolderBase]: 195/4259 cut-off events. [2025-03-17 11:11:32,841 INFO L125 PetriNetUnfolderBase]: For 629/721 co-relation queries the response was YES. [2025-03-17 11:11:32,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5896 conditions, 4259 events. 195/4259 cut-off events. For 629/721 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 33505 event pairs, 29 based on Foata normal form. 7/4060 useless extension candidates. Maximal degree in co-relation 5804. Up to 196 conditions per place. [2025-03-17 11:11:32,903 INFO L140 encePairwiseOnDemand]: 621/628 looper letters, 40 selfloop transitions, 5 changer transitions 0/594 dead transitions. [2025-03-17 11:11:32,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 613 places, 594 transitions, 1721 flow [2025-03-17 11:11:32,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:11:32,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:11:32,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3500 transitions. [2025-03-17 11:11:32,905 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9288747346072187 [2025-03-17 11:11:32,905 INFO L175 Difference]: Start difference. First operand has 610 places, 586 transitions, 1605 flow. Second operand 6 states and 3500 transitions. [2025-03-17 11:11:32,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 613 places, 594 transitions, 1721 flow [2025-03-17 11:11:32,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 608 places, 594 transitions, 1711 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:11:32,915 INFO L231 Difference]: Finished difference. Result has 608 places, 584 transitions, 1601 flow [2025-03-17 11:11:32,916 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1591, PETRI_DIFFERENCE_MINUEND_PLACES=603, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=584, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=579, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1601, PETRI_PLACES=608, PETRI_TRANSITIONS=584} [2025-03-17 11:11:32,916 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, 21 predicate places. [2025-03-17 11:11:32,916 INFO L471 AbstractCegarLoop]: Abstraction has has 608 places, 584 transitions, 1601 flow [2025-03-17 11:11:32,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 579.0) internal successors, (3474), 6 states have internal predecessors, (3474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:32,917 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:32,917 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] [2025-03-17 11:11:32,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-17 11:11:32,917 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-03-17 11:11:32,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:32,918 INFO L85 PathProgramCache]: Analyzing trace with hash 902525072, now seen corresponding path program 1 times [2025-03-17 11:11:32,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:32,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98844649] [2025-03-17 11:11:32,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:32,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:32,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-03-17 11:11:32,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-03-17 11:11:32,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:32,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:32,947 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-17 11:11:32,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:32,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98844649] [2025-03-17 11:11:32,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98844649] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:32,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:32,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:32,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056915385] [2025-03-17 11:11:32,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:32,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:32,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:32,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:32,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:32,955 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 599 out of 628 [2025-03-17 11:11:32,956 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 608 places, 584 transitions, 1601 flow. Second operand has 3 states, 3 states have (on average 602.0) internal successors, (1806), 3 states have internal predecessors, (1806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:32,956 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:32,956 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 599 of 628 [2025-03-17 11:11:32,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:33,448 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1601] thread3EXIT-->L107-6: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork1_thidvar0_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][331], [408#L107-6true, Black: 754#(<= ~n2~0 0), Black: 755#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n2~0 0)), Black: 768#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (not |thread1Thread1of1ForFork0_#t~short2#1|) (<= ~n2~0 0)), 722#(= |#race~a2~0| 0), Black: 838#true, 622#(= |#race~n1~0| 0), Black: 652#(not |thread1Thread1of1ForFork0_#t~short2#1|), Black: 716#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 702#(<= ~n1~0 0), Black: 703#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0)), 840#(= |#race~a3~0| 0), Black: 655#true, Black: 720#true, 634#(= |#race~n2~0| 0), Black: 778#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), Black: 791#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 783#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 785#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 777#(<= ~n3~0 0), 640#(= |#race~n3~0| 0), Black: 735#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 729#(<= ~n2~0 0), Black: 673#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 730#(and (= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= ~n2~0 0)), Black: 667#(<= ~n1~0 0), Black: 743#(and (not |thread3Thread1of1ForFork1_#t~short20#1|) (= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= ~n2~0 0)), Black: 681#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (not |thread1Thread1of1ForFork0_#t~short2#1|) (<= ~n1~0 0)), Black: 737#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 668#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n1~0 0)), Black: 675#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 802#(<= ~n3~0 0), 848#true, 657#(= |#race~a1~0| 0), Black: 816#(and (not |thread3Thread1of1ForFork1_#t~short20#1|) (= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= ~n3~0 0)), Black: 689#(not |thread2Thread1of1ForFork2_#t~short11#1|), Black: 803#(and (= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= ~n3~0 0)), Black: 694#(not |thread3Thread1of1ForFork1_#t~short20#1|), 854#true]) [2025-03-17 11:11:33,448 INFO L294 olderBase$Statistics]: this new event has 331 ancestors and is not cut-off event [2025-03-17 11:11:33,448 INFO L297 olderBase$Statistics]: existing Event has 331 ancestors and is not cut-off event [2025-03-17 11:11:33,448 INFO L297 olderBase$Statistics]: existing Event has 362 ancestors and is not cut-off event [2025-03-17 11:11:33,448 INFO L297 olderBase$Statistics]: existing Event has 331 ancestors and is not cut-off event [2025-03-17 11:11:33,503 INFO L124 PetriNetUnfolderBase]: 130/4207 cut-off events. [2025-03-17 11:11:33,503 INFO L125 PetriNetUnfolderBase]: For 509/535 co-relation queries the response was YES. [2025-03-17 11:11:33,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5600 conditions, 4207 events. 130/4207 cut-off events. For 509/535 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 31495 event pairs, 22 based on Foata normal form. 0/4036 useless extension candidates. Maximal degree in co-relation 5509. Up to 124 conditions per place. [2025-03-17 11:11:33,568 INFO L140 encePairwiseOnDemand]: 626/628 looper letters, 9 selfloop transitions, 1 changer transitions 0/583 dead transitions. [2025-03-17 11:11:33,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 609 places, 583 transitions, 1619 flow [2025-03-17 11:11:33,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:33,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:33,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1808 transitions. [2025-03-17 11:11:33,569 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9596602972399151 [2025-03-17 11:11:33,569 INFO L175 Difference]: Start difference. First operand has 608 places, 584 transitions, 1601 flow. Second operand 3 states and 1808 transitions. [2025-03-17 11:11:33,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 609 places, 583 transitions, 1619 flow [2025-03-17 11:11:33,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 604 places, 583 transitions, 1609 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:11:33,580 INFO L231 Difference]: Finished difference. Result has 604 places, 583 transitions, 1591 flow [2025-03-17 11:11:33,581 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1589, PETRI_DIFFERENCE_MINUEND_PLACES=602, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=583, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=582, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1591, PETRI_PLACES=604, PETRI_TRANSITIONS=583} [2025-03-17 11:11:33,581 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, 17 predicate places. [2025-03-17 11:11:33,581 INFO L471 AbstractCegarLoop]: Abstraction has has 604 places, 583 transitions, 1591 flow [2025-03-17 11:11:33,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 602.0) internal successors, (1806), 3 states have internal predecessors, (1806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:33,581 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:33,581 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-17 11:11:33,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-17 11:11:33,582 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread3Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-03-17 11:11:33,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:33,583 INFO L85 PathProgramCache]: Analyzing trace with hash -633421252, now seen corresponding path program 1 times [2025-03-17 11:11:33,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:33,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601975722] [2025-03-17 11:11:33,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:33,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:33,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-17 11:11:33,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-17 11:11:33,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:33,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:33,853 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 11:11:33,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:33,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601975722] [2025-03-17 11:11:33,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601975722] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:33,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:33,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:11:33,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103561505] [2025-03-17 11:11:33,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:33,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:11:33,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:33,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:11:33,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:11:34,236 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 576 out of 628 [2025-03-17 11:11:34,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 604 places, 583 transitions, 1591 flow. Second operand has 6 states, 6 states have (on average 579.1666666666666) internal successors, (3475), 6 states have internal predecessors, (3475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:34,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:34,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 576 of 628 [2025-03-17 11:11:34,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:34,773 INFO L124 PetriNetUnfolderBase]: 220/4123 cut-off events. [2025-03-17 11:11:34,773 INFO L125 PetriNetUnfolderBase]: For 732/761 co-relation queries the response was YES. [2025-03-17 11:11:34,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5748 conditions, 4123 events. 220/4123 cut-off events. For 732/761 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 32817 event pairs, 32 based on Foata normal form. 0/3979 useless extension candidates. Maximal degree in co-relation 5656. Up to 204 conditions per place. [2025-03-17 11:11:34,818 INFO L140 encePairwiseOnDemand]: 621/628 looper letters, 39 selfloop transitions, 5 changer transitions 0/590 dead transitions. [2025-03-17 11:11:34,818 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 607 places, 590 transitions, 1702 flow [2025-03-17 11:11:34,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:11:34,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:11:34,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3499 transitions. [2025-03-17 11:11:34,820 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9286093418259024 [2025-03-17 11:11:34,820 INFO L175 Difference]: Start difference. First operand has 604 places, 583 transitions, 1591 flow. Second operand 6 states and 3499 transitions. [2025-03-17 11:11:34,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 607 places, 590 transitions, 1702 flow [2025-03-17 11:11:34,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 606 places, 590 transitions, 1701 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:11:34,828 INFO L231 Difference]: Finished difference. Result has 606 places, 581 transitions, 1596 flow [2025-03-17 11:11:34,829 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1586, PETRI_DIFFERENCE_MINUEND_PLACES=601, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=581, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=576, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1596, PETRI_PLACES=606, PETRI_TRANSITIONS=581} [2025-03-17 11:11:34,829 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, 19 predicate places. [2025-03-17 11:11:34,830 INFO L471 AbstractCegarLoop]: Abstraction has has 606 places, 581 transitions, 1596 flow [2025-03-17 11:11:34,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 579.1666666666666) internal successors, (3475), 6 states have internal predecessors, (3475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:34,830 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:34,830 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] [2025-03-17 11:11:34,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-17 11:11:34,831 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-03-17 11:11:34,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:34,831 INFO L85 PathProgramCache]: Analyzing trace with hash 403421746, now seen corresponding path program 1 times [2025-03-17 11:11:34,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:34,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898581076] [2025-03-17 11:11:34,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:34,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:34,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-03-17 11:11:34,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-03-17 11:11:34,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:34,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:34,860 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-17 11:11:34,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:34,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898581076] [2025-03-17 11:11:34,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898581076] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:34,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:34,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:34,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048773117] [2025-03-17 11:11:34,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:34,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:34,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:34,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:34,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:34,871 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 596 out of 628 [2025-03-17 11:11:34,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 606 places, 581 transitions, 1596 flow. Second operand has 3 states, 3 states have (on average 599.0) internal successors, (1797), 3 states have internal predecessors, (1797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:34,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:34,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 596 of 628 [2025-03-17 11:11:34,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:35,313 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1601] thread3EXIT-->L107-6: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork1_thidvar0_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][331], [408#L107-6true, Black: 754#(<= ~n2~0 0), Black: 755#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n2~0 0)), Black: 768#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (not |thread1Thread1of1ForFork0_#t~short2#1|) (<= ~n2~0 0)), 722#(= |#race~a2~0| 0), Black: 838#true, 622#(= |#race~n1~0| 0), Black: 716#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 652#(not |thread1Thread1of1ForFork0_#t~short2#1|), Black: 702#(<= ~n1~0 0), Black: 703#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0)), 840#(= |#race~a3~0| 0), Black: 655#true, Black: 720#true, 634#(= |#race~n2~0| 0), Black: 778#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), Black: 791#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 783#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 785#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 777#(<= ~n3~0 0), 640#(= |#race~n3~0| 0), Black: 735#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 729#(<= ~n2~0 0), Black: 673#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 730#(and (= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= ~n2~0 0)), Black: 743#(and (not |thread3Thread1of1ForFork1_#t~short20#1|) (= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= ~n2~0 0)), Black: 667#(<= ~n1~0 0), Black: 681#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (not |thread1Thread1of1ForFork0_#t~short2#1|) (<= ~n1~0 0)), Black: 737#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 668#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n1~0 0)), Black: 675#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 657#(= |#race~a1~0| 0), Black: 802#(<= ~n3~0 0), Black: 816#(and (not |thread3Thread1of1ForFork1_#t~short20#1|) (= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= ~n3~0 0)), 863#true, Black: 689#(not |thread2Thread1of1ForFork2_#t~short11#1|), Black: 803#(and (= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= ~n3~0 0)), Black: 694#(not |thread3Thread1of1ForFork1_#t~short20#1|), 857#true]) [2025-03-17 11:11:35,313 INFO L294 olderBase$Statistics]: this new event has 331 ancestors and is not cut-off event [2025-03-17 11:11:35,313 INFO L297 olderBase$Statistics]: existing Event has 362 ancestors and is not cut-off event [2025-03-17 11:11:35,313 INFO L297 olderBase$Statistics]: existing Event has 331 ancestors and is not cut-off event [2025-03-17 11:11:35,313 INFO L297 olderBase$Statistics]: existing Event has 331 ancestors and is not cut-off event [2025-03-17 11:11:35,367 INFO L124 PetriNetUnfolderBase]: 120/3723 cut-off events. [2025-03-17 11:11:35,367 INFO L125 PetriNetUnfolderBase]: For 431/497 co-relation queries the response was YES. [2025-03-17 11:11:35,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5029 conditions, 3723 events. 120/3723 cut-off events. For 431/497 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 26248 event pairs, 27 based on Foata normal form. 0/3615 useless extension candidates. Maximal degree in co-relation 4938. Up to 133 conditions per place. [2025-03-17 11:11:35,413 INFO L140 encePairwiseOnDemand]: 625/628 looper letters, 11 selfloop transitions, 1 changer transitions 0/579 dead transitions. [2025-03-17 11:11:35,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 606 places, 579 transitions, 1616 flow [2025-03-17 11:11:35,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:35,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:35,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1802 transitions. [2025-03-17 11:11:35,414 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9564755838641189 [2025-03-17 11:11:35,414 INFO L175 Difference]: Start difference. First operand has 606 places, 581 transitions, 1596 flow. Second operand 3 states and 1802 transitions. [2025-03-17 11:11:35,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 606 places, 579 transitions, 1616 flow [2025-03-17 11:11:35,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 601 places, 579 transitions, 1606 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:11:35,422 INFO L231 Difference]: Finished difference. Result has 601 places, 579 transitions, 1584 flow [2025-03-17 11:11:35,422 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1582, PETRI_DIFFERENCE_MINUEND_PLACES=599, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=579, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=578, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1584, PETRI_PLACES=601, PETRI_TRANSITIONS=579} [2025-03-17 11:11:35,423 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, 14 predicate places. [2025-03-17 11:11:35,423 INFO L471 AbstractCegarLoop]: Abstraction has has 601 places, 579 transitions, 1584 flow [2025-03-17 11:11:35,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 599.0) internal successors, (1797), 3 states have internal predecessors, (1797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:35,423 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:35,423 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:11:35,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-17 11:11:35,424 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-03-17 11:11:35,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:35,424 INFO L85 PathProgramCache]: Analyzing trace with hash 755477473, now seen corresponding path program 1 times [2025-03-17 11:11:35,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:35,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107421558] [2025-03-17 11:11:35,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:35,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:35,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-03-17 11:11:35,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-03-17 11:11:35,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:35,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:35,453 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-17 11:11:35,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:35,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107421558] [2025-03-17 11:11:35,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107421558] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:35,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:35,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:35,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843256239] [2025-03-17 11:11:35,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:35,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:35,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:35,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:35,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:35,463 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 596 out of 628 [2025-03-17 11:11:35,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 601 places, 579 transitions, 1584 flow. Second operand has 3 states, 3 states have (on average 599.0) internal successors, (1797), 3 states have internal predecessors, (1797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:35,464 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:35,464 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 596 of 628 [2025-03-17 11:11:35,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:35,822 INFO L124 PetriNetUnfolderBase]: 120/3068 cut-off events. [2025-03-17 11:11:35,822 INFO L125 PetriNetUnfolderBase]: For 339/379 co-relation queries the response was YES. [2025-03-17 11:11:35,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4110 conditions, 3068 events. 120/3068 cut-off events. For 339/379 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 20880 event pairs, 33 based on Foata normal form. 15/3009 useless extension candidates. Maximal degree in co-relation 4019. Up to 144 conditions per place. [2025-03-17 11:11:35,855 INFO L140 encePairwiseOnDemand]: 625/628 looper letters, 7 selfloop transitions, 0 changer transitions 24/577 dead transitions. [2025-03-17 11:11:35,855 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 601 places, 577 transitions, 1602 flow [2025-03-17 11:11:35,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:35,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:35,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1801 transitions. [2025-03-17 11:11:35,856 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9559447983014862 [2025-03-17 11:11:35,856 INFO L175 Difference]: Start difference. First operand has 601 places, 579 transitions, 1584 flow. Second operand 3 states and 1801 transitions. [2025-03-17 11:11:35,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 601 places, 577 transitions, 1602 flow [2025-03-17 11:11:35,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 600 places, 577 transitions, 1601 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:11:35,863 INFO L231 Difference]: Finished difference. Result has 600 places, 553 transitions, 1474 flow [2025-03-17 11:11:35,863 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1579, PETRI_DIFFERENCE_MINUEND_PLACES=598, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=577, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=577, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1474, PETRI_PLACES=600, PETRI_TRANSITIONS=553} [2025-03-17 11:11:35,864 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, 13 predicate places. [2025-03-17 11:11:35,864 INFO L471 AbstractCegarLoop]: Abstraction has has 600 places, 553 transitions, 1474 flow [2025-03-17 11:11:35,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 599.0) internal successors, (1797), 3 states have internal predecessors, (1797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:35,864 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:35,864 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:11:35,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-17 11:11:35,864 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-03-17 11:11:35,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:35,865 INFO L85 PathProgramCache]: Analyzing trace with hash 2095526928, now seen corresponding path program 1 times [2025-03-17 11:11:35,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:35,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281838318] [2025-03-17 11:11:35,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:35,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:35,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 261 statements into 1 equivalence classes. [2025-03-17 11:11:35,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 261 of 261 statements. [2025-03-17 11:11:35,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:35,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:35,904 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 11:11:35,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:35,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281838318] [2025-03-17 11:11:35,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281838318] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:35,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:35,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:35,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677418498] [2025-03-17 11:11:35,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:35,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:35,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:35,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:35,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:35,915 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 597 out of 628 [2025-03-17 11:11:35,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 600 places, 553 transitions, 1474 flow. Second operand has 3 states, 3 states have (on average 598.6666666666666) internal successors, (1796), 3 states have internal predecessors, (1796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:35,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:35,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 597 of 628 [2025-03-17 11:11:35,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:36,375 INFO L124 PetriNetUnfolderBase]: 140/3562 cut-off events. [2025-03-17 11:11:36,376 INFO L125 PetriNetUnfolderBase]: For 325/335 co-relation queries the response was YES. [2025-03-17 11:11:36,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4705 conditions, 3562 events. 140/3562 cut-off events. For 325/335 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 23860 event pairs, 20 based on Foata normal form. 0/3471 useless extension candidates. Maximal degree in co-relation 4672. Up to 93 conditions per place. [2025-03-17 11:11:36,432 INFO L140 encePairwiseOnDemand]: 625/628 looper letters, 10 selfloop transitions, 2 changer transitions 12/554 dead transitions. [2025-03-17 11:11:36,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 580 places, 554 transitions, 1502 flow [2025-03-17 11:11:36,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:36,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:36,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1804 transitions. [2025-03-17 11:11:36,433 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9575371549893843 [2025-03-17 11:11:36,433 INFO L175 Difference]: Start difference. First operand has 600 places, 553 transitions, 1474 flow. Second operand 3 states and 1804 transitions. [2025-03-17 11:11:36,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 580 places, 554 transitions, 1502 flow [2025-03-17 11:11:36,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 580 places, 554 transitions, 1490 flow, removed 6 selfloop flow, removed 0 redundant places. [2025-03-17 11:11:36,443 INFO L231 Difference]: Finished difference. Result has 580 places, 540 transitions, 1382 flow [2025-03-17 11:11:36,444 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1460, PETRI_DIFFERENCE_MINUEND_PLACES=578, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=552, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=550, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1382, PETRI_PLACES=580, PETRI_TRANSITIONS=540} [2025-03-17 11:11:36,444 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -7 predicate places. [2025-03-17 11:11:36,444 INFO L471 AbstractCegarLoop]: Abstraction has has 580 places, 540 transitions, 1382 flow [2025-03-17 11:11:36,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 598.6666666666666) internal successors, (1796), 3 states have internal predecessors, (1796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:36,445 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:36,445 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:11:36,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-17 11:11:36,445 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-03-17 11:11:36,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:36,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1513765890, now seen corresponding path program 1 times [2025-03-17 11:11:36,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:36,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809204535] [2025-03-17 11:11:36,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:36,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:36,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 267 statements into 1 equivalence classes. [2025-03-17 11:11:36,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 267 of 267 statements. [2025-03-17 11:11:36,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:36,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:36,487 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 11:11:36,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:36,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809204535] [2025-03-17 11:11:36,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809204535] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:36,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:36,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:36,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301683584] [2025-03-17 11:11:36,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:36,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:36,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:36,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:36,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:36,503 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 596 out of 628 [2025-03-17 11:11:36,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 580 places, 540 transitions, 1382 flow. Second operand has 3 states, 3 states have (on average 598.0) internal successors, (1794), 3 states have internal predecessors, (1794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:36,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:36,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 596 of 628 [2025-03-17 11:11:36,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:36,867 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1291] L51-13-->L51-11: Formula: (= |v_#race~a2~0_6| 0) InVars {} OutVars{#race~a2~0=|v_#race~a2~0_6|} AuxVars[] AssignedVars[#race~a2~0][374], [Black: 754#(<= ~n2~0 0), 111#L79-19true, Black: 755#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n2~0 0)), Black: 768#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (not |thread1Thread1of1ForFork0_#t~short2#1|) (<= ~n2~0 0)), 869#true, 722#(= |#race~a2~0| 0), Black: 838#true, 622#(= |#race~n1~0| 0), Black: 716#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 652#(not |thread1Thread1of1ForFork0_#t~short2#1|), Black: 702#(<= ~n1~0 0), Black: 703#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0)), 840#(= |#race~a3~0| 0), Black: 655#true, Black: 720#true, 634#(= |#race~n2~0| 0), Black: 778#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), Black: 791#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 783#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 866#true, Black: 785#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 777#(<= ~n3~0 0), 640#(= |#race~n3~0| 0), Black: 735#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 729#(<= ~n2~0 0), Black: 730#(and (= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= ~n2~0 0)), Black: 673#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 667#(<= ~n1~0 0), Black: 743#(and (not |thread3Thread1of1ForFork1_#t~short20#1|) (= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= ~n2~0 0)), Black: 681#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (not |thread1Thread1of1ForFork0_#t~short2#1|) (<= ~n1~0 0)), Black: 737#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 668#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n1~0 0)), Black: 675#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 657#(= |#race~a1~0| 0), 34#L65-19true, Black: 802#(<= ~n3~0 0), Black: 816#(and (not |thread3Thread1of1ForFork1_#t~short20#1|) (= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= ~n3~0 0)), 25#L102-1true, Black: 689#(not |thread2Thread1of1ForFork2_#t~short11#1|), 324#L51-11true, Black: 803#(and (= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= ~n3~0 0)), 872#true, Black: 694#(not |thread3Thread1of1ForFork1_#t~short20#1|)]) [2025-03-17 11:11:36,867 INFO L294 olderBase$Statistics]: this new event has 340 ancestors and is cut-off event [2025-03-17 11:11:36,867 INFO L297 olderBase$Statistics]: existing Event has 309 ancestors and is cut-off event [2025-03-17 11:11:36,867 INFO L297 olderBase$Statistics]: existing Event has 340 ancestors and is cut-off event [2025-03-17 11:11:36,867 INFO L297 olderBase$Statistics]: existing Event has 309 ancestors and is cut-off event [2025-03-17 11:11:36,906 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1602] thread2EXIT-->L105: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][352], [Black: 754#(<= ~n2~0 0), 111#L79-19true, Black: 755#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n2~0 0)), Black: 768#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (not |thread1Thread1of1ForFork0_#t~short2#1|) (<= ~n2~0 0)), 869#true, 722#(= |#race~a2~0| 0), Black: 838#true, 622#(= |#race~n1~0| 0), Black: 716#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 652#(not |thread1Thread1of1ForFork0_#t~short2#1|), Black: 702#(<= ~n1~0 0), Black: 703#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0)), 840#(= |#race~a3~0| 0), Black: 655#true, Black: 720#true, 634#(= |#race~n2~0| 0), Black: 778#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), Black: 791#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 783#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 866#true, Black: 785#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 777#(<= ~n3~0 0), Black: 735#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 640#(= |#race~n3~0| 0), Black: 729#(<= ~n2~0 0), Black: 730#(and (= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= ~n2~0 0)), Black: 673#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 667#(<= ~n1~0 0), Black: 743#(and (not |thread3Thread1of1ForFork1_#t~short20#1|) (= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= ~n2~0 0)), Black: 681#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (not |thread1Thread1of1ForFork0_#t~short2#1|) (<= ~n1~0 0)), Black: 737#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 668#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n1~0 0)), Black: 675#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 802#(<= ~n3~0 0), 657#(= |#race~a1~0| 0), Black: 816#(and (not |thread3Thread1of1ForFork1_#t~short20#1|) (= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= ~n3~0 0)), Black: 689#(not |thread2Thread1of1ForFork2_#t~short11#1|), Black: 803#(and (= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= ~n3~0 0)), 872#true, Black: 694#(not |thread3Thread1of1ForFork1_#t~short20#1|), 464#L105true]) [2025-03-17 11:11:36,906 INFO L294 olderBase$Statistics]: this new event has 369 ancestors and is cut-off event [2025-03-17 11:11:36,906 INFO L297 olderBase$Statistics]: existing Event has 332 ancestors and is cut-off event [2025-03-17 11:11:36,906 INFO L297 olderBase$Statistics]: existing Event has 332 ancestors and is cut-off event [2025-03-17 11:11:36,906 INFO L297 olderBase$Statistics]: existing Event has 363 ancestors and is cut-off event [2025-03-17 11:11:36,912 INFO L124 PetriNetUnfolderBase]: 135/2905 cut-off events. [2025-03-17 11:11:36,912 INFO L125 PetriNetUnfolderBase]: For 200/223 co-relation queries the response was YES. [2025-03-17 11:11:36,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3752 conditions, 2905 events. 135/2905 cut-off events. For 200/223 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 18518 event pairs, 27 based on Foata normal form. 0/2820 useless extension candidates. Maximal degree in co-relation 3718. Up to 90 conditions per place. [2025-03-17 11:11:36,958 INFO L140 encePairwiseOnDemand]: 625/628 looper letters, 10 selfloop transitions, 2 changer transitions 11/541 dead transitions. [2025-03-17 11:11:36,958 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 574 places, 541 transitions, 1410 flow [2025-03-17 11:11:36,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:36,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:36,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1801 transitions. [2025-03-17 11:11:36,959 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9559447983014862 [2025-03-17 11:11:36,959 INFO L175 Difference]: Start difference. First operand has 580 places, 540 transitions, 1382 flow. Second operand 3 states and 1801 transitions. [2025-03-17 11:11:36,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 574 places, 541 transitions, 1410 flow [2025-03-17 11:11:36,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 561 places, 541 transitions, 1364 flow, removed 13 selfloop flow, removed 13 redundant places. [2025-03-17 11:11:36,967 INFO L231 Difference]: Finished difference. Result has 561 places, 528 transitions, 1266 flow [2025-03-17 11:11:36,968 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1334, PETRI_DIFFERENCE_MINUEND_PLACES=559, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=539, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=537, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1266, PETRI_PLACES=561, PETRI_TRANSITIONS=528} [2025-03-17 11:11:36,968 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -26 predicate places. [2025-03-17 11:11:36,968 INFO L471 AbstractCegarLoop]: Abstraction has has 561 places, 528 transitions, 1266 flow [2025-03-17 11:11:36,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 598.0) internal successors, (1794), 3 states have internal predecessors, (1794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:36,968 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:36,969 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:11:36,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-17 11:11:36,969 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-03-17 11:11:36,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:36,970 INFO L85 PathProgramCache]: Analyzing trace with hash 672813340, now seen corresponding path program 1 times [2025-03-17 11:11:36,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:36,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301954407] [2025-03-17 11:11:36,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:36,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:36,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-03-17 11:11:36,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-03-17 11:11:36,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:36,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:37,019 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 11:11:37,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:37,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301954407] [2025-03-17 11:11:37,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301954407] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:37,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:37,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:37,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616722539] [2025-03-17 11:11:37,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:37,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:37,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:37,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:37,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:37,032 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 596 out of 628 [2025-03-17 11:11:37,033 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 561 places, 528 transitions, 1266 flow. Second operand has 3 states, 3 states have (on average 598.3333333333334) internal successors, (1795), 3 states have internal predecessors, (1795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:37,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:37,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 596 of 628 [2025-03-17 11:11:37,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:37,260 INFO L124 PetriNetUnfolderBase]: 107/1753 cut-off events. [2025-03-17 11:11:37,261 INFO L125 PetriNetUnfolderBase]: For 69/91 co-relation queries the response was YES. [2025-03-17 11:11:37,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2204 conditions, 1753 events. 107/1753 cut-off events. For 69/91 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 9619 event pairs, 21 based on Foata normal form. 1/1680 useless extension candidates. Maximal degree in co-relation 2177. Up to 71 conditions per place. [2025-03-17 11:11:37,289 INFO L140 encePairwiseOnDemand]: 625/628 looper letters, 0 selfloop transitions, 0 changer transitions 529/529 dead transitions. [2025-03-17 11:11:37,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 555 places, 529 transitions, 1294 flow [2025-03-17 11:11:37,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:37,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:37,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1801 transitions. [2025-03-17 11:11:37,290 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9559447983014862 [2025-03-17 11:11:37,290 INFO L175 Difference]: Start difference. First operand has 561 places, 528 transitions, 1266 flow. Second operand 3 states and 1801 transitions. [2025-03-17 11:11:37,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 555 places, 529 transitions, 1294 flow [2025-03-17 11:11:37,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 542 places, 529 transitions, 1252 flow, removed 11 selfloop flow, removed 13 redundant places. [2025-03-17 11:11:37,294 INFO L231 Difference]: Finished difference. Result has 542 places, 0 transitions, 0 flow [2025-03-17 11:11:37,295 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1222, PETRI_DIFFERENCE_MINUEND_PLACES=540, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=527, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=527, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=542, PETRI_TRANSITIONS=0} [2025-03-17 11:11:37,295 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -45 predicate places. [2025-03-17 11:11:37,295 INFO L471 AbstractCegarLoop]: Abstraction has has 542 places, 0 transitions, 0 flow [2025-03-17 11:11:37,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 598.3333333333334) internal successors, (1795), 3 states have internal predecessors, (1795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:37,297 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (103 of 104 remaining) [2025-03-17 11:11:37,298 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (102 of 104 remaining) [2025-03-17 11:11:37,298 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (101 of 104 remaining) [2025-03-17 11:11:37,298 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (100 of 104 remaining) [2025-03-17 11:11:37,298 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (99 of 104 remaining) [2025-03-17 11:11:37,298 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (98 of 104 remaining) [2025-03-17 11:11:37,298 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (97 of 104 remaining) [2025-03-17 11:11:37,298 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (96 of 104 remaining) [2025-03-17 11:11:37,298 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (95 of 104 remaining) [2025-03-17 11:11:37,298 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (94 of 104 remaining) [2025-03-17 11:11:37,298 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (93 of 104 remaining) [2025-03-17 11:11:37,298 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (92 of 104 remaining) [2025-03-17 11:11:37,298 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (91 of 104 remaining) [2025-03-17 11:11:37,298 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (90 of 104 remaining) [2025-03-17 11:11:37,298 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (89 of 104 remaining) [2025-03-17 11:11:37,298 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (88 of 104 remaining) [2025-03-17 11:11:37,298 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (87 of 104 remaining) [2025-03-17 11:11:37,298 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (86 of 104 remaining) [2025-03-17 11:11:37,298 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (85 of 104 remaining) [2025-03-17 11:11:37,298 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (84 of 104 remaining) [2025-03-17 11:11:37,298 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (83 of 104 remaining) [2025-03-17 11:11:37,298 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (82 of 104 remaining) [2025-03-17 11:11:37,298 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (81 of 104 remaining) [2025-03-17 11:11:37,298 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (80 of 104 remaining) [2025-03-17 11:11:37,298 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (79 of 104 remaining) [2025-03-17 11:11:37,298 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (78 of 104 remaining) [2025-03-17 11:11:37,298 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (77 of 104 remaining) [2025-03-17 11:11:37,298 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (76 of 104 remaining) [2025-03-17 11:11:37,298 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (75 of 104 remaining) [2025-03-17 11:11:37,298 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (74 of 104 remaining) [2025-03-17 11:11:37,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (73 of 104 remaining) [2025-03-17 11:11:37,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (72 of 104 remaining) [2025-03-17 11:11:37,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (71 of 104 remaining) [2025-03-17 11:11:37,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (70 of 104 remaining) [2025-03-17 11:11:37,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (69 of 104 remaining) [2025-03-17 11:11:37,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (68 of 104 remaining) [2025-03-17 11:11:37,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (67 of 104 remaining) [2025-03-17 11:11:37,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (66 of 104 remaining) [2025-03-17 11:11:37,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (65 of 104 remaining) [2025-03-17 11:11:37,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (64 of 104 remaining) [2025-03-17 11:11:37,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (63 of 104 remaining) [2025-03-17 11:11:37,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (62 of 104 remaining) [2025-03-17 11:11:37,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (61 of 104 remaining) [2025-03-17 11:11:37,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (60 of 104 remaining) [2025-03-17 11:11:37,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (59 of 104 remaining) [2025-03-17 11:11:37,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (58 of 104 remaining) [2025-03-17 11:11:37,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (57 of 104 remaining) [2025-03-17 11:11:37,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (56 of 104 remaining) [2025-03-17 11:11:37,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (55 of 104 remaining) [2025-03-17 11:11:37,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (54 of 104 remaining) [2025-03-17 11:11:37,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (53 of 104 remaining) [2025-03-17 11:11:37,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (52 of 104 remaining) [2025-03-17 11:11:37,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (51 of 104 remaining) [2025-03-17 11:11:37,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (50 of 104 remaining) [2025-03-17 11:11:37,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (49 of 104 remaining) [2025-03-17 11:11:37,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (48 of 104 remaining) [2025-03-17 11:11:37,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (47 of 104 remaining) [2025-03-17 11:11:37,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (46 of 104 remaining) [2025-03-17 11:11:37,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (45 of 104 remaining) [2025-03-17 11:11:37,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (44 of 104 remaining) [2025-03-17 11:11:37,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (43 of 104 remaining) [2025-03-17 11:11:37,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (42 of 104 remaining) [2025-03-17 11:11:37,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (41 of 104 remaining) [2025-03-17 11:11:37,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (40 of 104 remaining) [2025-03-17 11:11:37,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (39 of 104 remaining) [2025-03-17 11:11:37,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (38 of 104 remaining) [2025-03-17 11:11:37,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (37 of 104 remaining) [2025-03-17 11:11:37,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (36 of 104 remaining) [2025-03-17 11:11:37,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (35 of 104 remaining) [2025-03-17 11:11:37,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (34 of 104 remaining) [2025-03-17 11:11:37,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (33 of 104 remaining) [2025-03-17 11:11:37,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (32 of 104 remaining) [2025-03-17 11:11:37,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (31 of 104 remaining) [2025-03-17 11:11:37,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (30 of 104 remaining) [2025-03-17 11:11:37,300 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (29 of 104 remaining) [2025-03-17 11:11:37,300 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (28 of 104 remaining) [2025-03-17 11:11:37,300 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (27 of 104 remaining) [2025-03-17 11:11:37,300 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (26 of 104 remaining) [2025-03-17 11:11:37,300 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (25 of 104 remaining) [2025-03-17 11:11:37,300 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (24 of 104 remaining) [2025-03-17 11:11:37,300 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (23 of 104 remaining) [2025-03-17 11:11:37,300 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (22 of 104 remaining) [2025-03-17 11:11:37,300 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (21 of 104 remaining) [2025-03-17 11:11:37,300 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (20 of 104 remaining) [2025-03-17 11:11:37,300 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (19 of 104 remaining) [2025-03-17 11:11:37,300 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (18 of 104 remaining) [2025-03-17 11:11:37,300 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (17 of 104 remaining) [2025-03-17 11:11:37,300 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (16 of 104 remaining) [2025-03-17 11:11:37,300 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (15 of 104 remaining) [2025-03-17 11:11:37,300 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (14 of 104 remaining) [2025-03-17 11:11:37,300 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (13 of 104 remaining) [2025-03-17 11:11:37,300 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (12 of 104 remaining) [2025-03-17 11:11:37,300 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (11 of 104 remaining) [2025-03-17 11:11:37,300 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (10 of 104 remaining) [2025-03-17 11:11:37,300 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (9 of 104 remaining) [2025-03-17 11:11:37,300 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (8 of 104 remaining) [2025-03-17 11:11:37,300 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (7 of 104 remaining) [2025-03-17 11:11:37,300 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (6 of 104 remaining) [2025-03-17 11:11:37,300 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (5 of 104 remaining) [2025-03-17 11:11:37,300 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (4 of 104 remaining) [2025-03-17 11:11:37,300 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (3 of 104 remaining) [2025-03-17 11:11:37,300 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (2 of 104 remaining) [2025-03-17 11:11:37,300 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (1 of 104 remaining) [2025-03-17 11:11:37,300 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (0 of 104 remaining) [2025-03-17 11:11:37,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-17 11:11:37,301 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:11:37,305 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-17 11:11:37,305 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 11:11:37,309 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 11:11:37 BasicIcfg [2025-03-17 11:11:37,309 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 11:11:37,309 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 11:11:37,310 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 11:11:37,310 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 11:11:37,310 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:11:03" (3/4) ... [2025-03-17 11:11:37,311 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 11:11:37,314 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-17 11:11:37,314 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-17 11:11:37,314 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-03-17 11:11:37,318 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2025-03-17 11:11:37,318 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-17 11:11:37,319 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 11:11:37,319 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 11:11:37,389 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 11:11:37,390 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 11:11:37,390 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 11:11:37,390 INFO L158 Benchmark]: Toolchain (without parser) took 34546.45ms. Allocated memory was 167.8MB in the beginning and 3.2GB in the end (delta: 3.0GB). Free memory was 131.9MB in the beginning and 642.6MB in the end (delta: -510.7MB). Peak memory consumption was 2.5GB. Max. memory is 16.1GB. [2025-03-17 11:11:37,390 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:11:37,390 INFO L158 Benchmark]: CACSL2BoogieTranslator took 198.16ms. Allocated memory is still 167.8MB. Free memory was 131.9MB in the beginning and 117.9MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 11:11:37,391 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.98ms. Allocated memory is still 167.8MB. Free memory was 117.9MB in the beginning and 114.1MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:11:37,391 INFO L158 Benchmark]: Boogie Preprocessor took 43.71ms. Allocated memory is still 167.8MB. Free memory was 114.1MB in the beginning and 111.2MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:11:37,391 INFO L158 Benchmark]: IcfgBuilder took 815.88ms. Allocated memory is still 167.8MB. Free memory was 111.2MB in the beginning and 65.9MB in the end (delta: 45.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-03-17 11:11:37,391 INFO L158 Benchmark]: TraceAbstraction took 33362.41ms. Allocated memory was 167.8MB in the beginning and 3.2GB in the end (delta: 3.0GB). Free memory was 65.5MB in the beginning and 651.0MB in the end (delta: -585.5MB). Peak memory consumption was 2.4GB. Max. memory is 16.1GB. [2025-03-17 11:11:37,391 INFO L158 Benchmark]: Witness Printer took 80.20ms. Allocated memory is still 3.2GB. Free memory was 651.0MB in the beginning and 642.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 11:11:37,392 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 198.16ms. Allocated memory is still 167.8MB. Free memory was 131.9MB in the beginning and 117.9MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.98ms. Allocated memory is still 167.8MB. Free memory was 117.9MB in the beginning and 114.1MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 43.71ms. Allocated memory is still 167.8MB. Free memory was 114.1MB in the beginning and 111.2MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 815.88ms. Allocated memory is still 167.8MB. Free memory was 111.2MB in the beginning and 65.9MB in the end (delta: 45.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * TraceAbstraction took 33362.41ms. Allocated memory was 167.8MB in the beginning and 3.2GB in the end (delta: 3.0GB). Free memory was 65.5MB in the beginning and 651.0MB in the end (delta: -585.5MB). Peak memory consumption was 2.4GB. Max. memory is 16.1GB. * Witness Printer took 80.20ms. Allocated memory is still 3.2GB. Free memory was 651.0MB in the beginning and 642.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 120]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 120]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 120]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 932 locations, 979 edges, 104 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 33.2s, OverallIterations: 37, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 28.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6632 SdHoareTripleChecker+Valid, 6.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4293 mSDsluCounter, 6258 SdHoareTripleChecker+Invalid, 5.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5977 mSDsCounter, 1291 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10477 IncrementalHoareTripleChecker+Invalid, 11768 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1291 mSolverCounterUnsat, 281 mSDtfsCounter, 10477 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 177 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1626occurred in iteration=24, InterpolantAutomatonStates: 180, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 6303 NumberOfCodeBlocks, 6303 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 6266 ConstructedInterpolants, 0 QuantifiedInterpolants, 8598 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 37 InterpolantComputations, 37 PerfectInterpolantSequences, 31/31 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 59 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-17 11:11:37,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE