./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-prod-cons-eq.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-prod-cons-eq.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 3dfcb4860b3021904fb2e25e7c2a428c9bcb0d82c2290cad723458395a0647ea --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 22:07:55,489 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 22:07:55,546 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-08 22:07:55,554 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 22:07:55,554 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 22:07:55,580 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 22:07:55,581 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 22:07:55,581 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 22:07:55,581 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 22:07:55,581 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 22:07:55,581 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 22:07:55,581 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 22:07:55,581 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 22:07:55,581 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 22:07:55,581 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 22:07:55,581 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 22:07:55,582 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 22:07:55,582 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 22:07:55,582 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 22:07:55,582 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 22:07:55,582 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 22:07:55,582 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 22:07:55,582 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-08 22:07:55,582 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 22:07:55,582 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 22:07:55,582 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 22:07:55,582 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 22:07:55,582 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 22:07:55,582 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 22:07:55,582 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 22:07:55,582 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 22:07:55,582 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:07:55,582 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 22:07:55,582 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 22:07:55,583 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 22:07:55,583 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 22:07:55,583 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 22:07:55,583 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 22:07:55,583 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 22:07:55,583 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 22:07:55,583 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 22:07:55,583 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 22:07:55,583 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 -> 3dfcb4860b3021904fb2e25e7c2a428c9bcb0d82c2290cad723458395a0647ea [2025-03-08 22:07:55,787 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 22:07:55,793 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 22:07:55,795 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 22:07:55,795 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 22:07:55,796 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 22:07:55,796 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-prod-cons-eq.wvr.c [2025-03-08 22:07:56,971 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5dcfc923/a0802d1573354f56a2c376400e89d3d8/FLAGd6a380656 [2025-03-08 22:07:57,223 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 22:07:57,224 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-prod-cons-eq.wvr.c [2025-03-08 22:07:57,265 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5dcfc923/a0802d1573354f56a2c376400e89d3d8/FLAGd6a380656 [2025-03-08 22:07:57,550 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5dcfc923/a0802d1573354f56a2c376400e89d3d8 [2025-03-08 22:07:57,552 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 22:07:57,554 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 22:07:57,555 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 22:07:57,555 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 22:07:57,558 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 22:07:57,559 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:07:57" (1/1) ... [2025-03-08 22:07:57,560 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1443b887 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:57, skipping insertion in model container [2025-03-08 22:07:57,561 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:07:57" (1/1) ... [2025-03-08 22:07:57,575 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 22:07:57,734 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:07:57,740 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 22:07:57,785 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:07:57,796 INFO L204 MainTranslator]: Completed translation [2025-03-08 22:07:57,796 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:57 WrapperNode [2025-03-08 22:07:57,797 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 22:07:57,797 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 22:07:57,797 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 22:07:57,798 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 22:07:57,802 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:57" (1/1) ... [2025-03-08 22:07:57,812 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:57" (1/1) ... [2025-03-08 22:07:57,847 INFO L138 Inliner]: procedures = 27, calls = 68, calls flagged for inlining = 29, calls inlined = 35, statements flattened = 817 [2025-03-08 22:07:57,847 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 22:07:57,848 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 22:07:57,848 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 22:07:57,848 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 22:07:57,859 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:57" (1/1) ... [2025-03-08 22:07:57,859 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:57" (1/1) ... [2025-03-08 22:07:57,869 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:57" (1/1) ... [2025-03-08 22:07:57,870 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:57" (1/1) ... [2025-03-08 22:07:57,894 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:57" (1/1) ... [2025-03-08 22:07:57,896 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:57" (1/1) ... [2025-03-08 22:07:57,902 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:57" (1/1) ... [2025-03-08 22:07:57,904 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:57" (1/1) ... [2025-03-08 22:07:57,911 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 22:07:57,911 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 22:07:57,911 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 22:07:57,913 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 22:07:57,914 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:57" (1/1) ... [2025-03-08 22:07:57,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:07:57,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:07:57,940 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 22:07:57,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 22:07:57,961 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 22:07:57,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-08 22:07:57,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-08 22:07:57,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-08 22:07:57,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-08 22:07:57,961 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-08 22:07:57,962 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-08 22:07:57,962 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-08 22:07:57,962 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-08 22:07:57,962 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-08 22:07:57,962 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-08 22:07:57,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-08 22:07:57,963 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-08 22:07:57,963 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-08 22:07:57,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 22:07:57,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 22:07:57,963 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 22:07:57,964 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-08 22:07:58,065 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 22:07:58,067 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 22:07:58,908 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 22:07:58,908 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 22:07:59,295 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 22:07:59,296 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 22:07:59,296 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:07:59 BoogieIcfgContainer [2025-03-08 22:07:59,296 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 22:07:59,298 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 22:07:59,298 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 22:07:59,301 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 22:07:59,301 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:07:57" (1/3) ... [2025-03-08 22:07:59,302 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a866983 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:07:59, skipping insertion in model container [2025-03-08 22:07:59,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:57" (2/3) ... [2025-03-08 22:07:59,302 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a866983 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:07:59, skipping insertion in model container [2025-03-08 22:07:59,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:07:59" (3/3) ... [2025-03-08 22:07:59,303 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-prod-cons-eq.wvr.c [2025-03-08 22:07:59,318 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 22:07:59,320 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-prod-cons-eq.wvr.c that has 4 procedures, 808 locations, 1 initial locations, 9 loop locations, and 133 error locations. [2025-03-08 22:07:59,321 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 22:07:59,448 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-08 22:07:59,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 817 places, 846 transitions, 1713 flow [2025-03-08 22:07:59,729 INFO L124 PetriNetUnfolderBase]: 39/843 cut-off events. [2025-03-08 22:07:59,731 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-08 22:07:59,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 856 conditions, 843 events. 39/843 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1660 event pairs, 0 based on Foata normal form. 0/671 useless extension candidates. Maximal degree in co-relation 599. Up to 2 conditions per place. [2025-03-08 22:07:59,747 INFO L82 GeneralOperation]: Start removeDead. Operand has 817 places, 846 transitions, 1713 flow [2025-03-08 22:07:59,762 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 798 places, 826 transitions, 1670 flow [2025-03-08 22:07:59,771 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:07:59,783 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;@36cabf42, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:07:59,784 INFO L334 AbstractCegarLoop]: Starting to check reachability of 234 error locations. [2025-03-08 22:07:59,790 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 22:07:59,790 INFO L124 PetriNetUnfolderBase]: 0/35 cut-off events. [2025-03-08 22:07:59,790 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 22:07:59,790 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:59,791 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:07:59,791 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-08 22:07:59,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:59,795 INFO L85 PathProgramCache]: Analyzing trace with hash -571880701, now seen corresponding path program 1 times [2025-03-08 22:07:59,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:59,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443154624] [2025-03-08 22:07:59,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:59,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:59,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-08 22:07:59,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 22:07:59,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:59,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:59,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:07:59,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:59,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443154624] [2025-03-08 22:07:59,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443154624] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:59,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:59,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:07:59,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888615062] [2025-03-08 22:07:59,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:59,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:07:59,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:59,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:07:59,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:08:00,011 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 753 out of 846 [2025-03-08 22:08:00,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 798 places, 826 transitions, 1670 flow. Second operand has 3 states, 3 states have (on average 754.3333333333334) internal successors, (2263), 3 states have internal predecessors, (2263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:00,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:08:00,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 753 of 846 [2025-03-08 22:08:00,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:08:00,323 INFO L124 PetriNetUnfolderBase]: 58/1094 cut-off events. [2025-03-08 22:08:00,324 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-03-08 22:08:00,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1197 conditions, 1094 events. 58/1094 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3622 event pairs, 19 based on Foata normal form. 65/966 useless extension candidates. Maximal degree in co-relation 784. Up to 65 conditions per place. [2025-03-08 22:08:00,338 INFO L140 encePairwiseOnDemand]: 770/846 looper letters, 14 selfloop transitions, 2 changer transitions 12/752 dead transitions. [2025-03-08 22:08:00,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 748 places, 752 transitions, 1554 flow [2025-03-08 22:08:00,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:08:00,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:08:00,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2349 transitions. [2025-03-08 22:08:00,357 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.925531914893617 [2025-03-08 22:08:00,360 INFO L175 Difference]: Start difference. First operand has 798 places, 826 transitions, 1670 flow. Second operand 3 states and 2349 transitions. [2025-03-08 22:08:00,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 748 places, 752 transitions, 1554 flow [2025-03-08 22:08:00,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 742 places, 752 transitions, 1542 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-08 22:08:00,385 INFO L231 Difference]: Finished difference. Result has 742 places, 740 transitions, 1490 flow [2025-03-08 22:08:00,388 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1510, PETRI_DIFFERENCE_MINUEND_PLACES=740, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=752, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=750, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1490, PETRI_PLACES=742, PETRI_TRANSITIONS=740} [2025-03-08 22:08:00,392 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -56 predicate places. [2025-03-08 22:08:00,392 INFO L471 AbstractCegarLoop]: Abstraction has has 742 places, 740 transitions, 1490 flow [2025-03-08 22:08:00,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 754.3333333333334) internal successors, (2263), 3 states have internal predecessors, (2263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:00,396 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:08:00,396 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] [2025-03-08 22:08:00,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 22:08:00,396 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-08 22:08:00,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:08:00,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1189960204, now seen corresponding path program 1 times [2025-03-08 22:08:00,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:08:00,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748622023] [2025-03-08 22:08:00,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:08:00,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:08:00,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-08 22:08:00,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 22:08:00,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:08:00,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:08:00,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:08:00,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:08:00,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748622023] [2025-03-08 22:08:00,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748622023] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:08:00,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:08:00,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:08:00,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382828855] [2025-03-08 22:08:00,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:08:00,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:08:00,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:08:00,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:08:00,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:08:00,510 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 746 out of 846 [2025-03-08 22:08:00,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 742 places, 740 transitions, 1490 flow. Second operand has 3 states, 3 states have (on average 747.3333333333334) internal successors, (2242), 3 states have internal predecessors, (2242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:00,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:08:00,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 746 of 846 [2025-03-08 22:08:00,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:08:00,785 INFO L124 PetriNetUnfolderBase]: 118/1177 cut-off events. [2025-03-08 22:08:00,785 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-08 22:08:00,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1387 conditions, 1177 events. 118/1177 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4368 event pairs, 67 based on Foata normal form. 0/984 useless extension candidates. Maximal degree in co-relation 1344. Up to 168 conditions per place. [2025-03-08 22:08:00,796 INFO L140 encePairwiseOnDemand]: 843/846 looper letters, 21 selfloop transitions, 2 changer transitions 0/739 dead transitions. [2025-03-08 22:08:00,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 731 places, 739 transitions, 1534 flow [2025-03-08 22:08:00,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:08:00,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:08:00,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2262 transitions. [2025-03-08 22:08:00,801 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8912529550827423 [2025-03-08 22:08:00,801 INFO L175 Difference]: Start difference. First operand has 742 places, 740 transitions, 1490 flow. Second operand 3 states and 2262 transitions. [2025-03-08 22:08:00,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 731 places, 739 transitions, 1534 flow [2025-03-08 22:08:00,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 729 places, 739 transitions, 1530 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:08:00,809 INFO L231 Difference]: Finished difference. Result has 729 places, 739 transitions, 1488 flow [2025-03-08 22:08:00,810 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1484, PETRI_DIFFERENCE_MINUEND_PLACES=727, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=739, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=737, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1488, PETRI_PLACES=729, PETRI_TRANSITIONS=739} [2025-03-08 22:08:00,811 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -69 predicate places. [2025-03-08 22:08:00,811 INFO L471 AbstractCegarLoop]: Abstraction has has 729 places, 739 transitions, 1488 flow [2025-03-08 22:08:00,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 747.3333333333334) internal successors, (2242), 3 states have internal predecessors, (2242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:00,812 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:08:00,812 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] [2025-03-08 22:08:00,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 22:08:00,813 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-08 22:08:00,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:08:00,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1425416, now seen corresponding path program 1 times [2025-03-08 22:08:00,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:08:00,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878479337] [2025-03-08 22:08:00,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:08:00,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:08:00,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-08 22:08:00,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-08 22:08:00,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:08:00,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:08:00,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:08:00,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:08:00,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878479337] [2025-03-08 22:08:00,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878479337] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:08:00,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:08:00,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:08:00,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030087780] [2025-03-08 22:08:00,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:08:00,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:08:00,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:08:00,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:08:00,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:08:00,890 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 740 out of 846 [2025-03-08 22:08:00,892 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 729 places, 739 transitions, 1488 flow. Second operand has 3 states, 3 states have (on average 741.0) internal successors, (2223), 3 states have internal predecessors, (2223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:00,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:08:00,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 740 of 846 [2025-03-08 22:08:00,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:08:01,149 INFO L124 PetriNetUnfolderBase]: 172/1301 cut-off events. [2025-03-08 22:08:01,150 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-08 22:08:01,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1615 conditions, 1301 events. 172/1301 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 5354 event pairs, 99 based on Foata normal form. 0/1126 useless extension candidates. Maximal degree in co-relation 1564. Up to 235 conditions per place. [2025-03-08 22:08:01,177 INFO L140 encePairwiseOnDemand]: 837/846 looper letters, 27 selfloop transitions, 3 changer transitions 0/738 dead transitions. [2025-03-08 22:08:01,177 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 725 places, 738 transitions, 1548 flow [2025-03-08 22:08:01,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:08:01,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:08:01,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2256 transitions. [2025-03-08 22:08:01,181 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8888888888888888 [2025-03-08 22:08:01,182 INFO L175 Difference]: Start difference. First operand has 729 places, 739 transitions, 1488 flow. Second operand 3 states and 2256 transitions. [2025-03-08 22:08:01,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 725 places, 738 transitions, 1548 flow [2025-03-08 22:08:01,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 723 places, 738 transitions, 1544 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:08:01,192 INFO L231 Difference]: Finished difference. Result has 723 places, 733 transitions, 1478 flow [2025-03-08 22:08:01,194 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1472, PETRI_DIFFERENCE_MINUEND_PLACES=721, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=733, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=730, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1478, PETRI_PLACES=723, PETRI_TRANSITIONS=733} [2025-03-08 22:08:01,195 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -75 predicate places. [2025-03-08 22:08:01,195 INFO L471 AbstractCegarLoop]: Abstraction has has 723 places, 733 transitions, 1478 flow [2025-03-08 22:08:01,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 741.0) internal successors, (2223), 3 states have internal predecessors, (2223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:01,197 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:08:01,197 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] [2025-03-08 22:08:01,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 22:08:01,197 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-08 22:08:01,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:08:01,198 INFO L85 PathProgramCache]: Analyzing trace with hash -2093616587, now seen corresponding path program 1 times [2025-03-08 22:08:01,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:08:01,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606560684] [2025-03-08 22:08:01,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:08:01,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:08:01,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-08 22:08:01,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-08 22:08:01,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:08:01,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:08:01,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:08:01,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:08:01,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606560684] [2025-03-08 22:08:01,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606560684] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:08:01,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:08:01,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:08:01,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381448871] [2025-03-08 22:08:01,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:08:01,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:08:01,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:08:01,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:08:01,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:08:01,302 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 741 out of 846 [2025-03-08 22:08:01,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 723 places, 733 transitions, 1478 flow. Second operand has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:01,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:08:01,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 741 of 846 [2025-03-08 22:08:01,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:08:01,664 INFO L124 PetriNetUnfolderBase]: 418/2446 cut-off events. [2025-03-08 22:08:01,665 INFO L125 PetriNetUnfolderBase]: For 79/79 co-relation queries the response was YES. [2025-03-08 22:08:01,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3054 conditions, 2446 events. 418/2446 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 13247 event pairs, 235 based on Foata normal form. 0/2000 useless extension candidates. Maximal degree in co-relation 1984. Up to 557 conditions per place. [2025-03-08 22:08:01,679 INFO L140 encePairwiseOnDemand]: 843/846 looper letters, 26 selfloop transitions, 2 changer transitions 0/732 dead transitions. [2025-03-08 22:08:01,679 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 724 places, 732 transitions, 1532 flow [2025-03-08 22:08:01,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:08:01,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:08:01,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2252 transitions. [2025-03-08 22:08:01,683 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8873128447596532 [2025-03-08 22:08:01,683 INFO L175 Difference]: Start difference. First operand has 723 places, 733 transitions, 1478 flow. Second operand 3 states and 2252 transitions. [2025-03-08 22:08:01,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 724 places, 732 transitions, 1532 flow [2025-03-08 22:08:01,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 722 places, 732 transitions, 1526 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:08:01,691 INFO L231 Difference]: Finished difference. Result has 722 places, 732 transitions, 1474 flow [2025-03-08 22:08:01,692 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1470, PETRI_DIFFERENCE_MINUEND_PLACES=720, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=732, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=730, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1474, PETRI_PLACES=722, PETRI_TRANSITIONS=732} [2025-03-08 22:08:01,693 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -76 predicate places. [2025-03-08 22:08:01,693 INFO L471 AbstractCegarLoop]: Abstraction has has 722 places, 732 transitions, 1474 flow [2025-03-08 22:08:01,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:01,694 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:08:01,694 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] [2025-03-08 22:08:01,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 22:08:01,695 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-08 22:08:01,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:08:01,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1633543589, now seen corresponding path program 1 times [2025-03-08 22:08:01,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:08:01,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202510590] [2025-03-08 22:08:01,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:08:01,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:08:01,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-08 22:08:01,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-08 22:08:01,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:08:01,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:08:01,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:08:01,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:08:01,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202510590] [2025-03-08 22:08:01,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202510590] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:08:01,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:08:01,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:08:01,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832252441] [2025-03-08 22:08:01,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:08:01,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:08:01,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:08:01,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:08:01,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:08:01,760 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 751 out of 846 [2025-03-08 22:08:01,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 722 places, 732 transitions, 1474 flow. Second operand has 3 states, 3 states have (on average 752.3333333333334) internal successors, (2257), 3 states have internal predecessors, (2257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:01,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:08:01,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 751 of 846 [2025-03-08 22:08:01,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:08:01,897 INFO L124 PetriNetUnfolderBase]: 58/1053 cut-off events. [2025-03-08 22:08:01,898 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-08 22:08:01,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1138 conditions, 1053 events. 58/1053 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 3341 event pairs, 19 based on Foata normal form. 0/901 useless extension candidates. Maximal degree in co-relation 1080. Up to 67 conditions per place. [2025-03-08 22:08:01,905 INFO L140 encePairwiseOnDemand]: 843/846 looper letters, 16 selfloop transitions, 2 changer transitions 0/731 dead transitions. [2025-03-08 22:08:01,905 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 723 places, 731 transitions, 1508 flow [2025-03-08 22:08:01,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:08:01,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:08:01,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2272 transitions. [2025-03-08 22:08:01,909 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8951930654058313 [2025-03-08 22:08:01,909 INFO L175 Difference]: Start difference. First operand has 722 places, 732 transitions, 1474 flow. Second operand 3 states and 2272 transitions. [2025-03-08 22:08:01,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 723 places, 731 transitions, 1508 flow [2025-03-08 22:08:01,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 721 places, 731 transitions, 1504 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:08:01,917 INFO L231 Difference]: Finished difference. Result has 721 places, 731 transitions, 1472 flow [2025-03-08 22:08:01,917 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1468, PETRI_DIFFERENCE_MINUEND_PLACES=719, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=731, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=729, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1472, PETRI_PLACES=721, PETRI_TRANSITIONS=731} [2025-03-08 22:08:01,918 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -77 predicate places. [2025-03-08 22:08:01,918 INFO L471 AbstractCegarLoop]: Abstraction has has 721 places, 731 transitions, 1472 flow [2025-03-08 22:08:01,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 752.3333333333334) internal successors, (2257), 3 states have internal predecessors, (2257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:01,919 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:08:01,919 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] [2025-03-08 22:08:01,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 22:08:01,920 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-08 22:08:01,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:08:01,920 INFO L85 PathProgramCache]: Analyzing trace with hash 317898127, now seen corresponding path program 1 times [2025-03-08 22:08:01,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:08:01,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155310737] [2025-03-08 22:08:01,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:08:01,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:08:01,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 22:08:01,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 22:08:01,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:08:01,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:08:01,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:08:01,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:08:01,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155310737] [2025-03-08 22:08:01,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155310737] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:08:01,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:08:01,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:08:01,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823043532] [2025-03-08 22:08:01,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:08:01,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:08:01,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:08:01,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:08:01,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:08:01,970 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 753 out of 846 [2025-03-08 22:08:01,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 721 places, 731 transitions, 1472 flow. Second operand has 3 states, 3 states have (on average 754.0) internal successors, (2262), 3 states have internal predecessors, (2262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:01,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:08:01,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 753 of 846 [2025-03-08 22:08:01,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:08:02,155 INFO L124 PetriNetUnfolderBase]: 68/1036 cut-off events. [2025-03-08 22:08:02,155 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-03-08 22:08:02,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1143 conditions, 1036 events. 68/1036 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 3267 event pairs, 11 based on Foata normal form. 0/891 useless extension candidates. Maximal degree in co-relation 1077. Up to 47 conditions per place. [2025-03-08 22:08:02,164 INFO L140 encePairwiseOnDemand]: 841/846 looper letters, 21 selfloop transitions, 3 changer transitions 0/737 dead transitions. [2025-03-08 22:08:02,164 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 721 places, 737 transitions, 1536 flow [2025-03-08 22:08:02,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:08:02,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:08:02,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2285 transitions. [2025-03-08 22:08:02,168 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9003152088258471 [2025-03-08 22:08:02,168 INFO L175 Difference]: Start difference. First operand has 721 places, 731 transitions, 1472 flow. Second operand 3 states and 2285 transitions. [2025-03-08 22:08:02,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 721 places, 737 transitions, 1536 flow [2025-03-08 22:08:02,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 719 places, 737 transitions, 1532 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:08:02,178 INFO L231 Difference]: Finished difference. Result has 721 places, 731 transitions, 1484 flow [2025-03-08 22:08:02,179 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1464, PETRI_DIFFERENCE_MINUEND_PLACES=717, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=729, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=726, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1484, PETRI_PLACES=721, PETRI_TRANSITIONS=731} [2025-03-08 22:08:02,180 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -77 predicate places. [2025-03-08 22:08:02,180 INFO L471 AbstractCegarLoop]: Abstraction has has 721 places, 731 transitions, 1484 flow [2025-03-08 22:08:02,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 754.0) internal successors, (2262), 3 states have internal predecessors, (2262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:02,181 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:08:02,181 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] [2025-03-08 22:08:02,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 22:08:02,181 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-08 22:08:02,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:08:02,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1133578795, now seen corresponding path program 1 times [2025-03-08 22:08:02,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:08:02,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288320386] [2025-03-08 22:08:02,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:08:02,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:08:02,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 22:08:02,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 22:08:02,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:08:02,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:08:02,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:08:02,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:08:02,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288320386] [2025-03-08 22:08:02,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288320386] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:08:02,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:08:02,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:08:02,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211035968] [2025-03-08 22:08:02,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:08:02,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:08:02,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:08:02,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:08:02,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:08:02,253 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 748 out of 846 [2025-03-08 22:08:02,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 721 places, 731 transitions, 1484 flow. Second operand has 3 states, 3 states have (on average 749.3333333333334) internal successors, (2248), 3 states have internal predecessors, (2248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:02,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:08:02,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 748 of 846 [2025-03-08 22:08:02,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:08:02,553 INFO L124 PetriNetUnfolderBase]: 230/1671 cut-off events. [2025-03-08 22:08:02,553 INFO L125 PetriNetUnfolderBase]: For 136/136 co-relation queries the response was YES. [2025-03-08 22:08:02,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2075 conditions, 1671 events. 230/1671 cut-off events. For 136/136 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 8164 event pairs, 131 based on Foata normal form. 0/1390 useless extension candidates. Maximal degree in co-relation 1443. Up to 310 conditions per place. [2025-03-08 22:08:02,567 INFO L140 encePairwiseOnDemand]: 843/846 looper letters, 20 selfloop transitions, 2 changer transitions 0/730 dead transitions. [2025-03-08 22:08:02,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 722 places, 730 transitions, 1526 flow [2025-03-08 22:08:02,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:08:02,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:08:02,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2266 transitions. [2025-03-08 22:08:02,571 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8928289992119779 [2025-03-08 22:08:02,571 INFO L175 Difference]: Start difference. First operand has 721 places, 731 transitions, 1484 flow. Second operand 3 states and 2266 transitions. [2025-03-08 22:08:02,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 722 places, 730 transitions, 1526 flow [2025-03-08 22:08:02,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 720 places, 730 transitions, 1520 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:08:02,579 INFO L231 Difference]: Finished difference. Result has 720 places, 730 transitions, 1480 flow [2025-03-08 22:08:02,580 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1476, PETRI_DIFFERENCE_MINUEND_PLACES=718, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=730, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=728, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1480, PETRI_PLACES=720, PETRI_TRANSITIONS=730} [2025-03-08 22:08:02,581 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -78 predicate places. [2025-03-08 22:08:02,581 INFO L471 AbstractCegarLoop]: Abstraction has has 720 places, 730 transitions, 1480 flow [2025-03-08 22:08:02,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 749.3333333333334) internal successors, (2248), 3 states have internal predecessors, (2248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:02,582 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:08:02,582 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:08:02,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 22:08:02,582 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-08 22:08:02,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:08:02,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1898671406, now seen corresponding path program 1 times [2025-03-08 22:08:02,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:08:02,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666098348] [2025-03-08 22:08:02,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:08:02,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:08:02,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-08 22:08:02,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-08 22:08:02,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:08:02,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:08:02,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:08:02,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:08:02,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666098348] [2025-03-08 22:08:02,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666098348] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:08:02,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:08:02,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:08:02,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29829061] [2025-03-08 22:08:02,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:08:02,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:08:02,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:08:02,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:08:02,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:08:02,624 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 752 out of 846 [2025-03-08 22:08:02,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 720 places, 730 transitions, 1480 flow. Second operand has 3 states, 3 states have (on average 753.3333333333334) internal successors, (2260), 3 states have internal predecessors, (2260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:02,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:08:02,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 752 of 846 [2025-03-08 22:08:02,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:08:02,802 INFO L124 PetriNetUnfolderBase]: 70/1098 cut-off events. [2025-03-08 22:08:02,803 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-03-08 22:08:02,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1223 conditions, 1098 events. 70/1098 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 3746 event pairs, 27 based on Foata normal form. 0/940 useless extension candidates. Maximal degree in co-relation 1148. Up to 86 conditions per place. [2025-03-08 22:08:02,811 INFO L140 encePairwiseOnDemand]: 843/846 looper letters, 16 selfloop transitions, 2 changer transitions 0/729 dead transitions. [2025-03-08 22:08:02,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 721 places, 729 transitions, 1514 flow [2025-03-08 22:08:02,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:08:02,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:08:02,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2274 transitions. [2025-03-08 22:08:02,814 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8959810874704491 [2025-03-08 22:08:02,814 INFO L175 Difference]: Start difference. First operand has 720 places, 730 transitions, 1480 flow. Second operand 3 states and 2274 transitions. [2025-03-08 22:08:02,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 721 places, 729 transitions, 1514 flow [2025-03-08 22:08:02,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 719 places, 729 transitions, 1510 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:08:02,822 INFO L231 Difference]: Finished difference. Result has 719 places, 729 transitions, 1478 flow [2025-03-08 22:08:02,823 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1474, PETRI_DIFFERENCE_MINUEND_PLACES=717, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=729, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=727, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1478, PETRI_PLACES=719, PETRI_TRANSITIONS=729} [2025-03-08 22:08:02,823 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -79 predicate places. [2025-03-08 22:08:02,823 INFO L471 AbstractCegarLoop]: Abstraction has has 719 places, 729 transitions, 1478 flow [2025-03-08 22:08:02,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 753.3333333333334) internal successors, (2260), 3 states have internal predecessors, (2260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:02,824 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:08:02,825 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:08:02,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 22:08:02,825 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-08 22:08:02,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:08:02,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1876443452, now seen corresponding path program 1 times [2025-03-08 22:08:02,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:08:02,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026058594] [2025-03-08 22:08:02,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:08:02,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:08:02,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-08 22:08:02,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-08 22:08:02,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:08:02,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:08:02,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:08:02,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:08:02,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026058594] [2025-03-08 22:08:02,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026058594] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:08:02,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:08:02,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:08:02,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023724703] [2025-03-08 22:08:02,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:08:02,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:08:02,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:08:02,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:08:02,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:08:02,867 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 751 out of 846 [2025-03-08 22:08:02,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 719 places, 729 transitions, 1478 flow. Second operand has 3 states, 3 states have (on average 752.3333333333334) internal successors, (2257), 3 states have internal predecessors, (2257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:02,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:08:02,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 751 of 846 [2025-03-08 22:08:02,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:08:03,032 INFO L124 PetriNetUnfolderBase]: 110/1240 cut-off events. [2025-03-08 22:08:03,033 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2025-03-08 22:08:03,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1429 conditions, 1240 events. 110/1240 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 4970 event pairs, 53 based on Foata normal form. 0/1047 useless extension candidates. Maximal degree in co-relation 1346. Up to 142 conditions per place. [2025-03-08 22:08:03,043 INFO L140 encePairwiseOnDemand]: 843/846 looper letters, 17 selfloop transitions, 2 changer transitions 0/728 dead transitions. [2025-03-08 22:08:03,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 720 places, 728 transitions, 1514 flow [2025-03-08 22:08:03,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:08:03,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:08:03,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2272 transitions. [2025-03-08 22:08:03,047 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8951930654058313 [2025-03-08 22:08:03,047 INFO L175 Difference]: Start difference. First operand has 719 places, 729 transitions, 1478 flow. Second operand 3 states and 2272 transitions. [2025-03-08 22:08:03,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 720 places, 728 transitions, 1514 flow [2025-03-08 22:08:03,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 718 places, 728 transitions, 1510 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:08:03,055 INFO L231 Difference]: Finished difference. Result has 718 places, 728 transitions, 1476 flow [2025-03-08 22:08:03,056 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1472, PETRI_DIFFERENCE_MINUEND_PLACES=716, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=728, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=726, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1476, PETRI_PLACES=718, PETRI_TRANSITIONS=728} [2025-03-08 22:08:03,057 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -80 predicate places. [2025-03-08 22:08:03,057 INFO L471 AbstractCegarLoop]: Abstraction has has 718 places, 728 transitions, 1476 flow [2025-03-08 22:08:03,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 752.3333333333334) internal successors, (2257), 3 states have internal predecessors, (2257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:03,058 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:08:03,058 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:08:03,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 22:08:03,059 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-08 22:08:03,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:08:03,059 INFO L85 PathProgramCache]: Analyzing trace with hash -728660816, now seen corresponding path program 1 times [2025-03-08 22:08:03,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:08:03,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092927189] [2025-03-08 22:08:03,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:08:03,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:08:03,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-08 22:08:03,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 22:08:03,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:08:03,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:08:03,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:08:03,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:08:03,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092927189] [2025-03-08 22:08:03,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092927189] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:08:03,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:08:03,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:08:03,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149050426] [2025-03-08 22:08:03,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:08:03,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:08:03,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:08:03,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:08:03,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:08:03,137 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 747 out of 846 [2025-03-08 22:08:03,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 718 places, 728 transitions, 1476 flow. Second operand has 3 states, 3 states have (on average 748.3333333333334) internal successors, (2245), 3 states have internal predecessors, (2245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:03,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:08:03,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 747 of 846 [2025-03-08 22:08:03,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:08:03,359 INFO L124 PetriNetUnfolderBase]: 208/1516 cut-off events. [2025-03-08 22:08:03,359 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2025-03-08 22:08:03,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1888 conditions, 1516 events. 208/1516 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 7057 event pairs, 129 based on Foata normal form. 0/1230 useless extension candidates. Maximal degree in co-relation 1797. Up to 291 conditions per place. [2025-03-08 22:08:03,369 INFO L140 encePairwiseOnDemand]: 843/846 looper letters, 21 selfloop transitions, 2 changer transitions 0/727 dead transitions. [2025-03-08 22:08:03,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 719 places, 727 transitions, 1520 flow [2025-03-08 22:08:03,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:08:03,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:08:03,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2264 transitions. [2025-03-08 22:08:03,373 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8920409771473601 [2025-03-08 22:08:03,373 INFO L175 Difference]: Start difference. First operand has 718 places, 728 transitions, 1476 flow. Second operand 3 states and 2264 transitions. [2025-03-08 22:08:03,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 719 places, 727 transitions, 1520 flow [2025-03-08 22:08:03,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 717 places, 727 transitions, 1516 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:08:03,380 INFO L231 Difference]: Finished difference. Result has 717 places, 727 transitions, 1474 flow [2025-03-08 22:08:03,381 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1470, PETRI_DIFFERENCE_MINUEND_PLACES=715, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=727, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=725, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1474, PETRI_PLACES=717, PETRI_TRANSITIONS=727} [2025-03-08 22:08:03,382 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -81 predicate places. [2025-03-08 22:08:03,382 INFO L471 AbstractCegarLoop]: Abstraction has has 717 places, 727 transitions, 1474 flow [2025-03-08 22:08:03,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 748.3333333333334) internal successors, (2245), 3 states have internal predecessors, (2245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:03,383 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:08:03,383 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:08:03,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 22:08:03,384 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-08 22:08:03,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:08:03,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1661570611, now seen corresponding path program 1 times [2025-03-08 22:08:03,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:08:03,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375817571] [2025-03-08 22:08:03,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:08:03,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:08:03,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 22:08:03,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 22:08:03,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:08:03,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:08:03,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:08:03,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:08:03,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375817571] [2025-03-08 22:08:03,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375817571] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:08:03,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:08:03,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:08:03,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452133839] [2025-03-08 22:08:03,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:08:03,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:08:03,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:08:03,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:08:03,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:08:03,442 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 748 out of 846 [2025-03-08 22:08:03,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 717 places, 727 transitions, 1474 flow. Second operand has 3 states, 3 states have (on average 749.3333333333334) internal successors, (2248), 3 states have internal predecessors, (2248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:03,444 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:08:03,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 748 of 846 [2025-03-08 22:08:03,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:08:03,623 INFO L124 PetriNetUnfolderBase]: 110/1238 cut-off events. [2025-03-08 22:08:03,623 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2025-03-08 22:08:03,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1430 conditions, 1238 events. 110/1238 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4970 event pairs, 53 based on Foata normal form. 0/1052 useless extension candidates. Maximal degree in co-relation 1331. Up to 145 conditions per place. [2025-03-08 22:08:03,634 INFO L140 encePairwiseOnDemand]: 843/846 looper letters, 20 selfloop transitions, 2 changer transitions 0/726 dead transitions. [2025-03-08 22:08:03,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 718 places, 726 transitions, 1516 flow [2025-03-08 22:08:03,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:08:03,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:08:03,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2266 transitions. [2025-03-08 22:08:03,639 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8928289992119779 [2025-03-08 22:08:03,639 INFO L175 Difference]: Start difference. First operand has 717 places, 727 transitions, 1474 flow. Second operand 3 states and 2266 transitions. [2025-03-08 22:08:03,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 718 places, 726 transitions, 1516 flow [2025-03-08 22:08:03,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 716 places, 726 transitions, 1512 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:08:03,646 INFO L231 Difference]: Finished difference. Result has 716 places, 726 transitions, 1472 flow [2025-03-08 22:08:03,647 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1468, PETRI_DIFFERENCE_MINUEND_PLACES=714, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=726, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=724, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1472, PETRI_PLACES=716, PETRI_TRANSITIONS=726} [2025-03-08 22:08:03,648 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -82 predicate places. [2025-03-08 22:08:03,648 INFO L471 AbstractCegarLoop]: Abstraction has has 716 places, 726 transitions, 1472 flow [2025-03-08 22:08:03,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 749.3333333333334) internal successors, (2248), 3 states have internal predecessors, (2248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:03,649 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:08:03,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] [2025-03-08 22:08:03,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 22:08:03,649 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-08 22:08:03,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:08:03,650 INFO L85 PathProgramCache]: Analyzing trace with hash -619462703, now seen corresponding path program 1 times [2025-03-08 22:08:03,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:08:03,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972955955] [2025-03-08 22:08:03,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:08:03,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:08:03,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-08 22:08:03,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-08 22:08:03,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:08:03,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:08:03,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:08:03,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:08:03,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972955955] [2025-03-08 22:08:03,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972955955] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:08:03,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:08:03,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:08:03,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236455316] [2025-03-08 22:08:03,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:08:03,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:08:03,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:08:03,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:08:03,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:08:03,699 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 751 out of 846 [2025-03-08 22:08:03,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 716 places, 726 transitions, 1472 flow. Second operand has 3 states, 3 states have (on average 752.3333333333334) internal successors, (2257), 3 states have internal predecessors, (2257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:03,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:08:03,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 751 of 846 [2025-03-08 22:08:03,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:08:03,892 INFO L124 PetriNetUnfolderBase]: 110/1237 cut-off events. [2025-03-08 22:08:03,892 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2025-03-08 22:08:03,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1426 conditions, 1237 events. 110/1237 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 4845 event pairs, 53 based on Foata normal form. 0/1044 useless extension candidates. Maximal degree in co-relation 1319. Up to 142 conditions per place. [2025-03-08 22:08:03,900 INFO L140 encePairwiseOnDemand]: 843/846 looper letters, 17 selfloop transitions, 2 changer transitions 0/725 dead transitions. [2025-03-08 22:08:03,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 717 places, 725 transitions, 1508 flow [2025-03-08 22:08:03,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:08:03,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:08:03,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2272 transitions. [2025-03-08 22:08:03,903 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8951930654058313 [2025-03-08 22:08:03,904 INFO L175 Difference]: Start difference. First operand has 716 places, 726 transitions, 1472 flow. Second operand 3 states and 2272 transitions. [2025-03-08 22:08:03,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 717 places, 725 transitions, 1508 flow [2025-03-08 22:08:03,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 715 places, 725 transitions, 1504 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:08:03,910 INFO L231 Difference]: Finished difference. Result has 715 places, 725 transitions, 1470 flow [2025-03-08 22:08:03,911 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1466, PETRI_DIFFERENCE_MINUEND_PLACES=713, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=725, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=723, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1470, PETRI_PLACES=715, PETRI_TRANSITIONS=725} [2025-03-08 22:08:03,912 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -83 predicate places. [2025-03-08 22:08:03,912 INFO L471 AbstractCegarLoop]: Abstraction has has 715 places, 725 transitions, 1470 flow [2025-03-08 22:08:03,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 752.3333333333334) internal successors, (2257), 3 states have internal predecessors, (2257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:03,913 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:08:03,913 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-08 22:08:03,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 22:08:03,913 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-08 22:08:03,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:08:03,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1410892752, now seen corresponding path program 1 times [2025-03-08 22:08:03,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:08:03,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427015369] [2025-03-08 22:08:03,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:08:03,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:08:03,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 22:08:03,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 22:08:03,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:08:03,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:08:03,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:08:03,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:08:03,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427015369] [2025-03-08 22:08:03,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427015369] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:08:03,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:08:03,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:08:03,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899182524] [2025-03-08 22:08:03,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:08:03,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:08:03,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:08:03,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:08:03,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:08:03,965 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 753 out of 846 [2025-03-08 22:08:03,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 715 places, 725 transitions, 1470 flow. Second operand has 3 states, 3 states have (on average 754.0) internal successors, (2262), 3 states have internal predecessors, (2262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:03,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:08:03,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 753 of 846 [2025-03-08 22:08:03,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:08:04,678 INFO L124 PetriNetUnfolderBase]: 252/4879 cut-off events. [2025-03-08 22:08:04,678 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2025-03-08 22:08:04,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5148 conditions, 4879 events. 252/4879 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 35826 event pairs, 79 based on Foata normal form. 0/3902 useless extension candidates. Maximal degree in co-relation 5033. Up to 214 conditions per place. [2025-03-08 22:08:04,711 INFO L140 encePairwiseOnDemand]: 843/846 looper letters, 16 selfloop transitions, 1 changer transitions 0/723 dead transitions. [2025-03-08 22:08:04,711 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 715 places, 723 transitions, 1500 flow [2025-03-08 22:08:04,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:08:04,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:08:04,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2277 transitions. [2025-03-08 22:08:04,715 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8971631205673759 [2025-03-08 22:08:04,715 INFO L175 Difference]: Start difference. First operand has 715 places, 725 transitions, 1470 flow. Second operand 3 states and 2277 transitions. [2025-03-08 22:08:04,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 715 places, 723 transitions, 1500 flow [2025-03-08 22:08:04,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 713 places, 723 transitions, 1496 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:08:04,723 INFO L231 Difference]: Finished difference. Result has 713 places, 723 transitions, 1464 flow [2025-03-08 22:08:04,724 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1462, PETRI_DIFFERENCE_MINUEND_PLACES=711, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=723, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=722, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1464, PETRI_PLACES=713, PETRI_TRANSITIONS=723} [2025-03-08 22:08:04,724 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -85 predicate places. [2025-03-08 22:08:04,724 INFO L471 AbstractCegarLoop]: Abstraction has has 713 places, 723 transitions, 1464 flow [2025-03-08 22:08:04,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 754.0) internal successors, (2262), 3 states have internal predecessors, (2262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:04,726 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:08:04,726 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] [2025-03-08 22:08:04,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 22:08:04,726 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-08 22:08:04,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:08:04,727 INFO L85 PathProgramCache]: Analyzing trace with hash 175784740, now seen corresponding path program 1 times [2025-03-08 22:08:04,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:08:04,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634656832] [2025-03-08 22:08:04,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:08:04,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:08:04,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 22:08:04,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 22:08:04,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:08:04,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:08:05,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:08:05,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:08:05,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634656832] [2025-03-08 22:08:05,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634656832] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:08:05,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:08:05,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:08:05,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437120008] [2025-03-08 22:08:05,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:08:05,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:08:05,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:08:05,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:08:05,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:08:05,546 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 670 out of 846 [2025-03-08 22:08:05,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 713 places, 723 transitions, 1464 flow. Second operand has 6 states, 6 states have (on average 671.5) internal successors, (4029), 6 states have internal predecessors, (4029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:05,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:08:05,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 670 of 846 [2025-03-08 22:08:05,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:08:06,952 INFO L124 PetriNetUnfolderBase]: 2081/10266 cut-off events. [2025-03-08 22:08:06,953 INFO L125 PetriNetUnfolderBase]: For 690/690 co-relation queries the response was YES. [2025-03-08 22:08:06,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13600 conditions, 10266 events. 2081/10266 cut-off events. For 690/690 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 91882 event pairs, 1421 based on Foata normal form. 0/8440 useless extension candidates. Maximal degree in co-relation 13486. Up to 2842 conditions per place. [2025-03-08 22:08:07,013 INFO L140 encePairwiseOnDemand]: 822/846 looper letters, 78 selfloop transitions, 20 changer transitions 0/719 dead transitions. [2025-03-08 22:08:07,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 714 places, 719 transitions, 1652 flow [2025-03-08 22:08:07,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:08:07,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:08:07,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4121 transitions. [2025-03-08 22:08:07,019 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8118597320724981 [2025-03-08 22:08:07,019 INFO L175 Difference]: Start difference. First operand has 713 places, 723 transitions, 1464 flow. Second operand 6 states and 4121 transitions. [2025-03-08 22:08:07,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 714 places, 719 transitions, 1652 flow [2025-03-08 22:08:07,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 713 places, 719 transitions, 1651 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:08:07,027 INFO L231 Difference]: Finished difference. Result has 713 places, 719 transitions, 1495 flow [2025-03-08 22:08:07,028 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1455, PETRI_DIFFERENCE_MINUEND_PLACES=708, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=719, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=699, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1495, PETRI_PLACES=713, PETRI_TRANSITIONS=719} [2025-03-08 22:08:07,028 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -85 predicate places. [2025-03-08 22:08:07,028 INFO L471 AbstractCegarLoop]: Abstraction has has 713 places, 719 transitions, 1495 flow [2025-03-08 22:08:07,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 671.5) internal successors, (4029), 6 states have internal predecessors, (4029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:07,030 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:08:07,030 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] [2025-03-08 22:08:07,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 22:08:07,030 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-08 22:08:07,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:08:07,031 INFO L85 PathProgramCache]: Analyzing trace with hash -760943436, now seen corresponding path program 1 times [2025-03-08 22:08:07,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:08:07,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959537171] [2025-03-08 22:08:07,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:08:07,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:08:07,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 22:08:07,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 22:08:07,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:08:07,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:08:07,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:08:07,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:08:07,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959537171] [2025-03-08 22:08:07,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959537171] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:08:07,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:08:07,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:08:07,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32950923] [2025-03-08 22:08:07,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:08:07,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:08:07,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:08:07,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:08:07,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:08:07,146 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 750 out of 846 [2025-03-08 22:08:07,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 713 places, 719 transitions, 1495 flow. Second operand has 3 states, 3 states have (on average 751.3333333333334) internal successors, (2254), 3 states have internal predecessors, (2254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:07,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:08:07,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 750 of 846 [2025-03-08 22:08:07,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:08:07,357 INFO L124 PetriNetUnfolderBase]: 190/1516 cut-off events. [2025-03-08 22:08:07,358 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2025-03-08 22:08:07,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1851 conditions, 1516 events. 190/1516 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 7093 event pairs, 105 based on Foata normal form. 0/1265 useless extension candidates. Maximal degree in co-relation 1787. Up to 253 conditions per place. [2025-03-08 22:08:07,372 INFO L140 encePairwiseOnDemand]: 843/846 looper letters, 18 selfloop transitions, 2 changer transitions 0/718 dead transitions. [2025-03-08 22:08:07,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 714 places, 718 transitions, 1533 flow [2025-03-08 22:08:07,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:08:07,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:08:07,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2270 transitions. [2025-03-08 22:08:07,376 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8944050433412135 [2025-03-08 22:08:07,376 INFO L175 Difference]: Start difference. First operand has 713 places, 719 transitions, 1495 flow. Second operand 3 states and 2270 transitions. [2025-03-08 22:08:07,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 714 places, 718 transitions, 1533 flow [2025-03-08 22:08:07,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 709 places, 718 transitions, 1493 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:08:07,384 INFO L231 Difference]: Finished difference. Result has 709 places, 718 transitions, 1457 flow [2025-03-08 22:08:07,386 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1453, PETRI_DIFFERENCE_MINUEND_PLACES=707, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=718, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=716, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1457, PETRI_PLACES=709, PETRI_TRANSITIONS=718} [2025-03-08 22:08:07,386 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -89 predicate places. [2025-03-08 22:08:07,386 INFO L471 AbstractCegarLoop]: Abstraction has has 709 places, 718 transitions, 1457 flow [2025-03-08 22:08:07,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 751.3333333333334) internal successors, (2254), 3 states have internal predecessors, (2254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:07,387 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:08:07,388 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] [2025-03-08 22:08:07,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 22:08:07,388 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-08 22:08:07,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:08:07,389 INFO L85 PathProgramCache]: Analyzing trace with hash -344921664, now seen corresponding path program 1 times [2025-03-08 22:08:07,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:08:07,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230064061] [2025-03-08 22:08:07,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:08:07,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:08:07,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 22:08:07,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 22:08:07,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:08:07,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:08:07,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:08:07,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:08:07,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230064061] [2025-03-08 22:08:07,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230064061] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:08:07,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:08:07,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:08:07,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488375329] [2025-03-08 22:08:07,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:08:07,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:08:07,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:08:07,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:08:07,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:08:07,453 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 741 out of 846 [2025-03-08 22:08:07,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 709 places, 718 transitions, 1457 flow. Second operand has 3 states, 3 states have (on average 742.0) internal successors, (2226), 3 states have internal predecessors, (2226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:07,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:08:07,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 741 of 846 [2025-03-08 22:08:07,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:08:09,042 INFO L124 PetriNetUnfolderBase]: 681/9111 cut-off events. [2025-03-08 22:08:09,042 INFO L125 PetriNetUnfolderBase]: For 142/142 co-relation queries the response was YES. [2025-03-08 22:08:09,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9940 conditions, 9111 events. 681/9111 cut-off events. For 142/142 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 83911 event pairs, 287 based on Foata normal form. 0/7284 useless extension candidates. Maximal degree in co-relation 9825. Up to 689 conditions per place. [2025-03-08 22:08:09,124 INFO L140 encePairwiseOnDemand]: 839/846 looper letters, 24 selfloop transitions, 1 changer transitions 0/712 dead transitions. [2025-03-08 22:08:09,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 705 places, 712 transitions, 1495 flow [2025-03-08 22:08:09,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:08:09,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:08:09,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2253 transitions. [2025-03-08 22:08:09,128 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8877068557919622 [2025-03-08 22:08:09,129 INFO L175 Difference]: Start difference. First operand has 709 places, 718 transitions, 1457 flow. Second operand 3 states and 2253 transitions. [2025-03-08 22:08:09,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 705 places, 712 transitions, 1495 flow [2025-03-08 22:08:09,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 703 places, 712 transitions, 1491 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:08:09,137 INFO L231 Difference]: Finished difference. Result has 703 places, 712 transitions, 1443 flow [2025-03-08 22:08:09,138 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1441, PETRI_DIFFERENCE_MINUEND_PLACES=701, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=712, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=711, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1443, PETRI_PLACES=703, PETRI_TRANSITIONS=712} [2025-03-08 22:08:09,138 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -95 predicate places. [2025-03-08 22:08:09,138 INFO L471 AbstractCegarLoop]: Abstraction has has 703 places, 712 transitions, 1443 flow [2025-03-08 22:08:09,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 742.0) internal successors, (2226), 3 states have internal predecessors, (2226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:09,139 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:08:09,139 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:08:09,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 22:08:09,139 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-08 22:08:09,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:08:09,140 INFO L85 PathProgramCache]: Analyzing trace with hash -373220394, now seen corresponding path program 1 times [2025-03-08 22:08:09,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:08:09,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055317675] [2025-03-08 22:08:09,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:08:09,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:08:09,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-08 22:08:09,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-08 22:08:09,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:08:09,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:08:09,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:08:09,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:08:09,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055317675] [2025-03-08 22:08:09,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055317675] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:08:09,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:08:09,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:08:09,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650690123] [2025-03-08 22:08:09,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:08:09,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:08:09,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:08:09,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:08:09,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:08:09,201 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 751 out of 846 [2025-03-08 22:08:09,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 703 places, 712 transitions, 1443 flow. Second operand has 3 states, 3 states have (on average 752.3333333333334) internal successors, (2257), 3 states have internal predecessors, (2257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:09,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:08:09,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 751 of 846 [2025-03-08 22:08:09,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:08:09,380 INFO L124 PetriNetUnfolderBase]: 131/1261 cut-off events. [2025-03-08 22:08:09,380 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2025-03-08 22:08:09,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1494 conditions, 1261 events. 131/1261 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 4958 event pairs, 71 based on Foata normal form. 0/1075 useless extension candidates. Maximal degree in co-relation 1379. Up to 175 conditions per place. [2025-03-08 22:08:09,388 INFO L140 encePairwiseOnDemand]: 843/846 looper letters, 17 selfloop transitions, 2 changer transitions 0/711 dead transitions. [2025-03-08 22:08:09,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 704 places, 711 transitions, 1479 flow [2025-03-08 22:08:09,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:08:09,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:08:09,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2272 transitions. [2025-03-08 22:08:09,392 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8951930654058313 [2025-03-08 22:08:09,392 INFO L175 Difference]: Start difference. First operand has 703 places, 712 transitions, 1443 flow. Second operand 3 states and 2272 transitions. [2025-03-08 22:08:09,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 704 places, 711 transitions, 1479 flow [2025-03-08 22:08:09,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 703 places, 711 transitions, 1478 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:08:09,399 INFO L231 Difference]: Finished difference. Result has 703 places, 711 transitions, 1444 flow [2025-03-08 22:08:09,400 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1440, PETRI_DIFFERENCE_MINUEND_PLACES=701, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=711, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=709, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1444, PETRI_PLACES=703, PETRI_TRANSITIONS=711} [2025-03-08 22:08:09,400 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -95 predicate places. [2025-03-08 22:08:09,400 INFO L471 AbstractCegarLoop]: Abstraction has has 703 places, 711 transitions, 1444 flow [2025-03-08 22:08:09,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 752.3333333333334) internal successors, (2257), 3 states have internal predecessors, (2257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:09,401 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:08:09,401 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:08:09,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 22:08:09,401 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-08 22:08:09,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:08:09,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1394164003, now seen corresponding path program 1 times [2025-03-08 22:08:09,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:08:09,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153979559] [2025-03-08 22:08:09,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:08:09,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:08:09,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-08 22:08:09,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-08 22:08:09,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:08:09,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:08:09,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:08:09,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:08:09,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153979559] [2025-03-08 22:08:09,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153979559] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:08:09,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:08:09,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:08:09,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843834311] [2025-03-08 22:08:09,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:08:09,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:08:09,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:08:09,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:08:09,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:08:09,450 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 756 out of 846 [2025-03-08 22:08:09,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 703 places, 711 transitions, 1444 flow. Second operand has 3 states, 3 states have (on average 757.0) internal successors, (2271), 3 states have internal predecessors, (2271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:09,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:08:09,452 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 756 of 846 [2025-03-08 22:08:09,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:08:09,571 INFO L124 PetriNetUnfolderBase]: 70/1071 cut-off events. [2025-03-08 22:08:09,571 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-03-08 22:08:09,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1195 conditions, 1071 events. 70/1071 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 3592 event pairs, 27 based on Foata normal form. 0/940 useless extension candidates. Maximal degree in co-relation 1080. Up to 83 conditions per place. [2025-03-08 22:08:09,580 INFO L140 encePairwiseOnDemand]: 844/846 looper letters, 14 selfloop transitions, 1 changer transitions 0/710 dead transitions. [2025-03-08 22:08:09,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 704 places, 710 transitions, 1472 flow [2025-03-08 22:08:09,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:08:09,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:08:09,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2283 transitions. [2025-03-08 22:08:09,583 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8995271867612293 [2025-03-08 22:08:09,584 INFO L175 Difference]: Start difference. First operand has 703 places, 711 transitions, 1444 flow. Second operand 3 states and 2283 transitions. [2025-03-08 22:08:09,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 704 places, 710 transitions, 1472 flow [2025-03-08 22:08:09,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 702 places, 710 transitions, 1468 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:08:09,591 INFO L231 Difference]: Finished difference. Result has 702 places, 710 transitions, 1440 flow [2025-03-08 22:08:09,591 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1438, PETRI_DIFFERENCE_MINUEND_PLACES=700, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=710, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=709, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1440, PETRI_PLACES=702, PETRI_TRANSITIONS=710} [2025-03-08 22:08:09,592 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -96 predicate places. [2025-03-08 22:08:09,592 INFO L471 AbstractCegarLoop]: Abstraction has has 702 places, 710 transitions, 1440 flow [2025-03-08 22:08:09,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 757.0) internal successors, (2271), 3 states have internal predecessors, (2271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:09,592 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:08:09,592 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:08:09,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 22:08:09,593 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-08 22:08:09,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:08:09,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1582542028, now seen corresponding path program 1 times [2025-03-08 22:08:09,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:08:09,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114668902] [2025-03-08 22:08:09,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:08:09,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:08:09,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-08 22:08:09,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-08 22:08:09,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:08:09,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:08:09,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:08:09,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:08:09,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114668902] [2025-03-08 22:08:09,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114668902] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:08:09,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:08:09,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:08:09,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595501560] [2025-03-08 22:08:09,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:08:09,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:08:09,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:08:09,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:08:09,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:08:09,648 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 753 out of 846 [2025-03-08 22:08:09,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 702 places, 710 transitions, 1440 flow. Second operand has 3 states, 3 states have (on average 754.3333333333334) internal successors, (2263), 3 states have internal predecessors, (2263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:09,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:08:09,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 753 of 846 [2025-03-08 22:08:09,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:08:09,799 INFO L124 PetriNetUnfolderBase]: 70/1070 cut-off events. [2025-03-08 22:08:09,799 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-03-08 22:08:09,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1195 conditions, 1070 events. 70/1070 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 3611 event pairs, 27 based on Foata normal form. 0/940 useless extension candidates. Maximal degree in co-relation 1080. Up to 85 conditions per place. [2025-03-08 22:08:09,808 INFO L140 encePairwiseOnDemand]: 843/846 looper letters, 15 selfloop transitions, 2 changer transitions 0/709 dead transitions. [2025-03-08 22:08:09,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 703 places, 709 transitions, 1472 flow [2025-03-08 22:08:09,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:08:09,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:08:09,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2276 transitions. [2025-03-08 22:08:09,811 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8967691095350669 [2025-03-08 22:08:09,811 INFO L175 Difference]: Start difference. First operand has 702 places, 710 transitions, 1440 flow. Second operand 3 states and 2276 transitions. [2025-03-08 22:08:09,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 703 places, 709 transitions, 1472 flow [2025-03-08 22:08:09,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 702 places, 709 transitions, 1471 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:08:09,818 INFO L231 Difference]: Finished difference. Result has 702 places, 709 transitions, 1441 flow [2025-03-08 22:08:09,819 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1437, PETRI_DIFFERENCE_MINUEND_PLACES=700, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=709, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=707, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1441, PETRI_PLACES=702, PETRI_TRANSITIONS=709} [2025-03-08 22:08:09,819 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -96 predicate places. [2025-03-08 22:08:09,819 INFO L471 AbstractCegarLoop]: Abstraction has has 702 places, 709 transitions, 1441 flow [2025-03-08 22:08:09,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 754.3333333333334) internal successors, (2263), 3 states have internal predecessors, (2263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:09,819 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:08:09,820 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:08:09,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 22:08:09,820 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-08 22:08:09,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:08:09,821 INFO L85 PathProgramCache]: Analyzing trace with hash 2092544408, now seen corresponding path program 1 times [2025-03-08 22:08:09,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:08:09,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415870124] [2025-03-08 22:08:09,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:08:09,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:08:09,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-03-08 22:08:09,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-03-08 22:08:09,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:08:09,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:08:09,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:08:09,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:08:09,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415870124] [2025-03-08 22:08:09,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415870124] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:08:09,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:08:09,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:08:09,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643105316] [2025-03-08 22:08:09,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:08:09,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:08:09,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:08:09,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:08:09,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:08:10,046 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 700 out of 846 [2025-03-08 22:08:10,047 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 702 places, 709 transitions, 1441 flow. Second operand has 3 states, 3 states have (on average 702.0) internal successors, (2106), 3 states have internal predecessors, (2106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:10,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:08:10,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 700 of 846 [2025-03-08 22:08:10,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:08:11,401 INFO L124 PetriNetUnfolderBase]: 2081/10172 cut-off events. [2025-03-08 22:08:11,401 INFO L125 PetriNetUnfolderBase]: For 690/690 co-relation queries the response was YES. [2025-03-08 22:08:11,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13483 conditions, 10172 events. 2081/10172 cut-off events. For 690/690 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 90755 event pairs, 1421 based on Foata normal form. 0/8440 useless extension candidates. Maximal degree in co-relation 13369. Up to 2833 conditions per place. [2025-03-08 22:08:11,463 INFO L140 encePairwiseOnDemand]: 843/846 looper letters, 69 selfloop transitions, 2 changer transitions 0/708 dead transitions. [2025-03-08 22:08:11,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 703 places, 708 transitions, 1581 flow [2025-03-08 22:08:11,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:08:11,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:08:11,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2171 transitions. [2025-03-08 22:08:11,466 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.855397951142632 [2025-03-08 22:08:11,466 INFO L175 Difference]: Start difference. First operand has 702 places, 709 transitions, 1441 flow. Second operand 3 states and 2171 transitions. [2025-03-08 22:08:11,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 703 places, 708 transitions, 1581 flow [2025-03-08 22:08:11,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 701 places, 708 transitions, 1577 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:08:11,473 INFO L231 Difference]: Finished difference. Result has 701 places, 708 transitions, 1439 flow [2025-03-08 22:08:11,474 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1435, PETRI_DIFFERENCE_MINUEND_PLACES=699, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=708, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=706, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1439, PETRI_PLACES=701, PETRI_TRANSITIONS=708} [2025-03-08 22:08:11,474 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -97 predicate places. [2025-03-08 22:08:11,474 INFO L471 AbstractCegarLoop]: Abstraction has has 701 places, 708 transitions, 1439 flow [2025-03-08 22:08:11,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 702.0) internal successors, (2106), 3 states have internal predecessors, (2106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:11,475 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:08:11,475 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:08:11,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 22:08:11,475 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-08 22:08:11,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:08:11,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1273105115, now seen corresponding path program 1 times [2025-03-08 22:08:11,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:08:11,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281387437] [2025-03-08 22:08:11,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:08:11,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:08:11,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 241 statements into 1 equivalence classes. [2025-03-08 22:08:11,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 241 of 241 statements. [2025-03-08 22:08:11,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:08:11,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:08:11,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:08:11,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:08:11,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281387437] [2025-03-08 22:08:11,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281387437] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:08:11,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:08:11,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:08:11,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182779015] [2025-03-08 22:08:11,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:08:11,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:08:11,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:08:11,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:08:11,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:08:11,537 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 752 out of 846 [2025-03-08 22:08:11,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 701 places, 708 transitions, 1439 flow. Second operand has 3 states, 3 states have (on average 753.3333333333334) internal successors, (2260), 3 states have internal predecessors, (2260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:11,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:08:11,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 752 of 846 [2025-03-08 22:08:11,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:08:11,705 INFO L124 PetriNetUnfolderBase]: 110/1209 cut-off events. [2025-03-08 22:08:11,705 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2025-03-08 22:08:11,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1400 conditions, 1209 events. 110/1209 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 4390 event pairs, 53 based on Foata normal form. 0/1043 useless extension candidates. Maximal degree in co-relation 1387. Up to 141 conditions per place. [2025-03-08 22:08:11,714 INFO L140 encePairwiseOnDemand]: 843/846 looper letters, 16 selfloop transitions, 2 changer transitions 0/707 dead transitions. [2025-03-08 22:08:11,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 702 places, 707 transitions, 1473 flow [2025-03-08 22:08:11,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:08:11,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:08:11,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2274 transitions. [2025-03-08 22:08:11,717 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8959810874704491 [2025-03-08 22:08:11,717 INFO L175 Difference]: Start difference. First operand has 701 places, 708 transitions, 1439 flow. Second operand 3 states and 2274 transitions. [2025-03-08 22:08:11,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 702 places, 707 transitions, 1473 flow [2025-03-08 22:08:11,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 700 places, 707 transitions, 1469 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:08:11,723 INFO L231 Difference]: Finished difference. Result has 700 places, 707 transitions, 1437 flow [2025-03-08 22:08:11,724 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1433, PETRI_DIFFERENCE_MINUEND_PLACES=698, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=707, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=705, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1437, PETRI_PLACES=700, PETRI_TRANSITIONS=707} [2025-03-08 22:08:11,724 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -98 predicate places. [2025-03-08 22:08:11,724 INFO L471 AbstractCegarLoop]: Abstraction has has 700 places, 707 transitions, 1437 flow [2025-03-08 22:08:11,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 753.3333333333334) internal successors, (2260), 3 states have internal predecessors, (2260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:11,726 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:08:11,726 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:08:11,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 22:08:11,727 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-08 22:08:11,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:08:11,728 INFO L85 PathProgramCache]: Analyzing trace with hash 667229051, now seen corresponding path program 1 times [2025-03-08 22:08:11,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:08:11,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347871042] [2025-03-08 22:08:11,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:08:11,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:08:11,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 245 statements into 1 equivalence classes. [2025-03-08 22:08:11,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 245 of 245 statements. [2025-03-08 22:08:11,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:08:11,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:08:11,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:08:11,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:08:11,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347871042] [2025-03-08 22:08:11,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347871042] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:08:11,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:08:11,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:08:11,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639035234] [2025-03-08 22:08:11,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:08:11,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:08:11,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:08:11,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:08:11,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:08:11,797 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 744 out of 846 [2025-03-08 22:08:11,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 700 places, 707 transitions, 1437 flow. Second operand has 3 states, 3 states have (on average 745.0) internal successors, (2235), 3 states have internal predecessors, (2235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:11,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:08:11,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 744 of 846 [2025-03-08 22:08:11,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:08:12,369 INFO L124 PetriNetUnfolderBase]: 252/4797 cut-off events. [2025-03-08 22:08:12,369 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2025-03-08 22:08:12,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5075 conditions, 4797 events. 252/4797 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 35602 event pairs, 79 based on Foata normal form. 0/3907 useless extension candidates. Maximal degree in co-relation 4960. Up to 220 conditions per place. [2025-03-08 22:08:12,407 INFO L140 encePairwiseOnDemand]: 840/846 looper letters, 22 selfloop transitions, 1 changer transitions 0/702 dead transitions. [2025-03-08 22:08:12,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 697 places, 702 transitions, 1473 flow [2025-03-08 22:08:12,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:08:12,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:08:12,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2259 transitions. [2025-03-08 22:08:12,410 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8900709219858156 [2025-03-08 22:08:12,410 INFO L175 Difference]: Start difference. First operand has 700 places, 707 transitions, 1437 flow. Second operand 3 states and 2259 transitions. [2025-03-08 22:08:12,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 697 places, 702 transitions, 1473 flow [2025-03-08 22:08:12,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 695 places, 702 transitions, 1469 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:08:12,416 INFO L231 Difference]: Finished difference. Result has 695 places, 702 transitions, 1425 flow [2025-03-08 22:08:12,417 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1423, PETRI_DIFFERENCE_MINUEND_PLACES=693, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=702, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=701, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1425, PETRI_PLACES=695, PETRI_TRANSITIONS=702} [2025-03-08 22:08:12,417 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -103 predicate places. [2025-03-08 22:08:12,417 INFO L471 AbstractCegarLoop]: Abstraction has has 695 places, 702 transitions, 1425 flow [2025-03-08 22:08:12,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 745.0) internal successors, (2235), 3 states have internal predecessors, (2235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:12,418 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:08:12,418 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:08:12,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 22:08:12,418 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-08 22:08:12,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:08:12,418 INFO L85 PathProgramCache]: Analyzing trace with hash -558549337, now seen corresponding path program 1 times [2025-03-08 22:08:12,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:08:12,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488807717] [2025-03-08 22:08:12,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:08:12,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:08:12,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-03-08 22:08:12,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-03-08 22:08:12,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:08:12,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:08:12,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:08:12,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:08:12,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488807717] [2025-03-08 22:08:12,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488807717] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:08:12,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:08:12,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:08:12,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620043255] [2025-03-08 22:08:12,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:08:12,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:08:12,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:08:12,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:08:12,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:08:12,477 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 751 out of 846 [2025-03-08 22:08:12,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 695 places, 702 transitions, 1425 flow. Second operand has 3 states, 3 states have (on average 752.3333333333334) internal successors, (2257), 3 states have internal predecessors, (2257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:12,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:08:12,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 751 of 846 [2025-03-08 22:08:12,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:08:12,639 INFO L124 PetriNetUnfolderBase]: 110/1203 cut-off events. [2025-03-08 22:08:12,639 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2025-03-08 22:08:12,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1394 conditions, 1203 events. 110/1203 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 4671 event pairs, 53 based on Foata normal form. 0/1045 useless extension candidates. Maximal degree in co-relation 1279. Up to 142 conditions per place. [2025-03-08 22:08:12,648 INFO L140 encePairwiseOnDemand]: 843/846 looper letters, 17 selfloop transitions, 2 changer transitions 0/701 dead transitions. [2025-03-08 22:08:12,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 696 places, 701 transitions, 1461 flow [2025-03-08 22:08:12,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:08:12,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:08:12,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2272 transitions. [2025-03-08 22:08:12,652 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8951930654058313 [2025-03-08 22:08:12,652 INFO L175 Difference]: Start difference. First operand has 695 places, 702 transitions, 1425 flow. Second operand 3 states and 2272 transitions. [2025-03-08 22:08:12,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 696 places, 701 transitions, 1461 flow [2025-03-08 22:08:12,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 695 places, 701 transitions, 1460 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:08:12,661 INFO L231 Difference]: Finished difference. Result has 695 places, 701 transitions, 1426 flow [2025-03-08 22:08:12,661 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1422, PETRI_DIFFERENCE_MINUEND_PLACES=693, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=701, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=699, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1426, PETRI_PLACES=695, PETRI_TRANSITIONS=701} [2025-03-08 22:08:12,662 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -103 predicate places. [2025-03-08 22:08:12,662 INFO L471 AbstractCegarLoop]: Abstraction has has 695 places, 701 transitions, 1426 flow [2025-03-08 22:08:12,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 752.3333333333334) internal successors, (2257), 3 states have internal predecessors, (2257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:12,662 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:08:12,662 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:08:12,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 22:08:12,663 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-08 22:08:12,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:08:12,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1140486510, now seen corresponding path program 1 times [2025-03-08 22:08:12,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:08:12,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012208751] [2025-03-08 22:08:12,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:08:12,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:08:12,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-03-08 22:08:12,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-03-08 22:08:12,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:08:12,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:08:12,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:08:12,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:08:12,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012208751] [2025-03-08 22:08:12,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012208751] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:08:12,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:08:12,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:08:12,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493346252] [2025-03-08 22:08:12,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:08:12,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:08:12,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:08:12,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:08:12,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:08:12,720 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 753 out of 846 [2025-03-08 22:08:12,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 695 places, 701 transitions, 1426 flow. Second operand has 3 states, 3 states have (on average 754.0) internal successors, (2262), 3 states have internal predecessors, (2262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:12,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:08:12,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 753 of 846 [2025-03-08 22:08:12,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:08:13,281 INFO L124 PetriNetUnfolderBase]: 293/5079 cut-off events. [2025-03-08 22:08:13,281 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2025-03-08 22:08:13,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5418 conditions, 5079 events. 293/5079 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 37578 event pairs, 40 based on Foata normal form. 0/4166 useless extension candidates. Maximal degree in co-relation 5304. Up to 227 conditions per place. [2025-03-08 22:08:13,313 INFO L140 encePairwiseOnDemand]: 841/846 looper letters, 26 selfloop transitions, 3 changer transitions 0/711 dead transitions. [2025-03-08 22:08:13,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 695 places, 711 transitions, 1512 flow [2025-03-08 22:08:13,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:08:13,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:08:13,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2289 transitions. [2025-03-08 22:08:13,316 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9018912529550828 [2025-03-08 22:08:13,316 INFO L175 Difference]: Start difference. First operand has 695 places, 701 transitions, 1426 flow. Second operand 3 states and 2289 transitions. [2025-03-08 22:08:13,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 695 places, 711 transitions, 1512 flow [2025-03-08 22:08:13,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 693 places, 711 transitions, 1508 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:08:13,322 INFO L231 Difference]: Finished difference. Result has 694 places, 702 transitions, 1441 flow [2025-03-08 22:08:13,322 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1418, PETRI_DIFFERENCE_MINUEND_PLACES=691, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=699, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=696, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1441, PETRI_PLACES=694, PETRI_TRANSITIONS=702} [2025-03-08 22:08:13,322 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -104 predicate places. [2025-03-08 22:08:13,322 INFO L471 AbstractCegarLoop]: Abstraction has has 694 places, 702 transitions, 1441 flow [2025-03-08 22:08:13,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 754.0) internal successors, (2262), 3 states have internal predecessors, (2262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:13,323 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:08:13,323 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:08:13,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 22:08:13,323 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-08 22:08:13,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:08:13,324 INFO L85 PathProgramCache]: Analyzing trace with hash 790936155, now seen corresponding path program 1 times [2025-03-08 22:08:13,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:08:13,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055942159] [2025-03-08 22:08:13,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:08:13,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:08:13,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 276 statements into 1 equivalence classes. [2025-03-08 22:08:13,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 276 of 276 statements. [2025-03-08 22:08:13,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:08:13,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:08:13,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:08:13,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:08:13,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055942159] [2025-03-08 22:08:13,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055942159] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:08:13,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:08:13,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:08:13,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200803425] [2025-03-08 22:08:13,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:08:13,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:08:13,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:08:13,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:08:13,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:08:13,380 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 753 out of 846 [2025-03-08 22:08:13,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 694 places, 702 transitions, 1441 flow. Second operand has 3 states, 3 states have (on average 754.0) internal successors, (2262), 3 states have internal predecessors, (2262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:13,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:08:13,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 753 of 846 [2025-03-08 22:08:13,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:08:14,136 INFO L124 PetriNetUnfolderBase]: 364/5532 cut-off events. [2025-03-08 22:08:14,136 INFO L125 PetriNetUnfolderBase]: For 183/225 co-relation queries the response was YES. [2025-03-08 22:08:14,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6060 conditions, 5532 events. 364/5532 cut-off events. For 183/225 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 41696 event pairs, 54 based on Foata normal form. 0/4545 useless extension candidates. Maximal degree in co-relation 5945. Up to 301 conditions per place. [2025-03-08 22:08:14,164 INFO L140 encePairwiseOnDemand]: 841/846 looper letters, 27 selfloop transitions, 4 changer transitions 0/713 dead transitions. [2025-03-08 22:08:14,164 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 694 places, 713 transitions, 1540 flow [2025-03-08 22:08:14,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:08:14,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:08:14,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2289 transitions. [2025-03-08 22:08:14,166 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9018912529550828 [2025-03-08 22:08:14,166 INFO L175 Difference]: Start difference. First operand has 694 places, 702 transitions, 1441 flow. Second operand 3 states and 2289 transitions. [2025-03-08 22:08:14,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 694 places, 713 transitions, 1540 flow [2025-03-08 22:08:14,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 694 places, 713 transitions, 1540 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:08:14,172 INFO L231 Difference]: Finished difference. Result has 695 places, 704 transitions, 1474 flow [2025-03-08 22:08:14,172 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1437, PETRI_DIFFERENCE_MINUEND_PLACES=692, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=700, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=696, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1474, PETRI_PLACES=695, PETRI_TRANSITIONS=704} [2025-03-08 22:08:14,172 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -103 predicate places. [2025-03-08 22:08:14,172 INFO L471 AbstractCegarLoop]: Abstraction has has 695 places, 704 transitions, 1474 flow [2025-03-08 22:08:14,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 754.0) internal successors, (2262), 3 states have internal predecessors, (2262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:14,173 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:08:14,173 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:08:14,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 22:08:14,173 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread1Err31ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-08 22:08:14,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:08:14,174 INFO L85 PathProgramCache]: Analyzing trace with hash -989291060, now seen corresponding path program 1 times [2025-03-08 22:08:14,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:08:14,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562008907] [2025-03-08 22:08:14,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:08:14,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:08:14,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 280 statements into 1 equivalence classes. [2025-03-08 22:08:14,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 280 of 280 statements. [2025-03-08 22:08:14,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:08:14,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:08:14,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:08:14,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:08:14,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562008907] [2025-03-08 22:08:14,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562008907] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:08:14,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:08:14,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:08:14,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021821405] [2025-03-08 22:08:14,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:08:14,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:08:14,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:08:14,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:08:14,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:08:14,225 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 757 out of 846 [2025-03-08 22:08:14,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 695 places, 704 transitions, 1474 flow. Second operand has 3 states, 3 states have (on average 758.0) internal successors, (2274), 3 states have internal predecessors, (2274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:14,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:08:14,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 757 of 846 [2025-03-08 22:08:14,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:08:14,798 INFO L124 PetriNetUnfolderBase]: 281/4298 cut-off events. [2025-03-08 22:08:14,798 INFO L125 PetriNetUnfolderBase]: For 435/689 co-relation queries the response was YES. [2025-03-08 22:08:14,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4916 conditions, 4298 events. 281/4298 cut-off events. For 435/689 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 29289 event pairs, 46 based on Foata normal form. 1/3569 useless extension candidates. Maximal degree in co-relation 4801. Up to 227 conditions per place. [2025-03-08 22:08:14,839 INFO L140 encePairwiseOnDemand]: 841/846 looper letters, 23 selfloop transitions, 4 changer transitions 0/713 dead transitions. [2025-03-08 22:08:14,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 696 places, 713 transitions, 1578 flow [2025-03-08 22:08:14,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:08:14,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:08:14,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2291 transitions. [2025-03-08 22:08:14,842 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9026792750197006 [2025-03-08 22:08:14,842 INFO L175 Difference]: Start difference. First operand has 695 places, 704 transitions, 1474 flow. Second operand 3 states and 2291 transitions. [2025-03-08 22:08:14,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 696 places, 713 transitions, 1578 flow [2025-03-08 22:08:14,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 696 places, 713 transitions, 1578 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:08:14,848 INFO L231 Difference]: Finished difference. Result has 697 places, 706 transitions, 1496 flow [2025-03-08 22:08:14,849 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1472, PETRI_DIFFERENCE_MINUEND_PLACES=694, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=703, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=699, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1496, PETRI_PLACES=697, PETRI_TRANSITIONS=706} [2025-03-08 22:08:14,849 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -101 predicate places. [2025-03-08 22:08:14,849 INFO L471 AbstractCegarLoop]: Abstraction has has 697 places, 706 transitions, 1496 flow [2025-03-08 22:08:14,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 758.0) internal successors, (2274), 3 states have internal predecessors, (2274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:14,849 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:08:14,849 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:08:14,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 22:08:14,850 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread3Err35ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-08 22:08:14,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:08:14,850 INFO L85 PathProgramCache]: Analyzing trace with hash -758568706, now seen corresponding path program 1 times [2025-03-08 22:08:14,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:08:14,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941652589] [2025-03-08 22:08:14,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:08:14,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:08:14,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 292 statements into 1 equivalence classes. [2025-03-08 22:08:14,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 292 of 292 statements. [2025-03-08 22:08:14,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:08:14,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:08:14,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:08:14,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:08:14,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941652589] [2025-03-08 22:08:14,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941652589] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:08:14,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:08:14,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:08:14,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383845837] [2025-03-08 22:08:14,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:08:14,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:08:14,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:08:14,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:08:14,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:08:14,899 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 756 out of 846 [2025-03-08 22:08:14,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 697 places, 706 transitions, 1496 flow. Second operand has 3 states, 3 states have (on average 757.6666666666666) internal successors, (2273), 3 states have internal predecessors, (2273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:14,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:08:14,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 756 of 846 [2025-03-08 22:08:14,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:08:15,827 INFO L124 PetriNetUnfolderBase]: 563/7838 cut-off events. [2025-03-08 22:08:15,827 INFO L125 PetriNetUnfolderBase]: For 844/890 co-relation queries the response was YES. [2025-03-08 22:08:15,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9152 conditions, 7838 events. 563/7838 cut-off events. For 844/890 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 67594 event pairs, 82 based on Foata normal form. 0/6480 useless extension candidates. Maximal degree in co-relation 9036. Up to 306 conditions per place. [2025-03-08 22:08:15,884 INFO L140 encePairwiseOnDemand]: 843/846 looper letters, 30 selfloop transitions, 2 changer transitions 0/717 dead transitions. [2025-03-08 22:08:15,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 698 places, 717 transitions, 1620 flow [2025-03-08 22:08:15,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:08:15,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:08:15,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2290 transitions. [2025-03-08 22:08:15,887 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9022852639873916 [2025-03-08 22:08:15,887 INFO L175 Difference]: Start difference. First operand has 697 places, 706 transitions, 1496 flow. Second operand 3 states and 2290 transitions. [2025-03-08 22:08:15,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 698 places, 717 transitions, 1620 flow [2025-03-08 22:08:15,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 697 places, 717 transitions, 1613 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:08:15,893 INFO L231 Difference]: Finished difference. Result has 697 places, 705 transitions, 1494 flow [2025-03-08 22:08:15,893 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1490, PETRI_DIFFERENCE_MINUEND_PLACES=695, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=705, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=703, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1494, PETRI_PLACES=697, PETRI_TRANSITIONS=705} [2025-03-08 22:08:15,894 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -101 predicate places. [2025-03-08 22:08:15,894 INFO L471 AbstractCegarLoop]: Abstraction has has 697 places, 705 transitions, 1494 flow [2025-03-08 22:08:15,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 757.6666666666666) internal successors, (2273), 3 states have internal predecessors, (2273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:15,894 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:08:15,894 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:08:15,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-08 22:08:15,894 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-08 22:08:15,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:08:15,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1714574113, now seen corresponding path program 1 times [2025-03-08 22:08:15,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:08:15,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566267950] [2025-03-08 22:08:15,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:08:15,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:08:15,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-03-08 22:08:15,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-03-08 22:08:15,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:08:15,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:08:15,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:08:15,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:08:15,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566267950] [2025-03-08 22:08:15,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566267950] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:08:15,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:08:15,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:08:15,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898112050] [2025-03-08 22:08:15,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:08:15,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:08:15,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:08:15,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:08:15,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:08:15,969 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 753 out of 846 [2025-03-08 22:08:15,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 697 places, 705 transitions, 1494 flow. Second operand has 3 states, 3 states have (on average 754.6666666666666) internal successors, (2264), 3 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:15,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:08:15,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 753 of 846 [2025-03-08 22:08:15,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:08:17,884 INFO L124 PetriNetUnfolderBase]: 802/11926 cut-off events. [2025-03-08 22:08:17,884 INFO L125 PetriNetUnfolderBase]: For 1117/1431 co-relation queries the response was YES. [2025-03-08 22:08:17,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13666 conditions, 11926 events. 802/11926 cut-off events. For 1117/1431 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 115290 event pairs, 89 based on Foata normal form. 2/9815 useless extension candidates. Maximal degree in co-relation 13549. Up to 609 conditions per place. [2025-03-08 22:08:17,976 INFO L140 encePairwiseOnDemand]: 842/846 looper letters, 36 selfloop transitions, 2 changer transitions 0/719 dead transitions. [2025-03-08 22:08:17,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 697 places, 719 transitions, 1639 flow [2025-03-08 22:08:17,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:08:17,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:08:17,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2288 transitions. [2025-03-08 22:08:17,979 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9014972419227738 [2025-03-08 22:08:17,979 INFO L175 Difference]: Start difference. First operand has 697 places, 705 transitions, 1494 flow. Second operand 3 states and 2288 transitions. [2025-03-08 22:08:17,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 697 places, 719 transitions, 1639 flow [2025-03-08 22:08:17,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 695 places, 719 transitions, 1635 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:08:17,986 INFO L231 Difference]: Finished difference. Result has 696 places, 705 transitions, 1500 flow [2025-03-08 22:08:17,986 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1486, PETRI_DIFFERENCE_MINUEND_PLACES=693, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=703, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=701, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1500, PETRI_PLACES=696, PETRI_TRANSITIONS=705} [2025-03-08 22:08:17,987 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -102 predicate places. [2025-03-08 22:08:17,987 INFO L471 AbstractCegarLoop]: Abstraction has has 696 places, 705 transitions, 1500 flow [2025-03-08 22:08:17,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 754.6666666666666) internal successors, (2264), 3 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:17,987 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:08:17,987 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:08:17,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-08 22:08:17,987 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread3Err34ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-08 22:08:17,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:08:17,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1600011144, now seen corresponding path program 1 times [2025-03-08 22:08:17,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:08:17,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274870226] [2025-03-08 22:08:17,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:08:17,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:08:17,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-03-08 22:08:18,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-03-08 22:08:18,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:08:18,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:08:18,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:08:18,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:08:18,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274870226] [2025-03-08 22:08:18,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274870226] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:08:18,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:08:18,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:08:18,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270045844] [2025-03-08 22:08:18,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:08:18,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:08:18,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:08:18,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:08:18,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:08:18,051 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 746 out of 846 [2025-03-08 22:08:18,052 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 696 places, 705 transitions, 1500 flow. Second operand has 3 states, 3 states have (on average 748.0) internal successors, (2244), 3 states have internal predecessors, (2244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:18,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:08:18,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 746 of 846 [2025-03-08 22:08:18,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:08:19,714 INFO L124 PetriNetUnfolderBase]: 1392/12996 cut-off events. [2025-03-08 22:08:19,714 INFO L125 PetriNetUnfolderBase]: For 2108/2200 co-relation queries the response was YES. [2025-03-08 22:08:19,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16433 conditions, 12996 events. 1392/12996 cut-off events. For 2108/2200 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 126285 event pairs, 139 based on Foata normal form. 5/10992 useless extension candidates. Maximal degree in co-relation 16315. Up to 1242 conditions per place. [2025-03-08 22:08:19,775 INFO L140 encePairwiseOnDemand]: 839/846 looper letters, 34 selfloop transitions, 2 changer transitions 5/713 dead transitions. [2025-03-08 22:08:19,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 694 places, 713 transitions, 1627 flow [2025-03-08 22:08:19,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:08:19,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:08:19,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2269 transitions. [2025-03-08 22:08:19,776 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8940110323089047 [2025-03-08 22:08:19,776 INFO L175 Difference]: Start difference. First operand has 696 places, 705 transitions, 1500 flow. Second operand 3 states and 2269 transitions. [2025-03-08 22:08:19,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 694 places, 713 transitions, 1627 flow [2025-03-08 22:08:19,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 694 places, 713 transitions, 1627 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:08:19,783 INFO L231 Difference]: Finished difference. Result has 694 places, 696 transitions, 1481 flow [2025-03-08 22:08:19,783 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1492, PETRI_DIFFERENCE_MINUEND_PLACES=692, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=701, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=699, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1481, PETRI_PLACES=694, PETRI_TRANSITIONS=696} [2025-03-08 22:08:19,785 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -104 predicate places. [2025-03-08 22:08:19,785 INFO L471 AbstractCegarLoop]: Abstraction has has 694 places, 696 transitions, 1481 flow [2025-03-08 22:08:19,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 748.0) internal successors, (2244), 3 states have internal predecessors, (2244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:19,786 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:08:19,786 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:08:19,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-08 22:08:19,786 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-08 22:08:19,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:08:19,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1728510781, now seen corresponding path program 1 times [2025-03-08 22:08:19,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:08:19,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409847282] [2025-03-08 22:08:19,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:08:19,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:08:19,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 303 statements into 1 equivalence classes. [2025-03-08 22:08:19,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 303 of 303 statements. [2025-03-08 22:08:19,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:08:19,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:08:19,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:08:19,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:08:19,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409847282] [2025-03-08 22:08:19,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409847282] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:08:19,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:08:19,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:08:19,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963504823] [2025-03-08 22:08:19,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:08:19,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:08:19,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:08:19,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:08:19,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:08:19,993 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 752 out of 846 [2025-03-08 22:08:19,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 694 places, 696 transitions, 1481 flow. Second operand has 4 states, 4 states have (on average 753.75) internal successors, (3015), 4 states have internal predecessors, (3015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:19,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:08:19,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 752 of 846 [2025-03-08 22:08:19,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:08:21,709 INFO L124 PetriNetUnfolderBase]: 745/11284 cut-off events. [2025-03-08 22:08:21,709 INFO L125 PetriNetUnfolderBase]: For 1367/1536 co-relation queries the response was YES. [2025-03-08 22:08:21,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13296 conditions, 11284 events. 745/11284 cut-off events. For 1367/1536 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 107223 event pairs, 100 based on Foata normal form. 0/9466 useless extension candidates. Maximal degree in co-relation 13176. Up to 271 conditions per place. [2025-03-08 22:08:21,784 INFO L140 encePairwiseOnDemand]: 839/846 looper letters, 35 selfloop transitions, 6 changer transitions 0/713 dead transitions. [2025-03-08 22:08:21,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 693 places, 713 transitions, 1669 flow [2025-03-08 22:08:21,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:08:21,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-08 22:08:21,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 3036 transitions. [2025-03-08 22:08:21,786 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8971631205673759 [2025-03-08 22:08:21,786 INFO L175 Difference]: Start difference. First operand has 694 places, 696 transitions, 1481 flow. Second operand 4 states and 3036 transitions. [2025-03-08 22:08:21,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 693 places, 713 transitions, 1669 flow [2025-03-08 22:08:21,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 691 places, 713 transitions, 1665 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:08:21,791 INFO L231 Difference]: Finished difference. Result has 691 places, 695 transitions, 1487 flow [2025-03-08 22:08:21,792 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1475, PETRI_DIFFERENCE_MINUEND_PLACES=688, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=695, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=689, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1487, PETRI_PLACES=691, PETRI_TRANSITIONS=695} [2025-03-08 22:08:21,792 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -107 predicate places. [2025-03-08 22:08:21,792 INFO L471 AbstractCegarLoop]: Abstraction has has 691 places, 695 transitions, 1487 flow [2025-03-08 22:08:21,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 753.75) internal successors, (3015), 4 states have internal predecessors, (3015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:21,793 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:08:21,793 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:08:21,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-08 22:08:21,793 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread3Err31ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-08 22:08:21,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:08:21,794 INFO L85 PathProgramCache]: Analyzing trace with hash 7308332, now seen corresponding path program 1 times [2025-03-08 22:08:21,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:08:21,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334015133] [2025-03-08 22:08:21,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:08:21,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:08:21,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 306 statements into 1 equivalence classes. [2025-03-08 22:08:21,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 306 of 306 statements. [2025-03-08 22:08:21,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:08:21,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:08:21,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:08:21,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:08:21,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334015133] [2025-03-08 22:08:21,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334015133] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:08:21,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:08:21,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:08:21,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332966668] [2025-03-08 22:08:21,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:08:21,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:08:21,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:08:21,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:08:21,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:08:21,880 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 725 out of 846 [2025-03-08 22:08:21,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 691 places, 695 transitions, 1487 flow. Second operand has 3 states, 3 states have (on average 727.0) internal successors, (2181), 3 states have internal predecessors, (2181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:21,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:08:21,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 725 of 846 [2025-03-08 22:08:21,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:08:24,085 INFO L124 PetriNetUnfolderBase]: 2838/15314 cut-off events. [2025-03-08 22:08:24,086 INFO L125 PetriNetUnfolderBase]: For 5183/5263 co-relation queries the response was YES. [2025-03-08 22:08:24,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23253 conditions, 15314 events. 2838/15314 cut-off events. For 5183/5263 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 154607 event pairs, 112 based on Foata normal form. 0/13633 useless extension candidates. Maximal degree in co-relation 23132. Up to 3602 conditions per place. [2025-03-08 22:08:24,170 INFO L140 encePairwiseOnDemand]: 832/846 looper letters, 50 selfloop transitions, 3 changer transitions 0/697 dead transitions. [2025-03-08 22:08:24,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 682 places, 697 transitions, 1634 flow [2025-03-08 22:08:24,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:08:24,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:08:24,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2228 transitions. [2025-03-08 22:08:24,173 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8778565799842396 [2025-03-08 22:08:24,173 INFO L175 Difference]: Start difference. First operand has 691 places, 695 transitions, 1487 flow. Second operand 3 states and 2228 transitions. [2025-03-08 22:08:24,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 682 places, 697 transitions, 1634 flow [2025-03-08 22:08:24,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 679 places, 697 transitions, 1620 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-08 22:08:24,180 INFO L231 Difference]: Finished difference. Result has 680 places, 685 transitions, 1466 flow [2025-03-08 22:08:24,181 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1453, PETRI_DIFFERENCE_MINUEND_PLACES=677, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=684, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=681, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1466, PETRI_PLACES=680, PETRI_TRANSITIONS=685} [2025-03-08 22:08:24,181 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -118 predicate places. [2025-03-08 22:08:24,182 INFO L471 AbstractCegarLoop]: Abstraction has has 680 places, 685 transitions, 1466 flow [2025-03-08 22:08:24,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 727.0) internal successors, (2181), 3 states have internal predecessors, (2181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:24,183 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:08:24,183 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:08:24,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-08 22:08:24,183 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-08 22:08:24,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:08:24,184 INFO L85 PathProgramCache]: Analyzing trace with hash 987371463, now seen corresponding path program 1 times [2025-03-08 22:08:24,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:08:24,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421613917] [2025-03-08 22:08:24,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:08:24,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:08:24,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-03-08 22:08:24,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-03-08 22:08:24,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:08:24,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:08:24,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:08:24,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:08:24,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421613917] [2025-03-08 22:08:24,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421613917] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:08:24,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:08:24,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 22:08:24,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725983564] [2025-03-08 22:08:24,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:08:24,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 22:08:24,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:08:24,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 22:08:24,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:08:24,887 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 714 out of 846 [2025-03-08 22:08:24,890 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 680 places, 685 transitions, 1466 flow. Second operand has 8 states, 8 states have (on average 718.25) internal successors, (5746), 8 states have internal predecessors, (5746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:24,890 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:08:24,890 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 714 of 846 [2025-03-08 22:08:24,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:08:26,392 INFO L124 PetriNetUnfolderBase]: 709/7349 cut-off events. [2025-03-08 22:08:26,392 INFO L125 PetriNetUnfolderBase]: For 1914/2695 co-relation queries the response was YES. [2025-03-08 22:08:26,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9683 conditions, 7349 events. 709/7349 cut-off events. For 1914/2695 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 57023 event pairs, 269 based on Foata normal form. 20/6444 useless extension candidates. Maximal degree in co-relation 9561. Up to 740 conditions per place. [2025-03-08 22:08:26,507 INFO L140 encePairwiseOnDemand]: 835/846 looper letters, 94 selfloop transitions, 12 changer transitions 0/730 dead transitions. [2025-03-08 22:08:26,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 688 places, 730 transitions, 1809 flow [2025-03-08 22:08:26,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 22:08:26,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-08 22:08:26,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 6522 transitions. [2025-03-08 22:08:26,510 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8565799842395587 [2025-03-08 22:08:26,510 INFO L175 Difference]: Start difference. First operand has 680 places, 685 transitions, 1466 flow. Second operand 9 states and 6522 transitions. [2025-03-08 22:08:26,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 688 places, 730 transitions, 1809 flow [2025-03-08 22:08:26,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 687 places, 730 transitions, 1806 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:08:26,518 INFO L231 Difference]: Finished difference. Result has 690 places, 690 transitions, 1513 flow [2025-03-08 22:08:26,519 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1463, PETRI_DIFFERENCE_MINUEND_PLACES=679, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=685, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=675, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1513, PETRI_PLACES=690, PETRI_TRANSITIONS=690} [2025-03-08 22:08:26,519 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -108 predicate places. [2025-03-08 22:08:26,519 INFO L471 AbstractCegarLoop]: Abstraction has has 690 places, 690 transitions, 1513 flow [2025-03-08 22:08:26,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 718.25) internal successors, (5746), 8 states have internal predecessors, (5746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:26,520 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:08:26,520 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:08:26,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-08 22:08:26,520 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-08 22:08:26,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:08:26,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1045101580, now seen corresponding path program 1 times [2025-03-08 22:08:26,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:08:26,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739768820] [2025-03-08 22:08:26,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:08:26,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:08:26,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 309 statements into 1 equivalence classes. [2025-03-08 22:08:26,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 309 of 309 statements. [2025-03-08 22:08:26,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:08:26,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:08:26,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:08:26,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:08:26,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739768820] [2025-03-08 22:08:26,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739768820] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:08:26,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:08:26,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:08:26,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144341404] [2025-03-08 22:08:26,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:08:26,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:08:26,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:08:26,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:08:26,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:08:27,191 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 699 out of 846 [2025-03-08 22:08:27,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 690 places, 690 transitions, 1513 flow. Second operand has 6 states, 6 states have (on average 700.6666666666666) internal successors, (4204), 6 states have internal predecessors, (4204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:27,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:08:27,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 699 of 846 [2025-03-08 22:08:27,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:08:32,252 INFO L124 PetriNetUnfolderBase]: 6432/29512 cut-off events. [2025-03-08 22:08:32,252 INFO L125 PetriNetUnfolderBase]: For 10817/10821 co-relation queries the response was YES. [2025-03-08 22:08:32,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46828 conditions, 29512 events. 6432/29512 cut-off events. For 10817/10821 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 324663 event pairs, 3864 based on Foata normal form. 0/26341 useless extension candidates. Maximal degree in co-relation 46701. Up to 9066 conditions per place. [2025-03-08 22:08:32,455 INFO L140 encePairwiseOnDemand]: 840/846 looper letters, 70 selfloop transitions, 5 changer transitions 0/689 dead transitions. [2025-03-08 22:08:32,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 694 places, 689 transitions, 1661 flow [2025-03-08 22:08:32,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:08:32,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:08:32,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4264 transitions. [2025-03-08 22:08:32,459 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8400315208825847 [2025-03-08 22:08:32,459 INFO L175 Difference]: Start difference. First operand has 690 places, 690 transitions, 1513 flow. Second operand 6 states and 4264 transitions. [2025-03-08 22:08:32,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 694 places, 689 transitions, 1661 flow [2025-03-08 22:08:32,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 692 places, 689 transitions, 1654 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:08:32,469 INFO L231 Difference]: Finished difference. Result has 692 places, 689 transitions, 1514 flow [2025-03-08 22:08:32,469 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1504, PETRI_DIFFERENCE_MINUEND_PLACES=687, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=689, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=684, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1514, PETRI_PLACES=692, PETRI_TRANSITIONS=689} [2025-03-08 22:08:32,470 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -106 predicate places. [2025-03-08 22:08:32,470 INFO L471 AbstractCegarLoop]: Abstraction has has 692 places, 689 transitions, 1514 flow [2025-03-08 22:08:32,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 700.6666666666666) internal successors, (4204), 6 states have internal predecessors, (4204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:32,471 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:08:32,471 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:08:32,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-08 22:08:32,471 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting thread3Err28ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-08 22:08:32,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:08:32,472 INFO L85 PathProgramCache]: Analyzing trace with hash -959072418, now seen corresponding path program 1 times [2025-03-08 22:08:32,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:08:32,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428499799] [2025-03-08 22:08:32,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:08:32,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:08:32,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 317 statements into 1 equivalence classes. [2025-03-08 22:08:32,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 317 of 317 statements. [2025-03-08 22:08:32,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:08:32,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:08:32,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:08:32,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:08:32,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428499799] [2025-03-08 22:08:32,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428499799] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:08:32,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:08:32,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:08:32,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922959536] [2025-03-08 22:08:32,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:08:32,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:08:32,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:08:32,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:08:32,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:08:32,544 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 750 out of 846 [2025-03-08 22:08:32,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 692 places, 689 transitions, 1514 flow. Second operand has 3 states, 3 states have (on average 752.0) internal successors, (2256), 3 states have internal predecessors, (2256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:32,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:08:32,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 750 of 846 [2025-03-08 22:08:32,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:08:36,028 INFO L124 PetriNetUnfolderBase]: 1841/19498 cut-off events. [2025-03-08 22:08:36,028 INFO L125 PetriNetUnfolderBase]: For 2966/2970 co-relation queries the response was YES. [2025-03-08 22:08:36,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24420 conditions, 19498 events. 1841/19498 cut-off events. For 2966/2970 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 212821 event pairs, 212 based on Foata normal form. 0/17447 useless extension candidates. Maximal degree in co-relation 24297. Up to 1988 conditions per place. [2025-03-08 22:08:36,174 INFO L140 encePairwiseOnDemand]: 841/846 looper letters, 33 selfloop transitions, 2 changer transitions 0/698 dead transitions. [2025-03-08 22:08:36,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 691 places, 698 transitions, 1630 flow [2025-03-08 22:08:36,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:08:36,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:08:36,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2279 transitions. [2025-03-08 22:08:36,176 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8979511426319937 [2025-03-08 22:08:36,176 INFO L175 Difference]: Start difference. First operand has 692 places, 689 transitions, 1514 flow. Second operand 3 states and 2279 transitions. [2025-03-08 22:08:36,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 691 places, 698 transitions, 1630 flow [2025-03-08 22:08:36,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 686 places, 698 transitions, 1620 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:08:36,184 INFO L231 Difference]: Finished difference. Result has 687 places, 688 transitions, 1514 flow [2025-03-08 22:08:36,184 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1498, PETRI_DIFFERENCE_MINUEND_PLACES=684, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=686, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=684, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1514, PETRI_PLACES=687, PETRI_TRANSITIONS=688} [2025-03-08 22:08:36,185 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -111 predicate places. [2025-03-08 22:08:36,185 INFO L471 AbstractCegarLoop]: Abstraction has has 687 places, 688 transitions, 1514 flow [2025-03-08 22:08:36,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 752.0) internal successors, (2256), 3 states have internal predecessors, (2256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:36,186 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:08:36,186 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:08:36,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-08 22:08:36,186 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-08 22:08:36,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:08:36,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1085234405, now seen corresponding path program 1 times [2025-03-08 22:08:36,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:08:36,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477596796] [2025-03-08 22:08:36,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:08:36,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:08:36,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 323 statements into 1 equivalence classes. [2025-03-08 22:08:36,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 323 of 323 statements. [2025-03-08 22:08:36,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:08:36,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:08:36,618 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:08:36,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:08:36,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477596796] [2025-03-08 22:08:36,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477596796] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:08:36,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:08:36,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:08:36,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632275736] [2025-03-08 22:08:36,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:08:36,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:08:36,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:08:36,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:08:36,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:08:36,977 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 728 out of 846 [2025-03-08 22:08:36,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 687 places, 688 transitions, 1514 flow. Second operand has 6 states, 6 states have (on average 730.5) internal successors, (4383), 6 states have internal predecessors, (4383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:36,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:08:36,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 728 of 846 [2025-03-08 22:08:36,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:08:38,416 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2353] L52-->L58-12: Formula: (let ((.cse13 (* v_~size1~0_261 4)) (.cse14 (* v_~front1~0_335 4)) (.cse15 (* v_~state11~0_117 4))) (let ((.cse6 (not |v_thread1_#t~short2#1_227|)) (.cse2 (not |v_thread1_#t~short1#1_213|)) (.cse5 (+ v_~front1~0_335 v_~size1~0_261)) (.cse9 (+ v_~produce~0.offset_71 .cse15 1)) (.cse11 (+ v_~produce~0.offset_71 3 .cse15)) (.cse1 (+ v_~produce~0.offset_71 .cse15)) (.cse12 (+ .cse13 .cse14 v_~queue1~0.offset_197)) (.cse0 (select |v_#race_781| v_~produce~0.base_71)) (.cse10 (+ 2 v_~produce~0.offset_71 .cse15))) (and (= (select .cse0 .cse1) 0) (= |v_#race~queue1~0_276| 0) (let ((.cse3 (= |v_#race~size1~0_363| 0)) (.cse4 (= |v_#race~front1~0_500| 0))) (or (and (= |v_#race~n_queue~0_174| |v_#race~n_queue~0_173|) (= |v_thread1_#t~short1#1_213| |v_thread1_#t~short1#1_214|) .cse2 .cse3 .cse4) (and |v_thread1_#t~short1#1_213| (= |v_#race~n_queue~0_173| 0) .cse3 (or (and (not |v_thread1_#t~short1#1_214|) (<= v_~n_queue~0_82 .cse5)) (and |v_thread1_#t~short1#1_214| (< .cse5 v_~n_queue~0_82))) .cse4))) (or (and .cse6 (< v_~state11~0_117 0)) (and (<= 0 v_~state11~0_117) |v_thread1_#t~short2#1_227|)) (not (= (ite |v_thread1_#t~short1#1_214| 1 0) 0)) (= |v_#race~state11~0_163| 0) (let ((.cse7 (= |v_#race~state11~0_173| 0))) (or (and .cse6 .cse7 (= |v_#race~n_produce~0_94| |v_#race~n_produce~0_93|) (= |v_thread1_#t~short2#1_227| |v_thread1_#t~short2#1_228|)) (and (or (and (<= v_~n_produce~0_36 v_~state11~0_117) (not |v_thread1_#t~short2#1_228|)) (and (< v_~state11~0_117 v_~n_produce~0_36) |v_thread1_#t~short2#1_228|)) .cse7 |v_thread1_#t~short2#1_227| (= |v_#race~n_produce~0_93| 0)))) (not (= (ite |v_thread1_#t~short2#1_228| 1 0) 0)) (= |v_#race~front1~0_468| 0) (= (+ v_~size1~0_261 1) v_~size1~0_260) (= (let ((.cse8 (store |v_#race_782| v_~queue1~0.base_197 (store (store (store (store (select |v_#race_782| v_~queue1~0.base_197) .cse12 0) (+ .cse13 .cse14 v_~queue1~0.offset_197 1) 0) (+ 2 .cse13 .cse14 v_~queue1~0.offset_197) 0) (+ 3 .cse13 .cse14 v_~queue1~0.offset_197) 0)))) (store .cse8 v_~produce~0.base_71 (store (store (store (store (select .cse8 v_~produce~0.base_71) .cse1 0) .cse9 0) .cse10 0) .cse11 0))) |v_#race_781|) (or (and .cse2 (< .cse5 0)) (and |v_thread1_#t~short1#1_213| (<= 0 .cse5))) (= (select .cse0 .cse9) 0) (= (select .cse0 .cse11) 0) (not (= (ite (= (select (select |v_#memory_int_185| v_~produce~0.base_71) .cse1) (select (select |v_#memory_int_185| v_~queue1~0.base_197) .cse12)) 1 0) 0)) (= (select .cse0 .cse10) 0) (= |v_#race~produce~0_60| 0)))) InVars {#race=|v_#race_782|, ~state11~0=v_~state11~0_117, ~size1~0=v_~size1~0_261, ~produce~0.base=v_~produce~0.base_71, ~queue1~0.base=v_~queue1~0.base_197, #race~n_queue~0=|v_#race~n_queue~0_174|, ~n_queue~0=v_~n_queue~0_82, #race~n_produce~0=|v_#race~n_produce~0_94|, #memory_int=|v_#memory_int_185|, ~n_produce~0=v_~n_produce~0_36, ~produce~0.offset=v_~produce~0.offset_71, ~queue1~0.offset=v_~queue1~0.offset_197, ~front1~0=v_~front1~0_335} OutVars{#race~produce~0=|v_#race~produce~0_60|, #race~state11~0=|v_#race~state11~0_163|, thread1Thread1of1ForFork1_#t~short2#1=|v_thread1Thread1of1ForFork1_#t~short2#1_23|, #race~size1~0=|v_#race~size1~0_349|, ~produce~0.base=v_~produce~0.base_71, thread1Thread1of1ForFork1_#t~short1#1=|v_thread1Thread1of1ForFork1_#t~short1#1_31|, ~queue1~0.base=v_~queue1~0.base_197, #race~front1~0=|v_#race~front1~0_468|, #race~n_queue~0=|v_#race~n_queue~0_173|, ~n_queue~0=v_~n_queue~0_82, ~front1~0=v_~front1~0_335, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_13|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_25|, #race=|v_#race_781|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_7|, ~state11~0=v_~state11~0_117, ~size1~0=v_~size1~0_260, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_3|, thread1Thread1of1ForFork1_#t~nondet6#1=|v_thread1Thread1of1ForFork1_#t~nondet6#1_3|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|, #race~n_produce~0=|v_#race~n_produce~0_93|, #memory_int=|v_#memory_int_185|, ~n_produce~0=v_~n_produce~0_36, ~produce~0.offset=v_~produce~0.offset_71, ~queue1~0.offset=v_~queue1~0.offset_197, #race~queue1~0=|v_#race~queue1~0_276|} AuxVars[|v_thread1_#t~short1#1_213|, |v_thread1_#t~short1#1_214|, |v_#race~size1~0_363|, |v_#race~state11~0_173|, |v_thread1_#t~short2#1_227|, |v_thread1_#t~short2#1_228|, |v_#race~front1~0_500|] AssignedVars[#race, #race~produce~0, #race~state11~0, thread1Thread1of1ForFork1_#t~short2#1, thread1Thread1of1ForFork1_#t~mem4#1, ~size1~0, thread1Thread1of1ForFork1_#t~post5#1, #race~size1~0, thread1Thread1of1ForFork1_#t~nondet6#1, thread1Thread1of1ForFork1_#t~short1#1, #race~front1~0, #race~n_queue~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #race~n_produce~0, thread1Thread1of1ForFork1_#t~mem3#1, #race~queue1~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][559], [Black: 894#true, 678#L58-12true, 955#(= |#race~produce~0| 0), 878#(= |#race~n_queue~0| 0), 911#(= |#race~update~0| 0), Black: 898#true, Black: 837#(= |#race~state12~0| 0), Black: 902#true, 896#(= |#race~consume~0| 0), 714#L135-1true, 900#(= |#race~n2~0| 0), Black: 909#true, Black: 931#(<= ~n_produce~0 0), Black: 939#(and (<= ~n_produce~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 937#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 957#true, 872#(= |#race~n_update~0| 0), 890#(= |#race~n1~0| 0), 7#L95-28true, Black: 953#true, Black: 922#true, 607#L83true, 860#(= |#race~n_produce~0| 0)]) [2025-03-08 22:08:38,416 INFO L294 olderBase$Statistics]: this new event has 519 ancestors and is cut-off event [2025-03-08 22:08:38,416 INFO L297 olderBase$Statistics]: existing Event has 519 ancestors and is cut-off event [2025-03-08 22:08:38,416 INFO L297 olderBase$Statistics]: existing Event has 388 ancestors and is cut-off event [2025-03-08 22:08:38,416 INFO L297 olderBase$Statistics]: existing Event has 471 ancestors and is cut-off event [2025-03-08 22:08:38,424 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2353] L52-->L58-12: Formula: (let ((.cse13 (* v_~size1~0_261 4)) (.cse14 (* v_~front1~0_335 4)) (.cse15 (* v_~state11~0_117 4))) (let ((.cse6 (not |v_thread1_#t~short2#1_227|)) (.cse2 (not |v_thread1_#t~short1#1_213|)) (.cse5 (+ v_~front1~0_335 v_~size1~0_261)) (.cse9 (+ v_~produce~0.offset_71 .cse15 1)) (.cse11 (+ v_~produce~0.offset_71 3 .cse15)) (.cse1 (+ v_~produce~0.offset_71 .cse15)) (.cse12 (+ .cse13 .cse14 v_~queue1~0.offset_197)) (.cse0 (select |v_#race_781| v_~produce~0.base_71)) (.cse10 (+ 2 v_~produce~0.offset_71 .cse15))) (and (= (select .cse0 .cse1) 0) (= |v_#race~queue1~0_276| 0) (let ((.cse3 (= |v_#race~size1~0_363| 0)) (.cse4 (= |v_#race~front1~0_500| 0))) (or (and (= |v_#race~n_queue~0_174| |v_#race~n_queue~0_173|) (= |v_thread1_#t~short1#1_213| |v_thread1_#t~short1#1_214|) .cse2 .cse3 .cse4) (and |v_thread1_#t~short1#1_213| (= |v_#race~n_queue~0_173| 0) .cse3 (or (and (not |v_thread1_#t~short1#1_214|) (<= v_~n_queue~0_82 .cse5)) (and |v_thread1_#t~short1#1_214| (< .cse5 v_~n_queue~0_82))) .cse4))) (or (and .cse6 (< v_~state11~0_117 0)) (and (<= 0 v_~state11~0_117) |v_thread1_#t~short2#1_227|)) (not (= (ite |v_thread1_#t~short1#1_214| 1 0) 0)) (= |v_#race~state11~0_163| 0) (let ((.cse7 (= |v_#race~state11~0_173| 0))) (or (and .cse6 .cse7 (= |v_#race~n_produce~0_94| |v_#race~n_produce~0_93|) (= |v_thread1_#t~short2#1_227| |v_thread1_#t~short2#1_228|)) (and (or (and (<= v_~n_produce~0_36 v_~state11~0_117) (not |v_thread1_#t~short2#1_228|)) (and (< v_~state11~0_117 v_~n_produce~0_36) |v_thread1_#t~short2#1_228|)) .cse7 |v_thread1_#t~short2#1_227| (= |v_#race~n_produce~0_93| 0)))) (not (= (ite |v_thread1_#t~short2#1_228| 1 0) 0)) (= |v_#race~front1~0_468| 0) (= (+ v_~size1~0_261 1) v_~size1~0_260) (= (let ((.cse8 (store |v_#race_782| v_~queue1~0.base_197 (store (store (store (store (select |v_#race_782| v_~queue1~0.base_197) .cse12 0) (+ .cse13 .cse14 v_~queue1~0.offset_197 1) 0) (+ 2 .cse13 .cse14 v_~queue1~0.offset_197) 0) (+ 3 .cse13 .cse14 v_~queue1~0.offset_197) 0)))) (store .cse8 v_~produce~0.base_71 (store (store (store (store (select .cse8 v_~produce~0.base_71) .cse1 0) .cse9 0) .cse10 0) .cse11 0))) |v_#race_781|) (or (and .cse2 (< .cse5 0)) (and |v_thread1_#t~short1#1_213| (<= 0 .cse5))) (= (select .cse0 .cse9) 0) (= (select .cse0 .cse11) 0) (not (= (ite (= (select (select |v_#memory_int_185| v_~produce~0.base_71) .cse1) (select (select |v_#memory_int_185| v_~queue1~0.base_197) .cse12)) 1 0) 0)) (= (select .cse0 .cse10) 0) (= |v_#race~produce~0_60| 0)))) InVars {#race=|v_#race_782|, ~state11~0=v_~state11~0_117, ~size1~0=v_~size1~0_261, ~produce~0.base=v_~produce~0.base_71, ~queue1~0.base=v_~queue1~0.base_197, #race~n_queue~0=|v_#race~n_queue~0_174|, ~n_queue~0=v_~n_queue~0_82, #race~n_produce~0=|v_#race~n_produce~0_94|, #memory_int=|v_#memory_int_185|, ~n_produce~0=v_~n_produce~0_36, ~produce~0.offset=v_~produce~0.offset_71, ~queue1~0.offset=v_~queue1~0.offset_197, ~front1~0=v_~front1~0_335} OutVars{#race~produce~0=|v_#race~produce~0_60|, #race~state11~0=|v_#race~state11~0_163|, thread1Thread1of1ForFork1_#t~short2#1=|v_thread1Thread1of1ForFork1_#t~short2#1_23|, #race~size1~0=|v_#race~size1~0_349|, ~produce~0.base=v_~produce~0.base_71, thread1Thread1of1ForFork1_#t~short1#1=|v_thread1Thread1of1ForFork1_#t~short1#1_31|, ~queue1~0.base=v_~queue1~0.base_197, #race~front1~0=|v_#race~front1~0_468|, #race~n_queue~0=|v_#race~n_queue~0_173|, ~n_queue~0=v_~n_queue~0_82, ~front1~0=v_~front1~0_335, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_13|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_25|, #race=|v_#race_781|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_7|, ~state11~0=v_~state11~0_117, ~size1~0=v_~size1~0_260, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_3|, thread1Thread1of1ForFork1_#t~nondet6#1=|v_thread1Thread1of1ForFork1_#t~nondet6#1_3|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|, #race~n_produce~0=|v_#race~n_produce~0_93|, #memory_int=|v_#memory_int_185|, ~n_produce~0=v_~n_produce~0_36, ~produce~0.offset=v_~produce~0.offset_71, ~queue1~0.offset=v_~queue1~0.offset_197, #race~queue1~0=|v_#race~queue1~0_276|} AuxVars[|v_thread1_#t~short1#1_213|, |v_thread1_#t~short1#1_214|, |v_#race~size1~0_363|, |v_#race~state11~0_173|, |v_thread1_#t~short2#1_227|, |v_thread1_#t~short2#1_228|, |v_#race~front1~0_500|] AssignedVars[#race, #race~produce~0, #race~state11~0, thread1Thread1of1ForFork1_#t~short2#1, thread1Thread1of1ForFork1_#t~mem4#1, ~size1~0, thread1Thread1of1ForFork1_#t~post5#1, #race~size1~0, thread1Thread1of1ForFork1_#t~nondet6#1, thread1Thread1of1ForFork1_#t~short1#1, #race~front1~0, #race~n_queue~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #race~n_produce~0, thread1Thread1of1ForFork1_#t~mem3#1, #race~queue1~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][559], [Black: 894#true, 678#L58-12true, 955#(= |#race~produce~0| 0), 878#(= |#race~n_queue~0| 0), 911#(= |#race~update~0| 0), Black: 898#true, Black: 837#(= |#race~state12~0| 0), Black: 902#true, 896#(= |#race~consume~0| 0), 714#L135-1true, 559#L73true, 900#(= |#race~n2~0| 0), Black: 909#true, Black: 931#(<= ~n_produce~0 0), Black: 939#(and (<= ~n_produce~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 937#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 957#true, 872#(= |#race~n_update~0| 0), 890#(= |#race~n1~0| 0), 7#L95-28true, Black: 953#true, Black: 922#true, 860#(= |#race~n_produce~0| 0)]) [2025-03-08 22:08:38,424 INFO L294 olderBase$Statistics]: this new event has 520 ancestors and is cut-off event [2025-03-08 22:08:38,424 INFO L297 olderBase$Statistics]: existing Event has 472 ancestors and is cut-off event [2025-03-08 22:08:38,424 INFO L297 olderBase$Statistics]: existing Event has 389 ancestors and is cut-off event [2025-03-08 22:08:38,424 INFO L297 olderBase$Statistics]: existing Event has 520 ancestors and is cut-off event [2025-03-08 22:08:38,680 INFO L124 PetriNetUnfolderBase]: 678/8521 cut-off events. [2025-03-08 22:08:38,680 INFO L125 PetriNetUnfolderBase]: For 1741/2167 co-relation queries the response was YES. [2025-03-08 22:08:38,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10729 conditions, 8521 events. 678/8521 cut-off events. For 1741/2167 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 70513 event pairs, 114 based on Foata normal form. 53/7656 useless extension candidates. Maximal degree in co-relation 10603. Up to 464 conditions per place. [2025-03-08 22:08:38,797 INFO L140 encePairwiseOnDemand]: 840/846 looper letters, 79 selfloop transitions, 5 changer transitions 0/723 dead transitions. [2025-03-08 22:08:38,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 691 places, 723 transitions, 1896 flow [2025-03-08 22:08:38,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:08:38,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:08:38,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4430 transitions. [2025-03-08 22:08:38,799 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8727344365642238 [2025-03-08 22:08:38,799 INFO L175 Difference]: Start difference. First operand has 687 places, 688 transitions, 1514 flow. Second operand 6 states and 4430 transitions. [2025-03-08 22:08:38,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 691 places, 723 transitions, 1896 flow [2025-03-08 22:08:38,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 691 places, 723 transitions, 1896 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:08:38,807 INFO L231 Difference]: Finished difference. Result has 691 places, 687 transitions, 1522 flow [2025-03-08 22:08:38,807 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1512, PETRI_DIFFERENCE_MINUEND_PLACES=686, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=687, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=682, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1522, PETRI_PLACES=691, PETRI_TRANSITIONS=687} [2025-03-08 22:08:38,808 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -107 predicate places. [2025-03-08 22:08:38,808 INFO L471 AbstractCegarLoop]: Abstraction has has 691 places, 687 transitions, 1522 flow [2025-03-08 22:08:38,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 730.5) internal successors, (4383), 6 states have internal predecessors, (4383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:38,809 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:08:38,809 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:08:38,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-08 22:08:38,810 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting thread3Err26ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-08 22:08:38,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:08:38,811 INFO L85 PathProgramCache]: Analyzing trace with hash -283212478, now seen corresponding path program 1 times [2025-03-08 22:08:38,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:08:38,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514335985] [2025-03-08 22:08:38,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:08:38,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:08:38,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 325 statements into 1 equivalence classes. [2025-03-08 22:08:38,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 325 of 325 statements. [2025-03-08 22:08:38,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:08:38,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:08:39,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:08:39,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:08:39,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514335985] [2025-03-08 22:08:39,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514335985] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:08:39,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:08:39,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:08:39,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781957849] [2025-03-08 22:08:39,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:08:39,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:08:39,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:08:39,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:08:39,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:08:39,705 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 716 out of 846 [2025-03-08 22:08:39,706 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 691 places, 687 transitions, 1522 flow. Second operand has 6 states, 6 states have (on average 718.0) internal successors, (4308), 6 states have internal predecessors, (4308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:39,706 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:08:39,706 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 716 of 846 [2025-03-08 22:08:39,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:08:42,956 INFO L124 PetriNetUnfolderBase]: 3558/18443 cut-off events. [2025-03-08 22:08:42,956 INFO L125 PetriNetUnfolderBase]: For 7268/7294 co-relation queries the response was YES. [2025-03-08 22:08:43,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29013 conditions, 18443 events. 3558/18443 cut-off events. For 7268/7294 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 186996 event pairs, 147 based on Foata normal form. 0/16999 useless extension candidates. Maximal degree in co-relation 28886. Up to 3586 conditions per place. [2025-03-08 22:08:43,105 INFO L140 encePairwiseOnDemand]: 838/846 looper letters, 101 selfloop transitions, 5 changer transitions 0/732 dead transitions. [2025-03-08 22:08:43,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 693 places, 732 transitions, 1980 flow [2025-03-08 22:08:43,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:08:43,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:08:43,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4378 transitions. [2025-03-08 22:08:43,107 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8624901497241922 [2025-03-08 22:08:43,107 INFO L175 Difference]: Start difference. First operand has 691 places, 687 transitions, 1522 flow. Second operand 6 states and 4378 transitions. [2025-03-08 22:08:43,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 693 places, 732 transitions, 1980 flow [2025-03-08 22:08:43,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 688 places, 732 transitions, 1970 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:08:43,116 INFO L231 Difference]: Finished difference. Result has 688 places, 684 transitions, 1516 flow [2025-03-08 22:08:43,116 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1506, PETRI_DIFFERENCE_MINUEND_PLACES=683, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=684, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=679, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1516, PETRI_PLACES=688, PETRI_TRANSITIONS=684} [2025-03-08 22:08:43,116 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -110 predicate places. [2025-03-08 22:08:43,117 INFO L471 AbstractCegarLoop]: Abstraction has has 688 places, 684 transitions, 1516 flow [2025-03-08 22:08:43,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 718.0) internal successors, (4308), 6 states have internal predecessors, (4308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:43,117 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:08:43,117 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:08:43,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-08 22:08:43,117 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-08 22:08:43,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:08:43,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1922071591, now seen corresponding path program 1 times [2025-03-08 22:08:43,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:08:43,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137893634] [2025-03-08 22:08:43,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:08:43,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:08:43,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 327 statements into 1 equivalence classes. [2025-03-08 22:08:43,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 327 of 327 statements. [2025-03-08 22:08:43,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:08:43,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:08:43,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:08:43,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:08:43,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137893634] [2025-03-08 22:08:43,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137893634] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:08:43,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:08:43,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:08:43,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909897469] [2025-03-08 22:08:43,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:08:43,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:08:43,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:08:43,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:08:43,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:08:43,191 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 748 out of 846 [2025-03-08 22:08:43,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 688 places, 684 transitions, 1516 flow. Second operand has 3 states, 3 states have (on average 751.3333333333334) internal successors, (2254), 3 states have internal predecessors, (2254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:43,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:08:43,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 748 of 846 [2025-03-08 22:08:43,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:08:44,641 INFO L124 PetriNetUnfolderBase]: 817/8647 cut-off events. [2025-03-08 22:08:44,641 INFO L125 PetriNetUnfolderBase]: For 2104/2479 co-relation queries the response was YES. [2025-03-08 22:08:44,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11463 conditions, 8647 events. 817/8647 cut-off events. For 2104/2479 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 71895 event pairs, 270 based on Foata normal form. 14/7818 useless extension candidates. Maximal degree in co-relation 11337. Up to 789 conditions per place. [2025-03-08 22:08:44,700 INFO L140 encePairwiseOnDemand]: 843/846 looper letters, 35 selfloop transitions, 2 changer transitions 0/692 dead transitions. [2025-03-08 22:08:44,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 689 places, 692 transitions, 1642 flow [2025-03-08 22:08:44,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:08:44,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:08:44,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2271 transitions. [2025-03-08 22:08:44,702 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8947990543735225 [2025-03-08 22:08:44,702 INFO L175 Difference]: Start difference. First operand has 688 places, 684 transitions, 1516 flow. Second operand 3 states and 2271 transitions. [2025-03-08 22:08:44,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 689 places, 692 transitions, 1642 flow [2025-03-08 22:08:44,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 684 places, 692 transitions, 1632 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:08:44,708 INFO L231 Difference]: Finished difference. Result has 684 places, 683 transitions, 1508 flow [2025-03-08 22:08:44,708 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1504, PETRI_DIFFERENCE_MINUEND_PLACES=682, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=683, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=681, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1508, PETRI_PLACES=684, PETRI_TRANSITIONS=683} [2025-03-08 22:08:44,709 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -114 predicate places. [2025-03-08 22:08:44,709 INFO L471 AbstractCegarLoop]: Abstraction has has 684 places, 683 transitions, 1508 flow [2025-03-08 22:08:44,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 751.3333333333334) internal successors, (2254), 3 states have internal predecessors, (2254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:44,709 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:08:44,709 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:08:44,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-08 22:08:44,710 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting thread3Err19ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-08 22:08:44,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:08:44,711 INFO L85 PathProgramCache]: Analyzing trace with hash -2070419727, now seen corresponding path program 1 times [2025-03-08 22:08:44,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:08:44,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515930174] [2025-03-08 22:08:44,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:08:44,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:08:44,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 346 statements into 1 equivalence classes. [2025-03-08 22:08:44,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 346 of 346 statements. [2025-03-08 22:08:44,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:08:44,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:08:45,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:08:45,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:08:45,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515930174] [2025-03-08 22:08:45,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515930174] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:08:45,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:08:45,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:08:45,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042395030] [2025-03-08 22:08:45,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:08:45,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:08:45,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:08:45,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:08:45,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:08:45,334 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 728 out of 846 [2025-03-08 22:08:45,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 684 places, 683 transitions, 1508 flow. Second operand has 6 states, 6 states have (on average 730.0) internal successors, (4380), 6 states have internal predecessors, (4380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:45,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:08:45,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 728 of 846 [2025-03-08 22:08:45,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:08:47,394 INFO L124 PetriNetUnfolderBase]: 1570/10902 cut-off events. [2025-03-08 22:08:47,394 INFO L125 PetriNetUnfolderBase]: For 3396/3636 co-relation queries the response was YES. [2025-03-08 22:08:47,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15584 conditions, 10902 events. 1570/10902 cut-off events. For 3396/3636 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 96302 event pairs, 192 based on Foata normal form. 1/9980 useless extension candidates. Maximal degree in co-relation 15457. Up to 682 conditions per place. [2025-03-08 22:08:47,509 INFO L140 encePairwiseOnDemand]: 840/846 looper letters, 87 selfloop transitions, 5 changer transitions 0/726 dead transitions. [2025-03-08 22:08:47,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 688 places, 726 transitions, 1902 flow [2025-03-08 22:08:47,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:08:47,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:08:47,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4438 transitions. [2025-03-08 22:08:47,512 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8743104806934594 [2025-03-08 22:08:47,512 INFO L175 Difference]: Start difference. First operand has 684 places, 683 transitions, 1508 flow. Second operand 6 states and 4438 transitions. [2025-03-08 22:08:47,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 688 places, 726 transitions, 1902 flow [2025-03-08 22:08:47,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 686 places, 726 transitions, 1898 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:08:47,520 INFO L231 Difference]: Finished difference. Result has 686 places, 682 transitions, 1512 flow [2025-03-08 22:08:47,521 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1502, PETRI_DIFFERENCE_MINUEND_PLACES=681, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=682, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=677, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1512, PETRI_PLACES=686, PETRI_TRANSITIONS=682} [2025-03-08 22:08:47,521 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -112 predicate places. [2025-03-08 22:08:47,521 INFO L471 AbstractCegarLoop]: Abstraction has has 686 places, 682 transitions, 1512 flow [2025-03-08 22:08:47,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 730.0) internal successors, (4380), 6 states have internal predecessors, (4380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:47,522 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:08:47,522 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:08:47,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-08 22:08:47,522 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting thread3Err15ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-08 22:08:47,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:08:47,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1086247943, now seen corresponding path program 1 times [2025-03-08 22:08:47,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:08:47,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189636290] [2025-03-08 22:08:47,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:08:47,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:08:47,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 362 statements into 1 equivalence classes. [2025-03-08 22:08:47,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 362 of 362 statements. [2025-03-08 22:08:47,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:08:47,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:08:47,886 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:08:47,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:08:47,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189636290] [2025-03-08 22:08:47,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189636290] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:08:47,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:08:47,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:08:47,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646448418] [2025-03-08 22:08:47,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:08:47,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:08:47,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:08:47,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:08:47,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:08:48,156 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 729 out of 846 [2025-03-08 22:08:48,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 686 places, 682 transitions, 1512 flow. Second operand has 6 states, 6 states have (on average 730.6666666666666) internal successors, (4384), 6 states have internal predecessors, (4384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:48,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:08:48,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 729 of 846 [2025-03-08 22:08:48,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:08:50,940 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2353] L52-->L58-12: Formula: (let ((.cse13 (* v_~size1~0_261 4)) (.cse14 (* v_~front1~0_335 4)) (.cse15 (* v_~state11~0_117 4))) (let ((.cse6 (not |v_thread1_#t~short2#1_227|)) (.cse2 (not |v_thread1_#t~short1#1_213|)) (.cse5 (+ v_~front1~0_335 v_~size1~0_261)) (.cse9 (+ v_~produce~0.offset_71 .cse15 1)) (.cse11 (+ v_~produce~0.offset_71 3 .cse15)) (.cse1 (+ v_~produce~0.offset_71 .cse15)) (.cse12 (+ .cse13 .cse14 v_~queue1~0.offset_197)) (.cse0 (select |v_#race_781| v_~produce~0.base_71)) (.cse10 (+ 2 v_~produce~0.offset_71 .cse15))) (and (= (select .cse0 .cse1) 0) (= |v_#race~queue1~0_276| 0) (let ((.cse3 (= |v_#race~size1~0_363| 0)) (.cse4 (= |v_#race~front1~0_500| 0))) (or (and (= |v_#race~n_queue~0_174| |v_#race~n_queue~0_173|) (= |v_thread1_#t~short1#1_213| |v_thread1_#t~short1#1_214|) .cse2 .cse3 .cse4) (and |v_thread1_#t~short1#1_213| (= |v_#race~n_queue~0_173| 0) .cse3 (or (and (not |v_thread1_#t~short1#1_214|) (<= v_~n_queue~0_82 .cse5)) (and |v_thread1_#t~short1#1_214| (< .cse5 v_~n_queue~0_82))) .cse4))) (or (and .cse6 (< v_~state11~0_117 0)) (and (<= 0 v_~state11~0_117) |v_thread1_#t~short2#1_227|)) (not (= (ite |v_thread1_#t~short1#1_214| 1 0) 0)) (= |v_#race~state11~0_163| 0) (let ((.cse7 (= |v_#race~state11~0_173| 0))) (or (and .cse6 .cse7 (= |v_#race~n_produce~0_94| |v_#race~n_produce~0_93|) (= |v_thread1_#t~short2#1_227| |v_thread1_#t~short2#1_228|)) (and (or (and (<= v_~n_produce~0_36 v_~state11~0_117) (not |v_thread1_#t~short2#1_228|)) (and (< v_~state11~0_117 v_~n_produce~0_36) |v_thread1_#t~short2#1_228|)) .cse7 |v_thread1_#t~short2#1_227| (= |v_#race~n_produce~0_93| 0)))) (not (= (ite |v_thread1_#t~short2#1_228| 1 0) 0)) (= |v_#race~front1~0_468| 0) (= (+ v_~size1~0_261 1) v_~size1~0_260) (= (let ((.cse8 (store |v_#race_782| v_~queue1~0.base_197 (store (store (store (store (select |v_#race_782| v_~queue1~0.base_197) .cse12 0) (+ .cse13 .cse14 v_~queue1~0.offset_197 1) 0) (+ 2 .cse13 .cse14 v_~queue1~0.offset_197) 0) (+ 3 .cse13 .cse14 v_~queue1~0.offset_197) 0)))) (store .cse8 v_~produce~0.base_71 (store (store (store (store (select .cse8 v_~produce~0.base_71) .cse1 0) .cse9 0) .cse10 0) .cse11 0))) |v_#race_781|) (or (and .cse2 (< .cse5 0)) (and |v_thread1_#t~short1#1_213| (<= 0 .cse5))) (= (select .cse0 .cse9) 0) (= (select .cse0 .cse11) 0) (not (= (ite (= (select (select |v_#memory_int_185| v_~produce~0.base_71) .cse1) (select (select |v_#memory_int_185| v_~queue1~0.base_197) .cse12)) 1 0) 0)) (= (select .cse0 .cse10) 0) (= |v_#race~produce~0_60| 0)))) InVars {#race=|v_#race_782|, ~state11~0=v_~state11~0_117, ~size1~0=v_~size1~0_261, ~produce~0.base=v_~produce~0.base_71, ~queue1~0.base=v_~queue1~0.base_197, #race~n_queue~0=|v_#race~n_queue~0_174|, ~n_queue~0=v_~n_queue~0_82, #race~n_produce~0=|v_#race~n_produce~0_94|, #memory_int=|v_#memory_int_185|, ~n_produce~0=v_~n_produce~0_36, ~produce~0.offset=v_~produce~0.offset_71, ~queue1~0.offset=v_~queue1~0.offset_197, ~front1~0=v_~front1~0_335} OutVars{#race~produce~0=|v_#race~produce~0_60|, #race~state11~0=|v_#race~state11~0_163|, thread1Thread1of1ForFork1_#t~short2#1=|v_thread1Thread1of1ForFork1_#t~short2#1_23|, #race~size1~0=|v_#race~size1~0_349|, ~produce~0.base=v_~produce~0.base_71, thread1Thread1of1ForFork1_#t~short1#1=|v_thread1Thread1of1ForFork1_#t~short1#1_31|, ~queue1~0.base=v_~queue1~0.base_197, #race~front1~0=|v_#race~front1~0_468|, #race~n_queue~0=|v_#race~n_queue~0_173|, ~n_queue~0=v_~n_queue~0_82, ~front1~0=v_~front1~0_335, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_13|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_25|, #race=|v_#race_781|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_7|, ~state11~0=v_~state11~0_117, ~size1~0=v_~size1~0_260, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_3|, thread1Thread1of1ForFork1_#t~nondet6#1=|v_thread1Thread1of1ForFork1_#t~nondet6#1_3|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|, #race~n_produce~0=|v_#race~n_produce~0_93|, #memory_int=|v_#memory_int_185|, ~n_produce~0=v_~n_produce~0_36, ~produce~0.offset=v_~produce~0.offset_71, ~queue1~0.offset=v_~queue1~0.offset_197, #race~queue1~0=|v_#race~queue1~0_276|} AuxVars[|v_thread1_#t~short1#1_213|, |v_thread1_#t~short1#1_214|, |v_#race~size1~0_363|, |v_#race~state11~0_173|, |v_thread1_#t~short2#1_227|, |v_thread1_#t~short2#1_228|, |v_#race~front1~0_500|] AssignedVars[#race, #race~produce~0, #race~state11~0, thread1Thread1of1ForFork1_#t~short2#1, thread1Thread1of1ForFork1_#t~mem4#1, ~size1~0, thread1Thread1of1ForFork1_#t~post5#1, #race~size1~0, thread1Thread1of1ForFork1_#t~nondet6#1, thread1Thread1of1ForFork1_#t~short1#1, #race~front1~0, #race~n_queue~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #race~n_produce~0, thread1Thread1of1ForFork1_#t~mem3#1, #race~queue1~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][536], [Black: 894#true, 678#L58-12true, 955#(= |#race~produce~0| 0), 878#(= |#race~n_queue~0| 0), 911#(= |#race~update~0| 0), Black: 898#true, Black: 837#(= |#race~state12~0| 0), Black: 902#true, 714#L135-1true, 896#(= |#race~consume~0| 0), 900#(= |#race~n2~0| 0), Black: 931#(<= ~n_produce~0 0), Black: 909#true, Black: 939#(and (<= ~n_produce~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 937#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 978#true, 872#(= |#race~n_update~0| 0), 972#true, 890#(= |#race~n1~0| 0), 7#L95-28true, Black: 953#true, Black: 922#true, 860#(= |#race~n_produce~0| 0), 607#L83true]) [2025-03-08 22:08:50,940 INFO L294 olderBase$Statistics]: this new event has 519 ancestors and is cut-off event [2025-03-08 22:08:50,940 INFO L297 olderBase$Statistics]: existing Event has 471 ancestors and is cut-off event [2025-03-08 22:08:50,940 INFO L297 olderBase$Statistics]: existing Event has 388 ancestors and is cut-off event [2025-03-08 22:08:50,940 INFO L297 olderBase$Statistics]: existing Event has 519 ancestors and is cut-off event [2025-03-08 22:08:50,954 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2353] L52-->L58-12: Formula: (let ((.cse13 (* v_~size1~0_261 4)) (.cse14 (* v_~front1~0_335 4)) (.cse15 (* v_~state11~0_117 4))) (let ((.cse6 (not |v_thread1_#t~short2#1_227|)) (.cse2 (not |v_thread1_#t~short1#1_213|)) (.cse5 (+ v_~front1~0_335 v_~size1~0_261)) (.cse9 (+ v_~produce~0.offset_71 .cse15 1)) (.cse11 (+ v_~produce~0.offset_71 3 .cse15)) (.cse1 (+ v_~produce~0.offset_71 .cse15)) (.cse12 (+ .cse13 .cse14 v_~queue1~0.offset_197)) (.cse0 (select |v_#race_781| v_~produce~0.base_71)) (.cse10 (+ 2 v_~produce~0.offset_71 .cse15))) (and (= (select .cse0 .cse1) 0) (= |v_#race~queue1~0_276| 0) (let ((.cse3 (= |v_#race~size1~0_363| 0)) (.cse4 (= |v_#race~front1~0_500| 0))) (or (and (= |v_#race~n_queue~0_174| |v_#race~n_queue~0_173|) (= |v_thread1_#t~short1#1_213| |v_thread1_#t~short1#1_214|) .cse2 .cse3 .cse4) (and |v_thread1_#t~short1#1_213| (= |v_#race~n_queue~0_173| 0) .cse3 (or (and (not |v_thread1_#t~short1#1_214|) (<= v_~n_queue~0_82 .cse5)) (and |v_thread1_#t~short1#1_214| (< .cse5 v_~n_queue~0_82))) .cse4))) (or (and .cse6 (< v_~state11~0_117 0)) (and (<= 0 v_~state11~0_117) |v_thread1_#t~short2#1_227|)) (not (= (ite |v_thread1_#t~short1#1_214| 1 0) 0)) (= |v_#race~state11~0_163| 0) (let ((.cse7 (= |v_#race~state11~0_173| 0))) (or (and .cse6 .cse7 (= |v_#race~n_produce~0_94| |v_#race~n_produce~0_93|) (= |v_thread1_#t~short2#1_227| |v_thread1_#t~short2#1_228|)) (and (or (and (<= v_~n_produce~0_36 v_~state11~0_117) (not |v_thread1_#t~short2#1_228|)) (and (< v_~state11~0_117 v_~n_produce~0_36) |v_thread1_#t~short2#1_228|)) .cse7 |v_thread1_#t~short2#1_227| (= |v_#race~n_produce~0_93| 0)))) (not (= (ite |v_thread1_#t~short2#1_228| 1 0) 0)) (= |v_#race~front1~0_468| 0) (= (+ v_~size1~0_261 1) v_~size1~0_260) (= (let ((.cse8 (store |v_#race_782| v_~queue1~0.base_197 (store (store (store (store (select |v_#race_782| v_~queue1~0.base_197) .cse12 0) (+ .cse13 .cse14 v_~queue1~0.offset_197 1) 0) (+ 2 .cse13 .cse14 v_~queue1~0.offset_197) 0) (+ 3 .cse13 .cse14 v_~queue1~0.offset_197) 0)))) (store .cse8 v_~produce~0.base_71 (store (store (store (store (select .cse8 v_~produce~0.base_71) .cse1 0) .cse9 0) .cse10 0) .cse11 0))) |v_#race_781|) (or (and .cse2 (< .cse5 0)) (and |v_thread1_#t~short1#1_213| (<= 0 .cse5))) (= (select .cse0 .cse9) 0) (= (select .cse0 .cse11) 0) (not (= (ite (= (select (select |v_#memory_int_185| v_~produce~0.base_71) .cse1) (select (select |v_#memory_int_185| v_~queue1~0.base_197) .cse12)) 1 0) 0)) (= (select .cse0 .cse10) 0) (= |v_#race~produce~0_60| 0)))) InVars {#race=|v_#race_782|, ~state11~0=v_~state11~0_117, ~size1~0=v_~size1~0_261, ~produce~0.base=v_~produce~0.base_71, ~queue1~0.base=v_~queue1~0.base_197, #race~n_queue~0=|v_#race~n_queue~0_174|, ~n_queue~0=v_~n_queue~0_82, #race~n_produce~0=|v_#race~n_produce~0_94|, #memory_int=|v_#memory_int_185|, ~n_produce~0=v_~n_produce~0_36, ~produce~0.offset=v_~produce~0.offset_71, ~queue1~0.offset=v_~queue1~0.offset_197, ~front1~0=v_~front1~0_335} OutVars{#race~produce~0=|v_#race~produce~0_60|, #race~state11~0=|v_#race~state11~0_163|, thread1Thread1of1ForFork1_#t~short2#1=|v_thread1Thread1of1ForFork1_#t~short2#1_23|, #race~size1~0=|v_#race~size1~0_349|, ~produce~0.base=v_~produce~0.base_71, thread1Thread1of1ForFork1_#t~short1#1=|v_thread1Thread1of1ForFork1_#t~short1#1_31|, ~queue1~0.base=v_~queue1~0.base_197, #race~front1~0=|v_#race~front1~0_468|, #race~n_queue~0=|v_#race~n_queue~0_173|, ~n_queue~0=v_~n_queue~0_82, ~front1~0=v_~front1~0_335, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_13|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_25|, #race=|v_#race_781|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_7|, ~state11~0=v_~state11~0_117, ~size1~0=v_~size1~0_260, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_3|, thread1Thread1of1ForFork1_#t~nondet6#1=|v_thread1Thread1of1ForFork1_#t~nondet6#1_3|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|, #race~n_produce~0=|v_#race~n_produce~0_93|, #memory_int=|v_#memory_int_185|, ~n_produce~0=v_~n_produce~0_36, ~produce~0.offset=v_~produce~0.offset_71, ~queue1~0.offset=v_~queue1~0.offset_197, #race~queue1~0=|v_#race~queue1~0_276|} AuxVars[|v_thread1_#t~short1#1_213|, |v_thread1_#t~short1#1_214|, |v_#race~size1~0_363|, |v_#race~state11~0_173|, |v_thread1_#t~short2#1_227|, |v_thread1_#t~short2#1_228|, |v_#race~front1~0_500|] AssignedVars[#race, #race~produce~0, #race~state11~0, thread1Thread1of1ForFork1_#t~short2#1, thread1Thread1of1ForFork1_#t~mem4#1, ~size1~0, thread1Thread1of1ForFork1_#t~post5#1, #race~size1~0, thread1Thread1of1ForFork1_#t~nondet6#1, thread1Thread1of1ForFork1_#t~short1#1, #race~front1~0, #race~n_queue~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #race~n_produce~0, thread1Thread1of1ForFork1_#t~mem3#1, #race~queue1~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][536], [Black: 894#true, 678#L58-12true, 955#(= |#race~produce~0| 0), 878#(= |#race~n_queue~0| 0), 911#(= |#race~update~0| 0), Black: 898#true, Black: 837#(= |#race~state12~0| 0), Black: 902#true, 714#L135-1true, 896#(= |#race~consume~0| 0), 559#L73true, 900#(= |#race~n2~0| 0), Black: 909#true, Black: 931#(<= ~n_produce~0 0), Black: 939#(and (<= ~n_produce~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 937#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 978#true, 872#(= |#race~n_update~0| 0), 972#true, 890#(= |#race~n1~0| 0), 7#L95-28true, Black: 953#true, Black: 922#true, 860#(= |#race~n_produce~0| 0)]) [2025-03-08 22:08:50,954 INFO L294 olderBase$Statistics]: this new event has 520 ancestors and is cut-off event [2025-03-08 22:08:50,954 INFO L297 olderBase$Statistics]: existing Event has 389 ancestors and is cut-off event [2025-03-08 22:08:50,954 INFO L297 olderBase$Statistics]: existing Event has 520 ancestors and is cut-off event [2025-03-08 22:08:50,954 INFO L297 olderBase$Statistics]: existing Event has 472 ancestors and is cut-off event [2025-03-08 22:08:51,068 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2353] L52-->L58-12: Formula: (let ((.cse13 (* v_~size1~0_261 4)) (.cse14 (* v_~front1~0_335 4)) (.cse15 (* v_~state11~0_117 4))) (let ((.cse6 (not |v_thread1_#t~short2#1_227|)) (.cse2 (not |v_thread1_#t~short1#1_213|)) (.cse5 (+ v_~front1~0_335 v_~size1~0_261)) (.cse9 (+ v_~produce~0.offset_71 .cse15 1)) (.cse11 (+ v_~produce~0.offset_71 3 .cse15)) (.cse1 (+ v_~produce~0.offset_71 .cse15)) (.cse12 (+ .cse13 .cse14 v_~queue1~0.offset_197)) (.cse0 (select |v_#race_781| v_~produce~0.base_71)) (.cse10 (+ 2 v_~produce~0.offset_71 .cse15))) (and (= (select .cse0 .cse1) 0) (= |v_#race~queue1~0_276| 0) (let ((.cse3 (= |v_#race~size1~0_363| 0)) (.cse4 (= |v_#race~front1~0_500| 0))) (or (and (= |v_#race~n_queue~0_174| |v_#race~n_queue~0_173|) (= |v_thread1_#t~short1#1_213| |v_thread1_#t~short1#1_214|) .cse2 .cse3 .cse4) (and |v_thread1_#t~short1#1_213| (= |v_#race~n_queue~0_173| 0) .cse3 (or (and (not |v_thread1_#t~short1#1_214|) (<= v_~n_queue~0_82 .cse5)) (and |v_thread1_#t~short1#1_214| (< .cse5 v_~n_queue~0_82))) .cse4))) (or (and .cse6 (< v_~state11~0_117 0)) (and (<= 0 v_~state11~0_117) |v_thread1_#t~short2#1_227|)) (not (= (ite |v_thread1_#t~short1#1_214| 1 0) 0)) (= |v_#race~state11~0_163| 0) (let ((.cse7 (= |v_#race~state11~0_173| 0))) (or (and .cse6 .cse7 (= |v_#race~n_produce~0_94| |v_#race~n_produce~0_93|) (= |v_thread1_#t~short2#1_227| |v_thread1_#t~short2#1_228|)) (and (or (and (<= v_~n_produce~0_36 v_~state11~0_117) (not |v_thread1_#t~short2#1_228|)) (and (< v_~state11~0_117 v_~n_produce~0_36) |v_thread1_#t~short2#1_228|)) .cse7 |v_thread1_#t~short2#1_227| (= |v_#race~n_produce~0_93| 0)))) (not (= (ite |v_thread1_#t~short2#1_228| 1 0) 0)) (= |v_#race~front1~0_468| 0) (= (+ v_~size1~0_261 1) v_~size1~0_260) (= (let ((.cse8 (store |v_#race_782| v_~queue1~0.base_197 (store (store (store (store (select |v_#race_782| v_~queue1~0.base_197) .cse12 0) (+ .cse13 .cse14 v_~queue1~0.offset_197 1) 0) (+ 2 .cse13 .cse14 v_~queue1~0.offset_197) 0) (+ 3 .cse13 .cse14 v_~queue1~0.offset_197) 0)))) (store .cse8 v_~produce~0.base_71 (store (store (store (store (select .cse8 v_~produce~0.base_71) .cse1 0) .cse9 0) .cse10 0) .cse11 0))) |v_#race_781|) (or (and .cse2 (< .cse5 0)) (and |v_thread1_#t~short1#1_213| (<= 0 .cse5))) (= (select .cse0 .cse9) 0) (= (select .cse0 .cse11) 0) (not (= (ite (= (select (select |v_#memory_int_185| v_~produce~0.base_71) .cse1) (select (select |v_#memory_int_185| v_~queue1~0.base_197) .cse12)) 1 0) 0)) (= (select .cse0 .cse10) 0) (= |v_#race~produce~0_60| 0)))) InVars {#race=|v_#race_782|, ~state11~0=v_~state11~0_117, ~size1~0=v_~size1~0_261, ~produce~0.base=v_~produce~0.base_71, ~queue1~0.base=v_~queue1~0.base_197, #race~n_queue~0=|v_#race~n_queue~0_174|, ~n_queue~0=v_~n_queue~0_82, #race~n_produce~0=|v_#race~n_produce~0_94|, #memory_int=|v_#memory_int_185|, ~n_produce~0=v_~n_produce~0_36, ~produce~0.offset=v_~produce~0.offset_71, ~queue1~0.offset=v_~queue1~0.offset_197, ~front1~0=v_~front1~0_335} OutVars{#race~produce~0=|v_#race~produce~0_60|, #race~state11~0=|v_#race~state11~0_163|, thread1Thread1of1ForFork1_#t~short2#1=|v_thread1Thread1of1ForFork1_#t~short2#1_23|, #race~size1~0=|v_#race~size1~0_349|, ~produce~0.base=v_~produce~0.base_71, thread1Thread1of1ForFork1_#t~short1#1=|v_thread1Thread1of1ForFork1_#t~short1#1_31|, ~queue1~0.base=v_~queue1~0.base_197, #race~front1~0=|v_#race~front1~0_468|, #race~n_queue~0=|v_#race~n_queue~0_173|, ~n_queue~0=v_~n_queue~0_82, ~front1~0=v_~front1~0_335, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_13|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_25|, #race=|v_#race_781|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_7|, ~state11~0=v_~state11~0_117, ~size1~0=v_~size1~0_260, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_3|, thread1Thread1of1ForFork1_#t~nondet6#1=|v_thread1Thread1of1ForFork1_#t~nondet6#1_3|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|, #race~n_produce~0=|v_#race~n_produce~0_93|, #memory_int=|v_#memory_int_185|, ~n_produce~0=v_~n_produce~0_36, ~produce~0.offset=v_~produce~0.offset_71, ~queue1~0.offset=v_~queue1~0.offset_197, #race~queue1~0=|v_#race~queue1~0_276|} AuxVars[|v_thread1_#t~short1#1_213|, |v_thread1_#t~short1#1_214|, |v_#race~size1~0_363|, |v_#race~state11~0_173|, |v_thread1_#t~short2#1_227|, |v_thread1_#t~short2#1_228|, |v_#race~front1~0_500|] AssignedVars[#race, #race~produce~0, #race~state11~0, thread1Thread1of1ForFork1_#t~short2#1, thread1Thread1of1ForFork1_#t~mem4#1, ~size1~0, thread1Thread1of1ForFork1_#t~post5#1, #race~size1~0, thread1Thread1of1ForFork1_#t~nondet6#1, thread1Thread1of1ForFork1_#t~short1#1, #race~front1~0, #race~n_queue~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #race~n_produce~0, thread1Thread1of1ForFork1_#t~mem3#1, #race~queue1~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][536], [Black: 894#true, 678#L58-12true, 955#(= |#race~produce~0| 0), 878#(= |#race~n_queue~0| 0), Black: 898#true, 911#(= |#race~update~0| 0), Black: 835#true, Black: 902#true, 896#(= |#race~consume~0| 0), 714#L135-1true, 559#L73true, 900#(= |#race~n2~0| 0), Black: 909#true, Black: 931#(<= ~n_produce~0 0), Black: 939#(and (<= ~n_produce~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 937#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 978#true, 872#(= |#race~n_update~0| 0), 972#true, 890#(= |#race~n1~0| 0), 7#L95-28true, Black: 953#true, Black: 922#true, 860#(= |#race~n_produce~0| 0)]) [2025-03-08 22:08:51,068 INFO L294 olderBase$Statistics]: this new event has 530 ancestors and is cut-off event [2025-03-08 22:08:51,068 INFO L297 olderBase$Statistics]: existing Event has 431 ancestors and is cut-off event [2025-03-08 22:08:51,068 INFO L297 olderBase$Statistics]: existing Event has 482 ancestors and is cut-off event [2025-03-08 22:08:51,068 INFO L297 olderBase$Statistics]: existing Event has 530 ancestors and is cut-off event [2025-03-08 22:08:51,241 INFO L124 PetriNetUnfolderBase]: 2318/17388 cut-off events. [2025-03-08 22:08:51,241 INFO L125 PetriNetUnfolderBase]: For 4391/4542 co-relation queries the response was YES. [2025-03-08 22:08:51,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24187 conditions, 17388 events. 2318/17388 cut-off events. For 4391/4542 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 180226 event pairs, 496 based on Foata normal form. 1/15828 useless extension candidates. Maximal degree in co-relation 24063. Up to 1506 conditions per place. [2025-03-08 22:08:51,435 INFO L140 encePairwiseOnDemand]: 840/846 looper letters, 86 selfloop transitions, 5 changer transitions 0/725 dead transitions. [2025-03-08 22:08:51,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 690 places, 725 transitions, 1904 flow [2025-03-08 22:08:51,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:08:51,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:08:51,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4443 transitions. [2025-03-08 22:08:51,438 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8752955082742316 [2025-03-08 22:08:51,438 INFO L175 Difference]: Start difference. First operand has 686 places, 682 transitions, 1512 flow. Second operand 6 states and 4443 transitions. [2025-03-08 22:08:51,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 690 places, 725 transitions, 1904 flow [2025-03-08 22:08:51,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 685 places, 725 transitions, 1894 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:08:51,448 INFO L231 Difference]: Finished difference. Result has 685 places, 681 transitions, 1510 flow [2025-03-08 22:08:51,450 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1500, PETRI_DIFFERENCE_MINUEND_PLACES=680, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=681, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=676, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1510, PETRI_PLACES=685, PETRI_TRANSITIONS=681} [2025-03-08 22:08:51,451 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -113 predicate places. [2025-03-08 22:08:51,451 INFO L471 AbstractCegarLoop]: Abstraction has has 685 places, 681 transitions, 1510 flow [2025-03-08 22:08:51,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 730.6666666666666) internal successors, (4384), 6 states have internal predecessors, (4384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:51,452 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:08:51,453 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:08:51,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-08 22:08:51,454 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting thread3Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-08 22:08:51,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:08:51,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1491369029, now seen corresponding path program 1 times [2025-03-08 22:08:51,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:08:51,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264310155] [2025-03-08 22:08:51,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:08:51,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:08:51,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 366 statements into 1 equivalence classes. [2025-03-08 22:08:51,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 366 of 366 statements. [2025-03-08 22:08:51,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:08:51,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:08:51,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:08:51,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:08:51,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264310155] [2025-03-08 22:08:51,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264310155] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:08:51,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:08:51,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:08:51,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420887683] [2025-03-08 22:08:51,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:08:51,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:08:51,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:08:51,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:08:51,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:08:51,525 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 750 out of 846 [2025-03-08 22:08:51,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 685 places, 681 transitions, 1510 flow. Second operand has 3 states, 3 states have (on average 753.0) internal successors, (2259), 3 states have internal predecessors, (2259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:51,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:08:51,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 750 of 846 [2025-03-08 22:08:51,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:08:54,217 INFO L124 PetriNetUnfolderBase]: 2113/17881 cut-off events. [2025-03-08 22:08:54,217 INFO L125 PetriNetUnfolderBase]: For 3818/3914 co-relation queries the response was YES. [2025-03-08 22:08:54,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24033 conditions, 17881 events. 2113/17881 cut-off events. For 3818/3914 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 187465 event pairs, 699 based on Foata normal form. 3/16372 useless extension candidates. Maximal degree in co-relation 23908. Up to 1921 conditions per place. [2025-03-08 22:08:54,361 INFO L140 encePairwiseOnDemand]: 843/846 looper letters, 34 selfloop transitions, 2 changer transitions 0/691 dead transitions. [2025-03-08 22:08:54,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 686 places, 691 transitions, 1633 flow [2025-03-08 22:08:54,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:08:54,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:08:54,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2276 transitions. [2025-03-08 22:08:54,363 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8967691095350669 [2025-03-08 22:08:54,363 INFO L175 Difference]: Start difference. First operand has 685 places, 681 transitions, 1510 flow. Second operand 3 states and 2276 transitions. [2025-03-08 22:08:54,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 686 places, 691 transitions, 1633 flow [2025-03-08 22:08:54,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 681 places, 691 transitions, 1623 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:08:54,371 INFO L231 Difference]: Finished difference. Result has 681 places, 680 transitions, 1502 flow [2025-03-08 22:08:54,372 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1498, PETRI_DIFFERENCE_MINUEND_PLACES=679, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=680, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=678, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1502, PETRI_PLACES=681, PETRI_TRANSITIONS=680} [2025-03-08 22:08:54,372 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -117 predicate places. [2025-03-08 22:08:54,372 INFO L471 AbstractCegarLoop]: Abstraction has has 681 places, 680 transitions, 1502 flow [2025-03-08 22:08:54,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 753.0) internal successors, (2259), 3 states have internal predecessors, (2259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:54,373 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:08:54,373 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:08:54,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-08 22:08:54,373 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting thread3Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-08 22:08:54,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:08:54,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1798347100, now seen corresponding path program 1 times [2025-03-08 22:08:54,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:08:54,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494390193] [2025-03-08 22:08:54,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:08:54,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:08:54,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 391 statements into 1 equivalence classes. [2025-03-08 22:08:54,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 391 of 391 statements. [2025-03-08 22:08:54,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:08:54,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:08:54,777 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 22:08:54,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:08:54,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494390193] [2025-03-08 22:08:54,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494390193] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:08:54,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:08:54,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:08:54,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445215631] [2025-03-08 22:08:54,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:08:54,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:08:54,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:08:54,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:08:54,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:08:55,129 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 728 out of 846 [2025-03-08 22:08:55,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 681 places, 680 transitions, 1502 flow. Second operand has 6 states, 6 states have (on average 730.0) internal successors, (4380), 6 states have internal predecessors, (4380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:55,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:08:55,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 728 of 846 [2025-03-08 22:08:55,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:08:56,777 INFO L124 PetriNetUnfolderBase]: 1115/8959 cut-off events. [2025-03-08 22:08:56,777 INFO L125 PetriNetUnfolderBase]: For 2443/2663 co-relation queries the response was YES. [2025-03-08 22:08:56,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12388 conditions, 8959 events. 1115/8959 cut-off events. For 2443/2663 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 74511 event pairs, 147 based on Foata normal form. 1/8255 useless extension candidates. Maximal degree in co-relation 12261. Up to 562 conditions per place. [2025-03-08 22:08:56,843 INFO L140 encePairwiseOnDemand]: 840/846 looper letters, 87 selfloop transitions, 5 changer transitions 0/723 dead transitions. [2025-03-08 22:08:56,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 685 places, 723 transitions, 1896 flow [2025-03-08 22:08:56,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:08:56,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:08:56,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4438 transitions. [2025-03-08 22:08:56,845 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8743104806934594 [2025-03-08 22:08:56,845 INFO L175 Difference]: Start difference. First operand has 681 places, 680 transitions, 1502 flow. Second operand 6 states and 4438 transitions. [2025-03-08 22:08:56,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 685 places, 723 transitions, 1896 flow [2025-03-08 22:08:56,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 683 places, 723 transitions, 1892 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:08:56,852 INFO L231 Difference]: Finished difference. Result has 683 places, 679 transitions, 1506 flow [2025-03-08 22:08:56,852 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1496, PETRI_DIFFERENCE_MINUEND_PLACES=678, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=679, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=674, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1506, PETRI_PLACES=683, PETRI_TRANSITIONS=679} [2025-03-08 22:08:56,853 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -115 predicate places. [2025-03-08 22:08:56,853 INFO L471 AbstractCegarLoop]: Abstraction has has 683 places, 679 transitions, 1506 flow [2025-03-08 22:08:56,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 730.0) internal successors, (4380), 6 states have internal predecessors, (4380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:56,853 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:08:56,853 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:08:56,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-08 22:08:56,854 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting thread3Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-08 22:08:56,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:08:56,855 INFO L85 PathProgramCache]: Analyzing trace with hash -921423202, now seen corresponding path program 1 times [2025-03-08 22:08:56,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:08:56,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468409164] [2025-03-08 22:08:56,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:08:56,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:08:56,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 395 statements into 1 equivalence classes. [2025-03-08 22:08:56,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 395 of 395 statements. [2025-03-08 22:08:56,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:08:56,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:08:56,904 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 22:08:56,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:08:56,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468409164] [2025-03-08 22:08:56,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468409164] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:08:56,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:08:56,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:08:56,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215070880] [2025-03-08 22:08:56,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:08:56,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:08:56,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:08:56,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:08:56,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:08:56,944 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 743 out of 846 [2025-03-08 22:08:56,944 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 683 places, 679 transitions, 1506 flow. Second operand has 3 states, 3 states have (on average 747.0) internal successors, (2241), 3 states have internal predecessors, (2241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:56,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:08:56,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 743 of 846 [2025-03-08 22:08:56,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:09:00,052 INFO L124 PetriNetUnfolderBase]: 2817/17591 cut-off events. [2025-03-08 22:09:00,052 INFO L125 PetriNetUnfolderBase]: For 5561/5629 co-relation queries the response was YES. [2025-03-08 22:09:00,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25836 conditions, 17591 events. 2817/17591 cut-off events. For 5561/5629 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 181143 event pairs, 1205 based on Foata normal form. 0/16104 useless extension candidates. Maximal degree in co-relation 25711. Up to 3365 conditions per place. [2025-03-08 22:09:00,135 INFO L140 encePairwiseOnDemand]: 843/846 looper letters, 43 selfloop transitions, 2 changer transitions 0/689 dead transitions. [2025-03-08 22:09:00,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 684 places, 689 transitions, 1647 flow [2025-03-08 22:09:00,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:09:00,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:09:00,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2263 transitions. [2025-03-08 22:09:00,137 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8916469661150512 [2025-03-08 22:09:00,137 INFO L175 Difference]: Start difference. First operand has 683 places, 679 transitions, 1506 flow. Second operand 3 states and 2263 transitions. [2025-03-08 22:09:00,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 684 places, 689 transitions, 1647 flow [2025-03-08 22:09:00,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 679 places, 689 transitions, 1637 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:09:00,144 INFO L231 Difference]: Finished difference. Result has 679 places, 678 transitions, 1498 flow [2025-03-08 22:09:00,145 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1494, PETRI_DIFFERENCE_MINUEND_PLACES=677, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=678, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=676, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1498, PETRI_PLACES=679, PETRI_TRANSITIONS=678} [2025-03-08 22:09:00,145 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -119 predicate places. [2025-03-08 22:09:00,145 INFO L471 AbstractCegarLoop]: Abstraction has has 679 places, 678 transitions, 1498 flow [2025-03-08 22:09:00,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 747.0) internal successors, (2241), 3 states have internal predecessors, (2241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:09:00,145 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:09:00,146 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:09:00,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-08 22:09:00,146 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting thread3Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-08 22:09:00,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:09:00,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1346634176, now seen corresponding path program 1 times [2025-03-08 22:09:00,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:09:00,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935092397] [2025-03-08 22:09:00,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:09:00,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:09:00,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 410 statements into 1 equivalence classes. [2025-03-08 22:09:00,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 410 of 410 statements. [2025-03-08 22:09:00,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:09:00,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:09:00,200 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 22:09:00,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:09:00,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935092397] [2025-03-08 22:09:00,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935092397] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:09:00,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:09:00,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:09:00,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647578895] [2025-03-08 22:09:00,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:09:00,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:09:00,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:09:00,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:09:00,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:09:00,208 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 756 out of 846 [2025-03-08 22:09:00,209 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 679 places, 678 transitions, 1498 flow. Second operand has 3 states, 3 states have (on average 758.0) internal successors, (2274), 3 states have internal predecessors, (2274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:09:00,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:09:00,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 756 of 846 [2025-03-08 22:09:00,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:09:02,737 INFO L124 PetriNetUnfolderBase]: 986/15168 cut-off events. [2025-03-08 22:09:02,738 INFO L125 PetriNetUnfolderBase]: For 1642/1790 co-relation queries the response was YES. [2025-03-08 22:09:02,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17834 conditions, 15168 events. 986/15168 cut-off events. For 1642/1790 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 151698 event pairs, 81 based on Foata normal form. 5/14044 useless extension candidates. Maximal degree in co-relation 17710. Up to 635 conditions per place. [2025-03-08 22:09:02,899 INFO L140 encePairwiseOnDemand]: 843/846 looper letters, 33 selfloop transitions, 2 changer transitions 0/692 dead transitions. [2025-03-08 22:09:02,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 680 places, 692 transitions, 1642 flow [2025-03-08 22:09:02,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:09:02,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:09:02,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2292 transitions. [2025-03-08 22:09:02,900 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9030732860520094 [2025-03-08 22:09:02,900 INFO L175 Difference]: Start difference. First operand has 679 places, 678 transitions, 1498 flow. Second operand 3 states and 2292 transitions. [2025-03-08 22:09:02,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 680 places, 692 transitions, 1642 flow [2025-03-08 22:09:02,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 678 places, 692 transitions, 1638 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:09:02,908 INFO L231 Difference]: Finished difference. Result has 679 places, 679 transitions, 1508 flow [2025-03-08 22:09:02,908 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1492, PETRI_DIFFERENCE_MINUEND_PLACES=676, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=677, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=675, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1508, PETRI_PLACES=679, PETRI_TRANSITIONS=679} [2025-03-08 22:09:02,909 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -119 predicate places. [2025-03-08 22:09:02,909 INFO L471 AbstractCegarLoop]: Abstraction has has 679 places, 679 transitions, 1508 flow [2025-03-08 22:09:02,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 758.0) internal successors, (2274), 3 states have internal predecessors, (2274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:09:02,909 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:09:02,909 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:09:02,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-08 22:09:02,909 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting thread3Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-08 22:09:02,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:09:02,911 INFO L85 PathProgramCache]: Analyzing trace with hash -860463760, now seen corresponding path program 1 times [2025-03-08 22:09:02,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:09:02,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197829158] [2025-03-08 22:09:02,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:09:02,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:09:02,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 415 statements into 1 equivalence classes. [2025-03-08 22:09:02,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 415 of 415 statements. [2025-03-08 22:09:02,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:09:02,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:09:03,025 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 22:09:03,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:09:03,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197829158] [2025-03-08 22:09:03,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197829158] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:09:03,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:09:03,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:09:03,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811287425] [2025-03-08 22:09:03,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:09:03,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:09:03,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:09:03,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:09:03,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:09:03,142 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 731 out of 846 [2025-03-08 22:09:03,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 679 places, 679 transitions, 1508 flow. Second operand has 3 states, 3 states have (on average 734.3333333333334) internal successors, (2203), 3 states have internal predecessors, (2203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:09:03,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:09:03,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 731 of 846 [2025-03-08 22:09:03,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:09:05,715 INFO L124 PetriNetUnfolderBase]: 1177/16318 cut-off events. [2025-03-08 22:09:05,715 INFO L125 PetriNetUnfolderBase]: For 2113/2261 co-relation queries the response was YES. [2025-03-08 22:09:05,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19644 conditions, 16318 events. 1177/16318 cut-off events. For 2113/2261 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 166420 event pairs, 222 based on Foata normal form. 1/15149 useless extension candidates. Maximal degree in co-relation 19517. Up to 767 conditions per place. [2025-03-08 22:09:05,862 INFO L140 encePairwiseOnDemand]: 843/846 looper letters, 56 selfloop transitions, 2 changer transitions 0/690 dead transitions. [2025-03-08 22:09:05,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 680 places, 690 transitions, 1679 flow [2025-03-08 22:09:05,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:09:05,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:09:05,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2240 transitions. [2025-03-08 22:09:05,864 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8825847123719465 [2025-03-08 22:09:05,864 INFO L175 Difference]: Start difference. First operand has 679 places, 679 transitions, 1508 flow. Second operand 3 states and 2240 transitions. [2025-03-08 22:09:05,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 680 places, 690 transitions, 1679 flow [2025-03-08 22:09:05,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 680 places, 690 transitions, 1679 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:09:05,870 INFO L231 Difference]: Finished difference. Result has 681 places, 679 transitions, 1516 flow [2025-03-08 22:09:05,871 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1506, PETRI_DIFFERENCE_MINUEND_PLACES=678, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=678, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=676, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1516, PETRI_PLACES=681, PETRI_TRANSITIONS=679} [2025-03-08 22:09:05,871 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -117 predicate places. [2025-03-08 22:09:05,871 INFO L471 AbstractCegarLoop]: Abstraction has has 681 places, 679 transitions, 1516 flow [2025-03-08 22:09:05,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 734.3333333333334) internal successors, (2203), 3 states have internal predecessors, (2203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:09:05,871 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:09:05,871 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:09:05,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-03-08 22:09:05,872 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-08 22:09:05,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:09:05,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1421599118, now seen corresponding path program 1 times [2025-03-08 22:09:05,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:09:05,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350849711] [2025-03-08 22:09:05,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:09:05,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:09:05,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 419 statements into 1 equivalence classes. [2025-03-08 22:09:05,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 419 of 419 statements. [2025-03-08 22:09:05,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:09:05,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:09:05,928 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 22:09:05,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:09:05,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350849711] [2025-03-08 22:09:05,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350849711] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:09:05,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:09:05,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:09:05,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667141119] [2025-03-08 22:09:05,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:09:05,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:09:05,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:09:05,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:09:05,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:09:05,937 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 754 out of 846 [2025-03-08 22:09:05,938 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 681 places, 679 transitions, 1516 flow. Second operand has 3 states, 3 states have (on average 756.3333333333334) internal successors, (2269), 3 states have internal predecessors, (2269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:09:05,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:09:05,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 754 of 846 [2025-03-08 22:09:05,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:09:09,261 INFO L124 PetriNetUnfolderBase]: 1572/21035 cut-off events. [2025-03-08 22:09:09,261 INFO L125 PetriNetUnfolderBase]: For 2704/2753 co-relation queries the response was YES. [2025-03-08 22:09:09,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25626 conditions, 21035 events. 1572/21035 cut-off events. For 2704/2753 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 222447 event pairs, 347 based on Foata normal form. 1/19685 useless extension candidates. Maximal degree in co-relation 25500. Up to 1134 conditions per place. [2025-03-08 22:09:09,374 INFO L140 encePairwiseOnDemand]: 843/846 looper letters, 0 selfloop transitions, 0 changer transitions 689/689 dead transitions. [2025-03-08 22:09:09,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 682 places, 689 transitions, 1637 flow [2025-03-08 22:09:09,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:09:09,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:09:09,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2285 transitions. [2025-03-08 22:09:09,375 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9003152088258471 [2025-03-08 22:09:09,375 INFO L175 Difference]: Start difference. First operand has 681 places, 679 transitions, 1516 flow. Second operand 3 states and 2285 transitions. [2025-03-08 22:09:09,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 682 places, 689 transitions, 1637 flow [2025-03-08 22:09:09,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 681 places, 689 transitions, 1635 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:09:09,381 INFO L231 Difference]: Finished difference. Result has 681 places, 0 transitions, 0 flow [2025-03-08 22:09:09,381 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1512, PETRI_DIFFERENCE_MINUEND_PLACES=679, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=678, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=678, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=681, PETRI_TRANSITIONS=0} [2025-03-08 22:09:09,381 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -117 predicate places. [2025-03-08 22:09:09,381 INFO L471 AbstractCegarLoop]: Abstraction has has 681 places, 0 transitions, 0 flow [2025-03-08 22:09:09,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 756.3333333333334) internal successors, (2269), 3 states have internal predecessors, (2269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:09:09,384 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err31ASSERT_VIOLATIONDATA_RACE (233 of 234 remaining) [2025-03-08 22:09:09,384 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err30ASSERT_VIOLATIONDATA_RACE (232 of 234 remaining) [2025-03-08 22:09:09,384 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err29ASSERT_VIOLATIONDATA_RACE (231 of 234 remaining) [2025-03-08 22:09:09,384 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err28ASSERT_VIOLATIONDATA_RACE (230 of 234 remaining) [2025-03-08 22:09:09,384 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err27ASSERT_VIOLATIONDATA_RACE (229 of 234 remaining) [2025-03-08 22:09:09,384 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err26ASSERT_VIOLATIONDATA_RACE (228 of 234 remaining) [2025-03-08 22:09:09,384 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err25ASSERT_VIOLATIONDATA_RACE (227 of 234 remaining) [2025-03-08 22:09:09,384 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err24ASSERT_VIOLATIONDATA_RACE (226 of 234 remaining) [2025-03-08 22:09:09,384 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (225 of 234 remaining) [2025-03-08 22:09:09,384 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (224 of 234 remaining) [2025-03-08 22:09:09,384 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (223 of 234 remaining) [2025-03-08 22:09:09,384 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (222 of 234 remaining) [2025-03-08 22:09:09,385 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (221 of 234 remaining) [2025-03-08 22:09:09,385 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (220 of 234 remaining) [2025-03-08 22:09:09,385 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (219 of 234 remaining) [2025-03-08 22:09:09,385 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (218 of 234 remaining) [2025-03-08 22:09:09,385 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (217 of 234 remaining) [2025-03-08 22:09:09,385 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (216 of 234 remaining) [2025-03-08 22:09:09,385 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (215 of 234 remaining) [2025-03-08 22:09:09,385 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (214 of 234 remaining) [2025-03-08 22:09:09,385 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (213 of 234 remaining) [2025-03-08 22:09:09,385 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (212 of 234 remaining) [2025-03-08 22:09:09,385 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (211 of 234 remaining) [2025-03-08 22:09:09,385 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (210 of 234 remaining) [2025-03-08 22:09:09,385 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (209 of 234 remaining) [2025-03-08 22:09:09,385 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (208 of 234 remaining) [2025-03-08 22:09:09,385 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (207 of 234 remaining) [2025-03-08 22:09:09,385 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (206 of 234 remaining) [2025-03-08 22:09:09,385 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (205 of 234 remaining) [2025-03-08 22:09:09,386 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (204 of 234 remaining) [2025-03-08 22:09:09,386 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (203 of 234 remaining) [2025-03-08 22:09:09,386 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (202 of 234 remaining) [2025-03-08 22:09:09,386 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err29ASSERT_VIOLATIONDATA_RACE (201 of 234 remaining) [2025-03-08 22:09:09,386 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err28ASSERT_VIOLATIONDATA_RACE (200 of 234 remaining) [2025-03-08 22:09:09,386 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err27ASSERT_VIOLATIONDATA_RACE (199 of 234 remaining) [2025-03-08 22:09:09,386 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err26ASSERT_VIOLATIONDATA_RACE (198 of 234 remaining) [2025-03-08 22:09:09,386 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err25ASSERT_VIOLATIONDATA_RACE (197 of 234 remaining) [2025-03-08 22:09:09,386 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err24ASSERT_VIOLATIONDATA_RACE (196 of 234 remaining) [2025-03-08 22:09:09,386 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (195 of 234 remaining) [2025-03-08 22:09:09,386 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (194 of 234 remaining) [2025-03-08 22:09:09,386 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (193 of 234 remaining) [2025-03-08 22:09:09,386 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (192 of 234 remaining) [2025-03-08 22:09:09,386 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (191 of 234 remaining) [2025-03-08 22:09:09,386 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (190 of 234 remaining) [2025-03-08 22:09:09,387 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (189 of 234 remaining) [2025-03-08 22:09:09,387 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (188 of 234 remaining) [2025-03-08 22:09:09,387 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (187 of 234 remaining) [2025-03-08 22:09:09,387 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (186 of 234 remaining) [2025-03-08 22:09:09,387 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (185 of 234 remaining) [2025-03-08 22:09:09,387 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (184 of 234 remaining) [2025-03-08 22:09:09,387 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (183 of 234 remaining) [2025-03-08 22:09:09,387 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (182 of 234 remaining) [2025-03-08 22:09:09,387 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (181 of 234 remaining) [2025-03-08 22:09:09,387 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (180 of 234 remaining) [2025-03-08 22:09:09,387 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (179 of 234 remaining) [2025-03-08 22:09:09,387 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (178 of 234 remaining) [2025-03-08 22:09:09,387 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (177 of 234 remaining) [2025-03-08 22:09:09,387 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (176 of 234 remaining) [2025-03-08 22:09:09,387 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (175 of 234 remaining) [2025-03-08 22:09:09,387 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (174 of 234 remaining) [2025-03-08 22:09:09,388 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (173 of 234 remaining) [2025-03-08 22:09:09,388 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (172 of 234 remaining) [2025-03-08 22:09:09,388 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err35ASSERT_VIOLATIONDATA_RACE (171 of 234 remaining) [2025-03-08 22:09:09,388 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err34ASSERT_VIOLATIONDATA_RACE (170 of 234 remaining) [2025-03-08 22:09:09,388 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err33ASSERT_VIOLATIONDATA_RACE (169 of 234 remaining) [2025-03-08 22:09:09,388 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err32ASSERT_VIOLATIONDATA_RACE (168 of 234 remaining) [2025-03-08 22:09:09,388 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err31ASSERT_VIOLATIONDATA_RACE (167 of 234 remaining) [2025-03-08 22:09:09,388 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err30ASSERT_VIOLATIONDATA_RACE (166 of 234 remaining) [2025-03-08 22:09:09,391 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err29ASSERT_VIOLATIONDATA_RACE (165 of 234 remaining) [2025-03-08 22:09:09,392 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err28ASSERT_VIOLATIONDATA_RACE (164 of 234 remaining) [2025-03-08 22:09:09,392 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err27ASSERT_VIOLATIONDATA_RACE (163 of 234 remaining) [2025-03-08 22:09:09,392 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err26ASSERT_VIOLATIONDATA_RACE (162 of 234 remaining) [2025-03-08 22:09:09,392 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err25ASSERT_VIOLATIONDATA_RACE (161 of 234 remaining) [2025-03-08 22:09:09,392 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err24ASSERT_VIOLATIONDATA_RACE (160 of 234 remaining) [2025-03-08 22:09:09,392 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err23ASSERT_VIOLATIONDATA_RACE (159 of 234 remaining) [2025-03-08 22:09:09,392 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err21ASSERT_VIOLATIONDATA_RACE (158 of 234 remaining) [2025-03-08 22:09:09,392 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err22ASSERT_VIOLATIONDATA_RACE (157 of 234 remaining) [2025-03-08 22:09:09,392 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err20ASSERT_VIOLATIONDATA_RACE (156 of 234 remaining) [2025-03-08 22:09:09,392 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (155 of 234 remaining) [2025-03-08 22:09:09,392 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (154 of 234 remaining) [2025-03-08 22:09:09,392 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (153 of 234 remaining) [2025-03-08 22:09:09,392 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (152 of 234 remaining) [2025-03-08 22:09:09,392 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (151 of 234 remaining) [2025-03-08 22:09:09,392 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (150 of 234 remaining) [2025-03-08 22:09:09,392 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (149 of 234 remaining) [2025-03-08 22:09:09,392 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (148 of 234 remaining) [2025-03-08 22:09:09,392 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (147 of 234 remaining) [2025-03-08 22:09:09,392 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (146 of 234 remaining) [2025-03-08 22:09:09,392 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (145 of 234 remaining) [2025-03-08 22:09:09,392 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (144 of 234 remaining) [2025-03-08 22:09:09,392 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (143 of 234 remaining) [2025-03-08 22:09:09,392 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (142 of 234 remaining) [2025-03-08 22:09:09,392 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (141 of 234 remaining) [2025-03-08 22:09:09,392 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (140 of 234 remaining) [2025-03-08 22:09:09,392 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (139 of 234 remaining) [2025-03-08 22:09:09,392 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (138 of 234 remaining) [2025-03-08 22:09:09,393 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (137 of 234 remaining) [2025-03-08 22:09:09,393 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (136 of 234 remaining) [2025-03-08 22:09:09,393 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONDATA_RACE (135 of 234 remaining) [2025-03-08 22:09:09,393 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONDATA_RACE (134 of 234 remaining) [2025-03-08 22:09:09,393 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONDATA_RACE (133 of 234 remaining) [2025-03-08 22:09:09,393 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONDATA_RACE (132 of 234 remaining) [2025-03-08 22:09:09,393 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONDATA_RACE (131 of 234 remaining) [2025-03-08 22:09:09,393 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE (130 of 234 remaining) [2025-03-08 22:09:09,393 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONDATA_RACE (129 of 234 remaining) [2025-03-08 22:09:09,393 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE (128 of 234 remaining) [2025-03-08 22:09:09,393 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE (127 of 234 remaining) [2025-03-08 22:09:09,393 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE (126 of 234 remaining) [2025-03-08 22:09:09,393 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (125 of 234 remaining) [2025-03-08 22:09:09,393 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (124 of 234 remaining) [2025-03-08 22:09:09,393 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (123 of 234 remaining) [2025-03-08 22:09:09,393 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (122 of 234 remaining) [2025-03-08 22:09:09,393 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (121 of 234 remaining) [2025-03-08 22:09:09,393 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (120 of 234 remaining) [2025-03-08 22:09:09,393 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (119 of 234 remaining) [2025-03-08 22:09:09,393 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (118 of 234 remaining) [2025-03-08 22:09:09,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (117 of 234 remaining) [2025-03-08 22:09:09,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (116 of 234 remaining) [2025-03-08 22:09:09,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (115 of 234 remaining) [2025-03-08 22:09:09,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (114 of 234 remaining) [2025-03-08 22:09:09,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (113 of 234 remaining) [2025-03-08 22:09:09,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (112 of 234 remaining) [2025-03-08 22:09:09,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (111 of 234 remaining) [2025-03-08 22:09:09,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (110 of 234 remaining) [2025-03-08 22:09:09,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (109 of 234 remaining) [2025-03-08 22:09:09,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (108 of 234 remaining) [2025-03-08 22:09:09,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (107 of 234 remaining) [2025-03-08 22:09:09,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (106 of 234 remaining) [2025-03-08 22:09:09,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (105 of 234 remaining) [2025-03-08 22:09:09,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (104 of 234 remaining) [2025-03-08 22:09:09,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (103 of 234 remaining) [2025-03-08 22:09:09,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (102 of 234 remaining) [2025-03-08 22:09:09,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (101 of 234 remaining) [2025-03-08 22:09:09,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (100 of 234 remaining) [2025-03-08 22:09:09,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (99 of 234 remaining) [2025-03-08 22:09:09,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (98 of 234 remaining) [2025-03-08 22:09:09,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err31ASSERT_VIOLATIONDATA_RACE (97 of 234 remaining) [2025-03-08 22:09:09,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err30ASSERT_VIOLATIONDATA_RACE (96 of 234 remaining) [2025-03-08 22:09:09,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err29ASSERT_VIOLATIONDATA_RACE (95 of 234 remaining) [2025-03-08 22:09:09,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err28ASSERT_VIOLATIONDATA_RACE (94 of 234 remaining) [2025-03-08 22:09:09,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err27ASSERT_VIOLATIONDATA_RACE (93 of 234 remaining) [2025-03-08 22:09:09,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err26ASSERT_VIOLATIONDATA_RACE (92 of 234 remaining) [2025-03-08 22:09:09,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err25ASSERT_VIOLATIONDATA_RACE (91 of 234 remaining) [2025-03-08 22:09:09,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err24ASSERT_VIOLATIONDATA_RACE (90 of 234 remaining) [2025-03-08 22:09:09,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (89 of 234 remaining) [2025-03-08 22:09:09,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (88 of 234 remaining) [2025-03-08 22:09:09,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (87 of 234 remaining) [2025-03-08 22:09:09,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (86 of 234 remaining) [2025-03-08 22:09:09,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (85 of 234 remaining) [2025-03-08 22:09:09,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (84 of 234 remaining) [2025-03-08 22:09:09,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (83 of 234 remaining) [2025-03-08 22:09:09,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (82 of 234 remaining) [2025-03-08 22:09:09,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (81 of 234 remaining) [2025-03-08 22:09:09,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (80 of 234 remaining) [2025-03-08 22:09:09,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (79 of 234 remaining) [2025-03-08 22:09:09,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (78 of 234 remaining) [2025-03-08 22:09:09,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (77 of 234 remaining) [2025-03-08 22:09:09,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (76 of 234 remaining) [2025-03-08 22:09:09,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (75 of 234 remaining) [2025-03-08 22:09:09,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (74 of 234 remaining) [2025-03-08 22:09:09,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (73 of 234 remaining) [2025-03-08 22:09:09,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (72 of 234 remaining) [2025-03-08 22:09:09,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (71 of 234 remaining) [2025-03-08 22:09:09,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (70 of 234 remaining) [2025-03-08 22:09:09,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (69 of 234 remaining) [2025-03-08 22:09:09,397 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (68 of 234 remaining) [2025-03-08 22:09:09,397 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (67 of 234 remaining) [2025-03-08 22:09:09,397 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (66 of 234 remaining) [2025-03-08 22:09:09,397 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err29ASSERT_VIOLATIONDATA_RACE (65 of 234 remaining) [2025-03-08 22:09:09,397 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err28ASSERT_VIOLATIONDATA_RACE (64 of 234 remaining) [2025-03-08 22:09:09,397 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err27ASSERT_VIOLATIONDATA_RACE (63 of 234 remaining) [2025-03-08 22:09:09,397 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err26ASSERT_VIOLATIONDATA_RACE (62 of 234 remaining) [2025-03-08 22:09:09,397 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err25ASSERT_VIOLATIONDATA_RACE (61 of 234 remaining) [2025-03-08 22:09:09,397 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err24ASSERT_VIOLATIONDATA_RACE (60 of 234 remaining) [2025-03-08 22:09:09,397 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (59 of 234 remaining) [2025-03-08 22:09:09,397 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (58 of 234 remaining) [2025-03-08 22:09:09,397 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (57 of 234 remaining) [2025-03-08 22:09:09,397 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (56 of 234 remaining) [2025-03-08 22:09:09,397 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (55 of 234 remaining) [2025-03-08 22:09:09,397 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (54 of 234 remaining) [2025-03-08 22:09:09,398 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (53 of 234 remaining) [2025-03-08 22:09:09,398 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (52 of 234 remaining) [2025-03-08 22:09:09,398 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (51 of 234 remaining) [2025-03-08 22:09:09,398 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (50 of 234 remaining) [2025-03-08 22:09:09,398 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (49 of 234 remaining) [2025-03-08 22:09:09,398 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (48 of 234 remaining) [2025-03-08 22:09:09,398 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (47 of 234 remaining) [2025-03-08 22:09:09,398 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (46 of 234 remaining) [2025-03-08 22:09:09,398 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (45 of 234 remaining) [2025-03-08 22:09:09,398 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (44 of 234 remaining) [2025-03-08 22:09:09,398 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (43 of 234 remaining) [2025-03-08 22:09:09,398 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (42 of 234 remaining) [2025-03-08 22:09:09,398 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (41 of 234 remaining) [2025-03-08 22:09:09,398 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (40 of 234 remaining) [2025-03-08 22:09:09,398 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (39 of 234 remaining) [2025-03-08 22:09:09,398 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (38 of 234 remaining) [2025-03-08 22:09:09,398 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (37 of 234 remaining) [2025-03-08 22:09:09,398 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (36 of 234 remaining) [2025-03-08 22:09:09,398 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err35ASSERT_VIOLATIONDATA_RACE (35 of 234 remaining) [2025-03-08 22:09:09,398 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err34ASSERT_VIOLATIONDATA_RACE (34 of 234 remaining) [2025-03-08 22:09:09,398 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err33ASSERT_VIOLATIONDATA_RACE (33 of 234 remaining) [2025-03-08 22:09:09,398 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err32ASSERT_VIOLATIONDATA_RACE (32 of 234 remaining) [2025-03-08 22:09:09,398 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err31ASSERT_VIOLATIONDATA_RACE (31 of 234 remaining) [2025-03-08 22:09:09,398 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err30ASSERT_VIOLATIONDATA_RACE (30 of 234 remaining) [2025-03-08 22:09:09,399 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err29ASSERT_VIOLATIONDATA_RACE (29 of 234 remaining) [2025-03-08 22:09:09,399 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err28ASSERT_VIOLATIONDATA_RACE (28 of 234 remaining) [2025-03-08 22:09:09,399 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err27ASSERT_VIOLATIONDATA_RACE (27 of 234 remaining) [2025-03-08 22:09:09,399 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err26ASSERT_VIOLATIONDATA_RACE (26 of 234 remaining) [2025-03-08 22:09:09,399 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err25ASSERT_VIOLATIONDATA_RACE (25 of 234 remaining) [2025-03-08 22:09:09,399 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err24ASSERT_VIOLATIONDATA_RACE (24 of 234 remaining) [2025-03-08 22:09:09,399 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err23ASSERT_VIOLATIONDATA_RACE (23 of 234 remaining) [2025-03-08 22:09:09,399 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err21ASSERT_VIOLATIONDATA_RACE (22 of 234 remaining) [2025-03-08 22:09:09,399 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err22ASSERT_VIOLATIONDATA_RACE (21 of 234 remaining) [2025-03-08 22:09:09,399 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err20ASSERT_VIOLATIONDATA_RACE (20 of 234 remaining) [2025-03-08 22:09:09,399 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (19 of 234 remaining) [2025-03-08 22:09:09,399 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (18 of 234 remaining) [2025-03-08 22:09:09,399 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (17 of 234 remaining) [2025-03-08 22:09:09,399 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (16 of 234 remaining) [2025-03-08 22:09:09,399 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (15 of 234 remaining) [2025-03-08 22:09:09,399 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (14 of 234 remaining) [2025-03-08 22:09:09,399 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (13 of 234 remaining) [2025-03-08 22:09:09,399 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (12 of 234 remaining) [2025-03-08 22:09:09,399 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (11 of 234 remaining) [2025-03-08 22:09:09,399 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (10 of 234 remaining) [2025-03-08 22:09:09,399 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (9 of 234 remaining) [2025-03-08 22:09:09,399 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (8 of 234 remaining) [2025-03-08 22:09:09,399 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (7 of 234 remaining) [2025-03-08 22:09:09,399 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (6 of 234 remaining) [2025-03-08 22:09:09,399 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (5 of 234 remaining) [2025-03-08 22:09:09,399 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (4 of 234 remaining) [2025-03-08 22:09:09,399 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (3 of 234 remaining) [2025-03-08 22:09:09,399 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (2 of 234 remaining) [2025-03-08 22:09:09,399 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (1 of 234 remaining) [2025-03-08 22:09:09,399 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (0 of 234 remaining) [2025-03-08 22:09:09,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-03-08 22:09:09,400 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:09:09,405 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-08 22:09:09,406 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 22:09:09,411 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 10:09:09 BasicIcfg [2025-03-08 22:09:09,411 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 22:09:09,412 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 22:09:09,412 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 22:09:09,412 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 22:09:09,412 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:07:59" (3/4) ... [2025-03-08 22:09:09,413 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 22:09:09,415 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-08 22:09:09,415 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-08 22:09:09,415 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-03-08 22:09:09,428 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 37 nodes and edges [2025-03-08 22:09:09,429 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-08 22:09:09,429 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 22:09:09,429 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 22:09:09,510 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 22:09:09,511 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 22:09:09,511 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 22:09:09,511 INFO L158 Benchmark]: Toolchain (without parser) took 71957.87ms. Allocated memory was 142.6MB in the beginning and 3.9GB in the end (delta: 3.7GB). Free memory was 106.7MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. [2025-03-08 22:09:09,512 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 124.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:09:09,512 INFO L158 Benchmark]: CACSL2BoogieTranslator took 242.20ms. Allocated memory is still 142.6MB. Free memory was 106.7MB in the beginning and 91.0MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 22:09:09,512 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.91ms. Allocated memory is still 142.6MB. Free memory was 91.0MB in the beginning and 86.0MB in the end (delta: 5.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:09:09,512 INFO L158 Benchmark]: Boogie Preprocessor took 62.99ms. Allocated memory is still 142.6MB. Free memory was 86.0MB in the beginning and 81.5MB in the end (delta: 4.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 22:09:09,512 INFO L158 Benchmark]: IcfgBuilder took 1385.01ms. Allocated memory is still 142.6MB. Free memory was 81.5MB in the beginning and 97.8MB in the end (delta: -16.3MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. [2025-03-08 22:09:09,512 INFO L158 Benchmark]: TraceAbstraction took 70113.41ms. Allocated memory was 142.6MB in the beginning and 3.9GB in the end (delta: 3.7GB). Free memory was 97.8MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 3.2GB. Max. memory is 16.1GB. [2025-03-08 22:09:09,512 INFO L158 Benchmark]: Witness Printer took 99.19ms. Allocated memory is still 3.9GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 8.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:09:09,513 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.21ms. Allocated memory is still 201.3MB. Free memory is still 124.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 242.20ms. Allocated memory is still 142.6MB. Free memory was 106.7MB in the beginning and 91.0MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.91ms. Allocated memory is still 142.6MB. Free memory was 91.0MB in the beginning and 86.0MB in the end (delta: 5.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 62.99ms. Allocated memory is still 142.6MB. Free memory was 86.0MB in the beginning and 81.5MB in the end (delta: 4.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 1385.01ms. Allocated memory is still 142.6MB. Free memory was 81.5MB in the beginning and 97.8MB in the end (delta: -16.3MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. * TraceAbstraction took 70113.41ms. Allocated memory was 142.6MB in the beginning and 3.9GB in the end (delta: 3.7GB). Free memory was 97.8MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 3.2GB. Max. memory is 16.1GB. * Witness Printer took 99.19ms. Allocated memory is still 3.9GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 8.4MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 55]: 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: 55]: 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: 55]: 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: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: 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: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: 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: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 110]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 115]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 117]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 118]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 119]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 121]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 152]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 121]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 122]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 152]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 122]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 123]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 152]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 123]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 124]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 163]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 124]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 125]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 126]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 127]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 127]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 128]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 129]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 129]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 140]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 140]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 152]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 129]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 1149 locations, 1206 edges, 234 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: 69.9s, OverallIterations: 45, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 63.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3873 SdHoareTripleChecker+Valid, 7.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2077 mSDsluCounter, 1817 SdHoareTripleChecker+Invalid, 6.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1513 mSDsCounter, 868 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6406 IncrementalHoareTripleChecker+Invalid, 7274 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 868 mSolverCounterUnsat, 304 mSDtfsCounter, 6406 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 132 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1670occurred in iteration=0, InterpolantAutomatonStates: 163, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 10218 NumberOfCodeBlocks, 10218 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 10173 ConstructedInterpolants, 0 QuantifiedInterpolants, 11435 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 45 InterpolantComputations, 45 PerfectInterpolantSequences, 64/64 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 133 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-08 22:09:09,532 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE