./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-chromosome-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version f8ab0bd5 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-chromosome-symm.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 23ca06a4d1d66eab783b29fc3ce31114eee62eb7d17a2452b84e2d73b8d92cfa --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 22:22:51,436 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 22:22:51,491 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-13 22:22:51,495 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 22:22:51,495 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 22:22:51,511 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 22:22:51,512 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 22:22:51,512 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 22:22:51,512 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 22:22:51,512 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 22:22:51,512 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 22:22:51,512 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 22:22:51,512 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 22:22:51,512 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 22:22:51,512 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 22:22:51,512 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 22:22:51,513 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 22:22:51,513 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 22:22:51,513 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 22:22:51,513 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 22:22:51,513 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 22:22:51,513 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 22:22:51,513 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-13 22:22:51,513 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-13 22:22:51,513 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 22:22:51,513 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 22:22:51,513 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 22:22:51,513 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 22:22:51,513 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 22:22:51,514 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 22:22:51,514 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 22:22:51,514 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:22:51,514 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 22:22:51,514 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 22:22:51,514 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 22:22:51,514 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 22:22:51,514 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 22:22:51,514 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 22:22:51,514 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 22:22:51,514 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 22:22:51,514 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 22:22:51,514 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 22:22:51,514 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 -> 23ca06a4d1d66eab783b29fc3ce31114eee62eb7d17a2452b84e2d73b8d92cfa [2025-03-13 22:22:51,737 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 22:22:51,746 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 22:22:51,748 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 22:22:51,749 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 22:22:51,749 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 22:22:51,750 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-chromosome-symm.wvr.c [2025-03-13 22:22:52,863 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74da9958f/a7a0e4e50cf34c38ade11a1d3c338723/FLAG53e51e711 [2025-03-13 22:22:53,101 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 22:22:53,103 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-chromosome-symm.wvr.c [2025-03-13 22:22:53,110 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74da9958f/a7a0e4e50cf34c38ade11a1d3c338723/FLAG53e51e711 [2025-03-13 22:22:53,435 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74da9958f/a7a0e4e50cf34c38ade11a1d3c338723 [2025-03-13 22:22:53,437 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 22:22:53,438 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 22:22:53,440 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 22:22:53,440 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 22:22:53,444 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 22:22:53,445 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:22:53" (1/1) ... [2025-03-13 22:22:53,445 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b86135f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:22:53, skipping insertion in model container [2025-03-13 22:22:53,445 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:22:53" (1/1) ... [2025-03-13 22:22:53,460 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 22:22:53,598 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:22:53,605 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 22:22:53,623 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:22:53,633 INFO L204 MainTranslator]: Completed translation [2025-03-13 22:22:53,634 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:22:53 WrapperNode [2025-03-13 22:22:53,634 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 22:22:53,635 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 22:22:53,635 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 22:22:53,636 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 22:22:53,641 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:22:53" (1/1) ... [2025-03-13 22:22:53,647 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:22:53" (1/1) ... [2025-03-13 22:22:53,671 INFO L138 Inliner]: procedures = 24, calls = 28, calls flagged for inlining = 16, calls inlined = 20, statements flattened = 311 [2025-03-13 22:22:53,671 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 22:22:53,672 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 22:22:53,672 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 22:22:53,672 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 22:22:53,680 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:22:53" (1/1) ... [2025-03-13 22:22:53,680 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:22:53" (1/1) ... [2025-03-13 22:22:53,683 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:22:53" (1/1) ... [2025-03-13 22:22:53,685 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:22:53" (1/1) ... [2025-03-13 22:22:53,695 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:22:53" (1/1) ... [2025-03-13 22:22:53,697 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:22:53" (1/1) ... [2025-03-13 22:22:53,700 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:22:53" (1/1) ... [2025-03-13 22:22:53,701 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:22:53" (1/1) ... [2025-03-13 22:22:53,703 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 22:22:53,703 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 22:22:53,705 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 22:22:53,705 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 22:22:53,706 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:22:53" (1/1) ... [2025-03-13 22:22:53,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:22:53,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:22:53,731 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-13 22:22:53,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-13 22:22:53,752 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 22:22:53,752 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-13 22:22:53,752 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-13 22:22:53,752 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-13 22:22:53,752 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-13 22:22:53,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-13 22:22:53,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-13 22:22:53,752 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-13 22:22:53,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 22:22:53,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 22:22:53,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-13 22:22:53,753 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 22:22:53,843 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 22:22:53,845 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 22:22:54,332 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 22:22:54,333 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 22:22:54,333 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 22:22:54,349 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 22:22:54,350 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:22:54 BoogieIcfgContainer [2025-03-13 22:22:54,350 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 22:22:54,351 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 22:22:54,351 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 22:22:54,354 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 22:22:54,355 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 10:22:53" (1/3) ... [2025-03-13 22:22:54,355 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11f07b45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:22:54, skipping insertion in model container [2025-03-13 22:22:54,355 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:22:53" (2/3) ... [2025-03-13 22:22:54,355 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11f07b45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:22:54, skipping insertion in model container [2025-03-13 22:22:54,355 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:22:54" (3/3) ... [2025-03-13 22:22:54,356 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-chromosome-symm.wvr.c [2025-03-13 22:22:54,366 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 22:22:54,367 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-chromosome-symm.wvr.c that has 3 procedures, 406 locations, 1 initial locations, 4 loop locations, and 34 error locations. [2025-03-13 22:22:54,367 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 22:22:54,490 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-13 22:22:54,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 412 places, 427 transitions, 868 flow [2025-03-13 22:22:54,683 INFO L124 PetriNetUnfolderBase]: 22/425 cut-off events. [2025-03-13 22:22:54,690 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 22:22:54,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 434 conditions, 425 events. 22/425 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 704 event pairs, 0 based on Foata normal form. 0/369 useless extension candidates. Maximal degree in co-relation 254. Up to 2 conditions per place. [2025-03-13 22:22:54,695 INFO L82 GeneralOperation]: Start removeDead. Operand has 412 places, 427 transitions, 868 flow [2025-03-13 22:22:54,703 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 392 places, 405 transitions, 822 flow [2025-03-13 22:22:54,710 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:22:54,720 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;@5621838b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:22:54,721 INFO L334 AbstractCegarLoop]: Starting to check reachability of 58 error locations. [2025-03-13 22:22:54,732 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:22:54,732 INFO L124 PetriNetUnfolderBase]: 2/59 cut-off events. [2025-03-13 22:22:54,732 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:22:54,733 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:22:54,733 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:22:54,733 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-13 22:22:54,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:22:54,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1422279367, now seen corresponding path program 1 times [2025-03-13 22:22:54,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:22:54,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026335886] [2025-03-13 22:22:54,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:22:54,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:22:54,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-13 22:22:54,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-13 22:22:54,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:22:54,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:22:55,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:22:55,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:22:55,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026335886] [2025-03-13 22:22:55,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026335886] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:22:55,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:22:55,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:22:55,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789987882] [2025-03-13 22:22:55,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:22:55,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:22:55,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:22:55,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:22:55,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:22:55,649 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 365 out of 427 [2025-03-13 22:22:55,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 392 places, 405 transitions, 822 flow. Second operand has 6 states, 6 states have (on average 366.5) internal successors, (2199), 6 states have internal predecessors, (2199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:22:55,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:22:55,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 365 of 427 [2025-03-13 22:22:55,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:22:55,883 INFO L124 PetriNetUnfolderBase]: 131/1616 cut-off events. [2025-03-13 22:22:55,883 INFO L125 PetriNetUnfolderBase]: For 69/70 co-relation queries the response was YES. [2025-03-13 22:22:55,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1893 conditions, 1616 events. 131/1616 cut-off events. For 69/70 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 10232 event pairs, 80 based on Foata normal form. 56/1430 useless extension candidates. Maximal degree in co-relation 1531. Up to 224 conditions per place. [2025-03-13 22:22:55,896 INFO L140 encePairwiseOnDemand]: 403/427 looper letters, 36 selfloop transitions, 10 changer transitions 6/391 dead transitions. [2025-03-13 22:22:55,896 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 395 places, 391 transitions, 886 flow [2025-03-13 22:22:55,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:22:55,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:22:55,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2250 transitions. [2025-03-13 22:22:55,919 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8782201405152225 [2025-03-13 22:22:55,922 INFO L175 Difference]: Start difference. First operand has 392 places, 405 transitions, 822 flow. Second operand 6 states and 2250 transitions. [2025-03-13 22:22:55,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 395 places, 391 transitions, 886 flow [2025-03-13 22:22:55,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 391 places, 391 transitions, 878 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-13 22:22:55,937 INFO L231 Difference]: Finished difference. Result has 391 places, 385 transitions, 794 flow [2025-03-13 22:22:55,940 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=786, PETRI_DIFFERENCE_MINUEND_PLACES=386, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=391, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=381, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=794, PETRI_PLACES=391, PETRI_TRANSITIONS=385} [2025-03-13 22:22:55,944 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -1 predicate places. [2025-03-13 22:22:55,945 INFO L471 AbstractCegarLoop]: Abstraction has has 391 places, 385 transitions, 794 flow [2025-03-13 22:22:55,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 366.5) internal successors, (2199), 6 states have internal predecessors, (2199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:22:55,947 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:22:55,947 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:22:55,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 22:22:55,947 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-13 22:22:55,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:22:55,948 INFO L85 PathProgramCache]: Analyzing trace with hash -321221636, now seen corresponding path program 1 times [2025-03-13 22:22:55,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:22:55,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445176334] [2025-03-13 22:22:55,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:22:55,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:22:55,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-13 22:22:55,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-13 22:22:55,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:22:55,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:22:55,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:22:55,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:22:55,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445176334] [2025-03-13 22:22:55,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445176334] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:22:55,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:22:55,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:22:55,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608658061] [2025-03-13 22:22:55,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:22:55,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:22:55,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:22:55,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:22:55,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:22:56,013 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 427 [2025-03-13 22:22:56,014 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 391 places, 385 transitions, 794 flow. Second operand has 3 states, 3 states have (on average 401.3333333333333) internal successors, (1204), 3 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:22:56,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:22:56,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 427 [2025-03-13 22:22:56,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:22:56,069 INFO L124 PetriNetUnfolderBase]: 13/491 cut-off events. [2025-03-13 22:22:56,070 INFO L125 PetriNetUnfolderBase]: For 2/3 co-relation queries the response was YES. [2025-03-13 22:22:56,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 524 conditions, 491 events. 13/491 cut-off events. For 2/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1302 event pairs, 3 based on Foata normal form. 0/430 useless extension candidates. Maximal degree in co-relation 491. Up to 16 conditions per place. [2025-03-13 22:22:56,073 INFO L140 encePairwiseOnDemand]: 424/427 looper letters, 9 selfloop transitions, 2 changer transitions 0/384 dead transitions. [2025-03-13 22:22:56,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 384 transitions, 814 flow [2025-03-13 22:22:56,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:22:56,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:22:56,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1212 transitions. [2025-03-13 22:22:56,075 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9461358313817331 [2025-03-13 22:22:56,075 INFO L175 Difference]: Start difference. First operand has 391 places, 385 transitions, 794 flow. Second operand 3 states and 1212 transitions. [2025-03-13 22:22:56,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 384 transitions, 814 flow [2025-03-13 22:22:56,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 381 places, 384 transitions, 794 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:22:56,091 INFO L231 Difference]: Finished difference. Result has 381 places, 384 transitions, 776 flow [2025-03-13 22:22:56,091 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=772, PETRI_DIFFERENCE_MINUEND_PLACES=379, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=382, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=776, PETRI_PLACES=381, PETRI_TRANSITIONS=384} [2025-03-13 22:22:56,092 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -11 predicate places. [2025-03-13 22:22:56,092 INFO L471 AbstractCegarLoop]: Abstraction has has 381 places, 384 transitions, 776 flow [2025-03-13 22:22:56,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 401.3333333333333) internal successors, (1204), 3 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:22:56,093 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:22:56,093 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] [2025-03-13 22:22:56,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 22:22:56,093 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-13 22:22:56,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:22:56,094 INFO L85 PathProgramCache]: Analyzing trace with hash 44884469, now seen corresponding path program 1 times [2025-03-13 22:22:56,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:22:56,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572469889] [2025-03-13 22:22:56,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:22:56,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:22:56,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-13 22:22:56,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-13 22:22:56,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:22:56,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:22:56,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:22:56,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:22:56,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572469889] [2025-03-13 22:22:56,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572469889] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:22:56,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:22:56,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:22:56,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616084948] [2025-03-13 22:22:56,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:22:56,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:22:56,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:22:56,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:22:56,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:22:56,159 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 427 [2025-03-13 22:22:56,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 381 places, 384 transitions, 776 flow. Second operand has 3 states, 3 states have (on average 401.3333333333333) internal successors, (1204), 3 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:22:56,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:22:56,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 427 [2025-03-13 22:22:56,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:22:56,214 INFO L124 PetriNetUnfolderBase]: 16/569 cut-off events. [2025-03-13 22:22:56,214 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-03-13 22:22:56,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 596 conditions, 569 events. 16/569 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1505 event pairs, 3 based on Foata normal form. 0/495 useless extension candidates. Maximal degree in co-relation 527. Up to 18 conditions per place. [2025-03-13 22:22:56,217 INFO L140 encePairwiseOnDemand]: 424/427 looper letters, 9 selfloop transitions, 2 changer transitions 0/383 dead transitions. [2025-03-13 22:22:56,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 383 transitions, 796 flow [2025-03-13 22:22:56,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:22:56,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:22:56,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1212 transitions. [2025-03-13 22:22:56,219 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9461358313817331 [2025-03-13 22:22:56,219 INFO L175 Difference]: Start difference. First operand has 381 places, 384 transitions, 776 flow. Second operand 3 states and 1212 transitions. [2025-03-13 22:22:56,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 382 places, 383 transitions, 796 flow [2025-03-13 22:22:56,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 380 places, 383 transitions, 792 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:22:56,225 INFO L231 Difference]: Finished difference. Result has 380 places, 383 transitions, 774 flow [2025-03-13 22:22:56,226 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=770, PETRI_DIFFERENCE_MINUEND_PLACES=378, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=383, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=381, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=774, PETRI_PLACES=380, PETRI_TRANSITIONS=383} [2025-03-13 22:22:56,227 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -12 predicate places. [2025-03-13 22:22:56,227 INFO L471 AbstractCegarLoop]: Abstraction has has 380 places, 383 transitions, 774 flow [2025-03-13 22:22:56,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 401.3333333333333) internal successors, (1204), 3 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:22:56,228 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:22:56,228 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:22:56,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 22:22:56,229 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-13 22:22:56,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:22:56,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1255992840, now seen corresponding path program 1 times [2025-03-13 22:22:56,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:22:56,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795762307] [2025-03-13 22:22:56,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:22:56,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:22:56,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-13 22:22:56,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-13 22:22:56,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:22:56,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:22:56,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:22:56,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:22:56,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795762307] [2025-03-13 22:22:56,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795762307] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:22:56,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:22:56,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:22:56,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279895473] [2025-03-13 22:22:56,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:22:56,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:22:56,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:22:56,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:22:56,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:22:56,293 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 427 [2025-03-13 22:22:56,295 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 383 transitions, 774 flow. Second operand has 3 states, 3 states have (on average 401.3333333333333) internal successors, (1204), 3 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:22:56,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:22:56,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 427 [2025-03-13 22:22:56,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:22:56,352 INFO L124 PetriNetUnfolderBase]: 15/584 cut-off events. [2025-03-13 22:22:56,352 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 22:22:56,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 609 conditions, 584 events. 15/584 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1827 event pairs, 3 based on Foata normal form. 0/508 useless extension candidates. Maximal degree in co-relation 493. Up to 16 conditions per place. [2025-03-13 22:22:56,354 INFO L140 encePairwiseOnDemand]: 424/427 looper letters, 9 selfloop transitions, 2 changer transitions 0/382 dead transitions. [2025-03-13 22:22:56,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 382 transitions, 794 flow [2025-03-13 22:22:56,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:22:56,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:22:56,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1212 transitions. [2025-03-13 22:22:56,357 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9461358313817331 [2025-03-13 22:22:56,358 INFO L175 Difference]: Start difference. First operand has 380 places, 383 transitions, 774 flow. Second operand 3 states and 1212 transitions. [2025-03-13 22:22:56,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 381 places, 382 transitions, 794 flow [2025-03-13 22:22:56,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 379 places, 382 transitions, 790 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:22:56,362 INFO L231 Difference]: Finished difference. Result has 379 places, 382 transitions, 772 flow [2025-03-13 22:22:56,362 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=768, PETRI_DIFFERENCE_MINUEND_PLACES=377, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=380, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=772, PETRI_PLACES=379, PETRI_TRANSITIONS=382} [2025-03-13 22:22:56,363 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -13 predicate places. [2025-03-13 22:22:56,363 INFO L471 AbstractCegarLoop]: Abstraction has has 379 places, 382 transitions, 772 flow [2025-03-13 22:22:56,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 401.3333333333333) internal successors, (1204), 3 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:22:56,364 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:22:56,364 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] [2025-03-13 22:22:56,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 22:22:56,364 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-13 22:22:56,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:22:56,365 INFO L85 PathProgramCache]: Analyzing trace with hash -556349842, now seen corresponding path program 1 times [2025-03-13 22:22:56,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:22:56,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506919545] [2025-03-13 22:22:56,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:22:56,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:22:56,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-13 22:22:56,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-13 22:22:56,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:22:56,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:22:56,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:22:56,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:22:56,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506919545] [2025-03-13 22:22:56,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506919545] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:22:56,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:22:56,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:22:56,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145308373] [2025-03-13 22:22:56,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:22:56,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:22:56,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:22:56,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:22:56,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:22:56,443 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 427 [2025-03-13 22:22:56,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 379 places, 382 transitions, 772 flow. Second operand has 3 states, 3 states have (on average 401.3333333333333) internal successors, (1204), 3 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:22:56,444 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:22:56,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 427 [2025-03-13 22:22:56,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:22:56,503 INFO L124 PetriNetUnfolderBase]: 15/586 cut-off events. [2025-03-13 22:22:56,503 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-03-13 22:22:56,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 611 conditions, 586 events. 15/586 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1690 event pairs, 3 based on Foata normal form. 0/510 useless extension candidates. Maximal degree in co-relation 487. Up to 16 conditions per place. [2025-03-13 22:22:56,507 INFO L140 encePairwiseOnDemand]: 424/427 looper letters, 9 selfloop transitions, 2 changer transitions 0/381 dead transitions. [2025-03-13 22:22:56,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 380 places, 381 transitions, 792 flow [2025-03-13 22:22:56,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:22:56,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:22:56,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1212 transitions. [2025-03-13 22:22:56,510 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9461358313817331 [2025-03-13 22:22:56,510 INFO L175 Difference]: Start difference. First operand has 379 places, 382 transitions, 772 flow. Second operand 3 states and 1212 transitions. [2025-03-13 22:22:56,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 380 places, 381 transitions, 792 flow [2025-03-13 22:22:56,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 381 transitions, 788 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:22:56,514 INFO L231 Difference]: Finished difference. Result has 378 places, 381 transitions, 770 flow [2025-03-13 22:22:56,515 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=766, PETRI_DIFFERENCE_MINUEND_PLACES=376, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=381, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=379, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=770, PETRI_PLACES=378, PETRI_TRANSITIONS=381} [2025-03-13 22:22:56,515 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -14 predicate places. [2025-03-13 22:22:56,517 INFO L471 AbstractCegarLoop]: Abstraction has has 378 places, 381 transitions, 770 flow [2025-03-13 22:22:56,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 401.3333333333333) internal successors, (1204), 3 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:22:56,517 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:22:56,518 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] [2025-03-13 22:22:56,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 22:22:56,518 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-13 22:22:56,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:22:56,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1619682911, now seen corresponding path program 1 times [2025-03-13 22:22:56,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:22:56,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525277182] [2025-03-13 22:22:56,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:22:56,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:22:56,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-13 22:22:56,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-13 22:22:56,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:22:56,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:22:56,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:22:56,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:22:56,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525277182] [2025-03-13 22:22:56,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525277182] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:22:56,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:22:56,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:22:56,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119363800] [2025-03-13 22:22:56,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:22:56,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:22:56,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:22:56,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:22:56,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:22:56,572 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 402 out of 427 [2025-03-13 22:22:56,573 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 381 transitions, 770 flow. Second operand has 3 states, 3 states have (on average 403.3333333333333) internal successors, (1210), 3 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:22:56,573 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:22:56,573 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 402 of 427 [2025-03-13 22:22:56,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:22:56,634 INFO L124 PetriNetUnfolderBase]: 26/858 cut-off events. [2025-03-13 22:22:56,634 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-13 22:22:56,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 892 conditions, 858 events. 26/858 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 3694 event pairs, 5 based on Foata normal form. 0/745 useless extension candidates. Maximal degree in co-relation 760. Up to 22 conditions per place. [2025-03-13 22:22:56,639 INFO L140 encePairwiseOnDemand]: 423/427 looper letters, 10 selfloop transitions, 2 changer transitions 0/382 dead transitions. [2025-03-13 22:22:56,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 382 transitions, 797 flow [2025-03-13 22:22:56,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:22:56,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:22:56,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1220 transitions. [2025-03-13 22:22:56,642 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9523809523809523 [2025-03-13 22:22:56,642 INFO L175 Difference]: Start difference. First operand has 378 places, 381 transitions, 770 flow. Second operand 3 states and 1220 transitions. [2025-03-13 22:22:56,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 382 transitions, 797 flow [2025-03-13 22:22:56,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 376 places, 382 transitions, 793 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:22:56,647 INFO L231 Difference]: Finished difference. Result has 377 places, 381 transitions, 776 flow [2025-03-13 22:22:56,648 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=762, PETRI_DIFFERENCE_MINUEND_PLACES=374, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=776, PETRI_PLACES=377, PETRI_TRANSITIONS=381} [2025-03-13 22:22:56,648 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -15 predicate places. [2025-03-13 22:22:56,648 INFO L471 AbstractCegarLoop]: Abstraction has has 377 places, 381 transitions, 776 flow [2025-03-13 22:22:56,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 403.3333333333333) internal successors, (1210), 3 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:22:56,649 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:22:56,649 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] [2025-03-13 22:22:56,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 22:22:56,649 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-13 22:22:56,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:22:56,650 INFO L85 PathProgramCache]: Analyzing trace with hash -905813716, now seen corresponding path program 1 times [2025-03-13 22:22:56,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:22:56,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85720442] [2025-03-13 22:22:56,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:22:56,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:22:56,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-13 22:22:56,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-13 22:22:56,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:22:56,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:22:56,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:22:56,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:22:56,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85720442] [2025-03-13 22:22:56,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85720442] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:22:56,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:22:56,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:22:56,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771465141] [2025-03-13 22:22:56,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:22:56,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:22:56,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:22:56,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:22:56,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:22:56,705 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 402 out of 427 [2025-03-13 22:22:56,706 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 381 transitions, 776 flow. Second operand has 3 states, 3 states have (on average 403.6666666666667) internal successors, (1211), 3 states have internal predecessors, (1211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:22:56,706 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:22:56,706 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 402 of 427 [2025-03-13 22:22:56,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:22:56,764 INFO L124 PetriNetUnfolderBase]: 27/835 cut-off events. [2025-03-13 22:22:56,764 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2025-03-13 22:22:56,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 874 conditions, 835 events. 27/835 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3876 event pairs, 3 based on Foata normal form. 0/731 useless extension candidates. Maximal degree in co-relation 642. Up to 22 conditions per place. [2025-03-13 22:22:56,768 INFO L140 encePairwiseOnDemand]: 423/427 looper letters, 10 selfloop transitions, 2 changer transitions 0/382 dead transitions. [2025-03-13 22:22:56,769 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 382 transitions, 803 flow [2025-03-13 22:22:56,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:22:56,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:22:56,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1220 transitions. [2025-03-13 22:22:56,771 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9523809523809523 [2025-03-13 22:22:56,771 INFO L175 Difference]: Start difference. First operand has 377 places, 381 transitions, 776 flow. Second operand 3 states and 1220 transitions. [2025-03-13 22:22:56,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 382 transitions, 803 flow [2025-03-13 22:22:56,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 377 places, 382 transitions, 803 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:22:56,775 INFO L231 Difference]: Finished difference. Result has 378 places, 381 transitions, 786 flow [2025-03-13 22:22:56,775 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=772, PETRI_DIFFERENCE_MINUEND_PLACES=375, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=786, PETRI_PLACES=378, PETRI_TRANSITIONS=381} [2025-03-13 22:22:56,776 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -14 predicate places. [2025-03-13 22:22:56,776 INFO L471 AbstractCegarLoop]: Abstraction has has 378 places, 381 transitions, 786 flow [2025-03-13 22:22:56,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 403.6666666666667) internal successors, (1211), 3 states have internal predecessors, (1211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:22:56,777 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:22:56,777 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-13 22:22:56,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 22:22:56,777 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-13 22:22:56,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:22:56,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1777969626, now seen corresponding path program 1 times [2025-03-13 22:22:56,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:22:56,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410655851] [2025-03-13 22:22:56,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:22:56,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:22:56,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-13 22:22:56,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-13 22:22:56,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:22:56,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:22:56,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:22:56,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:22:56,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410655851] [2025-03-13 22:22:56,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410655851] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:22:56,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:22:56,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:22:56,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061203106] [2025-03-13 22:22:56,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:22:56,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:22:56,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:22:56,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:22:56,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:22:56,837 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 397 out of 427 [2025-03-13 22:22:56,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 381 transitions, 786 flow. Second operand has 3 states, 3 states have (on average 398.3333333333333) internal successors, (1195), 3 states have internal predecessors, (1195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:22:56,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:22:56,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 397 of 427 [2025-03-13 22:22:56,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:22:56,888 INFO L124 PetriNetUnfolderBase]: 25/649 cut-off events. [2025-03-13 22:22:56,888 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 22:22:56,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 716 conditions, 649 events. 25/649 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2506 event pairs, 6 based on Foata normal form. 0/575 useless extension candidates. Maximal degree in co-relation 484. Up to 33 conditions per place. [2025-03-13 22:22:56,892 INFO L140 encePairwiseOnDemand]: 424/427 looper letters, 14 selfloop transitions, 2 changer transitions 0/381 dead transitions. [2025-03-13 22:22:56,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 381 transitions, 819 flow [2025-03-13 22:22:56,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:22:56,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:22:56,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1208 transitions. [2025-03-13 22:22:56,895 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9430132708821234 [2025-03-13 22:22:56,895 INFO L175 Difference]: Start difference. First operand has 378 places, 381 transitions, 786 flow. Second operand 3 states and 1208 transitions. [2025-03-13 22:22:56,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 381 transitions, 819 flow [2025-03-13 22:22:56,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 379 places, 381 transitions, 819 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:22:56,899 INFO L231 Difference]: Finished difference. Result has 379 places, 380 transitions, 788 flow [2025-03-13 22:22:56,900 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=784, PETRI_DIFFERENCE_MINUEND_PLACES=377, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=378, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=788, PETRI_PLACES=379, PETRI_TRANSITIONS=380} [2025-03-13 22:22:56,900 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -13 predicate places. [2025-03-13 22:22:56,901 INFO L471 AbstractCegarLoop]: Abstraction has has 379 places, 380 transitions, 788 flow [2025-03-13 22:22:56,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 398.3333333333333) internal successors, (1195), 3 states have internal predecessors, (1195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:22:56,901 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:22:56,901 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:22:56,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 22:22:56,902 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-13 22:22:56,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:22:56,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1870077388, now seen corresponding path program 1 times [2025-03-13 22:22:56,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:22:56,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083024487] [2025-03-13 22:22:56,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:22:56,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:22:56,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-13 22:22:56,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-13 22:22:56,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:22:56,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:22:56,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:22:56,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:22:56,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083024487] [2025-03-13 22:22:56,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083024487] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:22:56,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:22:56,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:22:56,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545553664] [2025-03-13 22:22:56,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:22:56,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:22:56,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:22:56,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:22:56,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:22:56,966 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 402 out of 427 [2025-03-13 22:22:56,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 379 places, 380 transitions, 788 flow. Second operand has 3 states, 3 states have (on average 403.3333333333333) internal successors, (1210), 3 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:22:56,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:22:56,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 402 of 427 [2025-03-13 22:22:56,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:22:57,053 INFO L124 PetriNetUnfolderBase]: 43/1091 cut-off events. [2025-03-13 22:22:57,054 INFO L125 PetriNetUnfolderBase]: For 9/10 co-relation queries the response was YES. [2025-03-13 22:22:57,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1163 conditions, 1091 events. 43/1091 cut-off events. For 9/10 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 5186 event pairs, 2 based on Foata normal form. 0/948 useless extension candidates. Maximal degree in co-relation 898. Up to 41 conditions per place. [2025-03-13 22:22:57,060 INFO L140 encePairwiseOnDemand]: 423/427 looper letters, 12 selfloop transitions, 2 changer transitions 0/383 dead transitions. [2025-03-13 22:22:57,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 383 transitions, 825 flow [2025-03-13 22:22:57,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:22:57,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:22:57,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1222 transitions. [2025-03-13 22:22:57,062 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9539422326307572 [2025-03-13 22:22:57,062 INFO L175 Difference]: Start difference. First operand has 379 places, 380 transitions, 788 flow. Second operand 3 states and 1222 transitions. [2025-03-13 22:22:57,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 383 transitions, 825 flow [2025-03-13 22:22:57,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 377 places, 383 transitions, 821 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:22:57,066 INFO L231 Difference]: Finished difference. Result has 378 places, 380 transitions, 794 flow [2025-03-13 22:22:57,067 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=780, PETRI_DIFFERENCE_MINUEND_PLACES=375, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=376, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=794, PETRI_PLACES=378, PETRI_TRANSITIONS=380} [2025-03-13 22:22:57,068 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -14 predicate places. [2025-03-13 22:22:57,068 INFO L471 AbstractCegarLoop]: Abstraction has has 378 places, 380 transitions, 794 flow [2025-03-13 22:22:57,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 403.3333333333333) internal successors, (1210), 3 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:22:57,069 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:22:57,069 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] [2025-03-13 22:22:57,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 22:22:57,069 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-13 22:22:57,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:22:57,069 INFO L85 PathProgramCache]: Analyzing trace with hash 2137855852, now seen corresponding path program 1 times [2025-03-13 22:22:57,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:22:57,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850314464] [2025-03-13 22:22:57,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:22:57,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:22:57,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-13 22:22:57,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-13 22:22:57,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:22:57,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:22:57,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:22:57,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:22:57,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850314464] [2025-03-13 22:22:57,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850314464] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:22:57,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:22:57,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:22:57,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350483879] [2025-03-13 22:22:57,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:22:57,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:22:57,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:22:57,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:22:57,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:22:57,134 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 391 out of 427 [2025-03-13 22:22:57,135 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 380 transitions, 794 flow. Second operand has 3 states, 3 states have (on average 392.3333333333333) internal successors, (1177), 3 states have internal predecessors, (1177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:22:57,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:22:57,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 391 of 427 [2025-03-13 22:22:57,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:22:57,228 INFO L124 PetriNetUnfolderBase]: 45/1032 cut-off events. [2025-03-13 22:22:57,229 INFO L125 PetriNetUnfolderBase]: For 6/18 co-relation queries the response was YES. [2025-03-13 22:22:57,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1152 conditions, 1032 events. 45/1032 cut-off events. For 6/18 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4384 event pairs, 5 based on Foata normal form. 2/919 useless extension candidates. Maximal degree in co-relation 888. Up to 36 conditions per place. [2025-03-13 22:22:57,234 INFO L140 encePairwiseOnDemand]: 417/427 looper letters, 16 selfloop transitions, 5 changer transitions 0/379 dead transitions. [2025-03-13 22:22:57,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 379 transitions, 835 flow [2025-03-13 22:22:57,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:22:57,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:22:57,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1199 transitions. [2025-03-13 22:22:57,237 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9359875097580016 [2025-03-13 22:22:57,237 INFO L175 Difference]: Start difference. First operand has 378 places, 380 transitions, 794 flow. Second operand 3 states and 1199 transitions. [2025-03-13 22:22:57,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 379 transitions, 835 flow [2025-03-13 22:22:57,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 379 transitions, 835 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:22:57,241 INFO L231 Difference]: Finished difference. Result has 377 places, 378 transitions, 816 flow [2025-03-13 22:22:57,242 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=784, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=370, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=816, PETRI_PLACES=377, PETRI_TRANSITIONS=378} [2025-03-13 22:22:57,243 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -15 predicate places. [2025-03-13 22:22:57,243 INFO L471 AbstractCegarLoop]: Abstraction has has 377 places, 378 transitions, 816 flow [2025-03-13 22:22:57,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 392.3333333333333) internal successors, (1177), 3 states have internal predecessors, (1177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:22:57,243 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:22:57,243 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] [2025-03-13 22:22:57,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-13 22:22:57,244 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-13 22:22:57,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:22:57,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1382861920, now seen corresponding path program 1 times [2025-03-13 22:22:57,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:22:57,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051896507] [2025-03-13 22:22:57,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:22:57,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:22:57,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-13 22:22:57,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-13 22:22:57,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:22:57,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:22:57,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:22:57,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:22:57,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051896507] [2025-03-13 22:22:57,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051896507] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:22:57,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:22:57,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:22:57,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494950989] [2025-03-13 22:22:57,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:22:57,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:22:57,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:22:57,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:22:57,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:22:57,320 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 397 out of 427 [2025-03-13 22:22:57,321 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 378 transitions, 816 flow. Second operand has 3 states, 3 states have (on average 398.6666666666667) internal successors, (1196), 3 states have internal predecessors, (1196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:22:57,321 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:22:57,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 397 of 427 [2025-03-13 22:22:57,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:22:57,409 INFO L124 PetriNetUnfolderBase]: 50/1066 cut-off events. [2025-03-13 22:22:57,409 INFO L125 PetriNetUnfolderBase]: For 38/40 co-relation queries the response was YES. [2025-03-13 22:22:57,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1214 conditions, 1066 events. 50/1066 cut-off events. For 38/40 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 4809 event pairs, 11 based on Foata normal form. 0/935 useless extension candidates. Maximal degree in co-relation 939. Up to 65 conditions per place. [2025-03-13 22:22:57,416 INFO L140 encePairwiseOnDemand]: 424/427 looper letters, 14 selfloop transitions, 2 changer transitions 0/378 dead transitions. [2025-03-13 22:22:57,416 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 378 transitions, 849 flow [2025-03-13 22:22:57,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:22:57,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:22:57,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1208 transitions. [2025-03-13 22:22:57,418 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9430132708821234 [2025-03-13 22:22:57,418 INFO L175 Difference]: Start difference. First operand has 377 places, 378 transitions, 816 flow. Second operand 3 states and 1208 transitions. [2025-03-13 22:22:57,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 378 transitions, 849 flow [2025-03-13 22:22:57,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 376 places, 378 transitions, 839 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:22:57,424 INFO L231 Difference]: Finished difference. Result has 376 places, 377 transitions, 808 flow [2025-03-13 22:22:57,425 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=804, PETRI_DIFFERENCE_MINUEND_PLACES=374, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=377, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=375, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=808, PETRI_PLACES=376, PETRI_TRANSITIONS=377} [2025-03-13 22:22:57,425 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -16 predicate places. [2025-03-13 22:22:57,426 INFO L471 AbstractCegarLoop]: Abstraction has has 376 places, 377 transitions, 808 flow [2025-03-13 22:22:57,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 398.6666666666667) internal successors, (1196), 3 states have internal predecessors, (1196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:22:57,426 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:22:57,426 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:22:57,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-13 22:22:57,427 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-13 22:22:57,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:22:57,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1175876173, now seen corresponding path program 1 times [2025-03-13 22:22:57,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:22:57,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313780983] [2025-03-13 22:22:57,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:22:57,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:22:57,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-13 22:22:57,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-13 22:22:57,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:22:57,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:22:57,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:22:57,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:22:57,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313780983] [2025-03-13 22:22:57,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313780983] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:22:57,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:22:57,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 22:22:57,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533594365] [2025-03-13 22:22:57,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:22:57,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 22:22:57,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:22:57,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 22:22:57,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-13 22:22:57,577 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 401 out of 427 [2025-03-13 22:22:57,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 376 places, 377 transitions, 808 flow. Second operand has 4 states, 4 states have (on average 402.25) internal successors, (1609), 4 states have internal predecessors, (1609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:22:57,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:22:57,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 401 of 427 [2025-03-13 22:22:57,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:22:57,722 INFO L124 PetriNetUnfolderBase]: 46/1176 cut-off events. [2025-03-13 22:22:57,722 INFO L125 PetriNetUnfolderBase]: For 9/31 co-relation queries the response was YES. [2025-03-13 22:22:57,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1332 conditions, 1176 events. 46/1176 cut-off events. For 9/31 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 5463 event pairs, 7 based on Foata normal form. 3/1052 useless extension candidates. Maximal degree in co-relation 1065. Up to 34 conditions per place. [2025-03-13 22:22:57,731 INFO L140 encePairwiseOnDemand]: 422/427 looper letters, 20 selfloop transitions, 4 changer transitions 0/388 dead transitions. [2025-03-13 22:22:57,731 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 380 places, 388 transitions, 883 flow [2025-03-13 22:22:57,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 22:22:57,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 22:22:57,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2030 transitions. [2025-03-13 22:22:57,734 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9508196721311475 [2025-03-13 22:22:57,734 INFO L175 Difference]: Start difference. First operand has 376 places, 377 transitions, 808 flow. Second operand 5 states and 2030 transitions. [2025-03-13 22:22:57,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 380 places, 388 transitions, 883 flow [2025-03-13 22:22:57,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 388 transitions, 879 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:22:57,739 INFO L231 Difference]: Finished difference. Result has 381 places, 379 transitions, 829 flow [2025-03-13 22:22:57,739 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=800, PETRI_DIFFERENCE_MINUEND_PLACES=374, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=376, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=372, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=829, PETRI_PLACES=381, PETRI_TRANSITIONS=379} [2025-03-13 22:22:57,740 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -11 predicate places. [2025-03-13 22:22:57,740 INFO L471 AbstractCegarLoop]: Abstraction has has 381 places, 379 transitions, 829 flow [2025-03-13 22:22:57,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 402.25) internal successors, (1609), 4 states have internal predecessors, (1609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:22:57,741 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:22:57,741 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] [2025-03-13 22:22:57,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-13 22:22:57,741 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-13 22:22:57,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:22:57,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1165742935, now seen corresponding path program 1 times [2025-03-13 22:22:57,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:22:57,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547204950] [2025-03-13 22:22:57,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:22:57,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:22:57,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-13 22:22:57,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-13 22:22:57,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:22:57,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:22:57,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:22:57,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:22:57,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547204950] [2025-03-13 22:22:57,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547204950] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:22:57,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:22:57,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:22:57,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321168956] [2025-03-13 22:22:57,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:22:57,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:22:57,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:22:57,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:22:57,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:22:57,805 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 397 out of 427 [2025-03-13 22:22:57,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 381 places, 379 transitions, 829 flow. Second operand has 3 states, 3 states have (on average 399.0) internal successors, (1197), 3 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:22:57,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:22:57,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 397 of 427 [2025-03-13 22:22:57,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:22:57,915 INFO L124 PetriNetUnfolderBase]: 57/1123 cut-off events. [2025-03-13 22:22:57,916 INFO L125 PetriNetUnfolderBase]: For 34/67 co-relation queries the response was YES. [2025-03-13 22:22:57,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1350 conditions, 1123 events. 57/1123 cut-off events. For 34/67 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 5063 event pairs, 14 based on Foata normal form. 2/1018 useless extension candidates. Maximal degree in co-relation 1083. Up to 79 conditions per place. [2025-03-13 22:22:57,922 INFO L140 encePairwiseOnDemand]: 424/427 looper letters, 16 selfloop transitions, 2 changer transitions 0/379 dead transitions. [2025-03-13 22:22:57,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 379 transitions, 866 flow [2025-03-13 22:22:57,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:22:57,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:22:57,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1208 transitions. [2025-03-13 22:22:57,925 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9430132708821234 [2025-03-13 22:22:57,925 INFO L175 Difference]: Start difference. First operand has 381 places, 379 transitions, 829 flow. Second operand 3 states and 1208 transitions. [2025-03-13 22:22:57,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 382 places, 379 transitions, 866 flow [2025-03-13 22:22:57,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 379 transitions, 866 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:22:57,929 INFO L231 Difference]: Finished difference. Result has 382 places, 378 transitions, 831 flow [2025-03-13 22:22:57,930 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=827, PETRI_DIFFERENCE_MINUEND_PLACES=380, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=376, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=831, PETRI_PLACES=382, PETRI_TRANSITIONS=378} [2025-03-13 22:22:57,930 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -10 predicate places. [2025-03-13 22:22:57,930 INFO L471 AbstractCegarLoop]: Abstraction has has 382 places, 378 transitions, 831 flow [2025-03-13 22:22:57,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 399.0) internal successors, (1197), 3 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:22:57,931 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:22:57,931 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] [2025-03-13 22:22:57,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-13 22:22:57,931 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-13 22:22:57,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:22:57,932 INFO L85 PathProgramCache]: Analyzing trace with hash -574050796, now seen corresponding path program 1 times [2025-03-13 22:22:57,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:22:57,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175576717] [2025-03-13 22:22:57,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:22:57,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:22:57,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-13 22:22:57,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-13 22:22:57,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:22:57,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:22:58,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:22:58,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:22:58,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175576717] [2025-03-13 22:22:58,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175576717] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:22:58,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:22:58,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:22:58,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340597061] [2025-03-13 22:22:58,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:22:58,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 22:22:58,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:22:58,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 22:22:58,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 22:22:58,076 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 391 out of 427 [2025-03-13 22:22:58,078 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 378 transitions, 831 flow. Second operand has 5 states, 5 states have (on average 394.4) internal successors, (1972), 5 states have internal predecessors, (1972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:22:58,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:22:58,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 391 of 427 [2025-03-13 22:22:58,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:22:58,192 INFO L124 PetriNetUnfolderBase]: 28/1064 cut-off events. [2025-03-13 22:22:58,192 INFO L125 PetriNetUnfolderBase]: For 19/27 co-relation queries the response was YES. [2025-03-13 22:22:58,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1198 conditions, 1064 events. 28/1064 cut-off events. For 19/27 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 4307 event pairs, 1 based on Foata normal form. 2/966 useless extension candidates. Maximal degree in co-relation 987. Up to 17 conditions per place. [2025-03-13 22:22:58,200 INFO L140 encePairwiseOnDemand]: 413/427 looper letters, 12 selfloop transitions, 12 changer transitions 0/380 dead transitions. [2025-03-13 22:22:58,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 380 transitions, 883 flow [2025-03-13 22:22:58,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 22:22:58,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 22:22:58,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1981 transitions. [2025-03-13 22:22:58,203 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9278688524590164 [2025-03-13 22:22:58,203 INFO L175 Difference]: Start difference. First operand has 382 places, 378 transitions, 831 flow. Second operand 5 states and 1981 transitions. [2025-03-13 22:22:58,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 380 transitions, 883 flow [2025-03-13 22:22:58,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 384 places, 380 transitions, 879 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:22:58,208 INFO L231 Difference]: Finished difference. Result has 385 places, 380 transitions, 867 flow [2025-03-13 22:22:58,208 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=827, PETRI_DIFFERENCE_MINUEND_PLACES=380, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=867, PETRI_PLACES=385, PETRI_TRANSITIONS=380} [2025-03-13 22:22:58,209 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -7 predicate places. [2025-03-13 22:22:58,209 INFO L471 AbstractCegarLoop]: Abstraction has has 385 places, 380 transitions, 867 flow [2025-03-13 22:22:58,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 394.4) internal successors, (1972), 5 states have internal predecessors, (1972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:22:58,210 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:22:58,210 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] [2025-03-13 22:22:58,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-13 22:22:58,210 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-13 22:22:58,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:22:58,211 INFO L85 PathProgramCache]: Analyzing trace with hash -57817320, now seen corresponding path program 1 times [2025-03-13 22:22:58,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:22:58,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468268536] [2025-03-13 22:22:58,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:22:58,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:22:58,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-13 22:22:58,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-13 22:22:58,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:22:58,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:22:58,352 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 22:22:58,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:22:58,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468268536] [2025-03-13 22:22:58,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468268536] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 22:22:58,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1944747928] [2025-03-13 22:22:58,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:22:58,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:22:58,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:22:58,355 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 22:22:58,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-13 22:22:58,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-13 22:22:58,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-13 22:22:58,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:22:58,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:22:58,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-13 22:22:58,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:22:58,579 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 22:22:58,579 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 22:22:58,678 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 22:22:58,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1944747928] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 22:22:58,678 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 22:22:58,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-03-13 22:22:58,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809181280] [2025-03-13 22:22:58,678 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 22:22:58,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-13 22:22:58,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:22:58,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-13 22:22:58,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-03-13 22:22:59,077 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 385 out of 427 [2025-03-13 22:22:59,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 385 places, 380 transitions, 867 flow. Second operand has 15 states, 15 states have (on average 387.6666666666667) internal successors, (5815), 15 states have internal predecessors, (5815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:22:59,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:22:59,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 385 of 427 [2025-03-13 22:22:59,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:22:59,338 INFO L124 PetriNetUnfolderBase]: 28/1098 cut-off events. [2025-03-13 22:22:59,339 INFO L125 PetriNetUnfolderBase]: For 23/31 co-relation queries the response was YES. [2025-03-13 22:22:59,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1263 conditions, 1098 events. 28/1098 cut-off events. For 23/31 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 4257 event pairs, 1 based on Foata normal form. 4/1002 useless extension candidates. Maximal degree in co-relation 1059. Up to 17 conditions per place. [2025-03-13 22:22:59,345 INFO L140 encePairwiseOnDemand]: 407/427 looper letters, 20 selfloop transitions, 26 changer transitions 0/396 dead transitions. [2025-03-13 22:22:59,346 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 395 places, 396 transitions, 995 flow [2025-03-13 22:22:59,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-13 22:22:59,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-13 22:22:59,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 4285 transitions. [2025-03-13 22:22:59,352 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9122844368746008 [2025-03-13 22:22:59,352 INFO L175 Difference]: Start difference. First operand has 385 places, 380 transitions, 867 flow. Second operand 11 states and 4285 transitions. [2025-03-13 22:22:59,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 395 places, 396 transitions, 995 flow [2025-03-13 22:22:59,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 392 places, 396 transitions, 975 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-13 22:22:59,358 INFO L231 Difference]: Finished difference. Result has 395 places, 392 transitions, 967 flow [2025-03-13 22:22:59,359 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=847, PETRI_DIFFERENCE_MINUEND_PLACES=382, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=360, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=967, PETRI_PLACES=395, PETRI_TRANSITIONS=392} [2025-03-13 22:22:59,360 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, 3 predicate places. [2025-03-13 22:22:59,360 INFO L471 AbstractCegarLoop]: Abstraction has has 395 places, 392 transitions, 967 flow [2025-03-13 22:22:59,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 387.6666666666667) internal successors, (5815), 15 states have internal predecessors, (5815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:22:59,362 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:22:59,362 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:22:59,369 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-13 22:22:59,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-13 22:22:59,563 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-13 22:22:59,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:22:59,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1204309864, now seen corresponding path program 2 times [2025-03-13 22:22:59,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:22:59,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725120644] [2025-03-13 22:22:59,564 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 22:22:59,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:22:59,582 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 217 statements into 2 equivalence classes. [2025-03-13 22:22:59,590 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 127 of 217 statements. [2025-03-13 22:22:59,590 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 22:22:59,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:22:59,908 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-03-13 22:22:59,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:22:59,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725120644] [2025-03-13 22:22:59,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725120644] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:22:59,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:22:59,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:22:59,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881124032] [2025-03-13 22:22:59,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:22:59,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:22:59,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:22:59,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:22:59,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:23:00,114 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 391 out of 427 [2025-03-13 22:23:00,115 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 395 places, 392 transitions, 967 flow. Second operand has 6 states, 6 states have (on average 393.8333333333333) internal successors, (2363), 6 states have internal predecessors, (2363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:00,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:00,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 391 of 427 [2025-03-13 22:23:00,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:00,313 INFO L124 PetriNetUnfolderBase]: 43/1221 cut-off events. [2025-03-13 22:23:00,313 INFO L125 PetriNetUnfolderBase]: For 42/63 co-relation queries the response was YES. [2025-03-13 22:23:00,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1487 conditions, 1221 events. 43/1221 cut-off events. For 42/63 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 5275 event pairs, 3 based on Foata normal form. 4/1118 useless extension candidates. Maximal degree in co-relation 1280. Up to 52 conditions per place. [2025-03-13 22:23:00,322 INFO L140 encePairwiseOnDemand]: 421/427 looper letters, 20 selfloop transitions, 6 changer transitions 0/395 dead transitions. [2025-03-13 22:23:00,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 399 places, 395 transitions, 1029 flow [2025-03-13 22:23:00,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:23:00,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:23:00,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2372 transitions. [2025-03-13 22:23:00,326 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9258391881342701 [2025-03-13 22:23:00,326 INFO L175 Difference]: Start difference. First operand has 395 places, 392 transitions, 967 flow. Second operand 6 states and 2372 transitions. [2025-03-13 22:23:00,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 399 places, 395 transitions, 1029 flow [2025-03-13 22:23:00,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 396 places, 395 transitions, 1005 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-03-13 22:23:00,333 INFO L231 Difference]: Finished difference. Result has 396 places, 391 transitions, 953 flow [2025-03-13 22:23:00,333 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=941, PETRI_DIFFERENCE_MINUEND_PLACES=391, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=391, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=385, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=953, PETRI_PLACES=396, PETRI_TRANSITIONS=391} [2025-03-13 22:23:00,334 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, 4 predicate places. [2025-03-13 22:23:00,334 INFO L471 AbstractCegarLoop]: Abstraction has has 396 places, 391 transitions, 953 flow [2025-03-13 22:23:00,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 393.8333333333333) internal successors, (2363), 6 states have internal predecessors, (2363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:00,334 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:00,335 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:23:00,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-13 22:23:00,335 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-13 22:23:00,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:00,335 INFO L85 PathProgramCache]: Analyzing trace with hash -18451011, now seen corresponding path program 1 times [2025-03-13 22:23:00,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:00,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534716749] [2025-03-13 22:23:00,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:00,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:00,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-03-13 22:23:00,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-03-13 22:23:00,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:00,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:00,408 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-03-13 22:23:00,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:00,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534716749] [2025-03-13 22:23:00,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534716749] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:00,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:00,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:00,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150013031] [2025-03-13 22:23:00,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:00,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:00,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:00,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:00,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:00,417 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 402 out of 427 [2025-03-13 22:23:00,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 396 places, 391 transitions, 953 flow. Second operand has 3 states, 3 states have (on average 403.6666666666667) internal successors, (1211), 3 states have internal predecessors, (1211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:00,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:00,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 402 of 427 [2025-03-13 22:23:00,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:00,591 INFO L124 PetriNetUnfolderBase]: 62/1648 cut-off events. [2025-03-13 22:23:00,592 INFO L125 PetriNetUnfolderBase]: For 47/54 co-relation queries the response was YES. [2025-03-13 22:23:00,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1960 conditions, 1648 events. 62/1648 cut-off events. For 47/54 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 9040 event pairs, 7 based on Foata normal form. 0/1512 useless extension candidates. Maximal degree in co-relation 1738. Up to 76 conditions per place. [2025-03-13 22:23:00,599 INFO L140 encePairwiseOnDemand]: 423/427 looper letters, 12 selfloop transitions, 2 changer transitions 0/394 dead transitions. [2025-03-13 22:23:00,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 396 places, 394 transitions, 990 flow [2025-03-13 22:23:00,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:00,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:00,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1222 transitions. [2025-03-13 22:23:00,601 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9539422326307572 [2025-03-13 22:23:00,601 INFO L175 Difference]: Start difference. First operand has 396 places, 391 transitions, 953 flow. Second operand 3 states and 1222 transitions. [2025-03-13 22:23:00,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 396 places, 394 transitions, 990 flow [2025-03-13 22:23:00,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 391 places, 394 transitions, 978 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:23:00,606 INFO L231 Difference]: Finished difference. Result has 392 places, 391 transitions, 951 flow [2025-03-13 22:23:00,606 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=937, PETRI_DIFFERENCE_MINUEND_PLACES=389, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=389, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=387, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=951, PETRI_PLACES=392, PETRI_TRANSITIONS=391} [2025-03-13 22:23:00,606 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, 0 predicate places. [2025-03-13 22:23:00,606 INFO L471 AbstractCegarLoop]: Abstraction has has 392 places, 391 transitions, 951 flow [2025-03-13 22:23:00,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 403.6666666666667) internal successors, (1211), 3 states have internal predecessors, (1211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:00,607 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:00,607 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:23:00,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-13 22:23:00,608 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-13 22:23:00,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:00,608 INFO L85 PathProgramCache]: Analyzing trace with hash -571949566, now seen corresponding path program 1 times [2025-03-13 22:23:00,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:00,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87927615] [2025-03-13 22:23:00,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:00,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:00,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-03-13 22:23:00,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-03-13 22:23:00,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:00,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:00,674 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-03-13 22:23:00,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:00,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87927615] [2025-03-13 22:23:00,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87927615] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:00,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:00,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:00,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223195097] [2025-03-13 22:23:00,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:00,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:00,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:00,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:00,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:00,696 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 391 out of 427 [2025-03-13 22:23:00,697 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 392 places, 391 transitions, 951 flow. Second operand has 3 states, 3 states have (on average 392.6666666666667) internal successors, (1178), 3 states have internal predecessors, (1178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:00,697 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:00,697 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 391 of 427 [2025-03-13 22:23:00,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:00,894 INFO L124 PetriNetUnfolderBase]: 84/1913 cut-off events. [2025-03-13 22:23:00,894 INFO L125 PetriNetUnfolderBase]: For 58/61 co-relation queries the response was YES. [2025-03-13 22:23:00,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2263 conditions, 1913 events. 84/1913 cut-off events. For 58/61 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 10790 event pairs, 15 based on Foata normal form. 4/1762 useless extension candidates. Maximal degree in co-relation 2041. Up to 84 conditions per place. [2025-03-13 22:23:00,900 INFO L140 encePairwiseOnDemand]: 415/427 looper letters, 10 selfloop transitions, 4 changer transitions 38/392 dead transitions. [2025-03-13 22:23:00,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 389 places, 392 transitions, 998 flow [2025-03-13 22:23:00,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:00,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:00,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1200 transitions. [2025-03-13 22:23:00,902 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.936768149882904 [2025-03-13 22:23:00,902 INFO L175 Difference]: Start difference. First operand has 392 places, 391 transitions, 951 flow. Second operand 3 states and 1200 transitions. [2025-03-13 22:23:00,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 389 places, 392 transitions, 998 flow [2025-03-13 22:23:00,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 389 places, 392 transitions, 998 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:23:00,906 INFO L231 Difference]: Finished difference. Result has 391 places, 353 transitions, 894 flow [2025-03-13 22:23:00,907 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=941, PETRI_DIFFERENCE_MINUEND_PLACES=387, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=386, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=382, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=894, PETRI_PLACES=391, PETRI_TRANSITIONS=353} [2025-03-13 22:23:00,907 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -1 predicate places. [2025-03-13 22:23:00,907 INFO L471 AbstractCegarLoop]: Abstraction has has 391 places, 353 transitions, 894 flow [2025-03-13 22:23:00,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 392.6666666666667) internal successors, (1178), 3 states have internal predecessors, (1178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:00,907 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:00,908 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:23:00,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-13 22:23:00,908 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-13 22:23:00,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:00,908 INFO L85 PathProgramCache]: Analyzing trace with hash -783685916, now seen corresponding path program 1 times [2025-03-13 22:23:00,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:00,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78816327] [2025-03-13 22:23:00,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:00,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:00,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-03-13 22:23:00,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-03-13 22:23:00,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:00,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:01,002 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-03-13 22:23:01,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:01,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78816327] [2025-03-13 22:23:01,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78816327] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:01,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:01,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 22:23:01,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043529508] [2025-03-13 22:23:01,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:01,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 22:23:01,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:01,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 22:23:01,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-13 22:23:01,047 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 401 out of 427 [2025-03-13 22:23:01,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 391 places, 353 transitions, 894 flow. Second operand has 4 states, 4 states have (on average 402.5) internal successors, (1610), 4 states have internal predecessors, (1610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:01,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:01,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 401 of 427 [2025-03-13 22:23:01,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:01,261 INFO L124 PetriNetUnfolderBase]: 64/1697 cut-off events. [2025-03-13 22:23:01,262 INFO L125 PetriNetUnfolderBase]: For 99/102 co-relation queries the response was YES. [2025-03-13 22:23:01,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2118 conditions, 1697 events. 64/1697 cut-off events. For 99/102 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 9903 event pairs, 25 based on Foata normal form. 0/1555 useless extension candidates. Maximal degree in co-relation 1894. Up to 76 conditions per place. [2025-03-13 22:23:01,271 INFO L140 encePairwiseOnDemand]: 422/427 looper letters, 15 selfloop transitions, 4 changer transitions 0/360 dead transitions. [2025-03-13 22:23:01,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 360 transitions, 947 flow [2025-03-13 22:23:01,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 22:23:01,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 22:23:01,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2025 transitions. [2025-03-13 22:23:01,275 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9484777517564403 [2025-03-13 22:23:01,275 INFO L175 Difference]: Start difference. First operand has 391 places, 353 transitions, 894 flow. Second operand 5 states and 2025 transitions. [2025-03-13 22:23:01,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 361 places, 360 transitions, 947 flow [2025-03-13 22:23:01,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 360 transitions, 939 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:23:01,279 INFO L231 Difference]: Finished difference. Result has 362 places, 355 transitions, 911 flow [2025-03-13 22:23:01,280 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=882, PETRI_DIFFERENCE_MINUEND_PLACES=355, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=348, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=911, PETRI_PLACES=362, PETRI_TRANSITIONS=355} [2025-03-13 22:23:01,280 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -30 predicate places. [2025-03-13 22:23:01,280 INFO L471 AbstractCegarLoop]: Abstraction has has 362 places, 355 transitions, 911 flow [2025-03-13 22:23:01,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 402.5) internal successors, (1610), 4 states have internal predecessors, (1610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:01,285 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:01,285 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:23:01,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-13 22:23:01,285 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-13 22:23:01,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:01,286 INFO L85 PathProgramCache]: Analyzing trace with hash 103461160, now seen corresponding path program 1 times [2025-03-13 22:23:01,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:01,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075056584] [2025-03-13 22:23:01,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:01,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:01,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-03-13 22:23:01,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-03-13 22:23:01,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:01,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:01,347 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-03-13 22:23:01,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:01,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075056584] [2025-03-13 22:23:01,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075056584] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:01,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:01,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:01,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961513495] [2025-03-13 22:23:01,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:01,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:01,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:01,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:01,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:01,379 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 397 out of 427 [2025-03-13 22:23:01,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 355 transitions, 911 flow. Second operand has 3 states, 3 states have (on average 399.3333333333333) internal successors, (1198), 3 states have internal predecessors, (1198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:01,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:01,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 397 of 427 [2025-03-13 22:23:01,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:01,588 INFO L124 PetriNetUnfolderBase]: 85/1728 cut-off events. [2025-03-13 22:23:01,588 INFO L125 PetriNetUnfolderBase]: For 133/136 co-relation queries the response was YES. [2025-03-13 22:23:01,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2255 conditions, 1728 events. 85/1728 cut-off events. For 133/136 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 11056 event pairs, 46 based on Foata normal form. 0/1601 useless extension candidates. Maximal degree in co-relation 2029. Up to 135 conditions per place. [2025-03-13 22:23:01,597 INFO L140 encePairwiseOnDemand]: 424/427 looper letters, 11 selfloop transitions, 2 changer transitions 1/355 dead transitions. [2025-03-13 22:23:01,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 355 transitions, 940 flow [2025-03-13 22:23:01,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:01,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:01,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1204 transitions. [2025-03-13 22:23:01,600 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9398907103825137 [2025-03-13 22:23:01,600 INFO L175 Difference]: Start difference. First operand has 362 places, 355 transitions, 911 flow. Second operand 3 states and 1204 transitions. [2025-03-13 22:23:01,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 355 transitions, 940 flow [2025-03-13 22:23:01,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 355 transitions, 940 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:23:01,605 INFO L231 Difference]: Finished difference. Result has 363 places, 354 transitions, 913 flow [2025-03-13 22:23:01,605 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=909, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=913, PETRI_PLACES=363, PETRI_TRANSITIONS=354} [2025-03-13 22:23:01,606 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -29 predicate places. [2025-03-13 22:23:01,606 INFO L471 AbstractCegarLoop]: Abstraction has has 363 places, 354 transitions, 913 flow [2025-03-13 22:23:01,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 399.3333333333333) internal successors, (1198), 3 states have internal predecessors, (1198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:01,606 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:01,606 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:23:01,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-13 22:23:01,607 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-13 22:23:01,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:01,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1636332571, now seen corresponding path program 1 times [2025-03-13 22:23:01,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:01,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115350451] [2025-03-13 22:23:01,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:01,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:01,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-03-13 22:23:01,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-03-13 22:23:01,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:01,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:01,868 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-13 22:23:01,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:01,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115350451] [2025-03-13 22:23:01,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115350451] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 22:23:01,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1177194382] [2025-03-13 22:23:01,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:01,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:23:01,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:23:01,871 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 22:23:01,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-13 22:23:01,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-03-13 22:23:02,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-03-13 22:23:02,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:02,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:02,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-13 22:23:02,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:23:02,250 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-13 22:23:02,251 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 22:23:02,380 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-13 22:23:02,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1177194382] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 22:23:02,381 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 22:23:02,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2025-03-13 22:23:02,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824692100] [2025-03-13 22:23:02,381 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 22:23:02,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-13 22:23:02,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:02,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-13 22:23:02,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2025-03-13 22:23:02,844 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 385 out of 427 [2025-03-13 22:23:02,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 354 transitions, 913 flow. Second operand has 22 states, 22 states have (on average 387.59090909090907) internal successors, (8527), 22 states have internal predecessors, (8527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:02,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:02,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 385 of 427 [2025-03-13 22:23:02,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:03,226 INFO L124 PetriNetUnfolderBase]: 21/1438 cut-off events. [2025-03-13 22:23:03,226 INFO L125 PetriNetUnfolderBase]: For 68/71 co-relation queries the response was YES. [2025-03-13 22:23:03,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1817 conditions, 1438 events. 21/1438 cut-off events. For 68/71 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 5728 event pairs, 5 based on Foata normal form. 4/1367 useless extension candidates. Maximal degree in co-relation 1708. Up to 19 conditions per place. [2025-03-13 22:23:03,236 INFO L140 encePairwiseOnDemand]: 407/427 looper letters, 23 selfloop transitions, 38 changer transitions 0/374 dead transitions. [2025-03-13 22:23:03,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 374 transitions, 1131 flow [2025-03-13 22:23:03,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-13 22:23:03,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-13 22:23:03,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 6610 transitions. [2025-03-13 22:23:03,243 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9105937456949993 [2025-03-13 22:23:03,243 INFO L175 Difference]: Start difference. First operand has 363 places, 354 transitions, 913 flow. Second operand 17 states and 6610 transitions. [2025-03-13 22:23:03,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 374 transitions, 1131 flow [2025-03-13 22:23:03,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 377 places, 374 transitions, 1127 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:23:03,248 INFO L231 Difference]: Finished difference. Result has 380 places, 368 transitions, 1093 flow [2025-03-13 22:23:03,249 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=909, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=324, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1093, PETRI_PLACES=380, PETRI_TRANSITIONS=368} [2025-03-13 22:23:03,249 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -12 predicate places. [2025-03-13 22:23:03,249 INFO L471 AbstractCegarLoop]: Abstraction has has 380 places, 368 transitions, 1093 flow [2025-03-13 22:23:03,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 387.59090909090907) internal successors, (8527), 22 states have internal predecessors, (8527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:03,250 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:03,251 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:23:03,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-13 22:23:03,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-13 22:23:03,451 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-13 22:23:03,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:03,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1518531941, now seen corresponding path program 2 times [2025-03-13 22:23:03,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:03,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079112306] [2025-03-13 22:23:03,452 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 22:23:03,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:03,473 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 283 statements into 2 equivalence classes. [2025-03-13 22:23:03,476 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 133 of 283 statements. [2025-03-13 22:23:03,476 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 22:23:03,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:03,701 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2025-03-13 22:23:03,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:03,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079112306] [2025-03-13 22:23:03,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079112306] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:03,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:03,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:23:03,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695436518] [2025-03-13 22:23:03,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:03,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:23:03,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:03,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:23:03,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:23:03,916 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 391 out of 427 [2025-03-13 22:23:03,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 368 transitions, 1093 flow. Second operand has 6 states, 6 states have (on average 394.0) internal successors, (2364), 6 states have internal predecessors, (2364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:03,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:03,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 391 of 427 [2025-03-13 22:23:03,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:04,171 INFO L124 PetriNetUnfolderBase]: 64/1911 cut-off events. [2025-03-13 22:23:04,171 INFO L125 PetriNetUnfolderBase]: For 147/150 co-relation queries the response was YES. [2025-03-13 22:23:04,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2504 conditions, 1911 events. 64/1911 cut-off events. For 147/150 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 10010 event pairs, 13 based on Foata normal form. 0/1807 useless extension candidates. Maximal degree in co-relation 2308. Up to 80 conditions per place. [2025-03-13 22:23:04,183 INFO L140 encePairwiseOnDemand]: 421/427 looper letters, 19 selfloop transitions, 6 changer transitions 0/371 dead transitions. [2025-03-13 22:23:04,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 384 places, 371 transitions, 1153 flow [2025-03-13 22:23:04,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:23:04,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:23:04,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2371 transitions. [2025-03-13 22:23:04,187 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9254488680718189 [2025-03-13 22:23:04,187 INFO L175 Difference]: Start difference. First operand has 380 places, 368 transitions, 1093 flow. Second operand 6 states and 2371 transitions. [2025-03-13 22:23:04,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 384 places, 371 transitions, 1153 flow [2025-03-13 22:23:04,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 376 places, 371 transitions, 1101 flow, removed 8 selfloop flow, removed 8 redundant places. [2025-03-13 22:23:04,193 INFO L231 Difference]: Finished difference. Result has 376 places, 367 transitions, 1051 flow [2025-03-13 22:23:04,194 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=1039, PETRI_DIFFERENCE_MINUEND_PLACES=371, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=361, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1051, PETRI_PLACES=376, PETRI_TRANSITIONS=367} [2025-03-13 22:23:04,195 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -16 predicate places. [2025-03-13 22:23:04,195 INFO L471 AbstractCegarLoop]: Abstraction has has 376 places, 367 transitions, 1051 flow [2025-03-13 22:23:04,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 394.0) internal successors, (2364), 6 states have internal predecessors, (2364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:04,195 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:04,196 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:23:04,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-13 22:23:04,196 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-13 22:23:04,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:04,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1167655805, now seen corresponding path program 1 times [2025-03-13 22:23:04,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:04,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264151224] [2025-03-13 22:23:04,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:04,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:04,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 285 statements into 1 equivalence classes. [2025-03-13 22:23:04,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 285 of 285 statements. [2025-03-13 22:23:04,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:04,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:04,702 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 311 trivial. 0 not checked. [2025-03-13 22:23:04,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:04,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264151224] [2025-03-13 22:23:04,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264151224] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:04,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:04,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:23:04,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219351915] [2025-03-13 22:23:04,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:04,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:23:04,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:04,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:23:04,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:23:04,884 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 391 out of 427 [2025-03-13 22:23:04,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 376 places, 367 transitions, 1051 flow. Second operand has 6 states, 6 states have (on average 393.8333333333333) internal successors, (2363), 6 states have internal predecessors, (2363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:04,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:04,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 391 of 427 [2025-03-13 22:23:04,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:05,075 INFO L124 PetriNetUnfolderBase]: 36/1532 cut-off events. [2025-03-13 22:23:05,075 INFO L125 PetriNetUnfolderBase]: For 113/116 co-relation queries the response was YES. [2025-03-13 22:23:05,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2038 conditions, 1532 events. 36/1532 cut-off events. For 113/116 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 6509 event pairs, 7 based on Foata normal form. 0/1461 useless extension candidates. Maximal degree in co-relation 1932. Up to 70 conditions per place. [2025-03-13 22:23:05,085 INFO L140 encePairwiseOnDemand]: 421/427 looper letters, 19 selfloop transitions, 6 changer transitions 0/370 dead transitions. [2025-03-13 22:23:05,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 380 places, 370 transitions, 1111 flow [2025-03-13 22:23:05,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:23:05,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:23:05,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2371 transitions. [2025-03-13 22:23:05,087 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9254488680718189 [2025-03-13 22:23:05,087 INFO L175 Difference]: Start difference. First operand has 376 places, 367 transitions, 1051 flow. Second operand 6 states and 2371 transitions. [2025-03-13 22:23:05,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 380 places, 370 transitions, 1111 flow [2025-03-13 22:23:05,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 370 transitions, 1099 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:23:05,092 INFO L231 Difference]: Finished difference. Result has 375 places, 366 transitions, 1049 flow [2025-03-13 22:23:05,093 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=1037, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=360, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1049, PETRI_PLACES=375, PETRI_TRANSITIONS=366} [2025-03-13 22:23:05,093 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -17 predicate places. [2025-03-13 22:23:05,093 INFO L471 AbstractCegarLoop]: Abstraction has has 375 places, 366 transitions, 1049 flow [2025-03-13 22:23:05,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 393.8333333333333) internal successors, (2363), 6 states have internal predecessors, (2363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:05,094 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:05,094 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:23:05,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-13 22:23:05,094 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-13 22:23:05,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:05,095 INFO L85 PathProgramCache]: Analyzing trace with hash 942671178, now seen corresponding path program 1 times [2025-03-13 22:23:05,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:05,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432480530] [2025-03-13 22:23:05,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:05,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:05,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 291 statements into 1 equivalence classes. [2025-03-13 22:23:05,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 291 of 291 statements. [2025-03-13 22:23:05,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:05,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:05,635 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2025-03-13 22:23:05,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:05,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432480530] [2025-03-13 22:23:05,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432480530] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:05,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:05,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:23:05,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015657092] [2025-03-13 22:23:05,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:05,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:23:05,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:05,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:23:05,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:23:05,813 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 391 out of 427 [2025-03-13 22:23:05,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 366 transitions, 1049 flow. Second operand has 6 states, 6 states have (on average 394.0) internal successors, (2364), 6 states have internal predecessors, (2364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:05,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:05,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 391 of 427 [2025-03-13 22:23:05,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:06,046 INFO L124 PetriNetUnfolderBase]: 64/1857 cut-off events. [2025-03-13 22:23:06,046 INFO L125 PetriNetUnfolderBase]: For 163/166 co-relation queries the response was YES. [2025-03-13 22:23:06,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2475 conditions, 1857 events. 64/1857 cut-off events. For 163/166 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 9767 event pairs, 13 based on Foata normal form. 0/1776 useless extension candidates. Maximal degree in co-relation 2279. Up to 80 conditions per place. [2025-03-13 22:23:06,057 INFO L140 encePairwiseOnDemand]: 421/427 looper letters, 19 selfloop transitions, 6 changer transitions 0/369 dead transitions. [2025-03-13 22:23:06,057 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 369 transitions, 1109 flow [2025-03-13 22:23:06,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:23:06,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:23:06,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2371 transitions. [2025-03-13 22:23:06,059 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9254488680718189 [2025-03-13 22:23:06,059 INFO L175 Difference]: Start difference. First operand has 375 places, 366 transitions, 1049 flow. Second operand 6 states and 2371 transitions. [2025-03-13 22:23:06,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 369 transitions, 1109 flow [2025-03-13 22:23:06,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 369 transitions, 1097 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:23:06,064 INFO L231 Difference]: Finished difference. Result has 374 places, 365 transitions, 1047 flow [2025-03-13 22:23:06,065 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=1035, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1047, PETRI_PLACES=374, PETRI_TRANSITIONS=365} [2025-03-13 22:23:06,065 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -18 predicate places. [2025-03-13 22:23:06,065 INFO L471 AbstractCegarLoop]: Abstraction has has 374 places, 365 transitions, 1047 flow [2025-03-13 22:23:06,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 394.0) internal successors, (2364), 6 states have internal predecessors, (2364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:06,066 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:06,066 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:23:06,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-13 22:23:06,066 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-13 22:23:06,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:06,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1281881420, now seen corresponding path program 1 times [2025-03-13 22:23:06,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:06,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672178526] [2025-03-13 22:23:06,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:06,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:06,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes. [2025-03-13 22:23:06,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements. [2025-03-13 22:23:06,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:06,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:06,146 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 311 trivial. 0 not checked. [2025-03-13 22:23:06,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:06,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672178526] [2025-03-13 22:23:06,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672178526] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:06,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:06,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:06,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215263813] [2025-03-13 22:23:06,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:06,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:06,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:06,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:06,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:06,169 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 397 out of 427 [2025-03-13 22:23:06,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 365 transitions, 1047 flow. Second operand has 3 states, 3 states have (on average 398.6666666666667) internal successors, (1196), 3 states have internal predecessors, (1196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:06,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:06,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 397 of 427 [2025-03-13 22:23:06,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:06,329 INFO L124 PetriNetUnfolderBase]: 42/1534 cut-off events. [2025-03-13 22:23:06,329 INFO L125 PetriNetUnfolderBase]: For 113/113 co-relation queries the response was YES. [2025-03-13 22:23:06,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2040 conditions, 1534 events. 42/1534 cut-off events. For 113/113 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 6645 event pairs, 17 based on Foata normal form. 0/1484 useless extension candidates. Maximal degree in co-relation 1934. Up to 79 conditions per place. [2025-03-13 22:23:06,338 INFO L140 encePairwiseOnDemand]: 424/427 looper letters, 11 selfloop transitions, 3 changer transitions 0/365 dead transitions. [2025-03-13 22:23:06,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 365 transitions, 1076 flow [2025-03-13 22:23:06,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:06,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:06,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1204 transitions. [2025-03-13 22:23:06,341 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9398907103825137 [2025-03-13 22:23:06,341 INFO L175 Difference]: Start difference. First operand has 374 places, 365 transitions, 1047 flow. Second operand 3 states and 1204 transitions. [2025-03-13 22:23:06,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 365 transitions, 1076 flow [2025-03-13 22:23:06,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 370 places, 365 transitions, 1064 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:23:06,346 INFO L231 Difference]: Finished difference. Result has 370 places, 364 transitions, 1039 flow [2025-03-13 22:23:06,346 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=1033, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=364, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=361, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1039, PETRI_PLACES=370, PETRI_TRANSITIONS=364} [2025-03-13 22:23:06,347 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -22 predicate places. [2025-03-13 22:23:06,347 INFO L471 AbstractCegarLoop]: Abstraction has has 370 places, 364 transitions, 1039 flow [2025-03-13 22:23:06,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 398.6666666666667) internal successors, (1196), 3 states have internal predecessors, (1196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:06,347 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:06,347 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:23:06,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-13 22:23:06,348 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-13 22:23:06,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:06,349 INFO L85 PathProgramCache]: Analyzing trace with hash 756332601, now seen corresponding path program 1 times [2025-03-13 22:23:06,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:06,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180161402] [2025-03-13 22:23:06,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:06,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:06,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 317 statements into 1 equivalence classes. [2025-03-13 22:23:06,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 317 of 317 statements. [2025-03-13 22:23:06,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:06,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:06,420 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 311 trivial. 0 not checked. [2025-03-13 22:23:06,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:06,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180161402] [2025-03-13 22:23:06,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180161402] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:06,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:06,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:06,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450658439] [2025-03-13 22:23:06,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:06,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:06,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:06,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:06,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:06,449 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 397 out of 427 [2025-03-13 22:23:06,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 364 transitions, 1039 flow. Second operand has 3 states, 3 states have (on average 399.0) internal successors, (1197), 3 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:06,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:06,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 397 of 427 [2025-03-13 22:23:06,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:06,637 INFO L124 PetriNetUnfolderBase]: 76/1736 cut-off events. [2025-03-13 22:23:06,637 INFO L125 PetriNetUnfolderBase]: For 171/174 co-relation queries the response was YES. [2025-03-13 22:23:06,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2317 conditions, 1736 events. 76/1736 cut-off events. For 171/174 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 10103 event pairs, 43 based on Foata normal form. 0/1663 useless extension candidates. Maximal degree in co-relation 2086. Up to 127 conditions per place. [2025-03-13 22:23:06,646 INFO L140 encePairwiseOnDemand]: 424/427 looper letters, 0 selfloop transitions, 0 changer transitions 364/364 dead transitions. [2025-03-13 22:23:06,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 364 transitions, 1068 flow [2025-03-13 22:23:06,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:06,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:06,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1204 transitions. [2025-03-13 22:23:06,647 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9398907103825137 [2025-03-13 22:23:06,647 INFO L175 Difference]: Start difference. First operand has 370 places, 364 transitions, 1039 flow. Second operand 3 states and 1204 transitions. [2025-03-13 22:23:06,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 364 transitions, 1068 flow [2025-03-13 22:23:06,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 364 transitions, 1062 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:23:06,651 INFO L231 Difference]: Finished difference. Result has 369 places, 0 transitions, 0 flow [2025-03-13 22:23:06,651 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=1031, PETRI_DIFFERENCE_MINUEND_PLACES=367, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=363, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=363, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=369, PETRI_TRANSITIONS=0} [2025-03-13 22:23:06,652 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -23 predicate places. [2025-03-13 22:23:06,652 INFO L471 AbstractCegarLoop]: Abstraction has has 369 places, 0 transitions, 0 flow [2025-03-13 22:23:06,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 399.0) internal successors, (1197), 3 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:06,654 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (57 of 58 remaining) [2025-03-13 22:23:06,654 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (56 of 58 remaining) [2025-03-13 22:23:06,654 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (55 of 58 remaining) [2025-03-13 22:23:06,654 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (54 of 58 remaining) [2025-03-13 22:23:06,655 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (53 of 58 remaining) [2025-03-13 22:23:06,655 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (52 of 58 remaining) [2025-03-13 22:23:06,655 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (51 of 58 remaining) [2025-03-13 22:23:06,655 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (50 of 58 remaining) [2025-03-13 22:23:06,655 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (49 of 58 remaining) [2025-03-13 22:23:06,655 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (48 of 58 remaining) [2025-03-13 22:23:06,655 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (47 of 58 remaining) [2025-03-13 22:23:06,655 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (46 of 58 remaining) [2025-03-13 22:23:06,655 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (45 of 58 remaining) [2025-03-13 22:23:06,655 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (44 of 58 remaining) [2025-03-13 22:23:06,655 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (43 of 58 remaining) [2025-03-13 22:23:06,655 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (42 of 58 remaining) [2025-03-13 22:23:06,655 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (41 of 58 remaining) [2025-03-13 22:23:06,655 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (40 of 58 remaining) [2025-03-13 22:23:06,656 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (39 of 58 remaining) [2025-03-13 22:23:06,656 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (38 of 58 remaining) [2025-03-13 22:23:06,656 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (37 of 58 remaining) [2025-03-13 22:23:06,656 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (36 of 58 remaining) [2025-03-13 22:23:06,656 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (35 of 58 remaining) [2025-03-13 22:23:06,656 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (34 of 58 remaining) [2025-03-13 22:23:06,656 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (33 of 58 remaining) [2025-03-13 22:23:06,656 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (32 of 58 remaining) [2025-03-13 22:23:06,656 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (31 of 58 remaining) [2025-03-13 22:23:06,656 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (30 of 58 remaining) [2025-03-13 22:23:06,656 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (29 of 58 remaining) [2025-03-13 22:23:06,656 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (28 of 58 remaining) [2025-03-13 22:23:06,656 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (27 of 58 remaining) [2025-03-13 22:23:06,656 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (26 of 58 remaining) [2025-03-13 22:23:06,656 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (25 of 58 remaining) [2025-03-13 22:23:06,656 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (24 of 58 remaining) [2025-03-13 22:23:06,657 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 58 remaining) [2025-03-13 22:23:06,657 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 58 remaining) [2025-03-13 22:23:06,657 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (21 of 58 remaining) [2025-03-13 22:23:06,657 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (20 of 58 remaining) [2025-03-13 22:23:06,657 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (19 of 58 remaining) [2025-03-13 22:23:06,657 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (18 of 58 remaining) [2025-03-13 22:23:06,657 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (17 of 58 remaining) [2025-03-13 22:23:06,657 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (16 of 58 remaining) [2025-03-13 22:23:06,657 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (15 of 58 remaining) [2025-03-13 22:23:06,657 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (14 of 58 remaining) [2025-03-13 22:23:06,657 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (13 of 58 remaining) [2025-03-13 22:23:06,657 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (12 of 58 remaining) [2025-03-13 22:23:06,657 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (11 of 58 remaining) [2025-03-13 22:23:06,657 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (10 of 58 remaining) [2025-03-13 22:23:06,657 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (9 of 58 remaining) [2025-03-13 22:23:06,658 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (8 of 58 remaining) [2025-03-13 22:23:06,658 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (7 of 58 remaining) [2025-03-13 22:23:06,658 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (6 of 58 remaining) [2025-03-13 22:23:06,658 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (5 of 58 remaining) [2025-03-13 22:23:06,658 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (4 of 58 remaining) [2025-03-13 22:23:06,658 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (3 of 58 remaining) [2025-03-13 22:23:06,658 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (2 of 58 remaining) [2025-03-13 22:23:06,658 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (1 of 58 remaining) [2025-03-13 22:23:06,658 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (0 of 58 remaining) [2025-03-13 22:23:06,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-13 22:23:06,659 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:23:06,662 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-13 22:23:06,663 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-13 22:23:06,666 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.03 10:23:06 BasicIcfg [2025-03-13 22:23:06,666 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-13 22:23:06,667 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-13 22:23:06,667 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-13 22:23:06,667 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-13 22:23:06,668 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:22:54" (3/4) ... [2025-03-13 22:23:06,669 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-13 22:23:06,671 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-13 22:23:06,671 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-13 22:23:06,675 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2025-03-13 22:23:06,675 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-13 22:23:06,675 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-13 22:23:06,675 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-13 22:23:06,745 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-13 22:23:06,746 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-13 22:23:06,746 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-13 22:23:06,747 INFO L158 Benchmark]: Toolchain (without parser) took 13308.34ms. Allocated memory was 167.8MB in the beginning and 578.8MB in the end (delta: 411.0MB). Free memory was 133.3MB in the beginning and 244.3MB in the end (delta: -110.9MB). Peak memory consumption was 295.2MB. Max. memory is 16.1GB. [2025-03-13 22:23:06,747 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 22:23:06,747 INFO L158 Benchmark]: CACSL2BoogieTranslator took 194.17ms. Allocated memory is still 167.8MB. Free memory was 133.3MB in the beginning and 120.2MB in the end (delta: 13.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-13 22:23:06,748 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.23ms. Allocated memory is still 167.8MB. Free memory was 120.2MB in the beginning and 117.7MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-13 22:23:06,749 INFO L158 Benchmark]: Boogie Preprocessor took 30.93ms. Allocated memory is still 167.8MB. Free memory was 117.7MB in the beginning and 115.9MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 22:23:06,749 INFO L158 Benchmark]: IcfgBuilder took 646.66ms. Allocated memory is still 167.8MB. Free memory was 115.9MB in the beginning and 84.2MB in the end (delta: 31.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-13 22:23:06,749 INFO L158 Benchmark]: TraceAbstraction took 12315.12ms. Allocated memory was 167.8MB in the beginning and 578.8MB in the end (delta: 411.0MB). Free memory was 83.7MB in the beginning and 248.5MB in the end (delta: -164.7MB). Peak memory consumption was 244.8MB. Max. memory is 16.1GB. [2025-03-13 22:23:06,749 INFO L158 Benchmark]: Witness Printer took 79.21ms. Allocated memory is still 578.8MB. Free memory was 248.5MB in the beginning and 244.3MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 22:23:06,750 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 194.17ms. Allocated memory is still 167.8MB. Free memory was 133.3MB in the beginning and 120.2MB in the end (delta: 13.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.23ms. Allocated memory is still 167.8MB. Free memory was 120.2MB in the beginning and 117.7MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.93ms. Allocated memory is still 167.8MB. Free memory was 117.7MB in the beginning and 115.9MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 646.66ms. Allocated memory is still 167.8MB. Free memory was 115.9MB in the beginning and 84.2MB in the end (delta: 31.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 12315.12ms. Allocated memory was 167.8MB in the beginning and 578.8MB in the end (delta: 411.0MB). Free memory was 83.7MB in the beginning and 248.5MB in the end (delta: -164.7MB). Peak memory consumption was 244.8MB. Max. memory is 16.1GB. * Witness Printer took 79.21ms. Allocated memory is still 578.8MB. Free memory was 248.5MB in the beginning and 244.3MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: 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: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 606 locations, 58 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: 12.1s, OverallIterations: 26, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2586 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1721 mSDsluCounter, 1226 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 920 mSDsCounter, 371 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4185 IncrementalHoareTripleChecker+Invalid, 4556 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 371 mSolverCounterUnsat, 306 mSDtfsCounter, 4185 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 875 GetRequests, 768 SyntacticMatches, 5 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1093occurred in iteration=21, InterpolantAutomatonStates: 121, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 4765 NumberOfCodeBlocks, 4525 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 5115 ConstructedInterpolants, 0 QuantifiedInterpolants, 6924 SizeOfPredicates, 14 NumberOfNonLiveVariables, 856 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 30 InterpolantComputations, 24 PerfectInterpolantSequences, 2180/2327 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 34 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-13 22:23:06,765 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