./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/parallel-ticket-5.wvr.c --full-output --architecture 32bit


--------------------------------------------------------------------------------


Checking for data races
Using default analysis
Version f8ab0bd5
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/parallel-ticket-5.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 9c69d99d457f457373aeec8cf091a3652593de03a43f690cddfeb4bfa1e12a5f
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-f8ab0bd-m
[2025-03-13 22:25:02,858 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-13 22:25:02,915 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2025-03-13 22:25:02,920 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-13 22:25:02,921 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-13 22:25:02,942 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-13 22:25:02,943 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-13 22:25:02,943 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-13 22:25:02,944 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-13 22:25:02,944 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-13 22:25:02,944 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-13 22:25:02,945 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-13 22:25:02,945 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-13 22:25:02,945 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-13 22:25:02,945 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-13 22:25:02,945 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-13 22:25:02,945 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-13 22:25:02,945 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-13 22:25:02,945 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-13 22:25:02,946 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-13 22:25:02,946 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-13 22:25:02,946 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-13 22:25:02,946 INFO  L153        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2025-03-13 22:25:02,946 INFO  L153        SettingsManager]:  * Check unreachability of reach_error function=false
[2025-03-13 22:25:02,946 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-13 22:25:02,946 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-13 22:25:02,946 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-13 22:25:02,946 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-13 22:25:02,946 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-13 22:25:02,946 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-13 22:25:02,947 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-13 22:25:02,947 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-13 22:25:02,947 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-13 22:25:02,947 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-13 22:25:02,947 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-13 22:25:02,947 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-13 22:25:02,947 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-13 22:25:02,947 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-13 22:25:02,948 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-13 22:25:02,948 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-13 22:25:02,948 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-13 22:25:02,948 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-13 22:25:02,948 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 -> 9c69d99d457f457373aeec8cf091a3652593de03a43f690cddfeb4bfa1e12a5f
[2025-03-13 22:25:03,159 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-13 22:25:03,167 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-13 22:25:03,168 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-13 22:25:03,169 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-13 22:25:03,170 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-13 22:25:03,171 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-ticket-5.wvr.c
[2025-03-13 22:25:04,353 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9936c32f1/eed1451bfc7141f2b8071dcc7bf039aa/FLAG55f1c0e9c
[2025-03-13 22:25:04,589 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-13 22:25:04,589 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-ticket-5.wvr.c
[2025-03-13 22:25:04,595 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9936c32f1/eed1451bfc7141f2b8071dcc7bf039aa/FLAG55f1c0e9c
[2025-03-13 22:25:04,929 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9936c32f1/eed1451bfc7141f2b8071dcc7bf039aa
[2025-03-13 22:25:04,931 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-13 22:25:04,932 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-13 22:25:04,933 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-13 22:25:04,934 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-13 22:25:04,937 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-13 22:25:04,937 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:25:04" (1/1) ...
[2025-03-13 22:25:04,938 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e1150ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:04, skipping insertion in model container
[2025-03-13 22:25:04,938 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:25:04" (1/1) ...
[2025-03-13 22:25:04,950 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-13 22:25:05,076 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-13 22:25:05,083 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-13 22:25:05,098 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-13 22:25:05,108 INFO  L204         MainTranslator]: Completed translation
[2025-03-13 22:25:05,108 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:05 WrapperNode
[2025-03-13 22:25:05,109 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-13 22:25:05,109 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-13 22:25:05,109 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-13 22:25:05,109 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-13 22:25:05,114 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:05" (1/1) ...
[2025-03-13 22:25:05,120 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:05" (1/1) ...
[2025-03-13 22:25:05,140 INFO  L138                Inliner]: procedures = 21, calls = 19, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 256
[2025-03-13 22:25:05,141 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-13 22:25:05,142 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-13 22:25:05,142 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-13 22:25:05,142 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-13 22:25:05,148 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:05" (1/1) ...
[2025-03-13 22:25:05,148 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:05" (1/1) ...
[2025-03-13 22:25:05,151 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:05" (1/1) ...
[2025-03-13 22:25:05,152 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:05" (1/1) ...
[2025-03-13 22:25:05,156 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:05" (1/1) ...
[2025-03-13 22:25:05,157 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:05" (1/1) ...
[2025-03-13 22:25:05,158 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:05" (1/1) ...
[2025-03-13 22:25:05,158 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:05" (1/1) ...
[2025-03-13 22:25:05,163 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-13 22:25:05,163 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-13 22:25:05,165 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-13 22:25:05,165 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-13 22:25:05,168 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:05" (1/1) ...
[2025-03-13 22:25:05,172 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-13 22:25:05,180 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-13 22:25:05,192 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-03-13 22:25:05,194 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-03-13 22:25:05,210 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-13 22:25:05,210 INFO  L130     BoogieDeclarations]: Found specification of procedure thread1
[2025-03-13 22:25:05,210 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread1
[2025-03-13 22:25:05,210 INFO  L130     BoogieDeclarations]: Found specification of procedure thread2
[2025-03-13 22:25:05,210 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread2
[2025-03-13 22:25:05,210 INFO  L130     BoogieDeclarations]: Found specification of procedure thread3
[2025-03-13 22:25:05,210 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread3
[2025-03-13 22:25:05,210 INFO  L130     BoogieDeclarations]: Found specification of procedure thread4
[2025-03-13 22:25:05,210 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread4
[2025-03-13 22:25:05,210 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2025-03-13 22:25:05,210 INFO  L130     BoogieDeclarations]: Found specification of procedure thread5
[2025-03-13 22:25:05,210 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread5
[2025-03-13 22:25:05,211 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-13 22:25:05,211 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-13 22:25:05,211 WARN  L225             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement.
[2025-03-13 22:25:05,288 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-13 22:25:05,290 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-13 22:25:05,587 INFO  L303             CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2025-03-13 22:25:05,588 INFO  L313             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-13 22:25:05,588 INFO  L318             CfgBuilder]: Performing block encoding
[2025-03-13 22:25:05,640 INFO  L337             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-13 22:25:05,641 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:25:05 BoogieIcfgContainer
[2025-03-13 22:25:05,641 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-13 22:25:05,643 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-13 22:25:05,643 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-13 22:25:05,646 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-13 22:25:05,647 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 10:25:04" (1/3) ...
[2025-03-13 22:25:05,648 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@546f4a29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:25:05, skipping insertion in model container
[2025-03-13 22:25:05,648 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:05" (2/3) ...
[2025-03-13 22:25:05,649 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@546f4a29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:25:05, skipping insertion in model container
[2025-03-13 22:25:05,649 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:25:05" (3/3) ...
[2025-03-13 22:25:05,651 INFO  L128   eAbstractionObserver]: Analyzing ICFG parallel-ticket-5.wvr.c
[2025-03-13 22:25:05,664 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-13 22:25:05,666 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-ticket-5.wvr.c that has 6 procedures, 271 locations, 1 initial locations, 0 loop locations, and 15 error locations.
[2025-03-13 22:25:05,666 INFO  L491   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2025-03-13 22:25:05,752 INFO  L143    ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions.
[2025-03-13 22:25:05,788 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 286 places, 281 transitions, 597 flow
[2025-03-13 22:25:05,872 INFO  L124   PetriNetUnfolderBase]: 11/276 cut-off events.
[2025-03-13 22:25:05,874 INFO  L125   PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES.
[2025-03-13 22:25:05,880 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 297 conditions, 276 events. 11/276 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 492 event pairs, 0 based on Foata normal form. 0/250 useless extension candidates. Maximal degree in co-relation 233. Up to 2 conditions per place. 
[2025-03-13 22:25:05,880 INFO  L82        GeneralOperation]: Start removeDead. Operand has 286 places, 281 transitions, 597 flow
[2025-03-13 22:25:05,884 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 265 places, 259 transitions, 545 flow
[2025-03-13 22:25:05,890 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-13 22:25:05,898 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;@7763efaf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-13 22:25:05,899 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 30 error locations.
[2025-03-13 22:25:05,906 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2025-03-13 22:25:05,907 INFO  L124   PetriNetUnfolderBase]: 0/28 cut-off events.
[2025-03-13 22:25:05,907 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2025-03-13 22:25:05,908 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-13 22:25:05,908 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]
[2025-03-13 22:25:05,909 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 26 more)] ===
[2025-03-13 22:25:05,912 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-13 22:25:05,912 INFO  L85        PathProgramCache]: Analyzing trace with hash 1517675666, now seen corresponding path program 1 times
[2025-03-13 22:25:05,918 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-13 22:25:05,919 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956552639]
[2025-03-13 22:25:05,919 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-13 22:25:05,922 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-13 22:25:05,979 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes.
[2025-03-13 22:25:05,990 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements.
[2025-03-13 22:25:05,990 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-13 22:25:05,991 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-13 22:25:06,063 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-13 22:25:06,067 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-13 22:25:06,067 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956552639]
[2025-03-13 22:25:06,067 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956552639] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-13 22:25:06,068 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-13 22:25:06,068 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-13 22:25:06,069 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426257570]
[2025-03-13 22:25:06,069 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-13 22:25:06,073 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-13 22:25:06,077 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-13 22:25:06,093 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-13 22:25:06,094 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-13 22:25:06,122 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 234 out of 281
[2025-03-13 22:25:06,125 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 259 transitions, 545 flow. Second operand  has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-13 22:25:06,128 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-13 22:25:06,128 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 281
[2025-03-13 22:25:06,130 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-13 22:25:09,186 INFO  L124   PetriNetUnfolderBase]: 8140/22951 cut-off events.
[2025-03-13 22:25:09,187 INFO  L125   PetriNetUnfolderBase]: For 1237/1237 co-relation queries the response was YES.
[2025-03-13 22:25:09,289 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 34557 conditions, 22951 events. 8140/22951 cut-off events. For 1237/1237 co-relation queries the response was YES. Maximal size of possible extension queue 849. Compared 261196 event pairs, 5691 based on Foata normal form. 1950/21769 useless extension candidates. Maximal degree in co-relation 33945. Up to 10336 conditions per place. 
[2025-03-13 22:25:09,438 INFO  L140   encePairwiseOnDemand]: 272/281 looper letters, 34 selfloop transitions, 2 changer transitions 1/252 dead transitions.
[2025-03-13 22:25:09,438 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 252 transitions, 603 flow
[2025-03-13 22:25:09,440 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-13 22:25:09,441 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-13 22:25:09,450 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 745 transitions.
[2025-03-13 22:25:09,454 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.8837485172004745
[2025-03-13 22:25:09,455 INFO  L175             Difference]: Start difference. First operand has 265 places, 259 transitions, 545 flow. Second operand 3 states and 745 transitions.
[2025-03-13 22:25:09,456 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 252 transitions, 603 flow
[2025-03-13 22:25:09,466 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 252 transitions, 586 flow, removed 0 selfloop flow, removed 9 redundant places.
[2025-03-13 22:25:09,471 INFO  L231             Difference]: Finished difference. Result has 257 places, 251 transitions, 516 flow
[2025-03-13 22:25:09,473 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=514, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=516, PETRI_PLACES=257, PETRI_TRANSITIONS=251}
[2025-03-13 22:25:09,476 INFO  L279   CegarLoopForPetriNet]: 265 programPoint places, -8 predicate places.
[2025-03-13 22:25:09,477 INFO  L471      AbstractCegarLoop]: Abstraction has has 257 places, 251 transitions, 516 flow
[2025-03-13 22:25:09,478 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-13 22:25:09,478 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-13 22:25:09,478 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]
[2025-03-13 22:25:09,479 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-03-13 22:25:09,479 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 26 more)] ===
[2025-03-13 22:25:09,480 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-13 22:25:09,480 INFO  L85        PathProgramCache]: Analyzing trace with hash -879484758, now seen corresponding path program 1 times
[2025-03-13 22:25:09,480 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-13 22:25:09,480 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550393454]
[2025-03-13 22:25:09,481 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-13 22:25:09,481 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-13 22:25:09,496 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes.
[2025-03-13 22:25:09,501 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements.
[2025-03-13 22:25:09,503 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-13 22:25:09,504 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-13 22:25:09,549 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-13 22:25:09,550 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-13 22:25:09,550 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550393454]
[2025-03-13 22:25:09,550 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550393454] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-13 22:25:09,550 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-13 22:25:09,550 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-13 22:25:09,550 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945501118]
[2025-03-13 22:25:09,550 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-13 22:25:09,551 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-13 22:25:09,552 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-13 22:25:09,552 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-13 22:25:09,552 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-13 22:25:09,574 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 234 out of 281
[2025-03-13 22:25:09,575 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 251 transitions, 516 flow. Second operand  has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-13 22:25:09,576 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-13 22:25:09,577 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 281
[2025-03-13 22:25:09,577 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-13 22:25:11,828 INFO  L124   PetriNetUnfolderBase]: 9181/24265 cut-off events.
[2025-03-13 22:25:11,829 INFO  L125   PetriNetUnfolderBase]: For 358/358 co-relation queries the response was YES.
[2025-03-13 22:25:11,895 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 36917 conditions, 24265 events. 9181/24265 cut-off events. For 358/358 co-relation queries the response was YES. Maximal size of possible extension queue 888. Compared 270499 event pairs, 6649 based on Foata normal form. 0/21005 useless extension candidates. Maximal degree in co-relation 36881. Up to 11675 conditions per place. 
[2025-03-13 22:25:11,999 INFO  L140   encePairwiseOnDemand]: 278/281 looper letters, 34 selfloop transitions, 2 changer transitions 0/250 dead transitions.
[2025-03-13 22:25:11,999 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 250 transitions, 586 flow
[2025-03-13 22:25:11,999 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-13 22:25:11,999 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-13 22:25:12,000 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 739 transitions.
[2025-03-13 22:25:12,001 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.8766310794780545
[2025-03-13 22:25:12,001 INFO  L175             Difference]: Start difference. First operand has 257 places, 251 transitions, 516 flow. Second operand 3 states and 739 transitions.
[2025-03-13 22:25:12,001 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 250 transitions, 586 flow
[2025-03-13 22:25:12,002 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 250 transitions, 582 flow, removed 0 selfloop flow, removed 2 redundant places.
[2025-03-13 22:25:12,004 INFO  L231             Difference]: Finished difference. Result has 255 places, 250 transitions, 514 flow
[2025-03-13 22:25:12,005 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=514, PETRI_PLACES=255, PETRI_TRANSITIONS=250}
[2025-03-13 22:25:12,005 INFO  L279   CegarLoopForPetriNet]: 265 programPoint places, -10 predicate places.
[2025-03-13 22:25:12,006 INFO  L471      AbstractCegarLoop]: Abstraction has has 255 places, 250 transitions, 514 flow
[2025-03-13 22:25:12,006 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-13 22:25:12,006 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-13 22:25:12,006 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]
[2025-03-13 22:25:12,006 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-13 22:25:12,007 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 26 more)] ===
[2025-03-13 22:25:12,007 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-13 22:25:12,007 INFO  L85        PathProgramCache]: Analyzing trace with hash -2059546307, now seen corresponding path program 1 times
[2025-03-13 22:25:12,007 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-13 22:25:12,007 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886535574]
[2025-03-13 22:25:12,007 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-13 22:25:12,008 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-13 22:25:12,015 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes.
[2025-03-13 22:25:12,019 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements.
[2025-03-13 22:25:12,024 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-13 22:25:12,024 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-13 22:25:12,062 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-13 22:25:12,062 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-13 22:25:12,062 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886535574]
[2025-03-13 22:25:12,062 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886535574] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-13 22:25:12,062 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-13 22:25:12,063 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-13 22:25:12,063 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547415440]
[2025-03-13 22:25:12,063 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-13 22:25:12,063 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-13 22:25:12,063 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-13 22:25:12,063 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-13 22:25:12,063 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-13 22:25:12,080 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 234 out of 281
[2025-03-13 22:25:12,081 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 250 transitions, 514 flow. Second operand  has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-13 22:25:12,081 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-13 22:25:12,081 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 281
[2025-03-13 22:25:12,081 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-13 22:25:14,414 INFO  L124   PetriNetUnfolderBase]: 9267/24292 cut-off events.
[2025-03-13 22:25:14,414 INFO  L125   PetriNetUnfolderBase]: For 375/375 co-relation queries the response was YES.
[2025-03-13 22:25:14,485 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 37061 conditions, 24292 events. 9267/24292 cut-off events. For 375/375 co-relation queries the response was YES. Maximal size of possible extension queue 914. Compared 270432 event pairs, 6740 based on Foata normal form. 0/20919 useless extension candidates. Maximal degree in co-relation 37017. Up to 11781 conditions per place. 
[2025-03-13 22:25:14,585 INFO  L140   encePairwiseOnDemand]: 278/281 looper letters, 34 selfloop transitions, 2 changer transitions 0/249 dead transitions.
[2025-03-13 22:25:14,586 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 249 transitions, 584 flow
[2025-03-13 22:25:14,586 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-13 22:25:14,586 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-13 22:25:14,587 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 739 transitions.
[2025-03-13 22:25:14,588 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.8766310794780545
[2025-03-13 22:25:14,589 INFO  L175             Difference]: Start difference. First operand has 255 places, 250 transitions, 514 flow. Second operand 3 states and 739 transitions.
[2025-03-13 22:25:14,589 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 249 transitions, 584 flow
[2025-03-13 22:25:14,590 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 249 transitions, 580 flow, removed 0 selfloop flow, removed 2 redundant places.
[2025-03-13 22:25:14,593 INFO  L231             Difference]: Finished difference. Result has 254 places, 249 transitions, 512 flow
[2025-03-13 22:25:14,594 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=512, PETRI_PLACES=254, PETRI_TRANSITIONS=249}
[2025-03-13 22:25:14,595 INFO  L279   CegarLoopForPetriNet]: 265 programPoint places, -11 predicate places.
[2025-03-13 22:25:14,595 INFO  L471      AbstractCegarLoop]: Abstraction has has 254 places, 249 transitions, 512 flow
[2025-03-13 22:25:14,596 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-13 22:25:14,596 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-13 22:25:14,596 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]
[2025-03-13 22:25:14,596 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-13 22:25:14,596 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 26 more)] ===
[2025-03-13 22:25:14,596 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-13 22:25:14,596 INFO  L85        PathProgramCache]: Analyzing trace with hash -702689454, now seen corresponding path program 1 times
[2025-03-13 22:25:14,596 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-13 22:25:14,596 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325118707]
[2025-03-13 22:25:14,596 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-13 22:25:14,596 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-13 22:25:14,607 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes.
[2025-03-13 22:25:14,611 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements.
[2025-03-13 22:25:14,613 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-13 22:25:14,613 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-13 22:25:14,660 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-13 22:25:14,660 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-13 22:25:14,660 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325118707]
[2025-03-13 22:25:14,660 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325118707] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-13 22:25:14,660 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-13 22:25:14,660 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-13 22:25:14,660 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348947469]
[2025-03-13 22:25:14,660 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-13 22:25:14,661 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-13 22:25:14,661 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-13 22:25:14,661 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-13 22:25:14,661 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-13 22:25:14,683 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 234 out of 281
[2025-03-13 22:25:14,684 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 249 transitions, 512 flow. Second operand  has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-13 22:25:14,684 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-13 22:25:14,684 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 281
[2025-03-13 22:25:14,684 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-13 22:25:16,402 INFO  L124   PetriNetUnfolderBase]: 9706/21096 cut-off events.
[2025-03-13 22:25:16,402 INFO  L125   PetriNetUnfolderBase]: For 417/417 co-relation queries the response was YES.
[2025-03-13 22:25:16,465 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 34356 conditions, 21096 events. 9706/21096 cut-off events. For 417/417 co-relation queries the response was YES. Maximal size of possible extension queue 886. Compared 205241 event pairs, 7189 based on Foata normal form. 0/18384 useless extension candidates. Maximal degree in co-relation 34304. Up to 12334 conditions per place. 
[2025-03-13 22:25:16,537 INFO  L140   encePairwiseOnDemand]: 278/281 looper letters, 34 selfloop transitions, 2 changer transitions 0/248 dead transitions.
[2025-03-13 22:25:16,537 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 248 transitions, 582 flow
[2025-03-13 22:25:16,538 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-13 22:25:16,538 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-13 22:25:16,540 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 739 transitions.
[2025-03-13 22:25:16,540 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.8766310794780545
[2025-03-13 22:25:16,540 INFO  L175             Difference]: Start difference. First operand has 254 places, 249 transitions, 512 flow. Second operand 3 states and 739 transitions.
[2025-03-13 22:25:16,540 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 248 transitions, 582 flow
[2025-03-13 22:25:16,541 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 248 transitions, 578 flow, removed 0 selfloop flow, removed 2 redundant places.
[2025-03-13 22:25:16,544 INFO  L231             Difference]: Finished difference. Result has 253 places, 248 transitions, 510 flow
[2025-03-13 22:25:16,545 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=510, PETRI_PLACES=253, PETRI_TRANSITIONS=248}
[2025-03-13 22:25:16,546 INFO  L279   CegarLoopForPetriNet]: 265 programPoint places, -12 predicate places.
[2025-03-13 22:25:16,546 INFO  L471      AbstractCegarLoop]: Abstraction has has 253 places, 248 transitions, 510 flow
[2025-03-13 22:25:16,546 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-13 22:25:16,546 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-13 22:25:16,547 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-13 22:25:16,547 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-13 22:25:16,547 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 26 more)] ===
[2025-03-13 22:25:16,547 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-13 22:25:16,548 INFO  L85        PathProgramCache]: Analyzing trace with hash -855494839, now seen corresponding path program 1 times
[2025-03-13 22:25:16,548 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-13 22:25:16,548 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70077485]
[2025-03-13 22:25:16,548 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-13 22:25:16,548 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-13 22:25:16,554 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes.
[2025-03-13 22:25:16,557 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements.
[2025-03-13 22:25:16,557 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-13 22:25:16,557 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-13 22:25:16,584 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-13 22:25:16,585 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-13 22:25:16,585 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70077485]
[2025-03-13 22:25:16,585 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70077485] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-13 22:25:16,585 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-13 22:25:16,585 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-13 22:25:16,585 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251892610]
[2025-03-13 22:25:16,585 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-13 22:25:16,585 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-13 22:25:16,585 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-13 22:25:16,585 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-13 22:25:16,586 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-13 22:25:16,598 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 234 out of 281
[2025-03-13 22:25:16,599 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 248 transitions, 510 flow. Second operand  has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-13 22:25:16,599 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-13 22:25:16,599 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 281
[2025-03-13 22:25:16,599 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-13 22:25:19,036 INFO  L124   PetriNetUnfolderBase]: 8685/22770 cut-off events.
[2025-03-13 22:25:19,036 INFO  L125   PetriNetUnfolderBase]: For 375/375 co-relation queries the response was YES.
[2025-03-13 22:25:19,093 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 34475 conditions, 22770 events. 8685/22770 cut-off events. For 375/375 co-relation queries the response was YES. Maximal size of possible extension queue 849. Compared 248555 event pairs, 6215 based on Foata normal form. 0/19671 useless extension candidates. Maximal degree in co-relation 34415. Up to 11049 conditions per place. 
[2025-03-13 22:25:19,167 INFO  L140   encePairwiseOnDemand]: 278/281 looper letters, 34 selfloop transitions, 2 changer transitions 0/247 dead transitions.
[2025-03-13 22:25:19,168 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 247 transitions, 580 flow
[2025-03-13 22:25:19,168 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-13 22:25:19,168 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-13 22:25:19,169 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 739 transitions.
[2025-03-13 22:25:19,169 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.8766310794780545
[2025-03-13 22:25:19,169 INFO  L175             Difference]: Start difference. First operand has 253 places, 248 transitions, 510 flow. Second operand 3 states and 739 transitions.
[2025-03-13 22:25:19,169 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 247 transitions, 580 flow
[2025-03-13 22:25:19,170 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 247 transitions, 576 flow, removed 0 selfloop flow, removed 2 redundant places.
[2025-03-13 22:25:19,172 INFO  L231             Difference]: Finished difference. Result has 252 places, 247 transitions, 508 flow
[2025-03-13 22:25:19,173 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=504, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=508, PETRI_PLACES=252, PETRI_TRANSITIONS=247}
[2025-03-13 22:25:19,173 INFO  L279   CegarLoopForPetriNet]: 265 programPoint places, -13 predicate places.
[2025-03-13 22:25:19,173 INFO  L471      AbstractCegarLoop]: Abstraction has has 252 places, 247 transitions, 508 flow
[2025-03-13 22:25:19,174 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-13 22:25:19,174 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-13 22:25:19,174 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-13 22:25:19,174 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-13 22:25:19,174 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 26 more)] ===
[2025-03-13 22:25:19,174 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-13 22:25:19,175 INFO  L85        PathProgramCache]: Analyzing trace with hash 1687438109, now seen corresponding path program 1 times
[2025-03-13 22:25:19,175 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-13 22:25:19,175 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041501297]
[2025-03-13 22:25:19,175 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-13 22:25:19,175 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-13 22:25:19,181 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes.
[2025-03-13 22:25:19,188 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements.
[2025-03-13 22:25:19,188 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-13 22:25:19,189 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-13 22:25:19,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-13 22:25:19,223 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-13 22:25:19,223 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041501297]
[2025-03-13 22:25:19,223 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041501297] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-13 22:25:19,223 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-13 22:25:19,223 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-13 22:25:19,223 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224852697]
[2025-03-13 22:25:19,223 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-13 22:25:19,223 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-13 22:25:19,224 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-13 22:25:19,224 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-13 22:25:19,224 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-13 22:25:19,235 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 236 out of 281
[2025-03-13 22:25:19,236 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 247 transitions, 508 flow. Second operand  has 3 states, 3 states have (on average 239.33333333333334) internal successors, (718), 3 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-13 22:25:19,237 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-13 22:25:19,237 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 281
[2025-03-13 22:25:19,237 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-13 22:25:21,844 INFO  L124   PetriNetUnfolderBase]: 11755/30292 cut-off events.
[2025-03-13 22:25:21,845 INFO  L125   PetriNetUnfolderBase]: For 228/228 co-relation queries the response was YES.
[2025-03-13 22:25:21,948 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 46458 conditions, 30292 events. 11755/30292 cut-off events. For 228/228 co-relation queries the response was YES. Maximal size of possible extension queue 1223. Compared 345182 event pairs, 6460 based on Foata normal form. 0/26232 useless extension candidates. Maximal degree in co-relation 46390. Up to 11588 conditions per place. 
[2025-03-13 22:25:22,085 INFO  L140   encePairwiseOnDemand]: 278/281 looper letters, 49 selfloop transitions, 2 changer transitions 0/262 dead transitions.
[2025-03-13 22:25:22,086 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 262 transitions, 645 flow
[2025-03-13 22:25:22,086 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-13 22:25:22,086 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-13 22:25:22,087 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 760 transitions.
[2025-03-13 22:25:22,087 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.9015421115065243
[2025-03-13 22:25:22,087 INFO  L175             Difference]: Start difference. First operand has 252 places, 247 transitions, 508 flow. Second operand 3 states and 760 transitions.
[2025-03-13 22:25:22,087 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 262 transitions, 645 flow
[2025-03-13 22:25:22,089 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 262 transitions, 641 flow, removed 0 selfloop flow, removed 2 redundant places.
[2025-03-13 22:25:22,091 INFO  L231             Difference]: Finished difference. Result has 251 places, 246 transitions, 506 flow
[2025-03-13 22:25:22,091 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=506, PETRI_PLACES=251, PETRI_TRANSITIONS=246}
[2025-03-13 22:25:22,091 INFO  L279   CegarLoopForPetriNet]: 265 programPoint places, -14 predicate places.
[2025-03-13 22:25:22,092 INFO  L471      AbstractCegarLoop]: Abstraction has has 251 places, 246 transitions, 506 flow
[2025-03-13 22:25:22,093 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 239.33333333333334) internal successors, (718), 3 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-13 22:25:22,093 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-13 22:25:22,093 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-13 22:25:22,093 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-03-13 22:25:22,093 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 26 more)] ===
[2025-03-13 22:25:22,094 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-13 22:25:22,094 INFO  L85        PathProgramCache]: Analyzing trace with hash -1385655265, now seen corresponding path program 1 times
[2025-03-13 22:25:22,094 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-13 22:25:22,094 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675787060]
[2025-03-13 22:25:22,094 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-13 22:25:22,094 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-13 22:25:22,106 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes.
[2025-03-13 22:25:22,119 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements.
[2025-03-13 22:25:22,120 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-13 22:25:22,123 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-13 22:25:22,177 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-13 22:25:22,179 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-13 22:25:22,179 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675787060]
[2025-03-13 22:25:22,179 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675787060] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-13 22:25:22,179 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-13 22:25:22,179 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-13 22:25:22,179 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565793669]
[2025-03-13 22:25:22,179 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-13 22:25:22,180 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-13 22:25:22,180 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-13 22:25:22,180 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-13 22:25:22,180 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-13 22:25:22,190 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 238 out of 281
[2025-03-13 22:25:22,191 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 246 transitions, 506 flow. Second operand  has 3 states, 3 states have (on average 241.33333333333334) internal successors, (724), 3 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-13 22:25:22,192 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-13 22:25:22,192 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 281
[2025-03-13 22:25:22,192 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-13 22:25:24,061 INFO  L124   PetriNetUnfolderBase]: 10729/21932 cut-off events.
[2025-03-13 22:25:24,061 INFO  L125   PetriNetUnfolderBase]: For 591/591 co-relation queries the response was YES.
[2025-03-13 22:25:24,297 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 36888 conditions, 21932 events. 10729/21932 cut-off events. For 591/591 co-relation queries the response was YES. Maximal size of possible extension queue 1056. Compared 201195 event pairs, 5362 based on Foata normal form. 0/20327 useless extension candidates. Maximal degree in co-relation 27803. Up to 9906 conditions per place. 
[2025-03-13 22:25:24,368 INFO  L140   encePairwiseOnDemand]: 279/281 looper letters, 48 selfloop transitions, 1 changer transitions 0/261 dead transitions.
[2025-03-13 22:25:24,368 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 261 transitions, 639 flow
[2025-03-13 22:25:24,369 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-13 22:25:24,369 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-13 22:25:24,370 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 764 transitions.
[2025-03-13 22:25:24,370 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.9062870699881376
[2025-03-13 22:25:24,370 INFO  L175             Difference]: Start difference. First operand has 251 places, 246 transitions, 506 flow. Second operand 3 states and 764 transitions.
[2025-03-13 22:25:24,370 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 261 transitions, 639 flow
[2025-03-13 22:25:24,372 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 261 transitions, 635 flow, removed 0 selfloop flow, removed 2 redundant places.
[2025-03-13 22:25:24,374 INFO  L231             Difference]: Finished difference. Result has 250 places, 245 transitions, 502 flow
[2025-03-13 22:25:24,375 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=500, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=502, PETRI_PLACES=250, PETRI_TRANSITIONS=245}
[2025-03-13 22:25:24,375 INFO  L279   CegarLoopForPetriNet]: 265 programPoint places, -15 predicate places.
[2025-03-13 22:25:24,375 INFO  L471      AbstractCegarLoop]: Abstraction has has 250 places, 245 transitions, 502 flow
[2025-03-13 22:25:24,376 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 241.33333333333334) internal successors, (724), 3 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-13 22:25:24,376 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-13 22:25:24,376 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-13 22:25:24,376 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-03-13 22:25:24,376 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 26 more)] ===
[2025-03-13 22:25:24,376 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-13 22:25:24,376 INFO  L85        PathProgramCache]: Analyzing trace with hash -1496506874, now seen corresponding path program 1 times
[2025-03-13 22:25:24,376 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-13 22:25:24,377 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16407851]
[2025-03-13 22:25:24,377 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-13 22:25:24,377 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-13 22:25:24,383 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes.
[2025-03-13 22:25:24,387 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements.
[2025-03-13 22:25:24,387 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-13 22:25:24,387 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-13 22:25:24,417 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-13 22:25:24,417 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-13 22:25:24,417 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16407851]
[2025-03-13 22:25:24,417 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16407851] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-13 22:25:24,417 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-13 22:25:24,417 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-13 22:25:24,417 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208634278]
[2025-03-13 22:25:24,417 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-13 22:25:24,417 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-13 22:25:24,418 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-13 22:25:24,418 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-13 22:25:24,418 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-13 22:25:24,431 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 236 out of 281
[2025-03-13 22:25:24,431 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 245 transitions, 502 flow. Second operand  has 3 states, 3 states have (on average 239.66666666666666) internal successors, (719), 3 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-13 22:25:24,431 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-13 22:25:24,431 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 281
[2025-03-13 22:25:24,431 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-13 22:25:27,165 INFO  L124   PetriNetUnfolderBase]: 14428/32703 cut-off events.
[2025-03-13 22:25:27,165 INFO  L125   PetriNetUnfolderBase]: For 547/547 co-relation queries the response was YES.
[2025-03-13 22:25:27,263 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 52534 conditions, 32703 events. 14428/32703 cut-off events. For 547/547 co-relation queries the response was YES. Maximal size of possible extension queue 1298. Compared 354661 event pairs, 7947 based on Foata normal form. 0/28649 useless extension candidates. Maximal degree in co-relation 40943. Up to 13745 conditions per place. 
[2025-03-13 22:25:27,384 INFO  L140   encePairwiseOnDemand]: 278/281 looper letters, 50 selfloop transitions, 2 changer transitions 0/261 dead transitions.
[2025-03-13 22:25:27,384 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 261 transitions, 643 flow
[2025-03-13 22:25:27,385 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-13 22:25:27,385 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-13 22:25:27,386 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 761 transitions.
[2025-03-13 22:25:27,386 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.9027283511269276
[2025-03-13 22:25:27,386 INFO  L175             Difference]: Start difference. First operand has 250 places, 245 transitions, 502 flow. Second operand 3 states and 761 transitions.
[2025-03-13 22:25:27,386 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 261 transitions, 643 flow
[2025-03-13 22:25:27,387 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 261 transitions, 642 flow, removed 0 selfloop flow, removed 1 redundant places.
[2025-03-13 22:25:27,389 INFO  L231             Difference]: Finished difference. Result has 250 places, 244 transitions, 503 flow
[2025-03-13 22:25:27,389 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=499, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=503, PETRI_PLACES=250, PETRI_TRANSITIONS=244}
[2025-03-13 22:25:27,390 INFO  L279   CegarLoopForPetriNet]: 265 programPoint places, -15 predicate places.
[2025-03-13 22:25:27,390 INFO  L471      AbstractCegarLoop]: Abstraction has has 250 places, 244 transitions, 503 flow
[2025-03-13 22:25:27,390 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 239.66666666666666) internal successors, (719), 3 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-13 22:25:27,390 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-13 22:25:27,391 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-13 22:25:27,391 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-03-13 22:25:27,391 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 26 more)] ===
[2025-03-13 22:25:27,393 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-13 22:25:27,393 INFO  L85        PathProgramCache]: Analyzing trace with hash 545523976, now seen corresponding path program 1 times
[2025-03-13 22:25:27,394 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-13 22:25:27,394 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894631893]
[2025-03-13 22:25:27,394 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-13 22:25:27,394 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-13 22:25:27,399 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes.
[2025-03-13 22:25:27,404 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements.
[2025-03-13 22:25:27,404 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-13 22:25:27,404 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-13 22:25:27,580 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-13 22:25:27,580 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-13 22:25:27,580 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894631893]
[2025-03-13 22:25:27,580 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894631893] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-13 22:25:27,581 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-13 22:25:27,581 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-13 22:25:27,581 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889733705]
[2025-03-13 22:25:27,581 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-13 22:25:27,581 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-13 22:25:27,581 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-13 22:25:27,582 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-13 22:25:27,582 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-13 22:25:27,590 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 238 out of 281
[2025-03-13 22:25:27,591 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 244 transitions, 503 flow. Second operand  has 3 states, 3 states have (on average 241.66666666666666) internal successors, (725), 3 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-13 22:25:27,591 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-13 22:25:27,591 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 281
[2025-03-13 22:25:27,591 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-13 22:25:29,380 INFO  L124   PetriNetUnfolderBase]: 11068/25050 cut-off events.
[2025-03-13 22:25:29,380 INFO  L125   PetriNetUnfolderBase]: For 864/864 co-relation queries the response was YES.
[2025-03-13 22:25:29,643 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 40703 conditions, 25050 events. 11068/25050 cut-off events. For 864/864 co-relation queries the response was YES. Maximal size of possible extension queue 1020. Compared 253471 event pairs, 4982 based on Foata normal form. 0/22704 useless extension candidates. Maximal degree in co-relation 31491. Up to 8803 conditions per place. 
[2025-03-13 22:25:29,732 INFO  L140   encePairwiseOnDemand]: 279/281 looper letters, 49 selfloop transitions, 1 changer transitions 0/260 dead transitions.
[2025-03-13 22:25:29,732 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 260 transitions, 640 flow
[2025-03-13 22:25:29,733 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-13 22:25:29,733 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-13 22:25:29,734 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 765 transitions.
[2025-03-13 22:25:29,734 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.9074733096085409
[2025-03-13 22:25:29,734 INFO  L175             Difference]: Start difference. First operand has 250 places, 244 transitions, 503 flow. Second operand 3 states and 765 transitions.
[2025-03-13 22:25:29,734 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 260 transitions, 640 flow
[2025-03-13 22:25:29,738 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 260 transitions, 636 flow, removed 0 selfloop flow, removed 2 redundant places.
[2025-03-13 22:25:29,740 INFO  L231             Difference]: Finished difference. Result has 249 places, 243 transitions, 499 flow
[2025-03-13 22:25:29,740 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=497, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=499, PETRI_PLACES=249, PETRI_TRANSITIONS=243}
[2025-03-13 22:25:29,741 INFO  L279   CegarLoopForPetriNet]: 265 programPoint places, -16 predicate places.
[2025-03-13 22:25:29,741 INFO  L471      AbstractCegarLoop]: Abstraction has has 249 places, 243 transitions, 499 flow
[2025-03-13 22:25:29,741 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 241.66666666666666) internal successors, (725), 3 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-13 22:25:29,741 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-13 22:25:29,742 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]
[2025-03-13 22:25:29,742 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-03-13 22:25:29,742 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting thread3Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 26 more)] ===
[2025-03-13 22:25:29,742 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-13 22:25:29,742 INFO  L85        PathProgramCache]: Analyzing trace with hash 1116588335, now seen corresponding path program 1 times
[2025-03-13 22:25:29,742 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-13 22:25:29,742 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613244012]
[2025-03-13 22:25:29,743 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-13 22:25:29,743 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-13 22:25:29,749 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes.
[2025-03-13 22:25:29,756 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements.
[2025-03-13 22:25:29,757 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-13 22:25:29,757 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-13 22:25:29,793 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-13 22:25:29,794 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-13 22:25:29,794 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613244012]
[2025-03-13 22:25:29,794 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613244012] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-13 22:25:29,794 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-13 22:25:29,795 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-13 22:25:29,795 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467972720]
[2025-03-13 22:25:29,795 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-13 22:25:29,795 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-13 22:25:29,795 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-13 22:25:29,796 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-13 22:25:29,797 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-13 22:25:29,810 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 236 out of 281
[2025-03-13 22:25:29,811 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 243 transitions, 499 flow. Second operand  has 3 states, 3 states have (on average 240.0) internal successors, (720), 3 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-13 22:25:29,811 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-13 22:25:29,812 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 281
[2025-03-13 22:25:29,812 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-13 22:25:32,634 INFO  L124   PetriNetUnfolderBase]: 14487/31582 cut-off events.
[2025-03-13 22:25:32,635 INFO  L125   PetriNetUnfolderBase]: For 603/603 co-relation queries the response was YES.
[2025-03-13 22:25:32,744 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 51474 conditions, 31582 events. 14487/31582 cut-off events. For 603/603 co-relation queries the response was YES. Maximal size of possible extension queue 1302. Compared 335383 event pairs, 7988 based on Foata normal form. 0/27701 useless extension candidates. Maximal degree in co-relation 40321. Up to 13706 conditions per place. 
[2025-03-13 22:25:32,861 INFO  L140   encePairwiseOnDemand]: 278/281 looper letters, 50 selfloop transitions, 2 changer transitions 0/259 dead transitions.
[2025-03-13 22:25:32,861 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 259 transitions, 640 flow
[2025-03-13 22:25:32,861 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-13 22:25:32,861 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-13 22:25:32,862 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 761 transitions.
[2025-03-13 22:25:32,863 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.9027283511269276
[2025-03-13 22:25:32,863 INFO  L175             Difference]: Start difference. First operand has 249 places, 243 transitions, 499 flow. Second operand 3 states and 761 transitions.
[2025-03-13 22:25:32,863 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 259 transitions, 640 flow
[2025-03-13 22:25:32,864 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 259 transitions, 639 flow, removed 0 selfloop flow, removed 1 redundant places.
[2025-03-13 22:25:32,866 INFO  L231             Difference]: Finished difference. Result has 249 places, 242 transitions, 500 flow
[2025-03-13 22:25:32,866 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=496, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=500, PETRI_PLACES=249, PETRI_TRANSITIONS=242}
[2025-03-13 22:25:32,867 INFO  L279   CegarLoopForPetriNet]: 265 programPoint places, -16 predicate places.
[2025-03-13 22:25:32,867 INFO  L471      AbstractCegarLoop]: Abstraction has has 249 places, 242 transitions, 500 flow
[2025-03-13 22:25:32,867 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 240.0) internal successors, (720), 3 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-13 22:25:32,867 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-13 22:25:32,867 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-13 22:25:32,868 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-03-13 22:25:32,868 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 26 more)] ===
[2025-03-13 22:25:32,868 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-13 22:25:32,868 INFO  L85        PathProgramCache]: Analyzing trace with hash 1212524145, now seen corresponding path program 1 times
[2025-03-13 22:25:32,868 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-13 22:25:32,868 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088376831]
[2025-03-13 22:25:32,868 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-13 22:25:32,868 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-13 22:25:32,878 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes.
[2025-03-13 22:25:32,887 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements.
[2025-03-13 22:25:32,890 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-13 22:25:32,891 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-13 22:25:32,932 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-13 22:25:32,932 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-13 22:25:32,932 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088376831]
[2025-03-13 22:25:32,932 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088376831] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-13 22:25:32,932 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-13 22:25:32,932 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-13 22:25:32,932 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4429241]
[2025-03-13 22:25:32,932 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-13 22:25:32,932 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-13 22:25:32,933 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-13 22:25:32,933 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-13 22:25:32,933 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-13 22:25:32,942 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 238 out of 281
[2025-03-13 22:25:32,943 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 242 transitions, 500 flow. Second operand  has 3 states, 3 states have (on average 242.0) internal successors, (726), 3 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-13 22:25:32,943 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-13 22:25:32,943 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 281
[2025-03-13 22:25:32,943 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-13 22:25:35,173 INFO  L124   PetriNetUnfolderBase]: 10372/25666 cut-off events.
[2025-03-13 22:25:35,173 INFO  L125   PetriNetUnfolderBase]: For 861/861 co-relation queries the response was YES.
[2025-03-13 22:25:35,254 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 40457 conditions, 25666 events. 10372/25666 cut-off events. For 861/861 co-relation queries the response was YES. Maximal size of possible extension queue 990. Compared 278125 event pairs, 3395 based on Foata normal form. 0/22512 useless extension candidates. Maximal degree in co-relation 31513. Up to 7615 conditions per place. 
[2025-03-13 22:25:35,339 INFO  L140   encePairwiseOnDemand]: 279/281 looper letters, 49 selfloop transitions, 1 changer transitions 0/258 dead transitions.
[2025-03-13 22:25:35,340 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 258 transitions, 637 flow
[2025-03-13 22:25:35,340 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-13 22:25:35,340 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-13 22:25:35,341 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 765 transitions.
[2025-03-13 22:25:35,341 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.9074733096085409
[2025-03-13 22:25:35,341 INFO  L175             Difference]: Start difference. First operand has 249 places, 242 transitions, 500 flow. Second operand 3 states and 765 transitions.
[2025-03-13 22:25:35,341 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 258 transitions, 637 flow
[2025-03-13 22:25:35,347 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 258 transitions, 633 flow, removed 0 selfloop flow, removed 2 redundant places.
[2025-03-13 22:25:35,349 INFO  L231             Difference]: Finished difference. Result has 248 places, 241 transitions, 496 flow
[2025-03-13 22:25:35,350 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=496, PETRI_PLACES=248, PETRI_TRANSITIONS=241}
[2025-03-13 22:25:35,350 INFO  L279   CegarLoopForPetriNet]: 265 programPoint places, -17 predicate places.
[2025-03-13 22:25:35,350 INFO  L471      AbstractCegarLoop]: Abstraction has has 248 places, 241 transitions, 496 flow
[2025-03-13 22:25:35,351 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 242.0) internal successors, (726), 3 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-13 22:25:35,351 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-13 22:25:35,351 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]
[2025-03-13 22:25:35,351 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-03-13 22:25:35,351 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting thread4Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 26 more)] ===
[2025-03-13 22:25:35,351 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-13 22:25:35,352 INFO  L85        PathProgramCache]: Analyzing trace with hash 1599397923, now seen corresponding path program 1 times
[2025-03-13 22:25:35,352 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-13 22:25:35,352 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252529913]
[2025-03-13 22:25:35,352 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-13 22:25:35,352 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-13 22:25:35,359 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes.
[2025-03-13 22:25:35,363 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements.
[2025-03-13 22:25:35,364 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-13 22:25:35,364 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-13 22:25:35,387 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-13 22:25:35,387 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-13 22:25:35,387 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252529913]
[2025-03-13 22:25:35,387 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252529913] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-13 22:25:35,387 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-13 22:25:35,387 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-13 22:25:35,387 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871764819]
[2025-03-13 22:25:35,387 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-13 22:25:35,387 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-13 22:25:35,387 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-13 22:25:35,388 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-13 22:25:35,388 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-13 22:25:35,399 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 236 out of 281
[2025-03-13 22:25:35,400 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 241 transitions, 496 flow. Second operand  has 3 states, 3 states have (on average 240.33333333333334) internal successors, (721), 3 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-13 22:25:35,400 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-13 22:25:35,401 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 281
[2025-03-13 22:25:35,401 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-13 22:25:37,857 INFO  L124   PetriNetUnfolderBase]: 14972/27283 cut-off events.
[2025-03-13 22:25:37,858 INFO  L125   PetriNetUnfolderBase]: For 662/662 co-relation queries the response was YES.
[2025-03-13 22:25:37,916 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 47682 conditions, 27283 events. 14972/27283 cut-off events. For 662/662 co-relation queries the response was YES. Maximal size of possible extension queue 1323. Compared 244530 event pairs, 8588 based on Foata normal form. 0/24254 useless extension candidates. Maximal degree in co-relation 37304. Up to 14363 conditions per place. 
[2025-03-13 22:25:38,002 INFO  L140   encePairwiseOnDemand]: 278/281 looper letters, 50 selfloop transitions, 2 changer transitions 0/257 dead transitions.
[2025-03-13 22:25:38,002 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 257 transitions, 637 flow
[2025-03-13 22:25:38,003 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-13 22:25:38,003 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-13 22:25:38,003 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 761 transitions.
[2025-03-13 22:25:38,004 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.9027283511269276
[2025-03-13 22:25:38,004 INFO  L175             Difference]: Start difference. First operand has 248 places, 241 transitions, 496 flow. Second operand 3 states and 761 transitions.
[2025-03-13 22:25:38,004 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 257 transitions, 637 flow
[2025-03-13 22:25:38,005 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 257 transitions, 636 flow, removed 0 selfloop flow, removed 1 redundant places.
[2025-03-13 22:25:38,007 INFO  L231             Difference]: Finished difference. Result has 248 places, 240 transitions, 497 flow
[2025-03-13 22:25:38,007 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=493, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=497, PETRI_PLACES=248, PETRI_TRANSITIONS=240}
[2025-03-13 22:25:38,008 INFO  L279   CegarLoopForPetriNet]: 265 programPoint places, -17 predicate places.
[2025-03-13 22:25:38,008 INFO  L471      AbstractCegarLoop]: Abstraction has has 248 places, 240 transitions, 497 flow
[2025-03-13 22:25:38,008 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 240.33333333333334) internal successors, (721), 3 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-13 22:25:38,008 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-13 22:25:38,008 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-13 22:25:38,009 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-03-13 22:25:38,009 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting thread4Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 26 more)] ===
[2025-03-13 22:25:38,009 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-13 22:25:38,009 INFO  L85        PathProgramCache]: Analyzing trace with hash -317926875, now seen corresponding path program 1 times
[2025-03-13 22:25:38,009 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-13 22:25:38,009 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257564917]
[2025-03-13 22:25:38,009 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-13 22:25:38,009 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-13 22:25:38,015 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes.
[2025-03-13 22:25:38,020 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements.
[2025-03-13 22:25:38,020 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-13 22:25:38,020 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-13 22:25:38,044 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-13 22:25:38,044 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-13 22:25:38,044 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257564917]
[2025-03-13 22:25:38,045 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257564917] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-13 22:25:38,045 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-13 22:25:38,045 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-13 22:25:38,045 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981077580]
[2025-03-13 22:25:38,045 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-13 22:25:38,045 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-13 22:25:38,045 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-13 22:25:38,046 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-13 22:25:38,046 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-13 22:25:38,054 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 238 out of 281
[2025-03-13 22:25:38,055 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 240 transitions, 497 flow. Second operand  has 3 states, 3 states have (on average 242.33333333333334) internal successors, (727), 3 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-13 22:25:38,055 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-13 22:25:38,055 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 281
[2025-03-13 22:25:38,055 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand