./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-match-subst.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-match-subst.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2c931aeff3bd4feb775048ea000220a43a3b08d8a3667f51cb57a0babc9201aa --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 22:04:51,448 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 22:04:51,498 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-08 22:04:51,506 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 22:04:51,509 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 22:04:51,524 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 22:04:51,525 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 22:04:51,525 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 22:04:51,525 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 22:04:51,525 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 22:04:51,526 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 22:04:51,526 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 22:04:51,526 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 22:04:51,527 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 22:04:51,527 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 22:04:51,527 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 22:04:51,527 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 22:04:51,527 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 22:04:51,527 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 22:04:51,527 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 22:04:51,527 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 22:04:51,527 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 22:04:51,527 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-08 22:04:51,527 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 22:04:51,527 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 22:04:51,527 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 22:04:51,527 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 22:04:51,527 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 22:04:51,527 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 22:04:51,527 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 22:04:51,528 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 22:04:51,528 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:04:51,528 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 22:04:51,528 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 22:04:51,528 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 22:04:51,528 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 22:04:51,528 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 22:04:51,528 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 22:04:51,528 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 22:04:51,528 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 22:04:51,528 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 22:04:51,528 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 22:04:51,528 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 -> 2c931aeff3bd4feb775048ea000220a43a3b08d8a3667f51cb57a0babc9201aa [2025-03-08 22:04:51,761 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 22:04:51,767 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 22:04:51,768 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 22:04:51,769 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 22:04:51,769 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 22:04:51,770 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-match-subst.wvr.c [2025-03-08 22:04:52,880 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ef3a6b5d/ab4ac6c58c5e4e6eafea3191cbbafb7b/FLAG3a189a91f [2025-03-08 22:04:53,101 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 22:04:53,103 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-match-subst.wvr.c [2025-03-08 22:04:53,112 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ef3a6b5d/ab4ac6c58c5e4e6eafea3191cbbafb7b/FLAG3a189a91f [2025-03-08 22:04:53,451 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ef3a6b5d/ab4ac6c58c5e4e6eafea3191cbbafb7b [2025-03-08 22:04:53,453 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 22:04:53,454 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 22:04:53,455 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 22:04:53,455 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 22:04:53,458 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 22:04:53,459 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:04:53" (1/1) ... [2025-03-08 22:04:53,459 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16db9792 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:53, skipping insertion in model container [2025-03-08 22:04:53,459 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:04:53" (1/1) ... [2025-03-08 22:04:53,469 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 22:04:53,598 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:04:53,610 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 22:04:53,638 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:04:53,652 INFO L204 MainTranslator]: Completed translation [2025-03-08 22:04:53,652 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:53 WrapperNode [2025-03-08 22:04:53,654 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 22:04:53,654 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 22:04:53,654 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 22:04:53,655 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 22:04:53,659 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:53" (1/1) ... [2025-03-08 22:04:53,669 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:53" (1/1) ... [2025-03-08 22:04:53,693 INFO L138 Inliner]: procedures = 22, calls = 20, calls flagged for inlining = 13, calls inlined = 23, statements flattened = 323 [2025-03-08 22:04:53,693 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 22:04:53,694 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 22:04:53,694 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 22:04:53,694 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 22:04:53,699 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:53" (1/1) ... [2025-03-08 22:04:53,699 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:53" (1/1) ... [2025-03-08 22:04:53,705 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:53" (1/1) ... [2025-03-08 22:04:53,705 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:53" (1/1) ... [2025-03-08 22:04:53,710 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:53" (1/1) ... [2025-03-08 22:04:53,711 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:53" (1/1) ... [2025-03-08 22:04:53,712 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:53" (1/1) ... [2025-03-08 22:04:53,712 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:53" (1/1) ... [2025-03-08 22:04:53,714 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 22:04:53,715 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 22:04:53,715 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 22:04:53,715 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 22:04:53,715 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:53" (1/1) ... [2025-03-08 22:04:53,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:04:53,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:04:53,738 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-08 22:04:53,742 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-08 22:04:53,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 22:04:53,758 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-08 22:04:53,758 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-08 22:04:53,758 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-08 22:04:53,758 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-08 22:04:53,758 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-08 22:04:53,758 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-08 22:04:53,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-08 22:04:53,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 22:04:53,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 22:04:53,759 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-08 22:04:53,831 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 22:04:53,832 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 22:04:54,187 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 22:04:54,187 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 22:04:54,214 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 22:04:54,214 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 22:04:54,214 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:04:54 BoogieIcfgContainer [2025-03-08 22:04:54,215 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 22:04:54,217 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 22:04:54,217 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 22:04:54,220 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 22:04:54,220 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:04:53" (1/3) ... [2025-03-08 22:04:54,221 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@210363d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:04:54, skipping insertion in model container [2025-03-08 22:04:54,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:53" (2/3) ... [2025-03-08 22:04:54,221 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@210363d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:04:54, skipping insertion in model container [2025-03-08 22:04:54,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:04:54" (3/3) ... [2025-03-08 22:04:54,222 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-match-subst.wvr.c [2025-03-08 22:04:54,232 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 22:04:54,234 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-match-subst.wvr.c that has 4 procedures, 437 locations, 1 initial locations, 0 loop locations, and 41 error locations. [2025-03-08 22:04:54,234 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 22:04:54,327 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-08 22:04:54,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 446 places, 454 transitions, 929 flow [2025-03-08 22:04:54,512 INFO L124 PetriNetUnfolderBase]: 18/451 cut-off events. [2025-03-08 22:04:54,514 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-08 22:04:54,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 464 conditions, 451 events. 18/451 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 817 event pairs, 0 based on Foata normal form. 0/392 useless extension candidates. Maximal degree in co-relation 311. Up to 2 conditions per place. [2025-03-08 22:04:54,529 INFO L82 GeneralOperation]: Start removeDead. Operand has 446 places, 454 transitions, 929 flow [2025-03-08 22:04:54,536 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 425 places, 431 transitions, 880 flow [2025-03-08 22:04:54,545 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:04:54,557 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;@2a539811, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:04:54,557 INFO L334 AbstractCegarLoop]: Starting to check reachability of 71 error locations. [2025-03-08 22:04:54,566 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 22:04:54,566 INFO L124 PetriNetUnfolderBase]: 0/29 cut-off events. [2025-03-08 22:04:54,566 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 22:04:54,567 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:54,567 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] [2025-03-08 22:04:54,568 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-08 22:04:54,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:54,573 INFO L85 PathProgramCache]: Analyzing trace with hash -656263710, now seen corresponding path program 1 times [2025-03-08 22:04:54,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:54,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254863387] [2025-03-08 22:04:54,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:54,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:54,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 22:04:54,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 22:04:54,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:54,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:54,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:04:54,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:54,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254863387] [2025-03-08 22:04:54,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254863387] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:54,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:54,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:04:54,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342190455] [2025-03-08 22:04:54,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:54,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:54,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:54,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:54,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:54,779 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 422 out of 454 [2025-03-08 22:04:54,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 425 places, 431 transitions, 880 flow. Second operand has 3 states, 3 states have (on average 423.3333333333333) internal successors, (1270), 3 states have internal predecessors, (1270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:04:54,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:54,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 422 of 454 [2025-03-08 22:04:54,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:55,054 INFO L124 PetriNetUnfolderBase]: 33/1375 cut-off events. [2025-03-08 22:04:55,054 INFO L125 PetriNetUnfolderBase]: For 28/30 co-relation queries the response was YES. [2025-03-08 22:04:55,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1462 conditions, 1375 events. 33/1375 cut-off events. For 28/30 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 6189 event pairs, 20 based on Foata normal form. 76/1250 useless extension candidates. Maximal degree in co-relation 1300. Up to 50 conditions per place. [2025-03-08 22:04:55,069 INFO L140 encePairwiseOnDemand]: 438/454 looper letters, 13 selfloop transitions, 2 changer transitions 1/417 dead transitions. [2025-03-08 22:04:55,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 426 places, 417 transitions, 882 flow [2025-03-08 22:04:55,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:55,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:55,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1295 transitions. [2025-03-08 22:04:55,084 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9508076358296622 [2025-03-08 22:04:55,088 INFO L175 Difference]: Start difference. First operand has 425 places, 431 transitions, 880 flow. Second operand 3 states and 1295 transitions. [2025-03-08 22:04:55,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 426 places, 417 transitions, 882 flow [2025-03-08 22:04:55,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 420 places, 417 transitions, 870 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-08 22:04:55,102 INFO L231 Difference]: Finished difference. Result has 420 places, 416 transitions, 842 flow [2025-03-08 22:04:55,104 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=840, PETRI_DIFFERENCE_MINUEND_PLACES=418, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=417, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=415, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=842, PETRI_PLACES=420, PETRI_TRANSITIONS=416} [2025-03-08 22:04:55,109 INFO L279 CegarLoopForPetriNet]: 425 programPoint places, -5 predicate places. [2025-03-08 22:04:55,109 INFO L471 AbstractCegarLoop]: Abstraction has has 420 places, 416 transitions, 842 flow [2025-03-08 22:04:55,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 423.3333333333333) internal successors, (1270), 3 states have internal predecessors, (1270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:04:55,110 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:55,110 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] [2025-03-08 22:04:55,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 22:04:55,110 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-08 22:04:55,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:55,111 INFO L85 PathProgramCache]: Analyzing trace with hash 948622931, now seen corresponding path program 1 times [2025-03-08 22:04:55,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:55,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134295320] [2025-03-08 22:04:55,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:55,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:55,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-08 22:04:55,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 22:04:55,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:55,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:55,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:04:55,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:55,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134295320] [2025-03-08 22:04:55,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134295320] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:55,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:55,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:04:55,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140754239] [2025-03-08 22:04:55,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:55,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:55,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:55,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:55,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:55,184 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 424 out of 454 [2025-03-08 22:04:55,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 420 places, 416 transitions, 842 flow. Second operand has 3 states, 3 states have (on average 425.3333333333333) internal successors, (1276), 3 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:04:55,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:55,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 424 of 454 [2025-03-08 22:04:55,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:55,311 INFO L124 PetriNetUnfolderBase]: 16/956 cut-off events. [2025-03-08 22:04:55,311 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-08 22:04:55,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 994 conditions, 956 events. 16/956 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 4050 event pairs, 7 based on Foata normal form. 0/814 useless extension candidates. Maximal degree in co-relation 957. Up to 25 conditions per place. [2025-03-08 22:04:55,322 INFO L140 encePairwiseOnDemand]: 451/454 looper letters, 11 selfloop transitions, 2 changer transitions 0/415 dead transitions. [2025-03-08 22:04:55,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 420 places, 415 transitions, 866 flow [2025-03-08 22:04:55,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:55,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:55,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1286 transitions. [2025-03-08 22:04:55,324 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9441997063142438 [2025-03-08 22:04:55,324 INFO L175 Difference]: Start difference. First operand has 420 places, 416 transitions, 842 flow. Second operand 3 states and 1286 transitions. [2025-03-08 22:04:55,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 420 places, 415 transitions, 866 flow [2025-03-08 22:04:55,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 418 places, 415 transitions, 862 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:04:55,329 INFO L231 Difference]: Finished difference. Result has 418 places, 415 transitions, 840 flow [2025-03-08 22:04:55,330 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=836, PETRI_DIFFERENCE_MINUEND_PLACES=416, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=415, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=413, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=840, PETRI_PLACES=418, PETRI_TRANSITIONS=415} [2025-03-08 22:04:55,330 INFO L279 CegarLoopForPetriNet]: 425 programPoint places, -7 predicate places. [2025-03-08 22:04:55,330 INFO L471 AbstractCegarLoop]: Abstraction has has 418 places, 415 transitions, 840 flow [2025-03-08 22:04:55,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 425.3333333333333) internal successors, (1276), 3 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:04:55,331 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:55,331 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:04:55,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 22:04:55,331 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-08 22:04:55,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:55,332 INFO L85 PathProgramCache]: Analyzing trace with hash 42244856, now seen corresponding path program 1 times [2025-03-08 22:04:55,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:55,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303230621] [2025-03-08 22:04:55,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:55,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:55,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-08 22:04:55,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-08 22:04:55,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:55,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:55,373 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-08 22:04:55,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:55,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303230621] [2025-03-08 22:04:55,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303230621] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:55,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:55,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:04:55,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855407090] [2025-03-08 22:04:55,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:55,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:55,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:55,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:55,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:55,390 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 424 out of 454 [2025-03-08 22:04:55,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 418 places, 415 transitions, 840 flow. Second operand has 3 states, 3 states have (on average 425.3333333333333) internal successors, (1276), 3 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:04:55,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:55,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 424 of 454 [2025-03-08 22:04:55,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:55,498 INFO L124 PetriNetUnfolderBase]: 16/937 cut-off events. [2025-03-08 22:04:55,498 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-08 22:04:55,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 975 conditions, 937 events. 16/937 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 3958 event pairs, 7 based on Foata normal form. 0/803 useless extension candidates. Maximal degree in co-relation 930. Up to 25 conditions per place. [2025-03-08 22:04:55,506 INFO L140 encePairwiseOnDemand]: 451/454 looper letters, 11 selfloop transitions, 2 changer transitions 0/414 dead transitions. [2025-03-08 22:04:55,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 419 places, 414 transitions, 864 flow [2025-03-08 22:04:55,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:55,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:55,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1286 transitions. [2025-03-08 22:04:55,509 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9441997063142438 [2025-03-08 22:04:55,509 INFO L175 Difference]: Start difference. First operand has 418 places, 415 transitions, 840 flow. Second operand 3 states and 1286 transitions. [2025-03-08 22:04:55,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 419 places, 414 transitions, 864 flow [2025-03-08 22:04:55,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 417 places, 414 transitions, 860 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:04:55,513 INFO L231 Difference]: Finished difference. Result has 417 places, 414 transitions, 838 flow [2025-03-08 22:04:55,514 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=834, PETRI_DIFFERENCE_MINUEND_PLACES=415, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=414, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=412, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=838, PETRI_PLACES=417, PETRI_TRANSITIONS=414} [2025-03-08 22:04:55,514 INFO L279 CegarLoopForPetriNet]: 425 programPoint places, -8 predicate places. [2025-03-08 22:04:55,514 INFO L471 AbstractCegarLoop]: Abstraction has has 417 places, 414 transitions, 838 flow [2025-03-08 22:04:55,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 425.3333333333333) internal successors, (1276), 3 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:04:55,515 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:55,515 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] [2025-03-08 22:04:55,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 22:04:55,515 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-08 22:04:55,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:55,516 INFO L85 PathProgramCache]: Analyzing trace with hash -946362878, now seen corresponding path program 1 times [2025-03-08 22:04:55,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:55,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624736879] [2025-03-08 22:04:55,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:55,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:55,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-08 22:04:55,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-08 22:04:55,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:55,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:55,563 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-08 22:04:55,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:55,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624736879] [2025-03-08 22:04:55,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624736879] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:55,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:55,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:04:55,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859242112] [2025-03-08 22:04:55,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:55,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:55,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:55,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:55,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:55,589 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 422 out of 454 [2025-03-08 22:04:55,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 417 places, 414 transitions, 838 flow. Second operand has 3 states, 3 states have (on average 423.3333333333333) internal successors, (1270), 3 states have internal predecessors, (1270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:04:55,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:55,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 422 of 454 [2025-03-08 22:04:55,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:55,690 INFO L124 PetriNetUnfolderBase]: 19/807 cut-off events. [2025-03-08 22:04:55,690 INFO L125 PetriNetUnfolderBase]: For 4/8 co-relation queries the response was YES. [2025-03-08 22:04:55,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 858 conditions, 807 events. 19/807 cut-off events. For 4/8 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2838 event pairs, 12 based on Foata normal form. 0/697 useless extension candidates. Maximal degree in co-relation 805. Up to 38 conditions per place. [2025-03-08 22:04:55,699 INFO L140 encePairwiseOnDemand]: 451/454 looper letters, 13 selfloop transitions, 2 changer transitions 0/413 dead transitions. [2025-03-08 22:04:55,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 418 places, 413 transitions, 866 flow [2025-03-08 22:04:55,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:55,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:55,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1282 transitions. [2025-03-08 22:04:55,702 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9412628487518355 [2025-03-08 22:04:55,702 INFO L175 Difference]: Start difference. First operand has 417 places, 414 transitions, 838 flow. Second operand 3 states and 1282 transitions. [2025-03-08 22:04:55,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 418 places, 413 transitions, 866 flow [2025-03-08 22:04:55,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 416 places, 413 transitions, 862 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:04:55,707 INFO L231 Difference]: Finished difference. Result has 416 places, 413 transitions, 836 flow [2025-03-08 22:04:55,707 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=832, PETRI_DIFFERENCE_MINUEND_PLACES=414, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=413, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=411, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=836, PETRI_PLACES=416, PETRI_TRANSITIONS=413} [2025-03-08 22:04:55,708 INFO L279 CegarLoopForPetriNet]: 425 programPoint places, -9 predicate places. [2025-03-08 22:04:55,709 INFO L471 AbstractCegarLoop]: Abstraction has has 416 places, 413 transitions, 836 flow [2025-03-08 22:04:55,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 423.3333333333333) internal successors, (1270), 3 states have internal predecessors, (1270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:04:55,710 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:55,710 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] [2025-03-08 22:04:55,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 22:04:55,710 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-08 22:04:55,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:55,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1446485017, now seen corresponding path program 1 times [2025-03-08 22:04:55,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:55,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222475049] [2025-03-08 22:04:55,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:55,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:55,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-08 22:04:55,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-08 22:04:55,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:55,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:55,761 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-08 22:04:55,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:55,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222475049] [2025-03-08 22:04:55,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222475049] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:55,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:55,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:04:55,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354947125] [2025-03-08 22:04:55,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:55,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:55,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:55,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:55,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:55,778 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 424 out of 454 [2025-03-08 22:04:55,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 416 places, 413 transitions, 836 flow. Second operand has 3 states, 3 states have (on average 425.3333333333333) internal successors, (1276), 3 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:04:55,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:55,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 424 of 454 [2025-03-08 22:04:55,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:55,896 INFO L124 PetriNetUnfolderBase]: 12/784 cut-off events. [2025-03-08 22:04:55,896 INFO L125 PetriNetUnfolderBase]: For 5/10 co-relation queries the response was YES. [2025-03-08 22:04:55,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 817 conditions, 784 events. 12/784 cut-off events. For 5/10 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2145 event pairs, 5 based on Foata normal form. 0/673 useless extension candidates. Maximal degree in co-relation 756. Up to 22 conditions per place. [2025-03-08 22:04:55,905 INFO L140 encePairwiseOnDemand]: 451/454 looper letters, 11 selfloop transitions, 2 changer transitions 0/412 dead transitions. [2025-03-08 22:04:55,905 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 417 places, 412 transitions, 860 flow [2025-03-08 22:04:55,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:55,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:55,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1286 transitions. [2025-03-08 22:04:55,908 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9441997063142438 [2025-03-08 22:04:55,908 INFO L175 Difference]: Start difference. First operand has 416 places, 413 transitions, 836 flow. Second operand 3 states and 1286 transitions. [2025-03-08 22:04:55,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 417 places, 412 transitions, 860 flow [2025-03-08 22:04:55,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 415 places, 412 transitions, 856 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:04:55,914 INFO L231 Difference]: Finished difference. Result has 415 places, 412 transitions, 834 flow [2025-03-08 22:04:55,914 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=830, PETRI_DIFFERENCE_MINUEND_PLACES=413, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=412, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=410, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=834, PETRI_PLACES=415, PETRI_TRANSITIONS=412} [2025-03-08 22:04:55,915 INFO L279 CegarLoopForPetriNet]: 425 programPoint places, -10 predicate places. [2025-03-08 22:04:55,915 INFO L471 AbstractCegarLoop]: Abstraction has has 415 places, 412 transitions, 834 flow [2025-03-08 22:04:55,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 425.3333333333333) internal successors, (1276), 3 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:04:55,916 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:55,916 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] [2025-03-08 22:04:55,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 22:04:55,916 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-08 22:04:55,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:55,918 INFO L85 PathProgramCache]: Analyzing trace with hash 921770405, now seen corresponding path program 1 times [2025-03-08 22:04:55,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:55,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740575040] [2025-03-08 22:04:55,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:55,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:55,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 22:04:55,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 22:04:55,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:55,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:55,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:04:55,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:55,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740575040] [2025-03-08 22:04:55,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740575040] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:55,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:55,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:04:55,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779160268] [2025-03-08 22:04:55,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:55,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:55,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:55,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:55,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:55,995 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 424 out of 454 [2025-03-08 22:04:55,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 415 places, 412 transitions, 834 flow. Second operand has 3 states, 3 states have (on average 425.3333333333333) internal successors, (1276), 3 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:04:55,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:55,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 424 of 454 [2025-03-08 22:04:55,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:56,110 INFO L124 PetriNetUnfolderBase]: 12/777 cut-off events. [2025-03-08 22:04:56,111 INFO L125 PetriNetUnfolderBase]: For 5/10 co-relation queries the response was YES. [2025-03-08 22:04:56,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 810 conditions, 777 events. 12/777 cut-off events. For 5/10 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2107 event pairs, 5 based on Foata normal form. 0/669 useless extension candidates. Maximal degree in co-relation 741. Up to 22 conditions per place. [2025-03-08 22:04:56,124 INFO L140 encePairwiseOnDemand]: 451/454 looper letters, 11 selfloop transitions, 2 changer transitions 0/411 dead transitions. [2025-03-08 22:04:56,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 416 places, 411 transitions, 858 flow [2025-03-08 22:04:56,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:56,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:56,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1286 transitions. [2025-03-08 22:04:56,128 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9441997063142438 [2025-03-08 22:04:56,128 INFO L175 Difference]: Start difference. First operand has 415 places, 412 transitions, 834 flow. Second operand 3 states and 1286 transitions. [2025-03-08 22:04:56,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 416 places, 411 transitions, 858 flow [2025-03-08 22:04:56,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 414 places, 411 transitions, 854 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:04:56,139 INFO L231 Difference]: Finished difference. Result has 414 places, 411 transitions, 832 flow [2025-03-08 22:04:56,140 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=828, PETRI_DIFFERENCE_MINUEND_PLACES=412, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=411, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=409, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=832, PETRI_PLACES=414, PETRI_TRANSITIONS=411} [2025-03-08 22:04:56,141 INFO L279 CegarLoopForPetriNet]: 425 programPoint places, -11 predicate places. [2025-03-08 22:04:56,142 INFO L471 AbstractCegarLoop]: Abstraction has has 414 places, 411 transitions, 832 flow [2025-03-08 22:04:56,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 425.3333333333333) internal successors, (1276), 3 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:04:56,143 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:56,143 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] [2025-03-08 22:04:56,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 22:04:56,143 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-08 22:04:56,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:56,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1226321235, now seen corresponding path program 1 times [2025-03-08 22:04:56,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:56,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535156949] [2025-03-08 22:04:56,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:56,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:56,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 22:04:56,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 22:04:56,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:56,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:56,192 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-08 22:04:56,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:56,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535156949] [2025-03-08 22:04:56,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535156949] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:56,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:56,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:04:56,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637715841] [2025-03-08 22:04:56,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:56,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:56,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:56,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:56,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:56,226 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 422 out of 454 [2025-03-08 22:04:56,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 414 places, 411 transitions, 832 flow. Second operand has 3 states, 3 states have (on average 423.3333333333333) internal successors, (1270), 3 states have internal predecessors, (1270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:04:56,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:56,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 422 of 454 [2025-03-08 22:04:56,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:56,323 INFO L124 PetriNetUnfolderBase]: 25/626 cut-off events. [2025-03-08 22:04:56,323 INFO L125 PetriNetUnfolderBase]: For 9/13 co-relation queries the response was YES. [2025-03-08 22:04:56,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 687 conditions, 626 events. 25/626 cut-off events. For 9/13 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2197 event pairs, 20 based on Foata normal form. 0/549 useless extension candidates. Maximal degree in co-relation 610. Up to 50 conditions per place. [2025-03-08 22:04:56,329 INFO L140 encePairwiseOnDemand]: 451/454 looper letters, 13 selfloop transitions, 2 changer transitions 0/410 dead transitions. [2025-03-08 22:04:56,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 415 places, 410 transitions, 860 flow [2025-03-08 22:04:56,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:56,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:56,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1282 transitions. [2025-03-08 22:04:56,331 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9412628487518355 [2025-03-08 22:04:56,332 INFO L175 Difference]: Start difference. First operand has 414 places, 411 transitions, 832 flow. Second operand 3 states and 1282 transitions. [2025-03-08 22:04:56,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 415 places, 410 transitions, 860 flow [2025-03-08 22:04:56,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 413 places, 410 transitions, 856 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:04:56,336 INFO L231 Difference]: Finished difference. Result has 413 places, 410 transitions, 830 flow [2025-03-08 22:04:56,336 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=826, PETRI_DIFFERENCE_MINUEND_PLACES=411, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=410, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=408, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=830, PETRI_PLACES=413, PETRI_TRANSITIONS=410} [2025-03-08 22:04:56,338 INFO L279 CegarLoopForPetriNet]: 425 programPoint places, -12 predicate places. [2025-03-08 22:04:56,338 INFO L471 AbstractCegarLoop]: Abstraction has has 413 places, 410 transitions, 830 flow [2025-03-08 22:04:56,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 423.3333333333333) internal successors, (1270), 3 states have internal predecessors, (1270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:04:56,339 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:56,339 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] [2025-03-08 22:04:56,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 22:04:56,339 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-08 22:04:56,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:56,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1866351931, now seen corresponding path program 1 times [2025-03-08 22:04:56,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:56,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944492020] [2025-03-08 22:04:56,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:56,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:56,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-08 22:04:56,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-08 22:04:56,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:56,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:56,392 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-08 22:04:56,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:56,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944492020] [2025-03-08 22:04:56,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944492020] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:56,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:56,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:04:56,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630295330] [2025-03-08 22:04:56,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:56,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:56,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:56,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:56,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:56,420 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 424 out of 454 [2025-03-08 22:04:56,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 413 places, 410 transitions, 830 flow. Second operand has 3 states, 3 states have (on average 425.3333333333333) internal successors, (1276), 3 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:04:56,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:56,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 424 of 454 [2025-03-08 22:04:56,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:56,495 INFO L124 PetriNetUnfolderBase]: 14/681 cut-off events. [2025-03-08 22:04:56,495 INFO L125 PetriNetUnfolderBase]: For 6/15 co-relation queries the response was YES. [2025-03-08 22:04:56,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 716 conditions, 681 events. 14/681 cut-off events. For 6/15 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1754 event pairs, 7 based on Foata normal form. 0/587 useless extension candidates. Maximal degree in co-relation 631. Up to 25 conditions per place. [2025-03-08 22:04:56,502 INFO L140 encePairwiseOnDemand]: 451/454 looper letters, 11 selfloop transitions, 2 changer transitions 0/409 dead transitions. [2025-03-08 22:04:56,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 414 places, 409 transitions, 854 flow [2025-03-08 22:04:56,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:56,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:56,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1286 transitions. [2025-03-08 22:04:56,505 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9441997063142438 [2025-03-08 22:04:56,505 INFO L175 Difference]: Start difference. First operand has 413 places, 410 transitions, 830 flow. Second operand 3 states and 1286 transitions. [2025-03-08 22:04:56,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 414 places, 409 transitions, 854 flow [2025-03-08 22:04:56,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 412 places, 409 transitions, 850 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:04:56,509 INFO L231 Difference]: Finished difference. Result has 412 places, 409 transitions, 828 flow [2025-03-08 22:04:56,509 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=824, PETRI_DIFFERENCE_MINUEND_PLACES=410, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=409, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=407, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=828, PETRI_PLACES=412, PETRI_TRANSITIONS=409} [2025-03-08 22:04:56,510 INFO L279 CegarLoopForPetriNet]: 425 programPoint places, -13 predicate places. [2025-03-08 22:04:56,510 INFO L471 AbstractCegarLoop]: Abstraction has has 412 places, 409 transitions, 828 flow [2025-03-08 22:04:56,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 425.3333333333333) internal successors, (1276), 3 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:04:56,510 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:56,511 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] [2025-03-08 22:04:56,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 22:04:56,511 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-08 22:04:56,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:56,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1382391037, now seen corresponding path program 1 times [2025-03-08 22:04:56,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:56,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234505118] [2025-03-08 22:04:56,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:56,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:56,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-08 22:04:56,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-08 22:04:56,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:56,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:56,556 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-08 22:04:56,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:56,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234505118] [2025-03-08 22:04:56,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234505118] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:56,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:56,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:04:56,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498497723] [2025-03-08 22:04:56,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:56,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:56,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:56,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:56,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:56,573 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 424 out of 454 [2025-03-08 22:04:56,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 412 places, 409 transitions, 828 flow. Second operand has 3 states, 3 states have (on average 425.3333333333333) internal successors, (1276), 3 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:04:56,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:56,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 424 of 454 [2025-03-08 22:04:56,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:56,635 INFO L124 PetriNetUnfolderBase]: 14/671 cut-off events. [2025-03-08 22:04:56,636 INFO L125 PetriNetUnfolderBase]: For 6/15 co-relation queries the response was YES. [2025-03-08 22:04:56,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 706 conditions, 671 events. 14/671 cut-off events. For 6/15 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1697 event pairs, 7 based on Foata normal form. 0/581 useless extension candidates. Maximal degree in co-relation 613. Up to 25 conditions per place. [2025-03-08 22:04:56,642 INFO L140 encePairwiseOnDemand]: 451/454 looper letters, 11 selfloop transitions, 2 changer transitions 0/408 dead transitions. [2025-03-08 22:04:56,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 413 places, 408 transitions, 852 flow [2025-03-08 22:04:56,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:56,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:56,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1286 transitions. [2025-03-08 22:04:56,644 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9441997063142438 [2025-03-08 22:04:56,644 INFO L175 Difference]: Start difference. First operand has 412 places, 409 transitions, 828 flow. Second operand 3 states and 1286 transitions. [2025-03-08 22:04:56,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 413 places, 408 transitions, 852 flow [2025-03-08 22:04:56,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 411 places, 408 transitions, 848 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:04:56,649 INFO L231 Difference]: Finished difference. Result has 411 places, 408 transitions, 826 flow [2025-03-08 22:04:56,649 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=822, PETRI_DIFFERENCE_MINUEND_PLACES=409, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=408, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=406, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=826, PETRI_PLACES=411, PETRI_TRANSITIONS=408} [2025-03-08 22:04:56,650 INFO L279 CegarLoopForPetriNet]: 425 programPoint places, -14 predicate places. [2025-03-08 22:04:56,650 INFO L471 AbstractCegarLoop]: Abstraction has has 411 places, 408 transitions, 826 flow [2025-03-08 22:04:56,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 425.3333333333333) internal successors, (1276), 3 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:04:56,651 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:56,651 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:04:56,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 22:04:56,651 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-08 22:04:56,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:56,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1488648862, now seen corresponding path program 1 times [2025-03-08 22:04:56,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:56,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083950933] [2025-03-08 22:04:56,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:56,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:56,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-08 22:04:56,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 22:04:56,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:56,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:56,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:04:56,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:56,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083950933] [2025-03-08 22:04:56,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083950933] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:56,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:56,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:04:56,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935922233] [2025-03-08 22:04:56,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:56,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:56,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:56,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:56,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:56,702 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 454 [2025-03-08 22:04:56,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 411 places, 408 transitions, 826 flow. Second operand has 3 states, 3 states have (on average 427.3333333333333) internal successors, (1282), 3 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:04:56,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:56,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 454 [2025-03-08 22:04:56,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:56,817 INFO L124 PetriNetUnfolderBase]: 34/1406 cut-off events. [2025-03-08 22:04:56,817 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-08 22:04:56,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1471 conditions, 1406 events. 34/1406 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 8123 event pairs, 13 based on Foata normal form. 0/1207 useless extension candidates. Maximal degree in co-relation 1370. Up to 43 conditions per place. [2025-03-08 22:04:56,827 INFO L140 encePairwiseOnDemand]: 450/454 looper letters, 13 selfloop transitions, 2 changer transitions 0/410 dead transitions. [2025-03-08 22:04:56,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 410 transitions, 862 flow [2025-03-08 22:04:56,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:56,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:56,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1295 transitions. [2025-03-08 22:04:56,829 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9508076358296622 [2025-03-08 22:04:56,830 INFO L175 Difference]: Start difference. First operand has 411 places, 408 transitions, 826 flow. Second operand 3 states and 1295 transitions. [2025-03-08 22:04:56,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 411 places, 410 transitions, 862 flow [2025-03-08 22:04:56,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 410 transitions, 858 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:04:56,834 INFO L231 Difference]: Finished difference. Result has 410 places, 408 transitions, 832 flow [2025-03-08 22:04:56,835 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=818, PETRI_DIFFERENCE_MINUEND_PLACES=407, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=404, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=832, PETRI_PLACES=410, PETRI_TRANSITIONS=408} [2025-03-08 22:04:56,835 INFO L279 CegarLoopForPetriNet]: 425 programPoint places, -15 predicate places. [2025-03-08 22:04:56,835 INFO L471 AbstractCegarLoop]: Abstraction has has 410 places, 408 transitions, 832 flow [2025-03-08 22:04:56,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 427.3333333333333) internal successors, (1282), 3 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:04:56,836 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:56,836 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] [2025-03-08 22:04:56,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 22:04:56,836 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-08 22:04:56,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:56,837 INFO L85 PathProgramCache]: Analyzing trace with hash -367418557, now seen corresponding path program 1 times [2025-03-08 22:04:56,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:56,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453458322] [2025-03-08 22:04:56,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:56,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:56,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-08 22:04:56,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-08 22:04:56,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:56,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:56,866 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-08 22:04:56,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:56,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453458322] [2025-03-08 22:04:56,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453458322] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:56,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:56,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:04:56,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227051720] [2025-03-08 22:04:56,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:56,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:56,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:56,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:56,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:56,876 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 454 [2025-03-08 22:04:56,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 410 places, 408 transitions, 832 flow. Second operand has 3 states, 3 states have (on average 427.3333333333333) internal successors, (1282), 3 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:04:56,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:56,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 454 [2025-03-08 22:04:56,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:57,003 INFO L124 PetriNetUnfolderBase]: 40/1646 cut-off events. [2025-03-08 22:04:57,003 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-08 22:04:57,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1724 conditions, 1646 events. 40/1646 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 10635 event pairs, 14 based on Foata normal form. 0/1421 useless extension candidates. Maximal degree in co-relation 1337. Up to 49 conditions per place. [2025-03-08 22:04:57,018 INFO L140 encePairwiseOnDemand]: 450/454 looper letters, 13 selfloop transitions, 2 changer transitions 0/410 dead transitions. [2025-03-08 22:04:57,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 410 places, 410 transitions, 868 flow [2025-03-08 22:04:57,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:57,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:57,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1295 transitions. [2025-03-08 22:04:57,020 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9508076358296622 [2025-03-08 22:04:57,020 INFO L175 Difference]: Start difference. First operand has 410 places, 408 transitions, 832 flow. Second operand 3 states and 1295 transitions. [2025-03-08 22:04:57,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 410 places, 410 transitions, 868 flow [2025-03-08 22:04:57,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 410 places, 410 transitions, 868 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:04:57,025 INFO L231 Difference]: Finished difference. Result has 411 places, 408 transitions, 842 flow [2025-03-08 22:04:57,026 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=828, PETRI_DIFFERENCE_MINUEND_PLACES=408, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=404, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=842, PETRI_PLACES=411, PETRI_TRANSITIONS=408} [2025-03-08 22:04:57,026 INFO L279 CegarLoopForPetriNet]: 425 programPoint places, -14 predicate places. [2025-03-08 22:04:57,026 INFO L471 AbstractCegarLoop]: Abstraction has has 411 places, 408 transitions, 842 flow [2025-03-08 22:04:57,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 427.3333333333333) internal successors, (1282), 3 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:04:57,027 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:57,027 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-08 22:04:57,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 22:04:57,027 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread3Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-08 22:04:57,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:57,028 INFO L85 PathProgramCache]: Analyzing trace with hash -2097842577, now seen corresponding path program 1 times [2025-03-08 22:04:57,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:57,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519241440] [2025-03-08 22:04:57,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:57,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:57,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-08 22:04:57,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-08 22:04:57,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:57,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:57,066 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-08 22:04:57,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:57,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519241440] [2025-03-08 22:04:57,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519241440] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:57,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:57,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:04:57,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756504584] [2025-03-08 22:04:57,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:57,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:57,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:57,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:57,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:57,080 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 454 [2025-03-08 22:04:57,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 411 places, 408 transitions, 842 flow. Second operand has 3 states, 3 states have (on average 428.0) internal successors, (1284), 3 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:04:57,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:57,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 454 [2025-03-08 22:04:57,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:57,186 INFO L124 PetriNetUnfolderBase]: 24/902 cut-off events. [2025-03-08 22:04:57,186 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-08 22:04:57,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 962 conditions, 902 events. 24/902 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4361 event pairs, 4 based on Foata normal form. 0/786 useless extension candidates. Maximal degree in co-relation 759. Up to 31 conditions per place. [2025-03-08 22:04:57,198 INFO L140 encePairwiseOnDemand]: 450/454 looper letters, 13 selfloop transitions, 2 changer transitions 0/410 dead transitions. [2025-03-08 22:04:57,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 410 transitions, 878 flow [2025-03-08 22:04:57,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:57,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:57,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1295 transitions. [2025-03-08 22:04:57,200 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9508076358296622 [2025-03-08 22:04:57,200 INFO L175 Difference]: Start difference. First operand has 411 places, 408 transitions, 842 flow. Second operand 3 states and 1295 transitions. [2025-03-08 22:04:57,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 411 places, 410 transitions, 878 flow [2025-03-08 22:04:57,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 411 places, 410 transitions, 878 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:04:57,204 INFO L231 Difference]: Finished difference. Result has 412 places, 408 transitions, 852 flow [2025-03-08 22:04:57,205 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=838, PETRI_DIFFERENCE_MINUEND_PLACES=409, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=404, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=852, PETRI_PLACES=412, PETRI_TRANSITIONS=408} [2025-03-08 22:04:57,205 INFO L279 CegarLoopForPetriNet]: 425 programPoint places, -13 predicate places. [2025-03-08 22:04:57,205 INFO L471 AbstractCegarLoop]: Abstraction has has 412 places, 408 transitions, 852 flow [2025-03-08 22:04:57,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 428.0) internal successors, (1284), 3 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:04:57,207 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:57,207 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:04:57,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 22:04:57,207 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread3Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-08 22:04:57,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:57,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1687020400, now seen corresponding path program 1 times [2025-03-08 22:04:57,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:57,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949067007] [2025-03-08 22:04:57,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:57,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:57,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-08 22:04:57,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-08 22:04:57,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:57,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:57,250 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-08 22:04:57,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:57,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949067007] [2025-03-08 22:04:57,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949067007] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:57,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:57,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:04:57,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470754599] [2025-03-08 22:04:57,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:57,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:57,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:57,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:57,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:57,260 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 454 [2025-03-08 22:04:57,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 412 places, 408 transitions, 852 flow. Second operand has 3 states, 3 states have (on average 428.0) internal successors, (1284), 3 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:04:57,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:57,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 454 [2025-03-08 22:04:57,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:57,356 INFO L124 PetriNetUnfolderBase]: 26/943 cut-off events. [2025-03-08 22:04:57,356 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-08 22:04:57,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1014 conditions, 943 events. 26/943 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4675 event pairs, 4 based on Foata normal form. 0/826 useless extension candidates. Maximal degree in co-relation 810. Up to 35 conditions per place. [2025-03-08 22:04:57,366 INFO L140 encePairwiseOnDemand]: 450/454 looper letters, 13 selfloop transitions, 2 changer transitions 0/410 dead transitions. [2025-03-08 22:04:57,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 412 places, 410 transitions, 888 flow [2025-03-08 22:04:57,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:57,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:57,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1295 transitions. [2025-03-08 22:04:57,368 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9508076358296622 [2025-03-08 22:04:57,368 INFO L175 Difference]: Start difference. First operand has 412 places, 408 transitions, 852 flow. Second operand 3 states and 1295 transitions. [2025-03-08 22:04:57,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 412 places, 410 transitions, 888 flow [2025-03-08 22:04:57,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 412 places, 410 transitions, 888 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:04:57,372 INFO L231 Difference]: Finished difference. Result has 413 places, 408 transitions, 862 flow [2025-03-08 22:04:57,372 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=848, PETRI_DIFFERENCE_MINUEND_PLACES=410, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=404, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=862, PETRI_PLACES=413, PETRI_TRANSITIONS=408} [2025-03-08 22:04:57,373 INFO L279 CegarLoopForPetriNet]: 425 programPoint places, -12 predicate places. [2025-03-08 22:04:57,373 INFO L471 AbstractCegarLoop]: Abstraction has has 413 places, 408 transitions, 862 flow [2025-03-08 22:04:57,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 428.0) internal successors, (1284), 3 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:04:57,374 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:57,374 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] [2025-03-08 22:04:57,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 22:04:57,374 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-08 22:04:57,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:57,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1954762881, now seen corresponding path program 1 times [2025-03-08 22:04:57,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:57,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363002943] [2025-03-08 22:04:57,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:57,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:57,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-08 22:04:57,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-08 22:04:57,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:57,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:57,422 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-08 22:04:57,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:57,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363002943] [2025-03-08 22:04:57,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363002943] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:57,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:57,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:04:57,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078743622] [2025-03-08 22:04:57,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:57,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:57,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:57,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:57,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:57,435 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 454 [2025-03-08 22:04:57,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 413 places, 408 transitions, 862 flow. Second operand has 3 states, 3 states have (on average 427.6666666666667) internal successors, (1283), 3 states have internal predecessors, (1283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:04:57,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:57,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 454 [2025-03-08 22:04:57,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:57,640 INFO L124 PetriNetUnfolderBase]: 66/1778 cut-off events. [2025-03-08 22:04:57,640 INFO L125 PetriNetUnfolderBase]: For 21/25 co-relation queries the response was YES. [2025-03-08 22:04:57,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1908 conditions, 1778 events. 66/1778 cut-off events. For 21/25 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 10927 event pairs, 10 based on Foata normal form. 0/1515 useless extension candidates. Maximal degree in co-relation 1461. Up to 80 conditions per place. [2025-03-08 22:04:57,657 INFO L140 encePairwiseOnDemand]: 450/454 looper letters, 13 selfloop transitions, 2 changer transitions 0/410 dead transitions. [2025-03-08 22:04:57,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 413 places, 410 transitions, 898 flow [2025-03-08 22:04:57,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:57,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:57,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1295 transitions. [2025-03-08 22:04:57,659 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9508076358296622 [2025-03-08 22:04:57,659 INFO L175 Difference]: Start difference. First operand has 413 places, 408 transitions, 862 flow. Second operand 3 states and 1295 transitions. [2025-03-08 22:04:57,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 413 places, 410 transitions, 898 flow [2025-03-08 22:04:57,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 413 places, 410 transitions, 898 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:04:57,663 INFO L231 Difference]: Finished difference. Result has 414 places, 408 transitions, 872 flow [2025-03-08 22:04:57,663 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=858, PETRI_DIFFERENCE_MINUEND_PLACES=411, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=404, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=872, PETRI_PLACES=414, PETRI_TRANSITIONS=408} [2025-03-08 22:04:57,664 INFO L279 CegarLoopForPetriNet]: 425 programPoint places, -11 predicate places. [2025-03-08 22:04:57,665 INFO L471 AbstractCegarLoop]: Abstraction has has 414 places, 408 transitions, 872 flow [2025-03-08 22:04:57,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 427.6666666666667) internal successors, (1283), 3 states have internal predecessors, (1283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:04:57,665 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:57,665 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:04:57,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 22:04:57,665 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-08 22:04:57,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:57,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1626387936, now seen corresponding path program 1 times [2025-03-08 22:04:57,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:57,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316098710] [2025-03-08 22:04:57,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:57,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:57,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-08 22:04:57,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-08 22:04:57,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:57,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:57,699 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-08 22:04:57,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:57,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316098710] [2025-03-08 22:04:57,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316098710] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:57,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:57,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:04:57,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488881414] [2025-03-08 22:04:57,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:57,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:57,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:57,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:57,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:57,709 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 454 [2025-03-08 22:04:57,711 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 414 places, 408 transitions, 872 flow. Second operand has 3 states, 3 states have (on average 427.6666666666667) internal successors, (1283), 3 states have internal predecessors, (1283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:04:57,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:57,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 454 [2025-03-08 22:04:57,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:57,901 INFO L124 PetriNetUnfolderBase]: 75/1940 cut-off events. [2025-03-08 22:04:57,901 INFO L125 PetriNetUnfolderBase]: For 23/27 co-relation queries the response was YES. [2025-03-08 22:04:57,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2095 conditions, 1940 events. 75/1940 cut-off events. For 23/27 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 12016 event pairs, 19 based on Foata normal form. 0/1662 useless extension candidates. Maximal degree in co-relation 1659. Up to 90 conditions per place. [2025-03-08 22:04:57,914 INFO L140 encePairwiseOnDemand]: 450/454 looper letters, 13 selfloop transitions, 2 changer transitions 0/410 dead transitions. [2025-03-08 22:04:57,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 414 places, 410 transitions, 908 flow [2025-03-08 22:04:57,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:57,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:57,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1295 transitions. [2025-03-08 22:04:57,918 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9508076358296622 [2025-03-08 22:04:57,918 INFO L175 Difference]: Start difference. First operand has 414 places, 408 transitions, 872 flow. Second operand 3 states and 1295 transitions. [2025-03-08 22:04:57,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 414 places, 410 transitions, 908 flow [2025-03-08 22:04:57,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 414 places, 410 transitions, 908 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:04:57,924 INFO L231 Difference]: Finished difference. Result has 415 places, 408 transitions, 882 flow [2025-03-08 22:04:57,925 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=868, PETRI_DIFFERENCE_MINUEND_PLACES=412, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=404, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=882, PETRI_PLACES=415, PETRI_TRANSITIONS=408} [2025-03-08 22:04:57,926 INFO L279 CegarLoopForPetriNet]: 425 programPoint places, -10 predicate places. [2025-03-08 22:04:57,926 INFO L471 AbstractCegarLoop]: Abstraction has has 415 places, 408 transitions, 882 flow [2025-03-08 22:04:57,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 427.6666666666667) internal successors, (1283), 3 states have internal predecessors, (1283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:04:57,927 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:57,927 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] [2025-03-08 22:04:57,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 22:04:57,927 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-08 22:04:57,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:57,928 INFO L85 PathProgramCache]: Analyzing trace with hash 713552194, now seen corresponding path program 1 times [2025-03-08 22:04:57,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:57,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699194470] [2025-03-08 22:04:57,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:57,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:57,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-08 22:04:57,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-08 22:04:57,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:57,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:57,976 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-08 22:04:57,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:57,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699194470] [2025-03-08 22:04:57,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699194470] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:57,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:57,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:04:57,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942324515] [2025-03-08 22:04:57,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:57,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:57,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:57,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:57,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:57,994 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 420 out of 454 [2025-03-08 22:04:57,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 415 places, 408 transitions, 882 flow. Second operand has 3 states, 3 states have (on average 421.3333333333333) internal successors, (1264), 3 states have internal predecessors, (1264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:04:57,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:57,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 420 of 454 [2025-03-08 22:04:57,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:58,205 INFO L124 PetriNetUnfolderBase]: 163/1738 cut-off events. [2025-03-08 22:04:58,205 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-03-08 22:04:58,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2090 conditions, 1738 events. 163/1738 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 12360 event pairs, 60 based on Foata normal form. 0/1489 useless extension candidates. Maximal degree in co-relation 1724. Up to 239 conditions per place. [2025-03-08 22:04:58,223 INFO L140 encePairwiseOnDemand]: 448/454 looper letters, 17 selfloop transitions, 2 changer transitions 0/408 dead transitions. [2025-03-08 22:04:58,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 413 places, 408 transitions, 922 flow [2025-03-08 22:04:58,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:58,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:58,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1283 transitions. [2025-03-08 22:04:58,225 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9419970631424376 [2025-03-08 22:04:58,226 INFO L175 Difference]: Start difference. First operand has 415 places, 408 transitions, 882 flow. Second operand 3 states and 1283 transitions. [2025-03-08 22:04:58,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 413 places, 408 transitions, 922 flow [2025-03-08 22:04:58,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 413 places, 408 transitions, 922 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:04:58,230 INFO L231 Difference]: Finished difference. Result has 414 places, 406 transitions, 888 flow [2025-03-08 22:04:58,231 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=874, PETRI_DIFFERENCE_MINUEND_PLACES=411, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=404, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=402, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=888, PETRI_PLACES=414, PETRI_TRANSITIONS=406} [2025-03-08 22:04:58,231 INFO L279 CegarLoopForPetriNet]: 425 programPoint places, -11 predicate places. [2025-03-08 22:04:58,231 INFO L471 AbstractCegarLoop]: Abstraction has has 414 places, 406 transitions, 888 flow [2025-03-08 22:04:58,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 421.3333333333333) internal successors, (1264), 3 states have internal predecessors, (1264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:04:58,232 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:58,232 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:04:58,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 22:04:58,232 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-08 22:04:58,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:58,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1471078493, now seen corresponding path program 1 times [2025-03-08 22:04:58,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:58,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132552767] [2025-03-08 22:04:58,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:58,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:58,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-08 22:04:58,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-08 22:04:58,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:58,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:58,273 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-08 22:04:58,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:58,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132552767] [2025-03-08 22:04:58,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132552767] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:58,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:58,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:04:58,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406214700] [2025-03-08 22:04:58,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:58,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:58,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:58,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:58,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:58,288 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 420 out of 454 [2025-03-08 22:04:58,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 414 places, 406 transitions, 888 flow. Second operand has 3 states, 3 states have (on average 421.3333333333333) internal successors, (1264), 3 states have internal predecessors, (1264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:04:58,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:58,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 420 of 454 [2025-03-08 22:04:58,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:58,475 INFO L124 PetriNetUnfolderBase]: 121/1554 cut-off events. [2025-03-08 22:04:58,475 INFO L125 PetriNetUnfolderBase]: For 21/45 co-relation queries the response was YES. [2025-03-08 22:04:58,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1849 conditions, 1554 events. 121/1554 cut-off events. For 21/45 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 9847 event pairs, 52 based on Foata normal form. 3/1362 useless extension candidates. Maximal degree in co-relation 1555. Up to 191 conditions per place. [2025-03-08 22:04:58,488 INFO L140 encePairwiseOnDemand]: 448/454 looper letters, 17 selfloop transitions, 2 changer transitions 0/406 dead transitions. [2025-03-08 22:04:58,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 412 places, 406 transitions, 928 flow [2025-03-08 22:04:58,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:58,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:58,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1283 transitions. [2025-03-08 22:04:58,491 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9419970631424376 [2025-03-08 22:04:58,491 INFO L175 Difference]: Start difference. First operand has 414 places, 406 transitions, 888 flow. Second operand 3 states and 1283 transitions. [2025-03-08 22:04:58,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 412 places, 406 transitions, 928 flow [2025-03-08 22:04:58,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 412 places, 406 transitions, 928 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:04:58,495 INFO L231 Difference]: Finished difference. Result has 413 places, 404 transitions, 894 flow [2025-03-08 22:04:58,496 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=880, PETRI_DIFFERENCE_MINUEND_PLACES=410, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=402, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=400, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=894, PETRI_PLACES=413, PETRI_TRANSITIONS=404} [2025-03-08 22:04:58,496 INFO L279 CegarLoopForPetriNet]: 425 programPoint places, -12 predicate places. [2025-03-08 22:04:58,496 INFO L471 AbstractCegarLoop]: Abstraction has has 413 places, 404 transitions, 894 flow [2025-03-08 22:04:58,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 421.3333333333333) internal successors, (1264), 3 states have internal predecessors, (1264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:04:58,497 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:58,497 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-08 22:04:58,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 22:04:58,497 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-08 22:04:58,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:58,498 INFO L85 PathProgramCache]: Analyzing trace with hash -429594352, now seen corresponding path program 1 times [2025-03-08 22:04:58,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:58,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714726617] [2025-03-08 22:04:58,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:58,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:58,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 22:04:58,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 22:04:58,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:58,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:58,543 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-08 22:04:58,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:58,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714726617] [2025-03-08 22:04:58,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714726617] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:58,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:58,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:04:58,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048279452] [2025-03-08 22:04:58,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:58,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:58,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:58,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:58,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:58,559 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 420 out of 454 [2025-03-08 22:04:58,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 413 places, 404 transitions, 894 flow. Second operand has 3 states, 3 states have (on average 421.6666666666667) internal successors, (1265), 3 states have internal predecessors, (1265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:04:58,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:58,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 420 of 454 [2025-03-08 22:04:58,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:58,771 INFO L124 PetriNetUnfolderBase]: 231/1986 cut-off events. [2025-03-08 22:04:58,772 INFO L125 PetriNetUnfolderBase]: For 51/53 co-relation queries the response was YES. [2025-03-08 22:04:58,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2492 conditions, 1986 events. 231/1986 cut-off events. For 51/53 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 13038 event pairs, 76 based on Foata normal form. 0/1789 useless extension candidates. Maximal degree in co-relation 2096. Up to 364 conditions per place. [2025-03-08 22:04:58,790 INFO L140 encePairwiseOnDemand]: 448/454 looper letters, 17 selfloop transitions, 2 changer transitions 0/404 dead transitions. [2025-03-08 22:04:58,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 404 transitions, 934 flow [2025-03-08 22:04:58,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:58,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:58,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1283 transitions. [2025-03-08 22:04:58,792 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9419970631424376 [2025-03-08 22:04:58,792 INFO L175 Difference]: Start difference. First operand has 413 places, 404 transitions, 894 flow. Second operand 3 states and 1283 transitions. [2025-03-08 22:04:58,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 411 places, 404 transitions, 934 flow [2025-03-08 22:04:58,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 411 places, 404 transitions, 934 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:04:58,797 INFO L231 Difference]: Finished difference. Result has 412 places, 402 transitions, 900 flow [2025-03-08 22:04:58,797 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=886, PETRI_DIFFERENCE_MINUEND_PLACES=409, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=400, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=398, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=900, PETRI_PLACES=412, PETRI_TRANSITIONS=402} [2025-03-08 22:04:58,798 INFO L279 CegarLoopForPetriNet]: 425 programPoint places, -13 predicate places. [2025-03-08 22:04:58,798 INFO L471 AbstractCegarLoop]: Abstraction has has 412 places, 402 transitions, 900 flow [2025-03-08 22:04:58,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 421.6666666666667) internal successors, (1265), 3 states have internal predecessors, (1265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:04:58,798 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:58,798 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-08 22:04:58,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 22:04:58,798 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-08 22:04:58,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:58,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1985565941, now seen corresponding path program 1 times [2025-03-08 22:04:58,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:58,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245323251] [2025-03-08 22:04:58,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:58,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:58,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 22:04:58,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 22:04:58,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:58,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:58,840 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-08 22:04:58,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:58,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245323251] [2025-03-08 22:04:58,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245323251] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:58,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:58,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:04:58,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181432195] [2025-03-08 22:04:58,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:58,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:58,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:58,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:58,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:58,849 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 427 out of 454 [2025-03-08 22:04:58,851 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 412 places, 402 transitions, 900 flow. Second operand has 3 states, 3 states have (on average 428.3333333333333) internal successors, (1285), 3 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:04:58,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:58,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 427 of 454 [2025-03-08 22:04:58,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:58,988 INFO L124 PetriNetUnfolderBase]: 55/1300 cut-off events. [2025-03-08 22:04:58,989 INFO L125 PetriNetUnfolderBase]: For 7/31 co-relation queries the response was YES. [2025-03-08 22:04:58,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1519 conditions, 1300 events. 55/1300 cut-off events. For 7/31 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 6940 event pairs, 4 based on Foata normal form. 4/1205 useless extension candidates. Maximal degree in co-relation 1196. Up to 30 conditions per place. [2025-03-08 22:04:59,001 INFO L140 encePairwiseOnDemand]: 451/454 looper letters, 11 selfloop transitions, 2 changer transitions 0/403 dead transitions. [2025-03-08 22:04:59,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 413 places, 403 transitions, 930 flow [2025-03-08 22:04:59,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:59,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:59,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1295 transitions. [2025-03-08 22:04:59,003 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9508076358296622 [2025-03-08 22:04:59,003 INFO L175 Difference]: Start difference. First operand has 412 places, 402 transitions, 900 flow. Second operand 3 states and 1295 transitions. [2025-03-08 22:04:59,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 413 places, 403 transitions, 930 flow [2025-03-08 22:04:59,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 413 places, 403 transitions, 930 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:04:59,008 INFO L231 Difference]: Finished difference. Result has 413 places, 401 transitions, 902 flow [2025-03-08 22:04:59,009 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=898, PETRI_DIFFERENCE_MINUEND_PLACES=411, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=401, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=399, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=902, PETRI_PLACES=413, PETRI_TRANSITIONS=401} [2025-03-08 22:04:59,009 INFO L279 CegarLoopForPetriNet]: 425 programPoint places, -12 predicate places. [2025-03-08 22:04:59,009 INFO L471 AbstractCegarLoop]: Abstraction has has 413 places, 401 transitions, 902 flow [2025-03-08 22:04:59,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 428.3333333333333) internal successors, (1285), 3 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:04:59,010 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:59,010 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-08 22:04:59,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 22:04:59,010 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-08 22:04:59,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:59,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1647885832, now seen corresponding path program 1 times [2025-03-08 22:04:59,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:59,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161714045] [2025-03-08 22:04:59,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:59,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:59,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-08 22:04:59,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-08 22:04:59,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:59,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:59,047 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-08 22:04:59,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:59,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161714045] [2025-03-08 22:04:59,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161714045] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:59,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:59,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:04:59,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150750803] [2025-03-08 22:04:59,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:59,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:59,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:59,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:59,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:59,061 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 454 [2025-03-08 22:04:59,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 413 places, 401 transitions, 902 flow. Second operand has 3 states, 3 states have (on average 427.6666666666667) internal successors, (1283), 3 states have internal predecessors, (1283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:04:59,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:59,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 454 [2025-03-08 22:04:59,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:59,241 INFO L124 PetriNetUnfolderBase]: 81/1576 cut-off events. [2025-03-08 22:04:59,242 INFO L125 PetriNetUnfolderBase]: For 19/31 co-relation queries the response was YES. [2025-03-08 22:04:59,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1889 conditions, 1576 events. 81/1576 cut-off events. For 19/31 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 9355 event pairs, 14 based on Foata normal form. 1/1465 useless extension candidates. Maximal degree in co-relation 1758. Up to 53 conditions per place. [2025-03-08 22:04:59,252 INFO L140 encePairwiseOnDemand]: 451/454 looper letters, 12 selfloop transitions, 2 changer transitions 0/402 dead transitions. [2025-03-08 22:04:59,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 414 places, 402 transitions, 934 flow [2025-03-08 22:04:59,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:59,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:59,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1293 transitions. [2025-03-08 22:04:59,255 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9493392070484582 [2025-03-08 22:04:59,255 INFO L175 Difference]: Start difference. First operand has 413 places, 401 transitions, 902 flow. Second operand 3 states and 1293 transitions. [2025-03-08 22:04:59,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 414 places, 402 transitions, 934 flow [2025-03-08 22:04:59,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 412 places, 402 transitions, 930 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:04:59,261 INFO L231 Difference]: Finished difference. Result has 412 places, 400 transitions, 900 flow [2025-03-08 22:04:59,262 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=896, PETRI_DIFFERENCE_MINUEND_PLACES=410, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=400, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=398, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=900, PETRI_PLACES=412, PETRI_TRANSITIONS=400} [2025-03-08 22:04:59,263 INFO L279 CegarLoopForPetriNet]: 425 programPoint places, -13 predicate places. [2025-03-08 22:04:59,263 INFO L471 AbstractCegarLoop]: Abstraction has has 412 places, 400 transitions, 900 flow [2025-03-08 22:04:59,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 427.6666666666667) internal successors, (1283), 3 states have internal predecessors, (1283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:04:59,263 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:59,264 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:04:59,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 22:04:59,264 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-08 22:04:59,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:59,265 INFO L85 PathProgramCache]: Analyzing trace with hash -876010472, now seen corresponding path program 1 times [2025-03-08 22:04:59,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:59,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533801326] [2025-03-08 22:04:59,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:59,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:59,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-08 22:04:59,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-08 22:04:59,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:59,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:59,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:04:59,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:59,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533801326] [2025-03-08 22:04:59,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533801326] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:59,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:59,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:04:59,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919821335] [2025-03-08 22:04:59,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:59,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:59,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:59,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:59,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:59,336 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 454 [2025-03-08 22:04:59,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 412 places, 400 transitions, 900 flow. Second operand has 3 states, 3 states have (on average 428.0) internal successors, (1284), 3 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:04:59,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:59,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 454 [2025-03-08 22:04:59,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:59,472 INFO L124 PetriNetUnfolderBase]: 65/1219 cut-off events. [2025-03-08 22:04:59,472 INFO L125 PetriNetUnfolderBase]: For 25/31 co-relation queries the response was YES. [2025-03-08 22:04:59,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1506 conditions, 1219 events. 65/1219 cut-off events. For 25/31 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 6108 event pairs, 10 based on Foata normal form. 0/1146 useless extension candidates. Maximal degree in co-relation 1397. Up to 63 conditions per place. [2025-03-08 22:04:59,484 INFO L140 encePairwiseOnDemand]: 451/454 looper letters, 12 selfloop transitions, 2 changer transitions 0/401 dead transitions. [2025-03-08 22:04:59,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 413 places, 401 transitions, 932 flow [2025-03-08 22:04:59,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:59,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:59,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1293 transitions. [2025-03-08 22:04:59,486 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9493392070484582 [2025-03-08 22:04:59,486 INFO L175 Difference]: Start difference. First operand has 412 places, 400 transitions, 900 flow. Second operand 3 states and 1293 transitions. [2025-03-08 22:04:59,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 413 places, 401 transitions, 932 flow [2025-03-08 22:04:59,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 411 places, 401 transitions, 928 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:04:59,491 INFO L231 Difference]: Finished difference. Result has 411 places, 399 transitions, 898 flow [2025-03-08 22:04:59,492 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=894, PETRI_DIFFERENCE_MINUEND_PLACES=409, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=399, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=397, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=898, PETRI_PLACES=411, PETRI_TRANSITIONS=399} [2025-03-08 22:04:59,493 INFO L279 CegarLoopForPetriNet]: 425 programPoint places, -14 predicate places. [2025-03-08 22:04:59,493 INFO L471 AbstractCegarLoop]: Abstraction has has 411 places, 399 transitions, 898 flow [2025-03-08 22:04:59,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 428.0) internal successors, (1284), 3 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:04:59,493 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:59,493 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:04:59,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 22:04:59,494 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-08 22:04:59,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:59,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1527442181, now seen corresponding path program 1 times [2025-03-08 22:04:59,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:59,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51343796] [2025-03-08 22:04:59,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:59,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:59,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 331 statements into 1 equivalence classes. [2025-03-08 22:04:59,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 331 of 331 statements. [2025-03-08 22:04:59,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:59,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:59,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:04:59,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:59,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51343796] [2025-03-08 22:04:59,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51343796] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:59,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:59,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:04:59,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073220480] [2025-03-08 22:04:59,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:59,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:59,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:59,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:59,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:59,584 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 429 out of 454 [2025-03-08 22:04:59,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 411 places, 399 transitions, 898 flow. Second operand has 3 states, 3 states have (on average 432.0) internal successors, (1296), 3 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:04:59,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:59,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 429 of 454 [2025-03-08 22:04:59,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:59,734 INFO L124 PetriNetUnfolderBase]: 49/1259 cut-off events. [2025-03-08 22:04:59,735 INFO L125 PetriNetUnfolderBase]: For 7/16 co-relation queries the response was YES. [2025-03-08 22:04:59,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1483 conditions, 1259 events. 49/1259 cut-off events. For 7/16 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 6536 event pairs, 2 based on Foata normal form. 0/1185 useless extension candidates. Maximal degree in co-relation 1326. Up to 30 conditions per place. [2025-03-08 22:04:59,744 INFO L140 encePairwiseOnDemand]: 452/454 looper letters, 8 selfloop transitions, 1 changer transitions 0/398 dead transitions. [2025-03-08 22:04:59,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 412 places, 398 transitions, 914 flow [2025-03-08 22:04:59,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:59,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:59,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1297 transitions. [2025-03-08 22:04:59,746 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9522760646108663 [2025-03-08 22:04:59,746 INFO L175 Difference]: Start difference. First operand has 411 places, 399 transitions, 898 flow. Second operand 3 states and 1297 transitions. [2025-03-08 22:04:59,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 412 places, 398 transitions, 914 flow [2025-03-08 22:04:59,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 410 places, 398 transitions, 910 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:04:59,752 INFO L231 Difference]: Finished difference. Result has 410 places, 398 transitions, 894 flow [2025-03-08 22:04:59,752 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=892, PETRI_DIFFERENCE_MINUEND_PLACES=408, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=397, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=894, PETRI_PLACES=410, PETRI_TRANSITIONS=398} [2025-03-08 22:04:59,752 INFO L279 CegarLoopForPetriNet]: 425 programPoint places, -15 predicate places. [2025-03-08 22:04:59,753 INFO L471 AbstractCegarLoop]: Abstraction has has 410 places, 398 transitions, 894 flow [2025-03-08 22:04:59,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 432.0) internal successors, (1296), 3 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:04:59,753 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:59,753 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:04:59,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 22:04:59,753 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-08 22:04:59,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:59,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1008284728, now seen corresponding path program 1 times [2025-03-08 22:04:59,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:59,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123737233] [2025-03-08 22:04:59,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:59,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:59,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 339 statements into 1 equivalence classes. [2025-03-08 22:04:59,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 339 of 339 statements. [2025-03-08 22:04:59,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:59,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:59,843 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-08 22:04:59,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:59,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123737233] [2025-03-08 22:04:59,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123737233] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:59,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:59,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:04:59,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663238340] [2025-03-08 22:04:59,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:59,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:59,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:59,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:59,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:59,856 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 454 [2025-03-08 22:04:59,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 410 places, 398 transitions, 894 flow. Second operand has 3 states, 3 states have (on average 429.0) internal successors, (1287), 3 states have internal predecessors, (1287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:04:59,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:59,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 454 [2025-03-08 22:04:59,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:00,044 INFO L124 PetriNetUnfolderBase]: 60/1492 cut-off events. [2025-03-08 22:05:00,044 INFO L125 PetriNetUnfolderBase]: For 7/13 co-relation queries the response was YES. [2025-03-08 22:05:00,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1730 conditions, 1492 events. 60/1492 cut-off events. For 7/13 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 8541 event pairs, 7 based on Foata normal form. 0/1401 useless extension candidates. Maximal degree in co-relation 1694. Up to 36 conditions per place. [2025-03-08 22:05:00,059 INFO L140 encePairwiseOnDemand]: 451/454 looper letters, 10 selfloop transitions, 1 changer transitions 0/396 dead transitions. [2025-03-08 22:05:00,059 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 410 places, 396 transitions, 912 flow [2025-03-08 22:05:00,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:00,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:00,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1291 transitions. [2025-03-08 22:05:00,061 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9478707782672541 [2025-03-08 22:05:00,061 INFO L175 Difference]: Start difference. First operand has 410 places, 398 transitions, 894 flow. Second operand 3 states and 1291 transitions. [2025-03-08 22:05:00,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 410 places, 396 transitions, 912 flow [2025-03-08 22:05:00,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 396 transitions, 911 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:05:00,065 INFO L231 Difference]: Finished difference. Result has 409 places, 396 transitions, 891 flow [2025-03-08 22:05:00,066 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=889, PETRI_DIFFERENCE_MINUEND_PLACES=407, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=395, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=891, PETRI_PLACES=409, PETRI_TRANSITIONS=396} [2025-03-08 22:05:00,066 INFO L279 CegarLoopForPetriNet]: 425 programPoint places, -16 predicate places. [2025-03-08 22:05:00,066 INFO L471 AbstractCegarLoop]: Abstraction has has 409 places, 396 transitions, 891 flow [2025-03-08 22:05:00,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 429.0) internal successors, (1287), 3 states have internal predecessors, (1287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:00,066 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:00,067 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:05:00,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 22:05:00,067 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-08 22:05:00,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:00,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1095718236, now seen corresponding path program 1 times [2025-03-08 22:05:00,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:00,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903770236] [2025-03-08 22:05:00,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:00,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:00,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 341 statements into 1 equivalence classes. [2025-03-08 22:05:00,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 341 of 341 statements. [2025-03-08 22:05:00,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:00,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:00,134 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-08 22:05:00,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:00,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903770236] [2025-03-08 22:05:00,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903770236] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:00,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:00,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:00,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327822402] [2025-03-08 22:05:00,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:00,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:00,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:00,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:00,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:00,144 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 454 [2025-03-08 22:05:00,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 396 transitions, 891 flow. Second operand has 3 states, 3 states have (on average 429.0) internal successors, (1287), 3 states have internal predecessors, (1287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:00,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:00,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 454 [2025-03-08 22:05:00,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:00,277 INFO L124 PetriNetUnfolderBase]: 50/1171 cut-off events. [2025-03-08 22:05:00,277 INFO L125 PetriNetUnfolderBase]: For 10/16 co-relation queries the response was YES. [2025-03-08 22:05:00,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1374 conditions, 1171 events. 50/1171 cut-off events. For 10/16 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 5821 event pairs, 5 based on Foata normal form. 1/1103 useless extension candidates. Maximal degree in co-relation 1349. Up to 36 conditions per place. [2025-03-08 22:05:00,284 INFO L140 encePairwiseOnDemand]: 451/454 looper letters, 0 selfloop transitions, 0 changer transitions 394/394 dead transitions. [2025-03-08 22:05:00,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 394 transitions, 907 flow [2025-03-08 22:05:00,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:00,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:00,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1290 transitions. [2025-03-08 22:05:00,286 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.947136563876652 [2025-03-08 22:05:00,286 INFO L175 Difference]: Start difference. First operand has 409 places, 396 transitions, 891 flow. Second operand 3 states and 1290 transitions. [2025-03-08 22:05:00,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 394 transitions, 907 flow [2025-03-08 22:05:00,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 408 places, 394 transitions, 906 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:05:00,289 INFO L231 Difference]: Finished difference. Result has 408 places, 0 transitions, 0 flow [2025-03-08 22:05:00,290 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=886, PETRI_DIFFERENCE_MINUEND_PLACES=406, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=394, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=394, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=408, PETRI_TRANSITIONS=0} [2025-03-08 22:05:00,290 INFO L279 CegarLoopForPetriNet]: 425 programPoint places, -17 predicate places. [2025-03-08 22:05:00,290 INFO L471 AbstractCegarLoop]: Abstraction has has 408 places, 0 transitions, 0 flow [2025-03-08 22:05:00,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 429.0) internal successors, (1287), 3 states have internal predecessors, (1287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:00,292 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (70 of 71 remaining) [2025-03-08 22:05:00,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (69 of 71 remaining) [2025-03-08 22:05:00,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (68 of 71 remaining) [2025-03-08 22:05:00,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (67 of 71 remaining) [2025-03-08 22:05:00,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (66 of 71 remaining) [2025-03-08 22:05:00,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (65 of 71 remaining) [2025-03-08 22:05:00,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (64 of 71 remaining) [2025-03-08 22:05:00,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (63 of 71 remaining) [2025-03-08 22:05:00,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (62 of 71 remaining) [2025-03-08 22:05:00,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (61 of 71 remaining) [2025-03-08 22:05:00,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (60 of 71 remaining) [2025-03-08 22:05:00,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (59 of 71 remaining) [2025-03-08 22:05:00,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (58 of 71 remaining) [2025-03-08 22:05:00,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (57 of 71 remaining) [2025-03-08 22:05:00,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (56 of 71 remaining) [2025-03-08 22:05:00,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (55 of 71 remaining) [2025-03-08 22:05:00,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (54 of 71 remaining) [2025-03-08 22:05:00,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (53 of 71 remaining) [2025-03-08 22:05:00,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (52 of 71 remaining) [2025-03-08 22:05:00,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (51 of 71 remaining) [2025-03-08 22:05:00,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (50 of 71 remaining) [2025-03-08 22:05:00,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (49 of 71 remaining) [2025-03-08 22:05:00,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (48 of 71 remaining) [2025-03-08 22:05:00,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (47 of 71 remaining) [2025-03-08 22:05:00,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (46 of 71 remaining) [2025-03-08 22:05:00,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (45 of 71 remaining) [2025-03-08 22:05:00,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (44 of 71 remaining) [2025-03-08 22:05:00,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (43 of 71 remaining) [2025-03-08 22:05:00,294 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (42 of 71 remaining) [2025-03-08 22:05:00,294 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (41 of 71 remaining) [2025-03-08 22:05:00,294 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (40 of 71 remaining) [2025-03-08 22:05:00,294 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (39 of 71 remaining) [2025-03-08 22:05:00,294 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (38 of 71 remaining) [2025-03-08 22:05:00,294 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (37 of 71 remaining) [2025-03-08 22:05:00,294 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (36 of 71 remaining) [2025-03-08 22:05:00,294 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (35 of 71 remaining) [2025-03-08 22:05:00,294 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (34 of 71 remaining) [2025-03-08 22:05:00,294 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (33 of 71 remaining) [2025-03-08 22:05:00,294 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (32 of 71 remaining) [2025-03-08 22:05:00,294 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (31 of 71 remaining) [2025-03-08 22:05:00,294 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (30 of 71 remaining) [2025-03-08 22:05:00,294 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 71 remaining) [2025-03-08 22:05:00,294 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 71 remaining) [2025-03-08 22:05:00,294 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 71 remaining) [2025-03-08 22:05:00,294 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (26 of 71 remaining) [2025-03-08 22:05:00,294 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (25 of 71 remaining) [2025-03-08 22:05:00,294 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (24 of 71 remaining) [2025-03-08 22:05:00,294 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (23 of 71 remaining) [2025-03-08 22:05:00,294 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (22 of 71 remaining) [2025-03-08 22:05:00,294 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (21 of 71 remaining) [2025-03-08 22:05:00,294 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (20 of 71 remaining) [2025-03-08 22:05:00,294 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (19 of 71 remaining) [2025-03-08 22:05:00,294 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (18 of 71 remaining) [2025-03-08 22:05:00,294 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (17 of 71 remaining) [2025-03-08 22:05:00,294 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (16 of 71 remaining) [2025-03-08 22:05:00,295 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (15 of 71 remaining) [2025-03-08 22:05:00,295 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (14 of 71 remaining) [2025-03-08 22:05:00,295 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (13 of 71 remaining) [2025-03-08 22:05:00,295 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (12 of 71 remaining) [2025-03-08 22:05:00,295 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (11 of 71 remaining) [2025-03-08 22:05:00,295 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (10 of 71 remaining) [2025-03-08 22:05:00,295 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (9 of 71 remaining) [2025-03-08 22:05:00,295 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (8 of 71 remaining) [2025-03-08 22:05:00,295 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (7 of 71 remaining) [2025-03-08 22:05:00,296 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (6 of 71 remaining) [2025-03-08 22:05:00,296 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (5 of 71 remaining) [2025-03-08 22:05:00,296 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (4 of 71 remaining) [2025-03-08 22:05:00,296 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (3 of 71 remaining) [2025-03-08 22:05:00,296 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (2 of 71 remaining) [2025-03-08 22:05:00,296 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (1 of 71 remaining) [2025-03-08 22:05:00,296 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (0 of 71 remaining) [2025-03-08 22:05:00,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 22:05:00,296 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] [2025-03-08 22:05:00,301 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-08 22:05:00,301 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 22:05:00,306 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 10:05:00 BasicIcfg [2025-03-08 22:05:00,306 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 22:05:00,306 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 22:05:00,307 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 22:05:00,307 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 22:05:00,307 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:04:54" (3/4) ... [2025-03-08 22:05:00,308 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 22:05:00,310 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-08 22:05:00,310 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-08 22:05:00,310 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-03-08 22:05:00,314 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2025-03-08 22:05:00,315 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-08 22:05:00,315 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 22:05:00,315 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 22:05:00,384 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 22:05:00,384 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 22:05:00,384 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 22:05:00,385 INFO L158 Benchmark]: Toolchain (without parser) took 6930.71ms. Allocated memory was 167.8MB in the beginning and 536.9MB in the end (delta: 369.1MB). Free memory was 124.1MB in the beginning and 458.6MB in the end (delta: -334.6MB). Peak memory consumption was 34.0MB. Max. memory is 16.1GB. [2025-03-08 22:05:00,385 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 116.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:05:00,386 INFO L158 Benchmark]: CACSL2BoogieTranslator took 198.86ms. Allocated memory is still 167.8MB. Free memory was 124.1MB in the beginning and 112.2MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 22:05:00,386 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.14ms. Allocated memory is still 167.8MB. Free memory was 112.2MB in the beginning and 109.9MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 22:05:00,386 INFO L158 Benchmark]: Boogie Preprocessor took 20.30ms. Allocated memory is still 167.8MB. Free memory was 109.9MB in the beginning and 107.9MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:05:00,386 INFO L158 Benchmark]: IcfgBuilder took 500.80ms. Allocated memory is still 167.8MB. Free memory was 107.9MB in the beginning and 77.4MB in the end (delta: 30.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 22:05:00,387 INFO L158 Benchmark]: TraceAbstraction took 6088.84ms. Allocated memory was 167.8MB in the beginning and 536.9MB in the end (delta: 369.1MB). Free memory was 76.4MB in the beginning and 467.0MB in the end (delta: -390.6MB). Peak memory consumption was 260.5MB. Max. memory is 16.1GB. [2025-03-08 22:05:00,387 INFO L158 Benchmark]: Witness Printer took 77.72ms. Allocated memory is still 536.9MB. Free memory was 467.0MB in the beginning and 458.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 22:05:00,388 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.14ms. Allocated memory is still 201.3MB. Free memory is still 116.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 198.86ms. Allocated memory is still 167.8MB. Free memory was 124.1MB in the beginning and 112.2MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.14ms. Allocated memory is still 167.8MB. Free memory was 112.2MB in the beginning and 109.9MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.30ms. Allocated memory is still 167.8MB. Free memory was 109.9MB in the beginning and 107.9MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 500.80ms. Allocated memory is still 167.8MB. Free memory was 107.9MB in the beginning and 77.4MB in the end (delta: 30.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 6088.84ms. Allocated memory was 167.8MB in the beginning and 536.9MB in the end (delta: 369.1MB). Free memory was 76.4MB in the beginning and 467.0MB in the end (delta: -390.6MB). Peak memory consumption was 260.5MB. Max. memory is 16.1GB. * Witness Printer took 77.72ms. Allocated memory is still 536.9MB. Free memory was 467.0MB in the beginning and 458.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: 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: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 88]: 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: 88]: 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, 710 locations, 742 edges, 71 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: 5.9s, OverallIterations: 24, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 527 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 168 mSDsluCounter, 129 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 84 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 642 IncrementalHoareTripleChecker+Invalid, 726 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 84 mSolverCounterUnsat, 129 mSDtfsCounter, 642 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=902occurred in iteration=19, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 3270 NumberOfCodeBlocks, 3270 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 3246 ConstructedInterpolants, 0 QuantifiedInterpolants, 3294 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 41 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-08 22:05:00,404 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE