./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/array-eq-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 735b3cc8 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/array-eq-trans.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e7f1528a4c77969c5bff279724a3ed43475460be047e2e4b141f1353c3ea9cfe --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 01:41:58,874 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:41:58,926 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-14 01:41:58,930 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:41:58,930 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:41:58,954 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:41:58,956 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:41:58,956 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:41:58,956 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:41:58,957 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:41:58,958 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:41:58,958 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:41:58,958 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:41:58,958 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:41:58,958 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:41:58,959 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:41:58,959 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:41:58,959 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:41:58,959 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:41:58,959 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:41:58,959 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:41:58,959 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:41:58,959 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-14 01:41:58,959 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-14 01:41:58,959 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:41:58,959 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:41:58,959 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:41:58,959 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:41:58,960 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:41:58,960 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:41:58,960 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:41:58,960 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:41:58,960 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:41:58,960 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:41:58,960 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:41:58,961 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:41:58,961 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:41:58,961 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:41:58,961 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:41:58,961 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:41:58,961 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:41:58,961 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:41:58,962 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 -> e7f1528a4c77969c5bff279724a3ed43475460be047e2e4b141f1353c3ea9cfe [2025-03-14 01:41:59,209 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:41:59,216 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:41:59,219 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:41:59,220 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:41:59,220 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:41:59,222 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/array-eq-trans.wvr.c [2025-03-14 01:42:00,479 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4c320dca/17c71191f0794737ad053d80bf117efd/FLAG8f5a4b488 [2025-03-14 01:42:00,716 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:42:00,719 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/array-eq-trans.wvr.c [2025-03-14 01:42:00,726 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4c320dca/17c71191f0794737ad053d80bf117efd/FLAG8f5a4b488 [2025-03-14 01:42:00,742 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4c320dca/17c71191f0794737ad053d80bf117efd [2025-03-14 01:42:00,746 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:42:00,747 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:42:00,749 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:42:00,749 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:42:00,753 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:42:00,753 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:42:00" (1/1) ... [2025-03-14 01:42:00,754 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47c3be5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:00, skipping insertion in model container [2025-03-14 01:42:00,755 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:42:00" (1/1) ... [2025-03-14 01:42:00,769 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:42:00,954 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:42:00,964 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:42:01,008 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:42:01,030 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:42:01,030 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:01 WrapperNode [2025-03-14 01:42:01,030 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:42:01,031 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:42:01,031 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:42:01,032 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:42:01,037 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:01" (1/1) ... [2025-03-14 01:42:01,048 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:01" (1/1) ... [2025-03-14 01:42:01,073 INFO L138 Inliner]: procedures = 23, calls = 32, calls flagged for inlining = 11, calls inlined = 15, statements flattened = 316 [2025-03-14 01:42:01,073 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:42:01,074 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:42:01,074 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:42:01,074 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:42:01,079 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:01" (1/1) ... [2025-03-14 01:42:01,079 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:01" (1/1) ... [2025-03-14 01:42:01,083 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:01" (1/1) ... [2025-03-14 01:42:01,083 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:01" (1/1) ... [2025-03-14 01:42:01,100 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:01" (1/1) ... [2025-03-14 01:42:01,101 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:01" (1/1) ... [2025-03-14 01:42:01,107 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:01" (1/1) ... [2025-03-14 01:42:01,109 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:01" (1/1) ... [2025-03-14 01:42:01,114 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:42:01,115 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:42:01,115 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:42:01,115 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:42:01,120 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:01" (1/1) ... [2025-03-14 01:42:01,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:42:01,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:42:01,149 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-14 01:42:01,152 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-14 01:42:01,171 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:42:01,172 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-14 01:42:01,172 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-14 01:42:01,172 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-14 01:42:01,172 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-14 01:42:01,172 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-14 01:42:01,172 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-14 01:42:01,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 01:42:01,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-14 01:42:01,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-14 01:42:01,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:42:01,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:42:01,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-14 01:42:01,174 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 01:42:01,270 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:42:01,272 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:42:01,915 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:42:01,916 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:42:01,916 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:42:01,945 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:42:01,947 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:42:01 BoogieIcfgContainer [2025-03-14 01:42:01,948 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:42:01,950 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:42:01,950 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:42:01,953 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:42:01,954 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:42:00" (1/3) ... [2025-03-14 01:42:01,954 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50cfcbdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:42:01, skipping insertion in model container [2025-03-14 01:42:01,954 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:01" (2/3) ... [2025-03-14 01:42:01,954 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50cfcbdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:42:01, skipping insertion in model container [2025-03-14 01:42:01,954 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:42:01" (3/3) ... [2025-03-14 01:42:01,955 INFO L128 eAbstractionObserver]: Analyzing ICFG array-eq-trans.wvr.c [2025-03-14 01:42:01,967 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:42:01,970 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG array-eq-trans.wvr.c that has 4 procedures, 593 locations, 1 initial locations, 6 loop locations, and 78 error locations. [2025-03-14 01:42:01,970 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:42:02,122 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-14 01:42:02,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 602 places, 622 transitions, 1265 flow [2025-03-14 01:42:02,318 INFO L124 PetriNetUnfolderBase]: 30/619 cut-off events. [2025-03-14 01:42:02,320 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-14 01:42:02,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 632 conditions, 619 events. 30/619 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1480 event pairs, 0 based on Foata normal form. 0/511 useless extension candidates. Maximal degree in co-relation 368. Up to 3 conditions per place. [2025-03-14 01:42:02,330 INFO L82 GeneralOperation]: Start removeDead. Operand has 602 places, 622 transitions, 1265 flow [2025-03-14 01:42:02,338 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 577 places, 594 transitions, 1206 flow [2025-03-14 01:42:02,345 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:42:02,354 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;@4d6f6fac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:42:02,354 INFO L334 AbstractCegarLoop]: Starting to check reachability of 117 error locations. [2025-03-14 01:42:02,359 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:42:02,359 INFO L124 PetriNetUnfolderBase]: 0/26 cut-off events. [2025-03-14 01:42:02,359 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:42:02,359 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:02,360 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-14 01:42:02,360 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-03-14 01:42:02,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:02,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1924535835, now seen corresponding path program 1 times [2025-03-14 01:42:02,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:02,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039893679] [2025-03-14 01:42:02,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:02,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:02,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-14 01:42:02,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-14 01:42:02,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:02,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:02,505 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-14 01:42:02,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:02,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039893679] [2025-03-14 01:42:02,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039893679] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:02,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:02,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:02,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415623643] [2025-03-14 01:42:02,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:02,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:02,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:02,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:02,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:02,609 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 591 out of 622 [2025-03-14 01:42:02,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 577 places, 594 transitions, 1206 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-14 01:42:02,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:02,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 591 of 622 [2025-03-14 01:42:02,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:02,773 INFO L124 PetriNetUnfolderBase]: 30/787 cut-off events. [2025-03-14 01:42:02,774 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-03-14 01:42:02,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 836 conditions, 787 events. 30/787 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2601 event pairs, 5 based on Foata normal form. 27/667 useless extension candidates. Maximal degree in co-relation 440. Up to 28 conditions per place. [2025-03-14 01:42:02,791 INFO L140 encePairwiseOnDemand]: 608/622 looper letters, 14 selfloop transitions, 2 changer transitions 8/582 dead transitions. [2025-03-14 01:42:02,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 578 places, 582 transitions, 1214 flow [2025-03-14 01:42:02,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:02,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:02,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1801 transitions. [2025-03-14 01:42:02,811 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9651661307609861 [2025-03-14 01:42:02,812 INFO L175 Difference]: Start difference. First operand has 577 places, 594 transitions, 1206 flow. Second operand 3 states and 1801 transitions. [2025-03-14 01:42:02,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 578 places, 582 transitions, 1214 flow [2025-03-14 01:42:02,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 572 places, 582 transitions, 1202 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-14 01:42:02,835 INFO L231 Difference]: Finished difference. Result has 572 places, 574 transitions, 1158 flow [2025-03-14 01:42:02,839 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1170, PETRI_DIFFERENCE_MINUEND_PLACES=570, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=582, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=580, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1158, PETRI_PLACES=572, PETRI_TRANSITIONS=574} [2025-03-14 01:42:02,843 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -5 predicate places. [2025-03-14 01:42:02,843 INFO L471 AbstractCegarLoop]: Abstraction has has 572 places, 574 transitions, 1158 flow [2025-03-14 01:42:02,845 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-14 01:42:02,845 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:02,846 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-14 01:42:02,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:42:02,846 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-03-14 01:42:02,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:02,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1936181023, now seen corresponding path program 1 times [2025-03-14 01:42:02,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:02,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831954886] [2025-03-14 01:42:02,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:02,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:02,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-14 01:42:02,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-14 01:42:02,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:02,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:02,915 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-14 01:42:02,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:02,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831954886] [2025-03-14 01:42:02,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831954886] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:02,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:02,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:02,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867270580] [2025-03-14 01:42:02,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:02,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:02,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:02,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:02,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:02,956 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 591 out of 622 [2025-03-14 01:42:02,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 572 places, 574 transitions, 1158 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-14 01:42:02,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:02,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 591 of 622 [2025-03-14 01:42:02,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:03,106 INFO L124 PetriNetUnfolderBase]: 38/919 cut-off events. [2025-03-14 01:42:03,106 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-14 01:42:03,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 963 conditions, 919 events. 38/919 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3687 event pairs, 7 based on Foata normal form. 0/750 useless extension candidates. Maximal degree in co-relation 929. Up to 31 conditions per place. [2025-03-14 01:42:03,118 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 14 selfloop transitions, 2 changer transitions 0/573 dead transitions. [2025-03-14 01:42:03,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 565 places, 573 transitions, 1188 flow [2025-03-14 01:42:03,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:03,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:03,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1790 transitions. [2025-03-14 01:42:03,125 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9592711682743837 [2025-03-14 01:42:03,126 INFO L175 Difference]: Start difference. First operand has 572 places, 574 transitions, 1158 flow. Second operand 3 states and 1790 transitions. [2025-03-14 01:42:03,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 565 places, 573 transitions, 1188 flow [2025-03-14 01:42:03,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 563 places, 573 transitions, 1184 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:42:03,134 INFO L231 Difference]: Finished difference. Result has 563 places, 573 transitions, 1156 flow [2025-03-14 01:42:03,135 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1152, PETRI_DIFFERENCE_MINUEND_PLACES=561, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=573, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=571, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1156, PETRI_PLACES=563, PETRI_TRANSITIONS=573} [2025-03-14 01:42:03,135 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -14 predicate places. [2025-03-14 01:42:03,135 INFO L471 AbstractCegarLoop]: Abstraction has has 563 places, 573 transitions, 1156 flow [2025-03-14 01:42:03,136 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-14 01:42:03,137 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:03,137 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-14 01:42:03,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 01:42:03,137 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-03-14 01:42:03,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:03,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1165122818, now seen corresponding path program 1 times [2025-03-14 01:42:03,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:03,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993947243] [2025-03-14 01:42:03,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:03,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:03,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-14 01:42:03,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-14 01:42:03,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:03,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:03,199 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-14 01:42:03,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:03,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993947243] [2025-03-14 01:42:03,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993947243] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:03,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:03,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:03,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805126014] [2025-03-14 01:42:03,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:03,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:03,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:03,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:03,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:03,253 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 591 out of 622 [2025-03-14 01:42:03,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 563 places, 573 transitions, 1156 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-14 01:42:03,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:03,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 591 of 622 [2025-03-14 01:42:03,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:03,331 INFO L124 PetriNetUnfolderBase]: 26/652 cut-off events. [2025-03-14 01:42:03,331 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-14 01:42:03,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 690 conditions, 652 events. 26/652 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1778 event pairs, 7 based on Foata normal form. 0/546 useless extension candidates. Maximal degree in co-relation 648. Up to 28 conditions per place. [2025-03-14 01:42:03,340 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 14 selfloop transitions, 2 changer transitions 0/572 dead transitions. [2025-03-14 01:42:03,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 564 places, 572 transitions, 1186 flow [2025-03-14 01:42:03,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:03,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:03,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1790 transitions. [2025-03-14 01:42:03,346 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9592711682743837 [2025-03-14 01:42:03,346 INFO L175 Difference]: Start difference. First operand has 563 places, 573 transitions, 1156 flow. Second operand 3 states and 1790 transitions. [2025-03-14 01:42:03,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 564 places, 572 transitions, 1186 flow [2025-03-14 01:42:03,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 562 places, 572 transitions, 1182 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:42:03,355 INFO L231 Difference]: Finished difference. Result has 562 places, 572 transitions, 1154 flow [2025-03-14 01:42:03,356 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1150, PETRI_DIFFERENCE_MINUEND_PLACES=560, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=572, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=570, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1154, PETRI_PLACES=562, PETRI_TRANSITIONS=572} [2025-03-14 01:42:03,356 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -15 predicate places. [2025-03-14 01:42:03,356 INFO L471 AbstractCegarLoop]: Abstraction has has 562 places, 572 transitions, 1154 flow [2025-03-14 01:42:03,358 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-14 01:42:03,358 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:03,358 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-14 01:42:03,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 01:42:03,359 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-03-14 01:42:03,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:03,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1496572960, now seen corresponding path program 1 times [2025-03-14 01:42:03,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:03,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983087344] [2025-03-14 01:42:03,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:03,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:03,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-14 01:42:03,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-14 01:42:03,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:03,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:03,418 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-14 01:42:03,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:03,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983087344] [2025-03-14 01:42:03,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983087344] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:03,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:03,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:03,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275591840] [2025-03-14 01:42:03,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:03,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:03,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:03,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:03,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:03,450 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 587 out of 622 [2025-03-14 01:42:03,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 562 places, 572 transitions, 1154 flow. Second operand has 3 states, 3 states have (on average 588.0) internal successors, (1764), 3 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:03,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:03,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 587 of 622 [2025-03-14 01:42:03,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:03,636 INFO L124 PetriNetUnfolderBase]: 48/971 cut-off events. [2025-03-14 01:42:03,637 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-14 01:42:03,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1032 conditions, 971 events. 48/971 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4117 event pairs, 12 based on Foata normal form. 0/795 useless extension candidates. Maximal degree in co-relation 982. Up to 48 conditions per place. [2025-03-14 01:42:03,650 INFO L140 encePairwiseOnDemand]: 616/622 looper letters, 16 selfloop transitions, 1 changer transitions 0/567 dead transitions. [2025-03-14 01:42:03,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 559 places, 567 transitions, 1178 flow [2025-03-14 01:42:03,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:03,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:03,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1783 transitions. [2025-03-14 01:42:03,655 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9555198285101822 [2025-03-14 01:42:03,655 INFO L175 Difference]: Start difference. First operand has 562 places, 572 transitions, 1154 flow. Second operand 3 states and 1783 transitions. [2025-03-14 01:42:03,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 559 places, 567 transitions, 1178 flow [2025-03-14 01:42:03,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 557 places, 567 transitions, 1174 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:42:03,666 INFO L231 Difference]: Finished difference. Result has 557 places, 567 transitions, 1142 flow [2025-03-14 01:42:03,667 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1140, PETRI_DIFFERENCE_MINUEND_PLACES=555, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=567, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=566, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1142, PETRI_PLACES=557, PETRI_TRANSITIONS=567} [2025-03-14 01:42:03,667 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -20 predicate places. [2025-03-14 01:42:03,667 INFO L471 AbstractCegarLoop]: Abstraction has has 557 places, 567 transitions, 1142 flow [2025-03-14 01:42:03,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 588.0) internal successors, (1764), 3 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:03,669 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:03,669 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-14 01:42:03,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 01:42:03,669 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-03-14 01:42:03,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:03,670 INFO L85 PathProgramCache]: Analyzing trace with hash -355271188, now seen corresponding path program 1 times [2025-03-14 01:42:03,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:03,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094706871] [2025-03-14 01:42:03,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:03,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:03,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-14 01:42:03,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-14 01:42:03,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:03,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:04,187 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-14 01:42:04,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:04,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094706871] [2025-03-14 01:42:04,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094706871] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:04,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:04,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:42:04,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780098114] [2025-03-14 01:42:04,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:04,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:42:04,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:04,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:42:04,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:42:04,554 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 513 out of 622 [2025-03-14 01:42:04,557 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 557 places, 567 transitions, 1142 flow. Second operand has 6 states, 6 states have (on average 514.5) internal successors, (3087), 6 states have internal predecessors, (3087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:04,557 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:04,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 513 of 622 [2025-03-14 01:42:04,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:06,120 INFO L124 PetriNetUnfolderBase]: 2257/12449 cut-off events. [2025-03-14 01:42:06,124 INFO L125 PetriNetUnfolderBase]: For 179/179 co-relation queries the response was YES. [2025-03-14 01:42:06,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15402 conditions, 12449 events. 2257/12449 cut-off events. For 179/179 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 144566 event pairs, 1520 based on Foata normal form. 0/9811 useless extension candidates. Maximal degree in co-relation 15353. Up to 2844 conditions per place. [2025-03-14 01:42:06,287 INFO L140 encePairwiseOnDemand]: 604/622 looper letters, 78 selfloop transitions, 15 changer transitions 0/564 dead transitions. [2025-03-14 01:42:06,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 559 places, 564 transitions, 1322 flow [2025-03-14 01:42:06,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:42:06,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:42:06,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3174 transitions. [2025-03-14 01:42:06,314 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8504823151125402 [2025-03-14 01:42:06,314 INFO L175 Difference]: Start difference. First operand has 557 places, 567 transitions, 1142 flow. Second operand 6 states and 3174 transitions. [2025-03-14 01:42:06,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 559 places, 564 transitions, 1322 flow [2025-03-14 01:42:06,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 558 places, 564 transitions, 1321 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:42:06,325 INFO L231 Difference]: Finished difference. Result has 558 places, 564 transitions, 1165 flow [2025-03-14 01:42:06,328 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1135, PETRI_DIFFERENCE_MINUEND_PLACES=553, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=564, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=549, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1165, PETRI_PLACES=558, PETRI_TRANSITIONS=564} [2025-03-14 01:42:06,331 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -19 predicate places. [2025-03-14 01:42:06,333 INFO L471 AbstractCegarLoop]: Abstraction has has 558 places, 564 transitions, 1165 flow [2025-03-14 01:42:06,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 514.5) internal successors, (3087), 6 states have internal predecessors, (3087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:06,334 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:06,334 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-14 01:42:06,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 01:42:06,334 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-03-14 01:42:06,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:06,335 INFO L85 PathProgramCache]: Analyzing trace with hash -715794705, now seen corresponding path program 1 times [2025-03-14 01:42:06,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:06,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929700851] [2025-03-14 01:42:06,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:06,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:06,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-14 01:42:06,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-14 01:42:06,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:06,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:06,412 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-14 01:42:06,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:06,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929700851] [2025-03-14 01:42:06,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929700851] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:06,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:06,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:06,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925558186] [2025-03-14 01:42:06,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:06,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:06,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:06,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:06,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:06,448 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 592 out of 622 [2025-03-14 01:42:06,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 558 places, 564 transitions, 1165 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-14 01:42:06,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:06,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 592 of 622 [2025-03-14 01:42:06,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:06,539 INFO L124 PetriNetUnfolderBase]: 27/710 cut-off events. [2025-03-14 01:42:06,540 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 01:42:06,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 759 conditions, 710 events. 27/710 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2169 event pairs, 5 based on Foata normal form. 0/599 useless extension candidates. Maximal degree in co-relation 711. Up to 24 conditions per place. [2025-03-14 01:42:06,548 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 13 selfloop transitions, 2 changer transitions 0/563 dead transitions. [2025-03-14 01:42:06,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 559 places, 563 transitions, 1193 flow [2025-03-14 01:42:06,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:06,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:06,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1792 transitions. [2025-03-14 01:42:06,552 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9603429796355841 [2025-03-14 01:42:06,552 INFO L175 Difference]: Start difference. First operand has 558 places, 564 transitions, 1165 flow. Second operand 3 states and 1792 transitions. [2025-03-14 01:42:06,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 559 places, 563 transitions, 1193 flow [2025-03-14 01:42:06,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 554 places, 563 transitions, 1163 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:42:06,560 INFO L231 Difference]: Finished difference. Result has 554 places, 563 transitions, 1137 flow [2025-03-14 01:42:06,561 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1133, PETRI_DIFFERENCE_MINUEND_PLACES=552, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=563, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=561, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1137, PETRI_PLACES=554, PETRI_TRANSITIONS=563} [2025-03-14 01:42:06,563 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -23 predicate places. [2025-03-14 01:42:06,563 INFO L471 AbstractCegarLoop]: Abstraction has has 554 places, 563 transitions, 1137 flow [2025-03-14 01:42:06,565 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-14 01:42:06,565 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:06,565 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-14 01:42:06,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 01:42:06,565 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-03-14 01:42:06,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:06,567 INFO L85 PathProgramCache]: Analyzing trace with hash -121553665, now seen corresponding path program 1 times [2025-03-14 01:42:06,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:06,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591211766] [2025-03-14 01:42:06,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:06,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:06,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-14 01:42:06,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-14 01:42:06,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:06,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:06,605 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-14 01:42:06,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:06,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591211766] [2025-03-14 01:42:06,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591211766] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:06,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:06,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:06,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82547537] [2025-03-14 01:42:06,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:06,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:06,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:06,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:06,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:06,627 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 587 out of 622 [2025-03-14 01:42:06,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 554 places, 563 transitions, 1137 flow. Second operand has 3 states, 3 states have (on average 588.0) internal successors, (1764), 3 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:06,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:06,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 587 of 622 [2025-03-14 01:42:06,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:06,788 INFO L124 PetriNetUnfolderBase]: 74/1297 cut-off events. [2025-03-14 01:42:06,789 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-14 01:42:06,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1383 conditions, 1297 events. 74/1297 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 7155 event pairs, 20 based on Foata normal form. 0/1060 useless extension candidates. Maximal degree in co-relation 1333. Up to 66 conditions per place. [2025-03-14 01:42:06,804 INFO L140 encePairwiseOnDemand]: 616/622 looper letters, 16 selfloop transitions, 1 changer transitions 0/558 dead transitions. [2025-03-14 01:42:06,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 551 places, 558 transitions, 1161 flow [2025-03-14 01:42:06,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:06,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:06,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1783 transitions. [2025-03-14 01:42:06,808 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9555198285101822 [2025-03-14 01:42:06,808 INFO L175 Difference]: Start difference. First operand has 554 places, 563 transitions, 1137 flow. Second operand 3 states and 1783 transitions. [2025-03-14 01:42:06,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 551 places, 558 transitions, 1161 flow [2025-03-14 01:42:06,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 549 places, 558 transitions, 1157 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:42:06,816 INFO L231 Difference]: Finished difference. Result has 549 places, 558 transitions, 1125 flow [2025-03-14 01:42:06,816 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1123, PETRI_DIFFERENCE_MINUEND_PLACES=547, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=558, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=557, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1125, PETRI_PLACES=549, PETRI_TRANSITIONS=558} [2025-03-14 01:42:06,817 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -28 predicate places. [2025-03-14 01:42:06,818 INFO L471 AbstractCegarLoop]: Abstraction has has 549 places, 558 transitions, 1125 flow [2025-03-14 01:42:06,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 588.0) internal successors, (1764), 3 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:06,819 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:06,819 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-14 01:42:06,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 01:42:06,819 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-03-14 01:42:06,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:06,819 INFO L85 PathProgramCache]: Analyzing trace with hash 2107925024, now seen corresponding path program 1 times [2025-03-14 01:42:06,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:06,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853333822] [2025-03-14 01:42:06,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:06,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:06,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-14 01:42:06,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-14 01:42:06,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:06,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:06,870 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-14 01:42:06,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:06,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853333822] [2025-03-14 01:42:06,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853333822] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:06,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:06,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:06,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103058018] [2025-03-14 01:42:06,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:06,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:06,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:06,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:06,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:06,900 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 592 out of 622 [2025-03-14 01:42:06,901 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 549 places, 558 transitions, 1125 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-14 01:42:06,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:06,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 592 of 622 [2025-03-14 01:42:06,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:06,995 INFO L124 PetriNetUnfolderBase]: 35/840 cut-off events. [2025-03-14 01:42:06,996 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 01:42:07,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 880 conditions, 840 events. 35/840 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3059 event pairs, 7 based on Foata normal form. 0/704 useless extension candidates. Maximal degree in co-relation 830. Up to 27 conditions per place. [2025-03-14 01:42:07,003 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 13 selfloop transitions, 2 changer transitions 0/557 dead transitions. [2025-03-14 01:42:07,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 550 places, 557 transitions, 1153 flow [2025-03-14 01:42:07,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:07,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:07,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1792 transitions. [2025-03-14 01:42:07,009 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9603429796355841 [2025-03-14 01:42:07,009 INFO L175 Difference]: Start difference. First operand has 549 places, 558 transitions, 1125 flow. Second operand 3 states and 1792 transitions. [2025-03-14 01:42:07,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 550 places, 557 transitions, 1153 flow [2025-03-14 01:42:07,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 549 places, 557 transitions, 1152 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:42:07,017 INFO L231 Difference]: Finished difference. Result has 549 places, 557 transitions, 1126 flow [2025-03-14 01:42:07,018 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1122, PETRI_DIFFERENCE_MINUEND_PLACES=547, 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=1126, PETRI_PLACES=549, PETRI_TRANSITIONS=557} [2025-03-14 01:42:07,018 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -28 predicate places. [2025-03-14 01:42:07,019 INFO L471 AbstractCegarLoop]: Abstraction has has 549 places, 557 transitions, 1126 flow [2025-03-14 01:42:07,020 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-14 01:42:07,021 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:07,021 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-14 01:42:07,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 01:42:07,021 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-03-14 01:42:07,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:07,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1946425328, now seen corresponding path program 1 times [2025-03-14 01:42:07,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:07,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242404852] [2025-03-14 01:42:07,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:07,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:07,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-14 01:42:07,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-14 01:42:07,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:07,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:07,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:42:07,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:07,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242404852] [2025-03-14 01:42:07,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242404852] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:07,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:07,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:07,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303007200] [2025-03-14 01:42:07,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:07,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:07,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:07,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:07,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:07,104 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 587 out of 622 [2025-03-14 01:42:07,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 549 places, 557 transitions, 1126 flow. Second operand has 3 states, 3 states have (on average 588.0) internal successors, (1764), 3 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:07,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:07,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 587 of 622 [2025-03-14 01:42:07,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:07,258 INFO L124 PetriNetUnfolderBase]: 70/1155 cut-off events. [2025-03-14 01:42:07,259 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-03-14 01:42:07,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1235 conditions, 1155 events. 70/1155 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 5662 event pairs, 20 based on Foata normal form. 0/961 useless extension candidates. Maximal degree in co-relation 1185. Up to 67 conditions per place. [2025-03-14 01:42:07,273 INFO L140 encePairwiseOnDemand]: 616/622 looper letters, 16 selfloop transitions, 1 changer transitions 0/552 dead transitions. [2025-03-14 01:42:07,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 546 places, 552 transitions, 1150 flow [2025-03-14 01:42:07,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:07,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:07,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1783 transitions. [2025-03-14 01:42:07,277 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9555198285101822 [2025-03-14 01:42:07,277 INFO L175 Difference]: Start difference. First operand has 549 places, 557 transitions, 1126 flow. Second operand 3 states and 1783 transitions. [2025-03-14 01:42:07,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 546 places, 552 transitions, 1150 flow [2025-03-14 01:42:07,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 544 places, 552 transitions, 1146 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:42:07,284 INFO L231 Difference]: Finished difference. Result has 544 places, 552 transitions, 1114 flow [2025-03-14 01:42:07,285 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1112, PETRI_DIFFERENCE_MINUEND_PLACES=542, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=552, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=551, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1114, PETRI_PLACES=544, PETRI_TRANSITIONS=552} [2025-03-14 01:42:07,286 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -33 predicate places. [2025-03-14 01:42:07,286 INFO L471 AbstractCegarLoop]: Abstraction has has 544 places, 552 transitions, 1114 flow [2025-03-14 01:42:07,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 588.0) internal successors, (1764), 3 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:07,287 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:07,287 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:42:07,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 01:42:07,287 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-03-14 01:42:07,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:07,288 INFO L85 PathProgramCache]: Analyzing trace with hash -783993518, now seen corresponding path program 1 times [2025-03-14 01:42:07,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:07,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019692585] [2025-03-14 01:42:07,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:07,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:07,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-14 01:42:07,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-14 01:42:07,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:07,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:07,334 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-14 01:42:07,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:07,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019692585] [2025-03-14 01:42:07,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019692585] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:07,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:07,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:07,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209612783] [2025-03-14 01:42:07,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:07,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:07,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:07,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:07,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:07,360 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 592 out of 622 [2025-03-14 01:42:07,362 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 544 places, 552 transitions, 1114 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-14 01:42:07,362 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:07,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 592 of 622 [2025-03-14 01:42:07,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:07,428 INFO L124 PetriNetUnfolderBase]: 26/629 cut-off events. [2025-03-14 01:42:07,428 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-14 01:42:07,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 667 conditions, 629 events. 26/629 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1668 event pairs, 7 based on Foata normal form. 0/544 useless extension candidates. Maximal degree in co-relation 617. Up to 27 conditions per place. [2025-03-14 01:42:07,435 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 13 selfloop transitions, 2 changer transitions 0/551 dead transitions. [2025-03-14 01:42:07,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 545 places, 551 transitions, 1142 flow [2025-03-14 01:42:07,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:07,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:07,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1792 transitions. [2025-03-14 01:42:07,440 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9603429796355841 [2025-03-14 01:42:07,440 INFO L175 Difference]: Start difference. First operand has 544 places, 552 transitions, 1114 flow. Second operand 3 states and 1792 transitions. [2025-03-14 01:42:07,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 545 places, 551 transitions, 1142 flow [2025-03-14 01:42:07,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 544 places, 551 transitions, 1141 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:42:07,446 INFO L231 Difference]: Finished difference. Result has 544 places, 551 transitions, 1115 flow [2025-03-14 01:42:07,447 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1111, PETRI_DIFFERENCE_MINUEND_PLACES=542, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=551, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=549, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1115, PETRI_PLACES=544, PETRI_TRANSITIONS=551} [2025-03-14 01:42:07,448 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -33 predicate places. [2025-03-14 01:42:07,448 INFO L471 AbstractCegarLoop]: Abstraction has has 544 places, 551 transitions, 1115 flow [2025-03-14 01:42:07,449 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-14 01:42:07,449 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:07,449 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] [2025-03-14 01:42:07,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-14 01:42:07,449 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-03-14 01:42:07,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:07,450 INFO L85 PathProgramCache]: Analyzing trace with hash -447227897, now seen corresponding path program 1 times [2025-03-14 01:42:07,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:07,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598674413] [2025-03-14 01:42:07,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:07,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:07,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-14 01:42:07,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-14 01:42:07,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:07,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:07,500 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-14 01:42:07,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:07,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598674413] [2025-03-14 01:42:07,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598674413] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:07,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:07,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:07,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629441496] [2025-03-14 01:42:07,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:07,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:07,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:07,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:07,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:07,529 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 575 out of 622 [2025-03-14 01:42:07,531 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 544 places, 551 transitions, 1115 flow. Second operand has 3 states, 3 states have (on average 576.0) internal successors, (1728), 3 states have internal predecessors, (1728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:07,531 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:07,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 575 of 622 [2025-03-14 01:42:07,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:07,601 INFO L124 PetriNetUnfolderBase]: 44/682 cut-off events. [2025-03-14 01:42:07,602 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 01:42:07,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 786 conditions, 682 events. 44/682 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2078 event pairs, 2 based on Foata normal form. 0/604 useless extension candidates. Maximal degree in co-relation 737. Up to 63 conditions per place. [2025-03-14 01:42:07,608 INFO L140 encePairwiseOnDemand]: 611/622 looper letters, 25 selfloop transitions, 2 changer transitions 0/544 dead transitions. [2025-03-14 01:42:07,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 537 places, 544 transitions, 1157 flow [2025-03-14 01:42:07,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:07,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:07,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1761 transitions. [2025-03-14 01:42:07,611 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9437299035369775 [2025-03-14 01:42:07,611 INFO L175 Difference]: Start difference. First operand has 544 places, 551 transitions, 1115 flow. Second operand 3 states and 1761 transitions. [2025-03-14 01:42:07,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 537 places, 544 transitions, 1157 flow [2025-03-14 01:42:07,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 535 places, 544 transitions, 1153 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:42:07,617 INFO L231 Difference]: Finished difference. Result has 535 places, 542 transitions, 1097 flow [2025-03-14 01:42:07,618 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1093, PETRI_DIFFERENCE_MINUEND_PLACES=533, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=542, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=540, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1097, PETRI_PLACES=535, PETRI_TRANSITIONS=542} [2025-03-14 01:42:07,619 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -42 predicate places. [2025-03-14 01:42:07,619 INFO L471 AbstractCegarLoop]: Abstraction has has 535 places, 542 transitions, 1097 flow [2025-03-14 01:42:07,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 576.0) internal successors, (1728), 3 states have internal predecessors, (1728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:07,620 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:07,620 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] [2025-03-14 01:42:07,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-14 01:42:07,621 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-03-14 01:42:07,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:07,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1929786781, now seen corresponding path program 1 times [2025-03-14 01:42:07,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:07,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964632426] [2025-03-14 01:42:07,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:07,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:07,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-14 01:42:07,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-14 01:42:07,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:07,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:07,662 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-14 01:42:07,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:07,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964632426] [2025-03-14 01:42:07,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964632426] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:07,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:07,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:07,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406047424] [2025-03-14 01:42:07,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:07,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:07,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:07,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:07,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:07,688 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 575 out of 622 [2025-03-14 01:42:07,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 535 places, 542 transitions, 1097 flow. Second operand has 3 states, 3 states have (on average 576.3333333333334) internal successors, (1729), 3 states have internal predecessors, (1729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:07,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:07,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 575 of 622 [2025-03-14 01:42:07,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:07,769 INFO L124 PetriNetUnfolderBase]: 47/735 cut-off events. [2025-03-14 01:42:07,769 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-03-14 01:42:07,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 828 conditions, 735 events. 47/735 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2580 event pairs, 18 based on Foata normal form. 0/654 useless extension candidates. Maximal degree in co-relation 779. Up to 62 conditions per place. [2025-03-14 01:42:07,777 INFO L140 encePairwiseOnDemand]: 611/622 looper letters, 25 selfloop transitions, 2 changer transitions 0/535 dead transitions. [2025-03-14 01:42:07,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 528 places, 535 transitions, 1139 flow [2025-03-14 01:42:07,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:07,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:07,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1761 transitions. [2025-03-14 01:42:07,781 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9437299035369775 [2025-03-14 01:42:07,781 INFO L175 Difference]: Start difference. First operand has 535 places, 542 transitions, 1097 flow. Second operand 3 states and 1761 transitions. [2025-03-14 01:42:07,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 528 places, 535 transitions, 1139 flow [2025-03-14 01:42:07,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 526 places, 535 transitions, 1135 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:42:07,788 INFO L231 Difference]: Finished difference. Result has 526 places, 533 transitions, 1079 flow [2025-03-14 01:42:07,789 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1075, PETRI_DIFFERENCE_MINUEND_PLACES=524, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=533, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=531, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1079, PETRI_PLACES=526, PETRI_TRANSITIONS=533} [2025-03-14 01:42:07,789 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -51 predicate places. [2025-03-14 01:42:07,789 INFO L471 AbstractCegarLoop]: Abstraction has has 526 places, 533 transitions, 1079 flow [2025-03-14 01:42:07,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 576.3333333333334) internal successors, (1729), 3 states have internal predecessors, (1729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:07,790 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:07,791 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:42:07,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-14 01:42:07,791 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-03-14 01:42:07,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:07,791 INFO L85 PathProgramCache]: Analyzing trace with hash 726342130, now seen corresponding path program 1 times [2025-03-14 01:42:07,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:07,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018267300] [2025-03-14 01:42:07,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:07,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:07,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-14 01:42:07,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-14 01:42:07,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:07,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:07,834 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-14 01:42:07,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:07,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018267300] [2025-03-14 01:42:07,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018267300] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:07,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:07,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:42:07,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254820263] [2025-03-14 01:42:07,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:07,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:07,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:07,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:07,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:07,843 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 595 out of 622 [2025-03-14 01:42:07,845 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 526 places, 533 transitions, 1079 flow. Second operand has 3 states, 3 states have (on average 596.6666666666666) internal successors, (1790), 3 states have internal predecessors, (1790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:07,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:07,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 595 of 622 [2025-03-14 01:42:07,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:07,911 INFO L124 PetriNetUnfolderBase]: 44/800 cut-off events. [2025-03-14 01:42:07,911 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 01:42:07,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 880 conditions, 800 events. 44/800 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2872 event pairs, 12 based on Foata normal form. 0/709 useless extension candidates. Maximal degree in co-relation 831. Up to 39 conditions per place. [2025-03-14 01:42:07,917 INFO L140 encePairwiseOnDemand]: 618/622 looper letters, 14 selfloop transitions, 3 changer transitions 0/536 dead transitions. [2025-03-14 01:42:07,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 528 places, 536 transitions, 1121 flow [2025-03-14 01:42:07,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:07,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:07,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1803 transitions. [2025-03-14 01:42:07,920 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9662379421221865 [2025-03-14 01:42:07,920 INFO L175 Difference]: Start difference. First operand has 526 places, 533 transitions, 1079 flow. Second operand 3 states and 1803 transitions. [2025-03-14 01:42:07,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 528 places, 536 transitions, 1121 flow [2025-03-14 01:42:07,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 526 places, 536 transitions, 1117 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:42:07,929 INFO L231 Difference]: Finished difference. Result has 528 places, 534 transitions, 1093 flow [2025-03-14 01:42:07,930 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1075, PETRI_DIFFERENCE_MINUEND_PLACES=524, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=533, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=530, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1093, PETRI_PLACES=528, PETRI_TRANSITIONS=534} [2025-03-14 01:42:07,931 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -49 predicate places. [2025-03-14 01:42:07,931 INFO L471 AbstractCegarLoop]: Abstraction has has 528 places, 534 transitions, 1093 flow [2025-03-14 01:42:07,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 596.6666666666666) internal successors, (1790), 3 states have internal predecessors, (1790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:07,932 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:07,932 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:42:07,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-14 01:42:07,932 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread3Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-03-14 01:42:07,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:07,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1675283982, now seen corresponding path program 1 times [2025-03-14 01:42:07,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:07,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159051862] [2025-03-14 01:42:07,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:07,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:07,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-14 01:42:07,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-14 01:42:07,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:07,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:07,993 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-14 01:42:07,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:07,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159051862] [2025-03-14 01:42:07,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159051862] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:07,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:07,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:07,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263560090] [2025-03-14 01:42:07,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:07,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:07,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:07,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:07,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:08,020 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 575 out of 622 [2025-03-14 01:42:08,022 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 528 places, 534 transitions, 1093 flow. Second operand has 3 states, 3 states have (on average 576.6666666666666) internal successors, (1730), 3 states have internal predecessors, (1730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:08,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:08,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 575 of 622 [2025-03-14 01:42:08,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:08,092 INFO L124 PetriNetUnfolderBase]: 44/665 cut-off events. [2025-03-14 01:42:08,093 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-03-14 01:42:08,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 754 conditions, 665 events. 44/665 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2145 event pairs, 2 based on Foata normal form. 0/609 useless extension candidates. Maximal degree in co-relation 704. Up to 61 conditions per place. [2025-03-14 01:42:08,097 INFO L140 encePairwiseOnDemand]: 611/622 looper letters, 25 selfloop transitions, 2 changer transitions 0/527 dead transitions. [2025-03-14 01:42:08,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 521 places, 527 transitions, 1135 flow [2025-03-14 01:42:08,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:08,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:08,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1761 transitions. [2025-03-14 01:42:08,101 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9437299035369775 [2025-03-14 01:42:08,101 INFO L175 Difference]: Start difference. First operand has 528 places, 534 transitions, 1093 flow. Second operand 3 states and 1761 transitions. [2025-03-14 01:42:08,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 521 places, 527 transitions, 1135 flow [2025-03-14 01:42:08,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 519 places, 527 transitions, 1129 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:42:08,108 INFO L231 Difference]: Finished difference. Result has 519 places, 525 transitions, 1073 flow [2025-03-14 01:42:08,109 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1069, PETRI_DIFFERENCE_MINUEND_PLACES=517, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=525, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=523, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1073, PETRI_PLACES=519, PETRI_TRANSITIONS=525} [2025-03-14 01:42:08,109 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -58 predicate places. [2025-03-14 01:42:08,109 INFO L471 AbstractCegarLoop]: Abstraction has has 519 places, 525 transitions, 1073 flow [2025-03-14 01:42:08,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 576.6666666666666) internal successors, (1730), 3 states have internal predecessors, (1730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:08,111 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:08,111 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-14 01:42:08,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-14 01:42:08,111 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-03-14 01:42:08,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:08,112 INFO L85 PathProgramCache]: Analyzing trace with hash 662094638, now seen corresponding path program 1 times [2025-03-14 01:42:08,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:08,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038493657] [2025-03-14 01:42:08,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:08,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:08,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-14 01:42:08,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-14 01:42:08,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:08,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:08,154 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-14 01:42:08,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:08,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038493657] [2025-03-14 01:42:08,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038493657] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:08,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:08,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:08,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383216289] [2025-03-14 01:42:08,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:08,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:08,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:08,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:08,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:08,173 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 590 out of 622 [2025-03-14 01:42:08,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 519 places, 525 transitions, 1073 flow. Second operand has 3 states, 3 states have (on average 591.3333333333334) internal successors, (1774), 3 states have internal predecessors, (1774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:08,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:08,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 590 of 622 [2025-03-14 01:42:08,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:08,277 INFO L124 PetriNetUnfolderBase]: 62/1077 cut-off events. [2025-03-14 01:42:08,277 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-03-14 01:42:08,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1186 conditions, 1077 events. 62/1077 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 4743 event pairs, 2 based on Foata normal form. 0/979 useless extension candidates. Maximal degree in co-relation 1136. Up to 52 conditions per place. [2025-03-14 01:42:08,288 INFO L140 encePairwiseOnDemand]: 614/622 looper letters, 20 selfloop transitions, 4 changer transitions 0/530 dead transitions. [2025-03-14 01:42:08,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 517 places, 530 transitions, 1136 flow [2025-03-14 01:42:08,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:08,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:08,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1798 transitions. [2025-03-14 01:42:08,292 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9635584137191854 [2025-03-14 01:42:08,292 INFO L175 Difference]: Start difference. First operand has 519 places, 525 transitions, 1073 flow. Second operand 3 states and 1798 transitions. [2025-03-14 01:42:08,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 517 places, 530 transitions, 1136 flow [2025-03-14 01:42:08,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 515 places, 530 transitions, 1132 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:42:08,299 INFO L231 Difference]: Finished difference. Result has 516 places, 525 transitions, 1089 flow [2025-03-14 01:42:08,299 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1061, PETRI_DIFFERENCE_MINUEND_PLACES=513, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=521, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=517, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1089, PETRI_PLACES=516, PETRI_TRANSITIONS=525} [2025-03-14 01:42:08,300 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -61 predicate places. [2025-03-14 01:42:08,300 INFO L471 AbstractCegarLoop]: Abstraction has has 516 places, 525 transitions, 1089 flow [2025-03-14 01:42:08,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 591.3333333333334) internal successors, (1774), 3 states have internal predecessors, (1774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:08,301 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:08,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 01:42:08,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-14 01:42:08,301 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-03-14 01:42:08,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:08,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1706693384, now seen corresponding path program 1 times [2025-03-14 01:42:08,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:08,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024377855] [2025-03-14 01:42:08,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:08,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:08,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-14 01:42:08,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-14 01:42:08,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:08,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:08,342 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-14 01:42:08,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:08,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024377855] [2025-03-14 01:42:08,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024377855] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:08,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:08,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:42:08,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893474974] [2025-03-14 01:42:08,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:08,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:08,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:08,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:08,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:08,351 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 595 out of 622 [2025-03-14 01:42:08,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 516 places, 525 transitions, 1089 flow. Second operand has 3 states, 3 states have (on average 597.0) internal successors, (1791), 3 states have internal predecessors, (1791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:08,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:08,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 595 of 622 [2025-03-14 01:42:08,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:08,491 INFO L124 PetriNetUnfolderBase]: 72/1058 cut-off events. [2025-03-14 01:42:08,491 INFO L125 PetriNetUnfolderBase]: For 22/82 co-relation queries the response was YES. [2025-03-14 01:42:08,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1183 conditions, 1058 events. 72/1058 cut-off events. For 22/82 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 4949 event pairs, 18 based on Foata normal form. 2/954 useless extension candidates. Maximal degree in co-relation 1133. Up to 57 conditions per place. [2025-03-14 01:42:08,507 INFO L140 encePairwiseOnDemand]: 618/622 looper letters, 14 selfloop transitions, 3 changer transitions 0/528 dead transitions. [2025-03-14 01:42:08,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 518 places, 528 transitions, 1131 flow [2025-03-14 01:42:08,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:08,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:08,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1803 transitions. [2025-03-14 01:42:08,512 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9662379421221865 [2025-03-14 01:42:08,512 INFO L175 Difference]: Start difference. First operand has 516 places, 525 transitions, 1089 flow. Second operand 3 states and 1803 transitions. [2025-03-14 01:42:08,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 518 places, 528 transitions, 1131 flow [2025-03-14 01:42:08,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 518 places, 528 transitions, 1131 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:42:08,520 INFO L231 Difference]: Finished difference. Result has 520 places, 526 transitions, 1107 flow [2025-03-14 01:42:08,521 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1089, PETRI_DIFFERENCE_MINUEND_PLACES=516, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=525, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=522, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1107, PETRI_PLACES=520, PETRI_TRANSITIONS=526} [2025-03-14 01:42:08,521 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -57 predicate places. [2025-03-14 01:42:08,521 INFO L471 AbstractCegarLoop]: Abstraction has has 520 places, 526 transitions, 1107 flow [2025-03-14 01:42:08,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 597.0) internal successors, (1791), 3 states have internal predecessors, (1791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:08,523 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:08,523 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-14 01:42:08,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-14 01:42:08,523 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-03-14 01:42:08,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:08,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1372956507, now seen corresponding path program 1 times [2025-03-14 01:42:08,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:08,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617867955] [2025-03-14 01:42:08,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:08,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:08,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-14 01:42:08,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-14 01:42:08,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:08,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:08,574 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-14 01:42:08,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:08,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617867955] [2025-03-14 01:42:08,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617867955] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:08,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:08,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:08,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383609673] [2025-03-14 01:42:08,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:08,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:08,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:08,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:08,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:08,590 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 590 out of 622 [2025-03-14 01:42:08,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 520 places, 526 transitions, 1107 flow. Second operand has 3 states, 3 states have (on average 591.6666666666666) internal successors, (1775), 3 states have internal predecessors, (1775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:08,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:08,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 590 of 622 [2025-03-14 01:42:08,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:08,779 INFO L124 PetriNetUnfolderBase]: 107/1690 cut-off events. [2025-03-14 01:42:08,779 INFO L125 PetriNetUnfolderBase]: For 21/29 co-relation queries the response was YES. [2025-03-14 01:42:08,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1920 conditions, 1690 events. 107/1690 cut-off events. For 21/29 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 9643 event pairs, 8 based on Foata normal form. 1/1548 useless extension candidates. Maximal degree in co-relation 1868. Up to 76 conditions per place. [2025-03-14 01:42:08,795 INFO L140 encePairwiseOnDemand]: 614/622 looper letters, 20 selfloop transitions, 4 changer transitions 0/531 dead transitions. [2025-03-14 01:42:08,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 518 places, 531 transitions, 1170 flow [2025-03-14 01:42:08,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:08,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:08,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1798 transitions. [2025-03-14 01:42:08,799 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9635584137191854 [2025-03-14 01:42:08,799 INFO L175 Difference]: Start difference. First operand has 520 places, 526 transitions, 1107 flow. Second operand 3 states and 1798 transitions. [2025-03-14 01:42:08,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 518 places, 531 transitions, 1170 flow [2025-03-14 01:42:08,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 516 places, 531 transitions, 1164 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:42:08,806 INFO L231 Difference]: Finished difference. Result has 517 places, 526 transitions, 1121 flow [2025-03-14 01:42:08,807 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1093, PETRI_DIFFERENCE_MINUEND_PLACES=514, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=522, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=518, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1121, PETRI_PLACES=517, PETRI_TRANSITIONS=526} [2025-03-14 01:42:08,808 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -60 predicate places. [2025-03-14 01:42:08,808 INFO L471 AbstractCegarLoop]: Abstraction has has 517 places, 526 transitions, 1121 flow [2025-03-14 01:42:08,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 591.6666666666666) internal successors, (1775), 3 states have internal predecessors, (1775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:08,810 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:08,810 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] [2025-03-14 01:42:08,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-14 01:42:08,810 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-03-14 01:42:08,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:08,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1570352878, now seen corresponding path program 1 times [2025-03-14 01:42:08,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:08,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140116828] [2025-03-14 01:42:08,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:08,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:08,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-14 01:42:08,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-14 01:42:08,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:08,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:09,021 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-14 01:42:09,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:09,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140116828] [2025-03-14 01:42:09,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140116828] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:09,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:09,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-14 01:42:09,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030718533] [2025-03-14 01:42:09,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:09,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-14 01:42:09,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:09,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-14 01:42:09,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-14 01:42:09,698 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 564 out of 622 [2025-03-14 01:42:09,700 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 517 places, 526 transitions, 1121 flow. Second operand has 8 states, 8 states have (on average 568.125) internal successors, (4545), 8 states have internal predecessors, (4545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:09,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:09,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 564 of 622 [2025-03-14 01:42:09,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:10,214 INFO L124 PetriNetUnfolderBase]: 177/2658 cut-off events. [2025-03-14 01:42:10,215 INFO L125 PetriNetUnfolderBase]: For 16/45 co-relation queries the response was YES. [2025-03-14 01:42:10,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3205 conditions, 2658 events. 177/2658 cut-off events. For 16/45 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 17522 event pairs, 14 based on Foata normal form. 5/2465 useless extension candidates. Maximal degree in co-relation 3150. Up to 115 conditions per place. [2025-03-14 01:42:10,246 INFO L140 encePairwiseOnDemand]: 605/622 looper letters, 79 selfloop transitions, 19 changer transitions 0/578 dead transitions. [2025-03-14 01:42:10,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 528 places, 578 transitions, 1452 flow [2025-03-14 01:42:10,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-14 01:42:10,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-14 01:42:10,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 6866 transitions. [2025-03-14 01:42:10,265 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.919882100750268 [2025-03-14 01:42:10,266 INFO L175 Difference]: Start difference. First operand has 517 places, 526 transitions, 1121 flow. Second operand 12 states and 6866 transitions. [2025-03-14 01:42:10,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 528 places, 578 transitions, 1452 flow [2025-03-14 01:42:10,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 528 places, 578 transitions, 1452 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:42:10,303 INFO L231 Difference]: Finished difference. Result has 533 places, 537 transitions, 1228 flow [2025-03-14 01:42:10,308 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1121, PETRI_DIFFERENCE_MINUEND_PLACES=517, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=526, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=510, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1228, PETRI_PLACES=533, PETRI_TRANSITIONS=537} [2025-03-14 01:42:10,309 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -44 predicate places. [2025-03-14 01:42:10,309 INFO L471 AbstractCegarLoop]: Abstraction has has 533 places, 537 transitions, 1228 flow [2025-03-14 01:42:10,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 568.125) internal successors, (4545), 8 states have internal predecessors, (4545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:10,310 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:10,314 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] [2025-03-14 01:42:10,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-14 01:42:10,314 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-03-14 01:42:10,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:10,315 INFO L85 PathProgramCache]: Analyzing trace with hash 268257727, now seen corresponding path program 1 times [2025-03-14 01:42:10,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:10,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222818681] [2025-03-14 01:42:10,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:10,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:10,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-14 01:42:10,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-14 01:42:10,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:10,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:10,553 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-14 01:42:10,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:10,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222818681] [2025-03-14 01:42:10,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222818681] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:10,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:10,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-14 01:42:10,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021562616] [2025-03-14 01:42:10,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:10,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-14 01:42:10,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:10,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-14 01:42:10,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-14 01:42:11,172 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 564 out of 622 [2025-03-14 01:42:11,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 533 places, 537 transitions, 1228 flow. Second operand has 8 states, 8 states have (on average 568.25) internal successors, (4546), 8 states have internal predecessors, (4546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:11,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:11,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 564 of 622 [2025-03-14 01:42:11,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:12,196 INFO L124 PetriNetUnfolderBase]: 426/5780 cut-off events. [2025-03-14 01:42:12,196 INFO L125 PetriNetUnfolderBase]: For 220/348 co-relation queries the response was YES. [2025-03-14 01:42:12,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7012 conditions, 5780 events. 426/5780 cut-off events. For 220/348 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 52618 event pairs, 62 based on Foata normal form. 12/5289 useless extension candidates. Maximal degree in co-relation 6946. Up to 201 conditions per place. [2025-03-14 01:42:12,250 INFO L140 encePairwiseOnDemand]: 605/622 looper letters, 74 selfloop transitions, 19 changer transitions 0/579 dead transitions. [2025-03-14 01:42:12,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 544 places, 579 transitions, 1528 flow [2025-03-14 01:42:12,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-14 01:42:12,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-14 01:42:12,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 6856 transitions. [2025-03-14 01:42:12,259 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9185423365487674 [2025-03-14 01:42:12,260 INFO L175 Difference]: Start difference. First operand has 533 places, 537 transitions, 1228 flow. Second operand 12 states and 6856 transitions. [2025-03-14 01:42:12,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 544 places, 579 transitions, 1528 flow [2025-03-14 01:42:12,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 544 places, 579 transitions, 1528 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:42:12,269 INFO L231 Difference]: Finished difference. Result has 549 places, 548 transitions, 1335 flow [2025-03-14 01:42:12,270 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1228, PETRI_DIFFERENCE_MINUEND_PLACES=533, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=537, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=521, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1335, PETRI_PLACES=549, PETRI_TRANSITIONS=548} [2025-03-14 01:42:12,270 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -28 predicate places. [2025-03-14 01:42:12,270 INFO L471 AbstractCegarLoop]: Abstraction has has 549 places, 548 transitions, 1335 flow [2025-03-14 01:42:12,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 568.25) internal successors, (4546), 8 states have internal predecessors, (4546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:12,271 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:12,271 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-14 01:42:12,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-14 01:42:12,271 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread3Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-03-14 01:42:12,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:12,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1508176349, now seen corresponding path program 1 times [2025-03-14 01:42:12,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:12,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934540276] [2025-03-14 01:42:12,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:12,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:12,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-14 01:42:12,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-14 01:42:12,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:12,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:12,317 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-14 01:42:12,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:12,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934540276] [2025-03-14 01:42:12,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934540276] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:12,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:12,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:42:12,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577083283] [2025-03-14 01:42:12,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:12,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:12,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:12,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:12,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:12,327 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 595 out of 622 [2025-03-14 01:42:12,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 549 places, 548 transitions, 1335 flow. Second operand has 3 states, 3 states have (on average 597.3333333333334) internal successors, (1792), 3 states have internal predecessors, (1792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:12,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:12,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 595 of 622 [2025-03-14 01:42:12,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:13,031 INFO L124 PetriNetUnfolderBase]: 618/5400 cut-off events. [2025-03-14 01:42:13,032 INFO L125 PetriNetUnfolderBase]: For 453/585 co-relation queries the response was YES. [2025-03-14 01:42:13,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6776 conditions, 5400 events. 618/5400 cut-off events. For 453/585 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 48449 event pairs, 209 based on Foata normal form. 0/4816 useless extension candidates. Maximal degree in co-relation 6702. Up to 631 conditions per place. [2025-03-14 01:42:13,087 INFO L140 encePairwiseOnDemand]: 618/622 looper letters, 14 selfloop transitions, 3 changer transitions 0/551 dead transitions. [2025-03-14 01:42:13,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 551 places, 551 transitions, 1377 flow [2025-03-14 01:42:13,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:13,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:13,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1803 transitions. [2025-03-14 01:42:13,090 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9662379421221865 [2025-03-14 01:42:13,090 INFO L175 Difference]: Start difference. First operand has 549 places, 548 transitions, 1335 flow. Second operand 3 states and 1803 transitions. [2025-03-14 01:42:13,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 551 places, 551 transitions, 1377 flow [2025-03-14 01:42:13,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 551 places, 551 transitions, 1377 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:42:13,097 INFO L231 Difference]: Finished difference. Result has 553 places, 549 transitions, 1353 flow [2025-03-14 01:42:13,098 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1335, PETRI_DIFFERENCE_MINUEND_PLACES=549, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=548, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=545, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1353, PETRI_PLACES=553, PETRI_TRANSITIONS=549} [2025-03-14 01:42:13,098 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -24 predicate places. [2025-03-14 01:42:13,098 INFO L471 AbstractCegarLoop]: Abstraction has has 553 places, 549 transitions, 1353 flow [2025-03-14 01:42:13,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 597.3333333333334) internal successors, (1792), 3 states have internal predecessors, (1792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:13,099 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:13,099 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:42:13,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-14 01:42:13,099 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread3Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-03-14 01:42:13,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:13,100 INFO L85 PathProgramCache]: Analyzing trace with hash 249359985, now seen corresponding path program 1 times [2025-03-14 01:42:13,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:13,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787567307] [2025-03-14 01:42:13,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:13,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:13,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-14 01:42:13,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-14 01:42:13,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:13,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:13,386 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-14 01:42:13,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:13,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787567307] [2025-03-14 01:42:13,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787567307] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:13,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:13,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-14 01:42:13,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222481175] [2025-03-14 01:42:13,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:13,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-14 01:42:13,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:13,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-14 01:42:13,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-14 01:42:13,907 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 564 out of 622 [2025-03-14 01:42:13,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 553 places, 549 transitions, 1353 flow. Second operand has 8 states, 8 states have (on average 568.375) internal successors, (4547), 8 states have internal predecessors, (4547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:13,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:13,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 564 of 622 [2025-03-14 01:42:13,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:15,067 INFO L124 PetriNetUnfolderBase]: 663/7300 cut-off events. [2025-03-14 01:42:15,067 INFO L125 PetriNetUnfolderBase]: For 637/745 co-relation queries the response was YES. [2025-03-14 01:42:15,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9268 conditions, 7300 events. 663/7300 cut-off events. For 637/745 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 72775 event pairs, 135 based on Foata normal form. 9/6617 useless extension candidates. Maximal degree in co-relation 9189. Up to 372 conditions per place. [2025-03-14 01:42:15,124 INFO L140 encePairwiseOnDemand]: 605/622 looper letters, 86 selfloop transitions, 22 changer transitions 0/601 dead transitions. [2025-03-14 01:42:15,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 565 places, 601 transitions, 1748 flow [2025-03-14 01:42:15,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-14 01:42:15,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-14 01:42:15,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 7431 transitions. [2025-03-14 01:42:15,131 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.918995795201583 [2025-03-14 01:42:15,132 INFO L175 Difference]: Start difference. First operand has 553 places, 549 transitions, 1353 flow. Second operand 13 states and 7431 transitions. [2025-03-14 01:42:15,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 565 places, 601 transitions, 1748 flow [2025-03-14 01:42:15,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 563 places, 601 transitions, 1732 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:42:15,142 INFO L231 Difference]: Finished difference. Result has 566 places, 556 transitions, 1439 flow [2025-03-14 01:42:15,143 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1347, PETRI_DIFFERENCE_MINUEND_PLACES=551, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=549, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=531, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1439, PETRI_PLACES=566, PETRI_TRANSITIONS=556} [2025-03-14 01:42:15,144 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -11 predicate places. [2025-03-14 01:42:15,144 INFO L471 AbstractCegarLoop]: Abstraction has has 566 places, 556 transitions, 1439 flow [2025-03-14 01:42:15,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 568.375) internal successors, (4547), 8 states have internal predecessors, (4547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:15,145 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:15,145 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 01:42:15,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-14 01:42:15,145 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-03-14 01:42:15,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:15,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1827511055, now seen corresponding path program 1 times [2025-03-14 01:42:15,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:15,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200964033] [2025-03-14 01:42:15,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:15,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:15,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-14 01:42:15,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-14 01:42:15,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:15,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:15,357 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-14 01:42:15,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:15,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200964033] [2025-03-14 01:42:15,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200964033] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:15,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:15,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-14 01:42:15,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748526784] [2025-03-14 01:42:15,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:15,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-14 01:42:15,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:15,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-14 01:42:15,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-14 01:42:15,752 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 564 out of 622 [2025-03-14 01:42:15,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 566 places, 556 transitions, 1439 flow. Second operand has 8 states, 8 states have (on average 568.25) internal successors, (4546), 8 states have internal predecessors, (4546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:15,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:15,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 564 of 622 [2025-03-14 01:42:15,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:16,627 INFO L124 PetriNetUnfolderBase]: 288/5457 cut-off events. [2025-03-14 01:42:16,627 INFO L125 PetriNetUnfolderBase]: For 262/387 co-relation queries the response was YES. [2025-03-14 01:42:16,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6809 conditions, 5457 events. 288/5457 cut-off events. For 262/387 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 43945 event pairs, 37 based on Foata normal form. 13/5095 useless extension candidates. Maximal degree in co-relation 6722. Up to 193 conditions per place. [2025-03-14 01:42:16,666 INFO L140 encePairwiseOnDemand]: 605/622 looper letters, 79 selfloop transitions, 24 changer transitions 0/597 dead transitions. [2025-03-14 01:42:16,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 577 places, 597 transitions, 1789 flow [2025-03-14 01:42:16,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-14 01:42:16,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-14 01:42:16,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 6859 transitions. [2025-03-14 01:42:16,674 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9189442658092176 [2025-03-14 01:42:16,674 INFO L175 Difference]: Start difference. First operand has 566 places, 556 transitions, 1439 flow. Second operand 12 states and 6859 transitions. [2025-03-14 01:42:16,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 577 places, 597 transitions, 1789 flow [2025-03-14 01:42:16,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 571 places, 597 transitions, 1772 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-14 01:42:16,682 INFO L231 Difference]: Finished difference. Result has 574 places, 563 transitions, 1545 flow [2025-03-14 01:42:16,682 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1422, PETRI_DIFFERENCE_MINUEND_PLACES=560, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=556, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=536, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1545, PETRI_PLACES=574, PETRI_TRANSITIONS=563} [2025-03-14 01:42:16,683 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -3 predicate places. [2025-03-14 01:42:16,683 INFO L471 AbstractCegarLoop]: Abstraction has has 574 places, 563 transitions, 1545 flow [2025-03-14 01:42:16,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 568.25) internal successors, (4546), 8 states have internal predecessors, (4546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:16,684 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:16,684 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] [2025-03-14 01:42:16,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-14 01:42:16,685 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-03-14 01:42:16,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:16,686 INFO L85 PathProgramCache]: Analyzing trace with hash 724684056, now seen corresponding path program 1 times [2025-03-14 01:42:16,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:16,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602415003] [2025-03-14 01:42:16,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:16,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:16,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-14 01:42:16,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-14 01:42:16,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:16,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:16,851 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-14 01:42:16,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:16,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602415003] [2025-03-14 01:42:16,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602415003] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:16,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:16,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-14 01:42:16,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968447052] [2025-03-14 01:42:16,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:16,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-14 01:42:16,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:16,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-14 01:42:16,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-14 01:42:17,304 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 564 out of 622 [2025-03-14 01:42:17,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 574 places, 563 transitions, 1545 flow. Second operand has 8 states, 8 states have (on average 568.375) internal successors, (4547), 8 states have internal predecessors, (4547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:17,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:17,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 564 of 622 [2025-03-14 01:42:17,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:18,913 INFO L124 PetriNetUnfolderBase]: 619/9244 cut-off events. [2025-03-14 01:42:18,913 INFO L125 PetriNetUnfolderBase]: For 841/1007 co-relation queries the response was YES. [2025-03-14 01:42:18,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11814 conditions, 9244 events. 619/9244 cut-off events. For 841/1007 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 92338 event pairs, 119 based on Foata normal form. 22/8535 useless extension candidates. Maximal degree in co-relation 11718. Up to 264 conditions per place. [2025-03-14 01:42:18,982 INFO L140 encePairwiseOnDemand]: 605/622 looper letters, 73 selfloop transitions, 27 changer transitions 0/601 dead transitions. [2025-03-14 01:42:18,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 586 places, 601 transitions, 1884 flow [2025-03-14 01:42:18,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-14 01:42:18,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-14 01:42:18,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 7416 transitions. [2025-03-14 01:42:18,986 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9171407370764284 [2025-03-14 01:42:18,986 INFO L175 Difference]: Start difference. First operand has 574 places, 563 transitions, 1545 flow. Second operand 13 states and 7416 transitions. [2025-03-14 01:42:18,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 586 places, 601 transitions, 1884 flow [2025-03-14 01:42:18,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 580 places, 601 transitions, 1867 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-14 01:42:19,000 INFO L231 Difference]: Finished difference. Result has 585 places, 575 transitions, 1676 flow [2025-03-14 01:42:19,001 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1528, PETRI_DIFFERENCE_MINUEND_PLACES=568, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=563, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=543, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1676, PETRI_PLACES=585, PETRI_TRANSITIONS=575} [2025-03-14 01:42:19,001 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, 8 predicate places. [2025-03-14 01:42:19,001 INFO L471 AbstractCegarLoop]: Abstraction has has 585 places, 575 transitions, 1676 flow [2025-03-14 01:42:19,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 568.375) internal successors, (4547), 8 states have internal predecessors, (4547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:19,002 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:19,003 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:42:19,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-14 01:42:19,003 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread3Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-03-14 01:42:19,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:19,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1530668270, now seen corresponding path program 1 times [2025-03-14 01:42:19,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:19,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151695423] [2025-03-14 01:42:19,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:19,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:19,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-03-14 01:42:19,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-03-14 01:42:19,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:19,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:19,175 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-14 01:42:19,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:19,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151695423] [2025-03-14 01:42:19,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151695423] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:19,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:19,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-14 01:42:19,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953195669] [2025-03-14 01:42:19,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:19,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-14 01:42:19,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:19,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-14 01:42:19,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-14 01:42:19,586 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 564 out of 622 [2025-03-14 01:42:19,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 585 places, 575 transitions, 1676 flow. Second operand has 8 states, 8 states have (on average 568.5) internal successors, (4548), 8 states have internal predecessors, (4548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:19,589 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:19,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 564 of 622 [2025-03-14 01:42:19,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:20,959 INFO L124 PetriNetUnfolderBase]: 659/8213 cut-off events. [2025-03-14 01:42:20,960 INFO L125 PetriNetUnfolderBase]: For 1123/1229 co-relation queries the response was YES. [2025-03-14 01:42:21,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10829 conditions, 8213 events. 659/8213 cut-off events. For 1123/1229 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 82436 event pairs, 147 based on Foata normal form. 11/7526 useless extension candidates. Maximal degree in co-relation 10722. Up to 389 conditions per place. [2025-03-14 01:42:21,029 INFO L140 encePairwiseOnDemand]: 605/622 looper letters, 73 selfloop transitions, 24 changer transitions 0/604 dead transitions. [2025-03-14 01:42:21,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 596 places, 604 transitions, 1984 flow [2025-03-14 01:42:21,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-14 01:42:21,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-14 01:42:21,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 6848 transitions. [2025-03-14 01:42:21,033 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.917470525187567 [2025-03-14 01:42:21,033 INFO L175 Difference]: Start difference. First operand has 585 places, 575 transitions, 1676 flow. Second operand 12 states and 6848 transitions. [2025-03-14 01:42:21,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 596 places, 604 transitions, 1984 flow [2025-03-14 01:42:21,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 595 places, 604 transitions, 1980 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-14 01:42:21,045 INFO L231 Difference]: Finished difference. Result has 598 places, 581 transitions, 1787 flow [2025-03-14 01:42:21,046 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1672, PETRI_DIFFERENCE_MINUEND_PLACES=584, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=575, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=555, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1787, PETRI_PLACES=598, PETRI_TRANSITIONS=581} [2025-03-14 01:42:21,047 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, 21 predicate places. [2025-03-14 01:42:21,047 INFO L471 AbstractCegarLoop]: Abstraction has has 598 places, 581 transitions, 1787 flow [2025-03-14 01:42:21,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 568.5) internal successors, (4548), 8 states have internal predecessors, (4548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:21,048 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:21,048 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:42:21,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-14 01:42:21,048 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-03-14 01:42:21,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:21,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1320707982, now seen corresponding path program 1 times [2025-03-14 01:42:21,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:21,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734796358] [2025-03-14 01:42:21,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:21,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:21,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-14 01:42:21,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-14 01:42:21,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:21,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:21,513 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-14 01:42:21,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:21,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734796358] [2025-03-14 01:42:21,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734796358] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:21,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:21,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:42:21,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177650196] [2025-03-14 01:42:21,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:21,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:42:21,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:21,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:42:21,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:42:22,115 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 575 out of 622 [2025-03-14 01:42:22,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 598 places, 581 transitions, 1787 flow. Second operand has 6 states, 6 states have (on average 577.8333333333334) internal successors, (3467), 6 states have internal predecessors, (3467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:22,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:22,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 575 of 622 [2025-03-14 01:42:22,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:23,885 INFO L124 PetriNetUnfolderBase]: 307/8437 cut-off events. [2025-03-14 01:42:23,886 INFO L125 PetriNetUnfolderBase]: For 654/727 co-relation queries the response was YES. [2025-03-14 01:42:23,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10321 conditions, 8437 events. 307/8437 cut-off events. For 654/727 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 76522 event pairs, 16 based on Foata normal form. 20/7889 useless extension candidates. Maximal degree in co-relation 10207. Up to 177 conditions per place. [2025-03-14 01:42:23,939 INFO L140 encePairwiseOnDemand]: 611/622 looper letters, 38 selfloop transitions, 10 changer transitions 0/594 dead transitions. [2025-03-14 01:42:23,939 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 601 places, 594 transitions, 1920 flow [2025-03-14 01:42:23,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:42:23,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:42:23,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3499 transitions. [2025-03-14 01:42:23,941 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.937566988210075 [2025-03-14 01:42:23,941 INFO L175 Difference]: Start difference. First operand has 598 places, 581 transitions, 1787 flow. Second operand 6 states and 3499 transitions. [2025-03-14 01:42:23,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 601 places, 594 transitions, 1920 flow [2025-03-14 01:42:23,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 594 places, 594 transitions, 1901 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-03-14 01:42:23,953 INFO L231 Difference]: Finished difference. Result has 598 places, 583 transitions, 1816 flow [2025-03-14 01:42:23,953 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1764, PETRI_DIFFERENCE_MINUEND_PLACES=589, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=579, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=569, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1816, PETRI_PLACES=598, PETRI_TRANSITIONS=583} [2025-03-14 01:42:23,954 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, 21 predicate places. [2025-03-14 01:42:23,954 INFO L471 AbstractCegarLoop]: Abstraction has has 598 places, 583 transitions, 1816 flow [2025-03-14 01:42:23,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 577.8333333333334) internal successors, (3467), 6 states have internal predecessors, (3467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:23,955 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:23,955 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:42:23,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-14 01:42:23,955 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-03-14 01:42:23,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:23,956 INFO L85 PathProgramCache]: Analyzing trace with hash 24955475, now seen corresponding path program 1 times [2025-03-14 01:42:23,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:23,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123955477] [2025-03-14 01:42:23,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:23,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:23,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-14 01:42:23,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-14 01:42:23,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:23,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:24,315 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-14 01:42:24,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:24,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123955477] [2025-03-14 01:42:24,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123955477] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:24,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:24,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:42:24,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895056912] [2025-03-14 01:42:24,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:24,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:42:24,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:24,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:42:24,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:42:24,723 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 575 out of 622 [2025-03-14 01:42:24,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 598 places, 583 transitions, 1816 flow. Second operand has 6 states, 6 states have (on average 578.0) internal successors, (3468), 6 states have internal predecessors, (3468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:24,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:24,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 575 of 622 [2025-03-14 01:42:24,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:26,408 INFO L124 PetriNetUnfolderBase]: 407/10840 cut-off events. [2025-03-14 01:42:26,408 INFO L125 PetriNetUnfolderBase]: For 723/958 co-relation queries the response was YES. [2025-03-14 01:42:26,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13244 conditions, 10840 events. 407/10840 cut-off events. For 723/958 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 107000 event pairs, 18 based on Foata normal form. 35/10181 useless extension candidates. Maximal degree in co-relation 13127. Up to 294 conditions per place. [2025-03-14 01:42:26,520 INFO L140 encePairwiseOnDemand]: 611/622 looper letters, 37 selfloop transitions, 10 changer transitions 0/595 dead transitions. [2025-03-14 01:42:26,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 601 places, 595 transitions, 1944 flow [2025-03-14 01:42:26,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:42:26,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:42:26,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3498 transitions. [2025-03-14 01:42:26,522 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9372990353697749 [2025-03-14 01:42:26,522 INFO L175 Difference]: Start difference. First operand has 598 places, 583 transitions, 1816 flow. Second operand 6 states and 3498 transitions. [2025-03-14 01:42:26,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 601 places, 595 transitions, 1944 flow [2025-03-14 01:42:26,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 600 places, 595 transitions, 1940 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:42:26,533 INFO L231 Difference]: Finished difference. Result has 604 places, 585 transitions, 1860 flow [2025-03-14 01:42:26,534 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1808, PETRI_DIFFERENCE_MINUEND_PLACES=595, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=581, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=571, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1860, PETRI_PLACES=604, PETRI_TRANSITIONS=585} [2025-03-14 01:42:26,534 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, 27 predicate places. [2025-03-14 01:42:26,534 INFO L471 AbstractCegarLoop]: Abstraction has has 604 places, 585 transitions, 1860 flow [2025-03-14 01:42:26,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 578.0) internal successors, (3468), 6 states have internal predecessors, (3468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:26,535 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:26,535 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] [2025-03-14 01:42:26,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-14 01:42:26,535 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-03-14 01:42:26,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:26,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1787550188, now seen corresponding path program 1 times [2025-03-14 01:42:26,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:26,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759005858] [2025-03-14 01:42:26,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:26,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:26,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-14 01:42:26,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-14 01:42:26,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:26,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:26,575 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-14 01:42:26,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:26,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759005858] [2025-03-14 01:42:26,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759005858] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:26,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:26,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:26,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369169543] [2025-03-14 01:42:26,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:26,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:26,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:26,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:26,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:26,589 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 590 out of 622 [2025-03-14 01:42:26,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 604 places, 585 transitions, 1860 flow. Second operand has 3 states, 3 states have (on average 591.6666666666666) internal successors, (1775), 3 states have internal predecessors, (1775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:26,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:26,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 590 of 622 [2025-03-14 01:42:26,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:29,275 INFO L124 PetriNetUnfolderBase]: 863/16330 cut-off events. [2025-03-14 01:42:29,275 INFO L125 PetriNetUnfolderBase]: For 1342/1363 co-relation queries the response was YES. [2025-03-14 01:42:29,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20836 conditions, 16330 events. 863/16330 cut-off events. For 1342/1363 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 183204 event pairs, 169 based on Foata normal form. 0/15345 useless extension candidates. Maximal degree in co-relation 20717. Up to 946 conditions per place. [2025-03-14 01:42:29,431 INFO L140 encePairwiseOnDemand]: 614/622 looper letters, 19 selfloop transitions, 4 changer transitions 0/589 dead transitions. [2025-03-14 01:42:29,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 602 places, 589 transitions, 1918 flow [2025-03-14 01:42:29,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:29,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:29,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1797 transitions. [2025-03-14 01:42:29,433 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9630225080385852 [2025-03-14 01:42:29,433 INFO L175 Difference]: Start difference. First operand has 604 places, 585 transitions, 1860 flow. Second operand 3 states and 1797 transitions. [2025-03-14 01:42:29,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 602 places, 589 transitions, 1918 flow [2025-03-14 01:42:29,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 601 places, 589 transitions, 1914 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:42:29,453 INFO L231 Difference]: Finished difference. Result has 602 places, 585 transitions, 1876 flow [2025-03-14 01:42:29,454 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1848, PETRI_DIFFERENCE_MINUEND_PLACES=599, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=581, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=577, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1876, PETRI_PLACES=602, PETRI_TRANSITIONS=585} [2025-03-14 01:42:29,454 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, 25 predicate places. [2025-03-14 01:42:29,454 INFO L471 AbstractCegarLoop]: Abstraction has has 602 places, 585 transitions, 1876 flow [2025-03-14 01:42:29,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 591.6666666666666) internal successors, (1775), 3 states have internal predecessors, (1775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:29,455 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:29,455 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-14 01:42:29,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-14 01:42:29,455 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-03-14 01:42:29,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:29,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1293478803, now seen corresponding path program 1 times [2025-03-14 01:42:29,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:29,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117059906] [2025-03-14 01:42:29,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:29,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:29,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-14 01:42:29,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-14 01:42:29,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:29,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:30,019 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-14 01:42:30,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:30,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117059906] [2025-03-14 01:42:30,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117059906] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:30,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:30,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:42:30,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91544202] [2025-03-14 01:42:30,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:30,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:42:30,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:30,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:42:30,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:42:30,482 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 575 out of 622 [2025-03-14 01:42:30,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 602 places, 585 transitions, 1876 flow. Second operand has 6 states, 6 states have (on average 577.8333333333334) internal successors, (3467), 6 states have internal predecessors, (3467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:30,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:30,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 575 of 622 [2025-03-14 01:42:30,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:32,601 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1449] thread3EXIT-->L99-40: 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[][554], [Black: 646#(not |thread1Thread1of1ForFork0_#t~short1|), Black: 652#true, 840#(= |#race~C~0| 0), Black: 658#(not |thread2Thread1of1ForFork2_#t~short6|), 634#(= |#race~Cn~0| 0), Black: 781#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~Cn~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~Cn~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~Cn~0 0) (= ~i_BC~0 0)), Black: 787#(and (not |thread2Thread1of1ForFork2_#t~short6|) (<= ~Cn~0 0) (= ~i_BC~0 0)), Black: 661#true, Black: 770#(= ~i_BC~0 0), Black: 774#(and (<= ~Cn~0 0) (= ~i_BC~0 0)), Black: 779#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~Cn~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~Cn~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i_BC~0 0)), 768#true, 654#(= |#race~A~0| 0), Black: 678#(and (<= ~An~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~An~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~An~0 0) (= ~i_AB~0 0)), Black: 667#(= ~i_AB~0 0), Black: 801#(and (= ~i_AC~0 0) (<= ~Cn~0 0)), Black: 684#(and (<= ~An~0 0) (= ~i_AB~0 0) (not |thread1Thread1of1ForFork0_#t~short1|)), Black: 671#(and (<= ~An~0 0) (= ~i_AB~0 0)), Black: 676#(and (<= ~An~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~An~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (= ~i_AB~0 0)), Black: 814#(and (not |thread3Thread1of1ForFork1_#t~short11|) (= ~i_AC~0 0) (<= ~Cn~0 0)), Black: 818#true, Black: 822#(and (= (select (select |#race| ~A~0.base) (+ (* ~i_AB~0 4) 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) 0)), 616#(= |#race~An~0| 0), Black: 820#(= (select (select |#race| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) 0), Black: 821#(and (= (select (select |#race| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) 0)), Black: 830#(= (select (select |#race| ~B~0.base) (+ (* ~i_BC~0 4) ~B~0.offset)) 0), Black: 832#(and (= (select (select |#race| ~B~0.base) (+ (* ~i_BC~0 4) ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* ~i_BC~0 4) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* ~i_BC~0 4) ~B~0.offset 1)) 0)), 288#L99-40true, Black: 831#(and (= (select (select |#race| ~B~0.base) (+ (* ~i_BC~0 4) ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* ~i_BC~0 4) ~B~0.offset 1)) 0)), Black: 701#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~Bn~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~Bn~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i_BC~0 0)), Black: 709#(and (<= ~Bn~0 0) (not |thread2Thread1of1ForFork2_#t~short6|) (= ~i_BC~0 0)), 722#(= ~i_AC~0 0), Black: 692#(= ~i_BC~0 0), Black: 696#(and (<= ~Bn~0 0) (= ~i_BC~0 0)), 628#(= |#race~Bn~0| 0), Black: 838#true, Black: 703#(and (<= ~Bn~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~Bn~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~Bn~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i_BC~0 0)), 665#true, Black: 717#(not |thread3Thread1of1ForFork1_#t~short11|), 797#(= ~i_AC~0 0), 847#(and (= (select (select |#race| ~B~0.base) (+ (* ~i_AB~0 4) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* ~i_AB~0 4) 3 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 1)) 0)), Black: 739#(and (not |thread3Thread1of1ForFork1_#t~short11|) (= ~i_AC~0 0) (<= ~An~0 0)), Black: 726#(and (= ~i_AC~0 0) (<= ~An~0 0)), 745#true, 828#true, Black: 764#(and (<= ~Bn~0 0) (= ~i_AB~0 0) (not |thread1Thread1of1ForFork0_#t~short1|)), 663#(= |#race~B~0| 0), Black: 751#(and (<= ~Bn~0 0) (= ~i_AB~0 0)), Black: 747#(= ~i_AB~0 0)]) [2025-03-14 01:42:32,602 INFO L294 olderBase$Statistics]: this new event has 436 ancestors and is cut-off event [2025-03-14 01:42:32,602 INFO L297 olderBase$Statistics]: existing Event has 391 ancestors and is cut-off event [2025-03-14 01:42:32,602 INFO L297 olderBase$Statistics]: existing Event has 363 ancestors and is cut-off event [2025-03-14 01:42:32,602 INFO L297 olderBase$Statistics]: existing Event has 391 ancestors and is cut-off event [2025-03-14 01:42:32,692 INFO L124 PetriNetUnfolderBase]: 446/11911 cut-off events. [2025-03-14 01:42:32,693 INFO L125 PetriNetUnfolderBase]: For 859/1036 co-relation queries the response was YES. [2025-03-14 01:42:32,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15286 conditions, 11911 events. 446/11911 cut-off events. For 859/1036 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 119858 event pairs, 25 based on Foata normal form. 64/11418 useless extension candidates. Maximal degree in co-relation 15164. Up to 273 conditions per place. [2025-03-14 01:42:32,779 INFO L140 encePairwiseOnDemand]: 611/622 looper letters, 38 selfloop transitions, 10 changer transitions 0/598 dead transitions. [2025-03-14 01:42:32,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 605 places, 598 transitions, 2009 flow [2025-03-14 01:42:32,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:42:32,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:42:32,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3499 transitions. [2025-03-14 01:42:32,781 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.937566988210075 [2025-03-14 01:42:32,781 INFO L175 Difference]: Start difference. First operand has 602 places, 585 transitions, 1876 flow. Second operand 6 states and 3499 transitions. [2025-03-14 01:42:32,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 605 places, 598 transitions, 2009 flow [2025-03-14 01:42:32,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 605 places, 598 transitions, 2009 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:42:32,796 INFO L231 Difference]: Finished difference. Result has 609 places, 587 transitions, 1924 flow [2025-03-14 01:42:32,796 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1872, PETRI_DIFFERENCE_MINUEND_PLACES=600, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=583, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=573, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1924, PETRI_PLACES=609, PETRI_TRANSITIONS=587} [2025-03-14 01:42:32,797 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, 32 predicate places. [2025-03-14 01:42:32,797 INFO L471 AbstractCegarLoop]: Abstraction has has 609 places, 587 transitions, 1924 flow [2025-03-14 01:42:32,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 577.8333333333334) internal successors, (3467), 6 states have internal predecessors, (3467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:32,797 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:32,797 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-14 01:42:32,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-14 01:42:32,798 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread3Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-03-14 01:42:32,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:32,798 INFO L85 PathProgramCache]: Analyzing trace with hash -363540063, now seen corresponding path program 1 times [2025-03-14 01:42:32,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:32,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936011310] [2025-03-14 01:42:32,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:32,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:32,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-14 01:42:32,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-14 01:42:32,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:32,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:33,086 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-14 01:42:33,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:33,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936011310] [2025-03-14 01:42:33,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936011310] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:33,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:33,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:42:33,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102179481] [2025-03-14 01:42:33,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:33,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:42:33,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:33,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:42:33,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:42:33,520 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 575 out of 622 [2025-03-14 01:42:33,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 609 places, 587 transitions, 1924 flow. Second operand has 6 states, 6 states have (on average 578.1666666666666) internal successors, (3469), 6 states have internal predecessors, (3469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:33,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:33,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 575 of 622 [2025-03-14 01:42:33,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:36,645 INFO L124 PetriNetUnfolderBase]: 936/17156 cut-off events. [2025-03-14 01:42:36,646 INFO L125 PetriNetUnfolderBase]: For 1488/1543 co-relation queries the response was YES. [2025-03-14 01:42:36,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22790 conditions, 17156 events. 936/17156 cut-off events. For 1488/1543 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 198353 event pairs, 75 based on Foata normal form. 4/16363 useless extension candidates. Maximal degree in co-relation 22664. Up to 660 conditions per place. [2025-03-14 01:42:36,751 INFO L140 encePairwiseOnDemand]: 611/622 looper letters, 36 selfloop transitions, 10 changer transitions 0/598 dead transitions. [2025-03-14 01:42:36,751 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 612 places, 598 transitions, 2047 flow [2025-03-14 01:42:36,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:42:36,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:42:36,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3497 transitions. [2025-03-14 01:42:36,753 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9370310825294748 [2025-03-14 01:42:36,753 INFO L175 Difference]: Start difference. First operand has 609 places, 587 transitions, 1924 flow. Second operand 6 states and 3497 transitions. [2025-03-14 01:42:36,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 612 places, 598 transitions, 2047 flow [2025-03-14 01:42:36,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 611 places, 598 transitions, 2043 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:42:36,769 INFO L231 Difference]: Finished difference. Result has 615 places, 589 transitions, 1968 flow [2025-03-14 01:42:36,769 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1916, PETRI_DIFFERENCE_MINUEND_PLACES=606, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=585, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=575, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1968, PETRI_PLACES=615, PETRI_TRANSITIONS=589} [2025-03-14 01:42:36,770 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, 38 predicate places. [2025-03-14 01:42:36,770 INFO L471 AbstractCegarLoop]: Abstraction has has 615 places, 589 transitions, 1968 flow [2025-03-14 01:42:36,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 578.1666666666666) internal successors, (3469), 6 states have internal predecessors, (3469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:36,770 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:36,771 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-14 01:42:36,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-14 01:42:36,771 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-03-14 01:42:36,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:36,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1229023752, now seen corresponding path program 1 times [2025-03-14 01:42:36,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:36,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968111105] [2025-03-14 01:42:36,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:36,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:36,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-03-14 01:42:36,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-03-14 01:42:36,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:36,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:37,077 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-14 01:42:37,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:37,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968111105] [2025-03-14 01:42:37,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968111105] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:37,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:37,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:42:37,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239045654] [2025-03-14 01:42:37,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:37,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:42:37,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:37,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:42:37,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:42:37,567 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 575 out of 622 [2025-03-14 01:42:37,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 615 places, 589 transitions, 1968 flow. Second operand has 6 states, 6 states have (on average 578.0) internal successors, (3468), 6 states have internal predecessors, (3468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:37,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:37,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 575 of 622 [2025-03-14 01:42:37,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:41,099 INFO L124 PetriNetUnfolderBase]: 613/15272 cut-off events. [2025-03-14 01:42:41,100 INFO L125 PetriNetUnfolderBase]: For 1263/1644 co-relation queries the response was YES. [2025-03-14 01:42:41,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20836 conditions, 15272 events. 613/15272 cut-off events. For 1263/1644 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 164016 event pairs, 40 based on Foata normal form. 52/14784 useless extension candidates. Maximal degree in co-relation 20706. Up to 416 conditions per place. [2025-03-14 01:42:41,292 INFO L140 encePairwiseOnDemand]: 611/622 looper letters, 37 selfloop transitions, 10 changer transitions 0/601 dead transitions. [2025-03-14 01:42:41,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 618 places, 601 transitions, 2096 flow [2025-03-14 01:42:41,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:42:41,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:42:41,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3498 transitions. [2025-03-14 01:42:41,296 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9372990353697749 [2025-03-14 01:42:41,296 INFO L175 Difference]: Start difference. First operand has 615 places, 589 transitions, 1968 flow. Second operand 6 states and 3498 transitions. [2025-03-14 01:42:41,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 618 places, 601 transitions, 2096 flow [2025-03-14 01:42:41,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 617 places, 601 transitions, 2092 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:42:41,322 INFO L231 Difference]: Finished difference. Result has 621 places, 591 transitions, 2012 flow [2025-03-14 01:42:41,323 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1960, PETRI_DIFFERENCE_MINUEND_PLACES=612, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=587, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=577, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2012, PETRI_PLACES=621, PETRI_TRANSITIONS=591} [2025-03-14 01:42:41,323 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, 44 predicate places. [2025-03-14 01:42:41,323 INFO L471 AbstractCegarLoop]: Abstraction has has 621 places, 591 transitions, 2012 flow [2025-03-14 01:42:41,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 578.0) internal successors, (3468), 6 states have internal predecessors, (3468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:41,324 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:41,324 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:42:41,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-14 01:42:41,324 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-03-14 01:42:41,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:41,325 INFO L85 PathProgramCache]: Analyzing trace with hash 203485179, now seen corresponding path program 1 times [2025-03-14 01:42:41,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:41,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537882148] [2025-03-14 01:42:41,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:41,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:41,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-03-14 01:42:41,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-03-14 01:42:41,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:41,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:41,375 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-14 01:42:41,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:41,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537882148] [2025-03-14 01:42:41,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537882148] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:41,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:41,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:41,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588453314] [2025-03-14 01:42:41,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:41,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:41,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:41,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:41,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:41,413 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 589 out of 622 [2025-03-14 01:42:41,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 621 places, 591 transitions, 2012 flow. Second operand has 3 states, 3 states have (on average 592.0) internal successors, (1776), 3 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:41,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:41,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 589 of 622 [2025-03-14 01:42:41,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:44,090 INFO L124 PetriNetUnfolderBase]: 570/15087 cut-off events. [2025-03-14 01:42:44,090 INFO L125 PetriNetUnfolderBase]: For 1320/1733 co-relation queries the response was YES. [2025-03-14 01:42:44,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21315 conditions, 15087 events. 570/15087 cut-off events. For 1320/1733 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 158694 event pairs, 101 based on Foata normal form. 7/14601 useless extension candidates. Maximal degree in co-relation 21183. Up to 712 conditions per place. [2025-03-14 01:42:44,322 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 19 selfloop transitions, 2 changer transitions 0/592 dead transitions. [2025-03-14 01:42:44,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 622 places, 592 transitions, 2058 flow [2025-03-14 01:42:44,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:44,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:44,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1789 transitions. [2025-03-14 01:42:44,323 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9587352625937835 [2025-03-14 01:42:44,323 INFO L175 Difference]: Start difference. First operand has 621 places, 591 transitions, 2012 flow. Second operand 3 states and 1789 transitions. [2025-03-14 01:42:44,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 622 places, 592 transitions, 2058 flow [2025-03-14 01:42:44,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 621 places, 592 transitions, 2054 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:42:44,348 INFO L231 Difference]: Finished difference. Result has 621 places, 590 transitions, 2010 flow [2025-03-14 01:42:44,348 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=2006, PETRI_DIFFERENCE_MINUEND_PLACES=619, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=590, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=588, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2010, PETRI_PLACES=621, PETRI_TRANSITIONS=590} [2025-03-14 01:42:44,349 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, 44 predicate places. [2025-03-14 01:42:44,349 INFO L471 AbstractCegarLoop]: Abstraction has has 621 places, 590 transitions, 2010 flow [2025-03-14 01:42:44,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 592.0) internal successors, (1776), 3 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:44,349 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:44,349 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-14 01:42:44,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-14 01:42:44,349 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread3Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-03-14 01:42:44,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:44,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1268682150, now seen corresponding path program 1 times [2025-03-14 01:42:44,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:44,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929216483] [2025-03-14 01:42:44,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:44,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:44,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-03-14 01:42:44,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-03-14 01:42:44,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:44,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:44,671 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-14 01:42:44,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:44,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929216483] [2025-03-14 01:42:44,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929216483] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:44,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:44,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:42:44,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537697014] [2025-03-14 01:42:44,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:44,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:42:44,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:44,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:42:44,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:42:45,014 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 575 out of 622 [2025-03-14 01:42:45,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 621 places, 590 transitions, 2010 flow. Second operand has 6 states, 6 states have (on average 578.1666666666666) internal successors, (3469), 6 states have internal predecessors, (3469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:45,015 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:45,015 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 575 of 622 [2025-03-14 01:42:45,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:48,068 INFO L124 PetriNetUnfolderBase]: 939/17051 cut-off events. [2025-03-14 01:42:48,069 INFO L125 PetriNetUnfolderBase]: For 1874/1932 co-relation queries the response was YES. [2025-03-14 01:42:48,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24197 conditions, 17051 events. 939/17051 cut-off events. For 1874/1932 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 195264 event pairs, 61 based on Foata normal form. 76/16473 useless extension candidates. Maximal degree in co-relation 24062. Up to 606 conditions per place. [2025-03-14 01:42:48,345 INFO L140 encePairwiseOnDemand]: 611/622 looper letters, 29 selfloop transitions, 6 changer transitions 173/601 dead transitions. [2025-03-14 01:42:48,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 624 places, 601 transitions, 2131 flow [2025-03-14 01:42:48,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:42:48,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:42:48,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3496 transitions. [2025-03-14 01:42:48,347 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9367631296891747 [2025-03-14 01:42:48,347 INFO L175 Difference]: Start difference. First operand has 621 places, 590 transitions, 2010 flow. Second operand 6 states and 3496 transitions. [2025-03-14 01:42:48,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 624 places, 601 transitions, 2131 flow [2025-03-14 01:42:48,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 622 places, 601 transitions, 2127 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:42:48,374 INFO L231 Difference]: Finished difference. Result has 622 places, 420 transitions, 1411 flow [2025-03-14 01:42:48,375 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=2002, PETRI_DIFFERENCE_MINUEND_PLACES=617, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=588, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=582, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1411, PETRI_PLACES=622, PETRI_TRANSITIONS=420} [2025-03-14 01:42:48,375 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, 45 predicate places. [2025-03-14 01:42:48,375 INFO L471 AbstractCegarLoop]: Abstraction has has 622 places, 420 transitions, 1411 flow [2025-03-14 01:42:48,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 578.1666666666666) internal successors, (3469), 6 states have internal predecessors, (3469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:48,376 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:48,376 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:42:48,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-14 01:42:48,376 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-03-14 01:42:48,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:48,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1139464704, now seen corresponding path program 1 times [2025-03-14 01:42:48,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:48,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788741222] [2025-03-14 01:42:48,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:48,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:48,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-14 01:42:48,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-14 01:42:48,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:48,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:48,458 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-14 01:42:48,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:48,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788741222] [2025-03-14 01:42:48,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788741222] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:48,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:48,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:48,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774716123] [2025-03-14 01:42:48,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:48,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:48,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:48,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:48,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:48,491 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 589 out of 622 [2025-03-14 01:42:48,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 622 places, 420 transitions, 1411 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-14 01:42:48,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:48,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 589 of 622 [2025-03-14 01:42:48,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:49,438 INFO L124 PetriNetUnfolderBase]: 407/4947 cut-off events. [2025-03-14 01:42:49,438 INFO L125 PetriNetUnfolderBase]: For 1417/1429 co-relation queries the response was YES. [2025-03-14 01:42:49,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8375 conditions, 4947 events. 407/4947 cut-off events. For 1417/1429 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 38433 event pairs, 208 based on Foata normal form. 0/4694 useless extension candidates. Maximal degree in co-relation 8242. Up to 520 conditions per place. [2025-03-14 01:42:49,516 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 14 selfloop transitions, 2 changer transitions 10/421 dead transitions. [2025-03-14 01:42:49,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 498 places, 421 transitions, 1447 flow [2025-03-14 01:42:49,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:49,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:49,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1784 transitions. [2025-03-14 01:42:49,518 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9560557341907824 [2025-03-14 01:42:49,518 INFO L175 Difference]: Start difference. First operand has 622 places, 420 transitions, 1411 flow. Second operand 3 states and 1784 transitions. [2025-03-14 01:42:49,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 498 places, 421 transitions, 1447 flow [2025-03-14 01:42:49,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 442 places, 421 transitions, 1297 flow, removed 5 selfloop flow, removed 56 redundant places. [2025-03-14 01:42:49,532 INFO L231 Difference]: Finished difference. Result has 442 places, 409 transitions, 1191 flow [2025-03-14 01:42:49,532 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1259, PETRI_DIFFERENCE_MINUEND_PLACES=440, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=419, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=417, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1191, PETRI_PLACES=442, PETRI_TRANSITIONS=409} [2025-03-14 01:42:49,532 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -135 predicate places. [2025-03-14 01:42:49,532 INFO L471 AbstractCegarLoop]: Abstraction has has 442 places, 409 transitions, 1191 flow [2025-03-14 01:42:49,533 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-14 01:42:49,533 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:49,533 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-14 01:42:49,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-14 01:42:49,533 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-03-14 01:42:49,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:49,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1519793650, now seen corresponding path program 1 times [2025-03-14 01:42:49,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:49,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166405705] [2025-03-14 01:42:49,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:49,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:49,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-03-14 01:42:49,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-03-14 01:42:49,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:49,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:49,570 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-14 01:42:49,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:49,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166405705] [2025-03-14 01:42:49,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166405705] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:49,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:49,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:49,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355752544] [2025-03-14 01:42:49,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:49,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:49,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:49,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:49,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:49,602 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 589 out of 622 [2025-03-14 01:42:49,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 442 places, 409 transitions, 1191 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-14 01:42:49,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:49,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 589 of 622 [2025-03-14 01:42:49,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:50,214 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1450] thread2EXIT-->L97: 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[][268], [111#L71-21true, Black: 701#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~Bn~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~Bn~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i_BC~0 0)), Black: 709#(and (<= ~Bn~0 0) (not |thread2Thread1of1ForFork2_#t~short6|) (= ~i_BC~0 0)), Black: 692#(= ~i_BC~0 0), Black: 646#(not |thread1Thread1of1ForFork0_#t~short1|), Black: 696#(and (<= ~Bn~0 0) (= ~i_BC~0 0)), Black: 838#true, 628#(= |#race~Bn~0| 0), Black: 703#(and (<= ~Bn~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~Bn~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~Bn~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i_BC~0 0)), Black: 717#(not |thread3Thread1of1ForFork1_#t~short11|), Black: 652#true, 840#(= |#race~C~0| 0), Black: 658#(not |thread2Thread1of1ForFork2_#t~short6|), 634#(= |#race~Cn~0| 0), Black: 661#true, Black: 779#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~Cn~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~Cn~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i_BC~0 0)), 720#true, 768#true, 654#(= |#race~A~0| 0), 884#true, Black: 739#(and (not |thread3Thread1of1ForFork1_#t~short11|) (= ~i_AC~0 0) (<= ~An~0 0)), Black: 722#(= ~i_AC~0 0), Black: 726#(and (= ~i_AC~0 0) (<= ~An~0 0)), 747#(= ~i_AB~0 0), Black: 678#(and (<= ~An~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~An~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~An~0 0) (= ~i_AB~0 0)), Black: 684#(and (<= ~An~0 0) (= ~i_AB~0 0) (not |thread1Thread1of1ForFork0_#t~short1|)), Black: 671#(and (<= ~An~0 0) (= ~i_AB~0 0)), Black: 676#(and (<= ~An~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~An~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (= ~i_AB~0 0)), 526#L97true, 667#(= ~i_AB~0 0), 881#true, 616#(= |#race~An~0| 0), Black: 764#(and (<= ~Bn~0 0) (= ~i_AB~0 0) (not |thread1Thread1of1ForFork0_#t~short1|)), 663#(= |#race~B~0| 0), Black: 751#(and (<= ~Bn~0 0) (= ~i_AB~0 0))]) [2025-03-14 01:42:50,215 INFO L294 olderBase$Statistics]: this new event has 441 ancestors and is cut-off event [2025-03-14 01:42:50,215 INFO L297 olderBase$Statistics]: existing Event has 368 ancestors and is cut-off event [2025-03-14 01:42:50,215 INFO L297 olderBase$Statistics]: existing Event has 340 ancestors and is cut-off event [2025-03-14 01:42:50,215 INFO L297 olderBase$Statistics]: existing Event has 396 ancestors and is cut-off event [2025-03-14 01:42:50,224 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1413] L71-15-->L71-12: Formula: (= |v_#race~C~0_6| 0) InVars {} OutVars{#race~C~0=|v_#race~C~0_6|} AuxVars[] AssignedVars[#race~C~0][361], [583#L71-12true, Black: 701#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~Bn~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~Bn~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i_BC~0 0)), Black: 709#(and (<= ~Bn~0 0) (not |thread2Thread1of1ForFork2_#t~short6|) (= ~i_BC~0 0)), Black: 692#(= ~i_BC~0 0), Black: 646#(not |thread1Thread1of1ForFork0_#t~short1|), Black: 696#(and (<= ~Bn~0 0) (= ~i_BC~0 0)), Black: 838#true, 628#(= |#race~Bn~0| 0), Black: 703#(and (<= ~Bn~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~Bn~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~Bn~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i_BC~0 0)), Black: 717#(not |thread3Thread1of1ForFork1_#t~short11|), Black: 652#true, 840#(= |#race~C~0| 0), Black: 658#(not |thread2Thread1of1ForFork2_#t~short6|), 634#(= |#race~Cn~0| 0), Black: 661#true, 546#L60-12true, 244#L96true, Black: 779#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~Cn~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~Cn~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i_BC~0 0)), 720#true, 768#true, 884#true, 654#(= |#race~A~0| 0), Black: 739#(and (not |thread3Thread1of1ForFork1_#t~short11|) (= ~i_AC~0 0) (<= ~An~0 0)), Black: 722#(= ~i_AC~0 0), Black: 726#(and (= ~i_AC~0 0) (<= ~An~0 0)), 747#(= ~i_AB~0 0), Black: 678#(and (<= ~An~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~An~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~An~0 0) (= ~i_AB~0 0)), Black: 684#(and (<= ~An~0 0) (= ~i_AB~0 0) (not |thread1Thread1of1ForFork0_#t~short1|)), Black: 671#(and (<= ~An~0 0) (= ~i_AB~0 0)), Black: 676#(and (<= ~An~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~An~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (= ~i_AB~0 0)), 667#(= ~i_AB~0 0), 881#true, 616#(= |#race~An~0| 0), Black: 764#(and (<= ~Bn~0 0) (= ~i_AB~0 0) (not |thread1Thread1of1ForFork0_#t~short1|)), 663#(= |#race~B~0| 0), Black: 751#(and (<= ~Bn~0 0) (= ~i_AB~0 0))]) [2025-03-14 01:42:50,224 INFO L294 olderBase$Statistics]: this new event has 434 ancestors and is cut-off event [2025-03-14 01:42:50,224 INFO L297 olderBase$Statistics]: existing Event has 389 ancestors and is cut-off event [2025-03-14 01:42:50,224 INFO L297 olderBase$Statistics]: existing Event has 389 ancestors and is cut-off event [2025-03-14 01:42:50,224 INFO L297 olderBase$Statistics]: existing Event has 361 ancestors and is cut-off event [2025-03-14 01:42:50,240 INFO L124 PetriNetUnfolderBase]: 489/4087 cut-off events. [2025-03-14 01:42:50,240 INFO L125 PetriNetUnfolderBase]: For 712/740 co-relation queries the response was YES. [2025-03-14 01:42:50,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5913 conditions, 4087 events. 489/4087 cut-off events. For 712/740 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 32254 event pairs, 216 based on Foata normal form. 0/3853 useless extension candidates. Maximal degree in co-relation 5813. Up to 517 conditions per place. [2025-03-14 01:42:50,295 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 0 selfloop transitions, 0 changer transitions 410/410 dead transitions. [2025-03-14 01:42:50,295 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 438 places, 410 transitions, 1227 flow [2025-03-14 01:42:50,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:50,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:50,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1784 transitions. [2025-03-14 01:42:50,296 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9560557341907824 [2025-03-14 01:42:50,296 INFO L175 Difference]: Start difference. First operand has 442 places, 409 transitions, 1191 flow. Second operand 3 states and 1784 transitions. [2025-03-14 01:42:50,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 438 places, 410 transitions, 1227 flow [2025-03-14 01:42:50,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 426 places, 410 transitions, 1194 flow, removed 5 selfloop flow, removed 12 redundant places. [2025-03-14 01:42:50,302 INFO L231 Difference]: Finished difference. Result has 426 places, 0 transitions, 0 flow [2025-03-14 01:42:50,302 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1156, PETRI_DIFFERENCE_MINUEND_PLACES=424, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=408, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=408, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=426, PETRI_TRANSITIONS=0} [2025-03-14 01:42:50,303 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -151 predicate places. [2025-03-14 01:42:50,303 INFO L471 AbstractCegarLoop]: Abstraction has has 426 places, 0 transitions, 0 flow [2025-03-14 01:42:50,303 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-14 01:42:50,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (116 of 117 remaining) [2025-03-14 01:42:50,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (115 of 117 remaining) [2025-03-14 01:42:50,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (114 of 117 remaining) [2025-03-14 01:42:50,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (113 of 117 remaining) [2025-03-14 01:42:50,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (112 of 117 remaining) [2025-03-14 01:42:50,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (111 of 117 remaining) [2025-03-14 01:42:50,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (110 of 117 remaining) [2025-03-14 01:42:50,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (109 of 117 remaining) [2025-03-14 01:42:50,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (108 of 117 remaining) [2025-03-14 01:42:50,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (107 of 117 remaining) [2025-03-14 01:42:50,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (106 of 117 remaining) [2025-03-14 01:42:50,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (105 of 117 remaining) [2025-03-14 01:42:50,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (104 of 117 remaining) [2025-03-14 01:42:50,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (103 of 117 remaining) [2025-03-14 01:42:50,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (102 of 117 remaining) [2025-03-14 01:42:50,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (101 of 117 remaining) [2025-03-14 01:42:50,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (100 of 117 remaining) [2025-03-14 01:42:50,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (99 of 117 remaining) [2025-03-14 01:42:50,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (98 of 117 remaining) [2025-03-14 01:42:50,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (97 of 117 remaining) [2025-03-14 01:42:50,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (96 of 117 remaining) [2025-03-14 01:42:50,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (95 of 117 remaining) [2025-03-14 01:42:50,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (94 of 117 remaining) [2025-03-14 01:42:50,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (93 of 117 remaining) [2025-03-14 01:42:50,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (92 of 117 remaining) [2025-03-14 01:42:50,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (91 of 117 remaining) [2025-03-14 01:42:50,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (90 of 117 remaining) [2025-03-14 01:42:50,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (89 of 117 remaining) [2025-03-14 01:42:50,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (88 of 117 remaining) [2025-03-14 01:42:50,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (87 of 117 remaining) [2025-03-14 01:42:50,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (86 of 117 remaining) [2025-03-14 01:42:50,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (85 of 117 remaining) [2025-03-14 01:42:50,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (84 of 117 remaining) [2025-03-14 01:42:50,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (83 of 117 remaining) [2025-03-14 01:42:50,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (82 of 117 remaining) [2025-03-14 01:42:50,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (81 of 117 remaining) [2025-03-14 01:42:50,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41ASSERT_VIOLATIONDATA_RACE (80 of 117 remaining) [2025-03-14 01:42:50,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONDATA_RACE (79 of 117 remaining) [2025-03-14 01:42:50,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39ASSERT_VIOLATIONDATA_RACE (78 of 117 remaining) [2025-03-14 01:42:50,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONDATA_RACE (77 of 117 remaining) [2025-03-14 01:42:50,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONDATA_RACE (76 of 117 remaining) [2025-03-14 01:42:50,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONDATA_RACE (75 of 117 remaining) [2025-03-14 01:42:50,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONDATA_RACE (74 of 117 remaining) [2025-03-14 01:42:50,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONDATA_RACE (73 of 117 remaining) [2025-03-14 01:42:50,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONDATA_RACE (72 of 117 remaining) [2025-03-14 01:42:50,309 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONDATA_RACE (71 of 117 remaining) [2025-03-14 01:42:50,309 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONDATA_RACE (70 of 117 remaining) [2025-03-14 01:42:50,309 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONDATA_RACE (69 of 117 remaining) [2025-03-14 01:42:50,309 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE (68 of 117 remaining) [2025-03-14 01:42:50,309 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONDATA_RACE (67 of 117 remaining) [2025-03-14 01:42:50,309 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE (66 of 117 remaining) [2025-03-14 01:42:50,309 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE (65 of 117 remaining) [2025-03-14 01:42:50,309 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE (64 of 117 remaining) [2025-03-14 01:42:50,309 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (63 of 117 remaining) [2025-03-14 01:42:50,309 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (62 of 117 remaining) [2025-03-14 01:42:50,309 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (61 of 117 remaining) [2025-03-14 01:42:50,309 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (60 of 117 remaining) [2025-03-14 01:42:50,309 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (59 of 117 remaining) [2025-03-14 01:42:50,309 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (58 of 117 remaining) [2025-03-14 01:42:50,309 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (57 of 117 remaining) [2025-03-14 01:42:50,309 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (56 of 117 remaining) [2025-03-14 01:42:50,309 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (55 of 117 remaining) [2025-03-14 01:42:50,310 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (54 of 117 remaining) [2025-03-14 01:42:50,310 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (53 of 117 remaining) [2025-03-14 01:42:50,310 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (52 of 117 remaining) [2025-03-14 01:42:50,310 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (51 of 117 remaining) [2025-03-14 01:42:50,310 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (50 of 117 remaining) [2025-03-14 01:42:50,310 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (49 of 117 remaining) [2025-03-14 01:42:50,310 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (48 of 117 remaining) [2025-03-14 01:42:50,310 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (47 of 117 remaining) [2025-03-14 01:42:50,310 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (46 of 117 remaining) [2025-03-14 01:42:50,310 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (45 of 117 remaining) [2025-03-14 01:42:50,310 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (44 of 117 remaining) [2025-03-14 01:42:50,310 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (43 of 117 remaining) [2025-03-14 01:42:50,310 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (42 of 117 remaining) [2025-03-14 01:42:50,310 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (41 of 117 remaining) [2025-03-14 01:42:50,310 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (40 of 117 remaining) [2025-03-14 01:42:50,310 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (39 of 117 remaining) [2025-03-14 01:42:50,310 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (38 of 117 remaining) [2025-03-14 01:42:50,311 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 117 remaining) [2025-03-14 01:42:50,311 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 117 remaining) [2025-03-14 01:42:50,311 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (35 of 117 remaining) [2025-03-14 01:42:50,311 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (34 of 117 remaining) [2025-03-14 01:42:50,311 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (33 of 117 remaining) [2025-03-14 01:42:50,311 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (32 of 117 remaining) [2025-03-14 01:42:50,311 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (31 of 117 remaining) [2025-03-14 01:42:50,311 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (30 of 117 remaining) [2025-03-14 01:42:50,311 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (29 of 117 remaining) [2025-03-14 01:42:50,311 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (28 of 117 remaining) [2025-03-14 01:42:50,311 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (27 of 117 remaining) [2025-03-14 01:42:50,311 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (26 of 117 remaining) [2025-03-14 01:42:50,311 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (25 of 117 remaining) [2025-03-14 01:42:50,311 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (24 of 117 remaining) [2025-03-14 01:42:50,311 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (23 of 117 remaining) [2025-03-14 01:42:50,311 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (22 of 117 remaining) [2025-03-14 01:42:50,311 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (21 of 117 remaining) [2025-03-14 01:42:50,311 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (20 of 117 remaining) [2025-03-14 01:42:50,312 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (19 of 117 remaining) [2025-03-14 01:42:50,312 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (18 of 117 remaining) [2025-03-14 01:42:50,312 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (17 of 117 remaining) [2025-03-14 01:42:50,312 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (16 of 117 remaining) [2025-03-14 01:42:50,312 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (15 of 117 remaining) [2025-03-14 01:42:50,312 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (14 of 117 remaining) [2025-03-14 01:42:50,312 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (13 of 117 remaining) [2025-03-14 01:42:50,312 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (12 of 117 remaining) [2025-03-14 01:42:50,312 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (11 of 117 remaining) [2025-03-14 01:42:50,312 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (10 of 117 remaining) [2025-03-14 01:42:50,312 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (9 of 117 remaining) [2025-03-14 01:42:50,312 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (8 of 117 remaining) [2025-03-14 01:42:50,312 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (7 of 117 remaining) [2025-03-14 01:42:50,312 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (6 of 117 remaining) [2025-03-14 01:42:50,312 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (5 of 117 remaining) [2025-03-14 01:42:50,312 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (4 of 117 remaining) [2025-03-14 01:42:50,312 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (3 of 117 remaining) [2025-03-14 01:42:50,312 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (2 of 117 remaining) [2025-03-14 01:42:50,312 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (1 of 117 remaining) [2025-03-14 01:42:50,312 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (0 of 117 remaining) [2025-03-14 01:42:50,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-14 01:42:50,312 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] [2025-03-14 01:42:50,317 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-14 01:42:50,317 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-14 01:42:50,321 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.03 01:42:50 BasicIcfg [2025-03-14 01:42:50,322 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-14 01:42:50,322 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-14 01:42:50,322 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-14 01:42:50,322 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-14 01:42:50,323 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:42:01" (3/4) ... [2025-03-14 01:42:50,324 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-14 01:42:50,326 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-14 01:42:50,327 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-14 01:42:50,327 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-03-14 01:42:50,336 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 28 nodes and edges [2025-03-14 01:42:50,336 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-14 01:42:50,337 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-14 01:42:50,337 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-14 01:42:50,414 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-14 01:42:50,415 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-14 01:42:50,415 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-14 01:42:50,416 INFO L158 Benchmark]: Toolchain (without parser) took 49668.11ms. Allocated memory was 142.6MB in the beginning and 2.8GB in the end (delta: 2.7GB). Free memory was 112.5MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2025-03-14 01:42:50,416 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 201.3MB. Free memory is still 124.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 01:42:50,417 INFO L158 Benchmark]: CACSL2BoogieTranslator took 281.91ms. Allocated memory is still 142.6MB. Free memory was 112.5MB in the beginning and 98.8MB in the end (delta: 13.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-14 01:42:50,417 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.00ms. Allocated memory is still 142.6MB. Free memory was 98.8MB in the beginning and 95.9MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-14 01:42:50,417 INFO L158 Benchmark]: Boogie Preprocessor took 40.90ms. Allocated memory is still 142.6MB. Free memory was 95.9MB in the beginning and 93.0MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 01:42:50,418 INFO L158 Benchmark]: IcfgBuilder took 832.58ms. Allocated memory is still 142.6MB. Free memory was 93.0MB in the beginning and 47.5MB in the end (delta: 45.4MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-03-14 01:42:50,418 INFO L158 Benchmark]: TraceAbstraction took 48372.12ms. Allocated memory was 142.6MB in the beginning and 2.8GB in the end (delta: 2.7GB). Free memory was 47.0MB in the beginning and 1.4GB in the end (delta: -1.4GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2025-03-14 01:42:50,419 INFO L158 Benchmark]: Witness Printer took 92.39ms. Allocated memory is still 2.8GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-14 01:42:50,420 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.31ms. Allocated memory is still 201.3MB. Free memory is still 124.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 281.91ms. Allocated memory is still 142.6MB. Free memory was 112.5MB in the beginning and 98.8MB in the end (delta: 13.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.00ms. Allocated memory is still 142.6MB. Free memory was 98.8MB in the beginning and 95.9MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.90ms. Allocated memory is still 142.6MB. Free memory was 95.9MB in the beginning and 93.0MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 832.58ms. Allocated memory is still 142.6MB. Free memory was 93.0MB in the beginning and 47.5MB in the end (delta: 45.4MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * TraceAbstraction took 48372.12ms. Allocated memory was 142.6MB in the beginning and 2.8GB in the end (delta: 2.7GB). Free memory was 47.0MB in the beginning and 1.4GB in the end (delta: -1.4GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. * Witness Printer took 92.39ms. Allocated memory is still 2.8GB. Free memory was 1.4GB in the beginning and 1.4GB 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: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 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: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 88]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 88]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: 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, 788 locations, 117 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: 48.2s, OverallIterations: 34, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 42.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7105 SdHoareTripleChecker+Valid, 7.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4471 mSDsluCounter, 4508 SdHoareTripleChecker+Invalid, 6.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3576 mSDsCounter, 1378 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12231 IncrementalHoareTripleChecker+Invalid, 13609 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1378 mSolverCounterUnsat, 932 mSDtfsCounter, 12231 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 173 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2012occurred in iteration=30, InterpolantAutomatonStates: 179, 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.4s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 5389 NumberOfCodeBlocks, 5389 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 5355 ConstructedInterpolants, 0 QuantifiedInterpolants, 10193 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 PerfectInterpolantSequences, 23/23 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 78 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-14 01:42:50,439 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE