./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-deagle/arithmetic_prog_bad.i --full-output --architecture 32bit


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


Checking for data races
Using default analysis
Version c00e63dc
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-deagle/arithmetic_prog_bad.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 051706a1eb405a384d7cf371ab2d9b9605b94715fa3ad16d6c2eb8e3fbb8fc38
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-c00e63d-m
[2025-02-06 09:32:58,735 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-02-06 09:32:58,785 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2025-02-06 09:32:58,788 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-02-06 09:32:58,788 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-02-06 09:32:58,809 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-02-06 09:32:58,810 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-02-06 09:32:58,810 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-02-06 09:32:58,810 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-02-06 09:32:58,811 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-02-06 09:32:58,811 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-02-06 09:32:58,811 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-02-06 09:32:58,811 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-02-06 09:32:58,811 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-02-06 09:32:58,811 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-02-06 09:32:58,811 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-02-06 09:32:58,811 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-02-06 09:32:58,811 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-02-06 09:32:58,812 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-02-06 09:32:58,812 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-02-06 09:32:58,812 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-02-06 09:32:58,812 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-02-06 09:32:58,812 INFO  L153        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2025-02-06 09:32:58,812 INFO  L153        SettingsManager]:  * Check unreachability of reach_error function=false
[2025-02-06 09:32:58,812 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-02-06 09:32:58,812 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-02-06 09:32:58,812 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-02-06 09:32:58,812 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-02-06 09:32:58,812 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-02-06 09:32:58,813 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-02-06 09:32:58,813 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-02-06 09:32:58,813 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-06 09:32:58,813 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-02-06 09:32:58,813 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-02-06 09:32:58,813 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-02-06 09:32:58,813 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-02-06 09:32:58,813 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-02-06 09:32:58,813 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-02-06 09:32:58,813 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-02-06 09:32:58,814 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-02-06 09:32:58,814 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-02-06 09:32:58,814 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-02-06 09:32:58,814 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-jdk21/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 -> 051706a1eb405a384d7cf371ab2d9b9605b94715fa3ad16d6c2eb8e3fbb8fc38
[2025-02-06 09:32:59,061 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-02-06 09:32:59,067 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-02-06 09:32:59,070 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-02-06 09:32:59,071 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-02-06 09:32:59,071 INFO  L274        PluginConnector]: CDTParser initialized
[2025-02-06 09:32:59,073 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-deagle/arithmetic_prog_bad.i
[2025-02-06 09:33:00,182 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/201d3409d/9ade548ddb824fad8e4f15491ab92adc/FLAGae7fdd149
[2025-02-06 09:33:00,518 INFO  L384              CDTParser]: Found 1 translation units.
[2025-02-06 09:33:00,519 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-deagle/arithmetic_prog_bad.i
[2025-02-06 09:33:00,535 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/201d3409d/9ade548ddb824fad8e4f15491ab92adc/FLAGae7fdd149
[2025-02-06 09:33:00,764 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/201d3409d/9ade548ddb824fad8e4f15491ab92adc
[2025-02-06 09:33:00,766 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-02-06 09:33:00,767 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-02-06 09:33:00,769 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-02-06 09:33:00,769 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-02-06 09:33:00,776 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-02-06 09:33:00,777 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:33:00" (1/1) ...
[2025-02-06 09:33:00,777 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37c9112d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:33:00, skipping insertion in model container
[2025-02-06 09:33:00,778 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:33:00" (1/1) ...
[2025-02-06 09:33:00,808 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-02-06 09:33:01,077 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-06 09:33:01,093 INFO  L200         MainTranslator]: Completed pre-run
[2025-02-06 09:33:01,131 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-06 09:33:01,180 INFO  L204         MainTranslator]: Completed translation
[2025-02-06 09:33:01,181 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:33:01 WrapperNode
[2025-02-06 09:33:01,181 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-02-06 09:33:01,182 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-02-06 09:33:01,182 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-02-06 09:33:01,182 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-02-06 09:33:01,187 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:33:01" (1/1) ...
[2025-02-06 09:33:01,199 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:33:01" (1/1) ...
[2025-02-06 09:33:01,220 INFO  L138                Inliner]: procedures = 243, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 274
[2025-02-06 09:33:01,221 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-02-06 09:33:01,222 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-02-06 09:33:01,222 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-02-06 09:33:01,222 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-02-06 09:33:01,228 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:33:01" (1/1) ...
[2025-02-06 09:33:01,228 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:33:01" (1/1) ...
[2025-02-06 09:33:01,231 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:33:01" (1/1) ...
[2025-02-06 09:33:01,231 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:33:01" (1/1) ...
[2025-02-06 09:33:01,239 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:33:01" (1/1) ...
[2025-02-06 09:33:01,240 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:33:01" (1/1) ...
[2025-02-06 09:33:01,242 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:33:01" (1/1) ...
[2025-02-06 09:33:01,243 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:33:01" (1/1) ...
[2025-02-06 09:33:01,245 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-02-06 09:33:01,246 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-02-06 09:33:01,246 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-02-06 09:33:01,246 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-02-06 09:33:01,247 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:33:01" (1/1) ...
[2025-02-06 09:33:01,252 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-06 09:33:01,263 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 09:33:01,276 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-02-06 09:33:01,283 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-02-06 09:33:01,297 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2025-02-06 09:33:01,298 INFO  L130     BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock
[2025-02-06 09:33:01,298 INFO  L130     BoogieDeclarations]: Found specification of procedure thread1
[2025-02-06 09:33:01,298 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread1
[2025-02-06 09:33:01,298 INFO  L130     BoogieDeclarations]: Found specification of procedure thread2
[2025-02-06 09:33:01,298 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread2
[2025-02-06 09:33:01,299 INFO  L130     BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock
[2025-02-06 09:33:01,299 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-02-06 09:33:01,299 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2025-02-06 09:33:01,299 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-02-06 09:33:01,299 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-02-06 09:33:01,300 WARN  L227             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement.
[2025-02-06 09:33:01,420 INFO  L257             CfgBuilder]: Building ICFG
[2025-02-06 09:33:01,421 INFO  L287             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-02-06 09:33:01,714 INFO  L304             CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2025-02-06 09:33:01,715 INFO  L308             CfgBuilder]: Performing block encoding
[2025-02-06 09:33:01,742 INFO  L332             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-02-06 09:33:01,742 INFO  L337             CfgBuilder]: Removed 0 assume(true) statements.
[2025-02-06 09:33:01,742 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:33:01 BoogieIcfgContainer
[2025-02-06 09:33:01,743 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-02-06 09:33:01,745 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-02-06 09:33:01,745 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-02-06 09:33:01,748 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-02-06 09:33:01,748 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 09:33:00" (1/3) ...
[2025-02-06 09:33:01,749 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20517c7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:33:01, skipping insertion in model container
[2025-02-06 09:33:01,749 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:33:01" (2/3) ...
[2025-02-06 09:33:01,749 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20517c7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:33:01, skipping insertion in model container
[2025-02-06 09:33:01,749 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:33:01" (3/3) ...
[2025-02-06 09:33:01,750 INFO  L128   eAbstractionObserver]: Analyzing ICFG arithmetic_prog_bad.i
[2025-02-06 09:33:01,761 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-02-06 09:33:01,762 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG arithmetic_prog_bad.i that has 3 procedures, 369 locations, 1 initial locations, 4 loop locations, and 15 error locations.
[2025-02-06 09:33:01,762 INFO  L491   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2025-02-06 09:33:01,838 INFO  L143    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2025-02-06 09:33:01,872 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 375 places, 377 transitions, 768 flow
[2025-02-06 09:33:01,985 INFO  L124   PetriNetUnfolderBase]: 9/375 cut-off events.
[2025-02-06 09:33:01,986 INFO  L125   PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES.
[2025-02-06 09:33:01,992 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 384 conditions, 375 events. 9/375 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 293 event pairs, 0 based on Foata normal form. 0/351 useless extension candidates. Maximal degree in co-relation 295. Up to 3 conditions per place. 
[2025-02-06 09:33:01,992 INFO  L82        GeneralOperation]: Start removeDead. Operand has 375 places, 377 transitions, 768 flow
[2025-02-06 09:33:01,999 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 362 places, 361 transitions, 734 flow
[2025-02-06 09:33:02,009 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-02-06 09:33:02,021 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;@7bed1a37, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-02-06 09:33:02,021 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 28 error locations.
[2025-02-06 09:33:02,057 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2025-02-06 09:33:02,057 INFO  L124   PetriNetUnfolderBase]: 0/242 cut-off events.
[2025-02-06 09:33:02,057 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2025-02-06 09:33:02,057 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-02-06 09:33:02,058 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 09:33:02,058 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err2ASSERT_VIOLATIONDATA_RACE (and 24 more)] ===
[2025-02-06 09:33:02,062 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 09:33:02,062 INFO  L85        PathProgramCache]: Analyzing trace with hash 1054558135, now seen corresponding path program 1 times
[2025-02-06 09:33:02,067 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 09:33:02,068 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766180325]
[2025-02-06 09:33:02,068 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 09:33:02,068 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 09:33:02,161 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 242 statements into 1 equivalence classes.
[2025-02-06 09:33:02,248 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 242 of 242 statements.
[2025-02-06 09:33:02,248 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 09:33:02,248 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 09:33:02,512 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-06 09:33:02,514 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 09:33:02,514 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766180325]
[2025-02-06 09:33:02,514 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766180325] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 09:33:02,514 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 09:33:02,515 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-06 09:33:02,516 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098818595]
[2025-02-06 09:33:02,517 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 09:33:02,522 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-06 09:33:02,526 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 09:33:02,542 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-06 09:33:02,542 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-06 09:33:02,593 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 347 out of 377
[2025-02-06 09:33:02,597 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 361 transitions, 734 flow. Second operand  has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-06 09:33:02,597 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-02-06 09:33:02,597 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 347 of 377
[2025-02-06 09:33:02,598 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-02-06 09:33:02,749 INFO  L124   PetriNetUnfolderBase]: 89/653 cut-off events.
[2025-02-06 09:33:02,749 INFO  L125   PetriNetUnfolderBase]: For 62/68 co-relation queries the response was YES.
[2025-02-06 09:33:02,751 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 853 conditions, 653 events. 89/653 cut-off events. For 62/68 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2048 event pairs, 53 based on Foata normal form. 0/591 useless extension candidates. Maximal degree in co-relation 517. Up to 163 conditions per place. 
[2025-02-06 09:33:02,754 INFO  L140   encePairwiseOnDemand]: 372/377 looper letters, 21 selfloop transitions, 2 changer transitions 0/358 dead transitions.
[2025-02-06 09:33:02,754 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 358 transitions, 774 flow
[2025-02-06 09:33:02,756 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-06 09:33:02,758 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-02-06 09:33:02,768 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1067 transitions.
[2025-02-06 09:33:02,772 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.9434129089301503
[2025-02-06 09:33:02,773 INFO  L175             Difference]: Start difference. First operand has 362 places, 361 transitions, 734 flow. Second operand 3 states and 1067 transitions.
[2025-02-06 09:33:02,774 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 358 transitions, 774 flow
[2025-02-06 09:33:02,780 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 358 transitions, 766 flow, removed 0 selfloop flow, removed 4 redundant places.
[2025-02-06 09:33:02,788 INFO  L231             Difference]: Finished difference. Result has 359 places, 358 transitions, 724 flow
[2025-02-06 09:33:02,791 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=377, PETRI_DIFFERENCE_MINUEND_FLOW=720, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=356, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=724, PETRI_PLACES=359, PETRI_TRANSITIONS=358}
[2025-02-06 09:33:02,795 INFO  L279   CegarLoopForPetriNet]: 362 programPoint places, -3 predicate places.
[2025-02-06 09:33:02,795 INFO  L471      AbstractCegarLoop]: Abstraction has has 359 places, 358 transitions, 724 flow
[2025-02-06 09:33:02,796 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-06 09:33:02,796 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-02-06 09:33:02,796 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-06 09:33:02,796 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-02-06 09:33:02,796 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err2ASSERT_VIOLATIONDATA_RACE (and 24 more)] ===
[2025-02-06 09:33:02,797 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 09:33:02,797 INFO  L85        PathProgramCache]: Analyzing trace with hash 1263766383, now seen corresponding path program 1 times
[2025-02-06 09:33:02,797 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 09:33:02,797 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933344161]
[2025-02-06 09:33:02,797 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 09:33:02,797 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 09:33:02,836 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 247 statements into 1 equivalence classes.
[2025-02-06 09:33:02,858 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 247 of 247 statements.
[2025-02-06 09:33:02,858 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 09:33:02,858 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 09:33:02,958 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-06 09:33:02,959 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 09:33:02,959 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933344161]
[2025-02-06 09:33:02,959 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933344161] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 09:33:02,959 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 09:33:02,959 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-06 09:33:02,959 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679700266]
[2025-02-06 09:33:02,959 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 09:33:02,960 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-06 09:33:02,961 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 09:33:02,961 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-06 09:33:02,961 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-06 09:33:02,993 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 348 out of 377
[2025-02-06 09:33:02,994 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 358 transitions, 724 flow. Second operand  has 3 states, 3 states have (on average 349.3333333333333) internal successors, (1048), 3 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-06 09:33:02,994 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-02-06 09:33:02,994 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 348 of 377
[2025-02-06 09:33:02,994 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-02-06 09:33:03,084 INFO  L124   PetriNetUnfolderBase]: 75/700 cut-off events.
[2025-02-06 09:33:03,084 INFO  L125   PetriNetUnfolderBase]: For 18/20 co-relation queries the response was YES.
[2025-02-06 09:33:03,086 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 839 conditions, 700 events. 75/700 cut-off events. For 18/20 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2523 event pairs, 33 based on Foata normal form. 0/622 useless extension candidates. Maximal degree in co-relation 590. Up to 128 conditions per place. 
[2025-02-06 09:33:03,087 INFO  L140   encePairwiseOnDemand]: 374/377 looper letters, 20 selfloop transitions, 2 changer transitions 0/357 dead transitions.
[2025-02-06 09:33:03,087 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 357 transitions, 766 flow
[2025-02-06 09:33:03,088 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-06 09:33:03,088 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-02-06 09:33:03,089 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1067 transitions.
[2025-02-06 09:33:03,089 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.9434129089301503
[2025-02-06 09:33:03,089 INFO  L175             Difference]: Start difference. First operand has 359 places, 358 transitions, 724 flow. Second operand 3 states and 1067 transitions.
[2025-02-06 09:33:03,089 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 357 transitions, 766 flow
[2025-02-06 09:33:03,091 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 357 transitions, 762 flow, removed 0 selfloop flow, removed 2 redundant places.
[2025-02-06 09:33:03,094 INFO  L231             Difference]: Finished difference. Result has 358 places, 357 transitions, 722 flow
[2025-02-06 09:33:03,094 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=377, PETRI_DIFFERENCE_MINUEND_FLOW=718, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=355, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=722, PETRI_PLACES=358, PETRI_TRANSITIONS=357}
[2025-02-06 09:33:03,095 INFO  L279   CegarLoopForPetriNet]: 362 programPoint places, -4 predicate places.
[2025-02-06 09:33:03,095 INFO  L471      AbstractCegarLoop]: Abstraction has has 358 places, 357 transitions, 722 flow
[2025-02-06 09:33:03,095 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 349.3333333333333) internal successors, (1048), 3 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-06 09:33:03,095 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-02-06 09:33:03,095 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-06 09:33:03,095 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-02-06 09:33:03,095 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err2ASSERT_VIOLATIONDATA_RACE (and 24 more)] ===
[2025-02-06 09:33:03,096 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 09:33:03,096 INFO  L85        PathProgramCache]: Analyzing trace with hash 1920823622, now seen corresponding path program 1 times
[2025-02-06 09:33:03,096 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 09:33:03,096 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40516530]
[2025-02-06 09:33:03,097 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 09:33:03,097 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 09:33:03,126 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 261 statements into 1 equivalence classes.
[2025-02-06 09:33:03,140 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 261 of 261 statements.
[2025-02-06 09:33:03,140 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 09:33:03,140 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 09:33:03,199 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-06 09:33:03,199 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 09:33:03,199 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40516530]
[2025-02-06 09:33:03,199 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40516530] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 09:33:03,199 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 09:33:03,199 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-06 09:33:03,199 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895021214]
[2025-02-06 09:33:03,199 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 09:33:03,199 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-06 09:33:03,201 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 09:33:03,203 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-06 09:33:03,203 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-06 09:33:03,230 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 345 out of 377
[2025-02-06 09:33:03,231 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 357 transitions, 722 flow. Second operand  has 3 states, 3 states have (on average 346.6666666666667) internal successors, (1040), 3 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-06 09:33:03,231 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-02-06 09:33:03,231 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 345 of 377
[2025-02-06 09:33:03,231 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-02-06 09:33:03,420 INFO  L124   PetriNetUnfolderBase]: 207/1202 cut-off events.
[2025-02-06 09:33:03,421 INFO  L125   PetriNetUnfolderBase]: For 29/38 co-relation queries the response was YES.
[2025-02-06 09:33:03,423 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1622 conditions, 1202 events. 207/1202 cut-off events. For 29/38 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 6100 event pairs, 55 based on Foata normal form. 1/1072 useless extension candidates. Maximal degree in co-relation 1368. Up to 266 conditions per place. 
[2025-02-06 09:33:03,427 INFO  L140   encePairwiseOnDemand]: 363/377 looper letters, 37 selfloop transitions, 10 changer transitions 0/377 dead transitions.
[2025-02-06 09:33:03,428 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 377 transitions, 858 flow
[2025-02-06 09:33:03,428 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-06 09:33:03,428 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-02-06 09:33:03,431 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1086 transitions.
[2025-02-06 09:33:03,432 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.9602122015915119
[2025-02-06 09:33:03,433 INFO  L175             Difference]: Start difference. First operand has 358 places, 357 transitions, 722 flow. Second operand 3 states and 1086 transitions.
[2025-02-06 09:33:03,433 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 377 transitions, 858 flow
[2025-02-06 09:33:03,434 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 377 transitions, 854 flow, removed 0 selfloop flow, removed 2 redundant places.
[2025-02-06 09:33:03,437 INFO  L231             Difference]: Finished difference. Result has 360 places, 367 transitions, 806 flow
[2025-02-06 09:33:03,438 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=377, PETRI_DIFFERENCE_MINUEND_FLOW=718, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=347, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=806, PETRI_PLACES=360, PETRI_TRANSITIONS=367}
[2025-02-06 09:33:03,438 INFO  L279   CegarLoopForPetriNet]: 362 programPoint places, -2 predicate places.
[2025-02-06 09:33:03,438 INFO  L471      AbstractCegarLoop]: Abstraction has has 360 places, 367 transitions, 806 flow
[2025-02-06 09:33:03,439 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 346.6666666666667) internal successors, (1040), 3 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-06 09:33:03,439 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-02-06 09:33:03,439 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-06 09:33:03,439 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-02-06 09:33:03,439 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err2ASSERT_VIOLATIONDATA_RACE (and 24 more)] ===
[2025-02-06 09:33:03,440 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 09:33:03,440 INFO  L85        PathProgramCache]: Analyzing trace with hash 2125162564, now seen corresponding path program 1 times
[2025-02-06 09:33:03,440 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 09:33:03,440 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691330586]
[2025-02-06 09:33:03,441 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 09:33:03,441 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 09:33:03,468 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 265 statements into 1 equivalence classes.
[2025-02-06 09:33:03,482 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 265 of 265 statements.
[2025-02-06 09:33:03,482 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 09:33:03,482 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 09:33:03,622 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-06 09:33:03,623 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 09:33:03,623 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691330586]
[2025-02-06 09:33:03,623 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691330586] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 09:33:03,623 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 09:33:03,623 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-06 09:33:03,623 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052568435]
[2025-02-06 09:33:03,623 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 09:33:03,624 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-06 09:33:03,624 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 09:33:03,624 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-06 09:33:03,624 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-06 09:33:03,633 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 356 out of 377
[2025-02-06 09:33:03,634 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 367 transitions, 806 flow. Second operand  has 3 states, 3 states have (on average 357.6666666666667) internal successors, (1073), 3 states have internal predecessors, (1073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-06 09:33:03,634 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-02-06 09:33:03,634 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 356 of 377
[2025-02-06 09:33:03,634 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-02-06 09:33:03,843 INFO  L124   PetriNetUnfolderBase]: 266/1801 cut-off events.
[2025-02-06 09:33:03,843 INFO  L125   PetriNetUnfolderBase]: For 119/121 co-relation queries the response was YES.
[2025-02-06 09:33:03,846 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2548 conditions, 1801 events. 266/1801 cut-off events. For 119/121 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 11201 event pairs, 87 based on Foata normal form. 6/1609 useless extension candidates. Maximal degree in co-relation 2027. Up to 260 conditions per place. 
[2025-02-06 09:33:03,850 INFO  L140   encePairwiseOnDemand]: 374/377 looper letters, 24 selfloop transitions, 2 changer transitions 0/377 dead transitions.
[2025-02-06 09:33:03,850 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 377 transitions, 879 flow
[2025-02-06 09:33:03,850 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-06 09:33:03,851 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-02-06 09:33:03,853 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1095 transitions.
[2025-02-06 09:33:03,853 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.9681697612732095
[2025-02-06 09:33:03,853 INFO  L175             Difference]: Start difference. First operand has 360 places, 367 transitions, 806 flow. Second operand 3 states and 1095 transitions.
[2025-02-06 09:33:03,853 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 362 places, 377 transitions, 879 flow
[2025-02-06 09:33:03,858 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 360 places, 377 transitions, 859 flow, removed 0 selfloop flow, removed 2 redundant places.
[2025-02-06 09:33:03,860 INFO  L231             Difference]: Finished difference. Result has 361 places, 368 transitions, 798 flow
[2025-02-06 09:33:03,861 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=377, PETRI_DIFFERENCE_MINUEND_FLOW=786, PETRI_DIFFERENCE_MINUEND_PLACES=358, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=365, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=798, PETRI_PLACES=361, PETRI_TRANSITIONS=368}
[2025-02-06 09:33:03,862 INFO  L279   CegarLoopForPetriNet]: 362 programPoint places, -1 predicate places.
[2025-02-06 09:33:03,862 INFO  L471      AbstractCegarLoop]: Abstraction has has 361 places, 368 transitions, 798 flow
[2025-02-06 09:33:03,863 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 357.6666666666667) internal successors, (1073), 3 states have internal predecessors, (1073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-06 09:33:03,863 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-02-06 09:33:03,863 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-06 09:33:03,863 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-02-06 09:33:03,863 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err2ASSERT_VIOLATIONDATA_RACE (and 24 more)] ===
[2025-02-06 09:33:03,864 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 09:33:03,864 INFO  L85        PathProgramCache]: Analyzing trace with hash -1647845143, now seen corresponding path program 1 times
[2025-02-06 09:33:03,864 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 09:33:03,864 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73378654]
[2025-02-06 09:33:03,864 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 09:33:03,864 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 09:33:03,894 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 269 statements into 1 equivalence classes.
[2025-02-06 09:33:03,911 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 269 of 269 statements.
[2025-02-06 09:33:03,911 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 09:33:03,911 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 09:33:03,983 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-06 09:33:03,983 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 09:33:03,983 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73378654]
[2025-02-06 09:33:03,983 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73378654] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 09:33:03,983 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 09:33:03,983 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-06 09:33:03,983 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735321675]
[2025-02-06 09:33:03,983 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 09:33:03,983 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-06 09:33:03,984 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 09:33:03,984 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-06 09:33:03,984 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-06 09:33:04,012 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 349 out of 377
[2025-02-06 09:33:04,013 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 361 places, 368 transitions, 798 flow. Second operand  has 3 states, 3 states have (on average 351.6666666666667) internal successors, (1055), 3 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-06 09:33:04,013 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-02-06 09:33:04,013 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 349 of 377
[2025-02-06 09:33:04,013 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-02-06 09:33:04,235 INFO  L124   PetriNetUnfolderBase]: 443/2130 cut-off events.
[2025-02-06 09:33:04,235 INFO  L125   PetriNetUnfolderBase]: For 279/326 co-relation queries the response was YES.
[2025-02-06 09:33:04,239 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3376 conditions, 2130 events. 443/2130 cut-off events. For 279/326 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 13609 event pairs, 166 based on Foata normal form. 15/1919 useless extension candidates. Maximal degree in co-relation 2861. Up to 688 conditions per place. 
[2025-02-06 09:33:04,245 INFO  L140   encePairwiseOnDemand]: 370/377 looper letters, 32 selfloop transitions, 10 changer transitions 0/381 dead transitions.
[2025-02-06 09:33:04,245 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 381 transitions, 921 flow
[2025-02-06 09:33:04,246 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-06 09:33:04,246 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-02-06 09:33:04,247 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1081 transitions.
[2025-02-06 09:33:04,247 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.9557913351016799
[2025-02-06 09:33:04,247 INFO  L175             Difference]: Start difference. First operand has 361 places, 368 transitions, 798 flow. Second operand 3 states and 1081 transitions.
[2025-02-06 09:33:04,247 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 381 transitions, 921 flow
[2025-02-06 09:33:04,250 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 381 transitions, 919 flow, removed 0 selfloop flow, removed 1 redundant places.
[2025-02-06 09:33:04,255 INFO  L231             Difference]: Finished difference. Result has 364 places, 376 transitions, 882 flow
[2025-02-06 09:33:04,255 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=377, PETRI_DIFFERENCE_MINUEND_FLOW=796, PETRI_DIFFERENCE_MINUEND_PLACES=360, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=358, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=882, PETRI_PLACES=364, PETRI_TRANSITIONS=376}
[2025-02-06 09:33:04,258 INFO  L279   CegarLoopForPetriNet]: 362 programPoint places, 2 predicate places.
[2025-02-06 09:33:04,258 INFO  L471      AbstractCegarLoop]: Abstraction has has 364 places, 376 transitions, 882 flow
[2025-02-06 09:33:04,258 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 351.6666666666667) internal successors, (1055), 3 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-06 09:33:04,258 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-02-06 09:33:04,258 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-06 09:33:04,258 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-02-06 09:33:04,258 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err2ASSERT_VIOLATIONDATA_RACE (and 24 more)] ===
[2025-02-06 09:33:04,259 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 09:33:04,259 INFO  L85        PathProgramCache]: Analyzing trace with hash 1863014754, now seen corresponding path program 1 times
[2025-02-06 09:33:04,259 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 09:33:04,259 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934403606]
[2025-02-06 09:33:04,259 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 09:33:04,259 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 09:33:04,283 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes.
[2025-02-06 09:33:04,304 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements.
[2025-02-06 09:33:04,304 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 09:33:04,304 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 09:33:04,412 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-06 09:33:04,413 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 09:33:04,413 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934403606]
[2025-02-06 09:33:04,413 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934403606] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 09:33:04,413 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 09:33:04,413 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-06 09:33:04,413 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076101112]
[2025-02-06 09:33:04,413 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 09:33:04,413 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-06 09:33:04,413 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 09:33:04,414 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-06 09:33:04,414 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-06 09:33:04,427 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 353 out of 377
[2025-02-06 09:33:04,428 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 376 transitions, 882 flow. Second operand  has 3 states, 3 states have (on average 355.0) internal successors, (1065), 3 states have internal predecessors, (1065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-06 09:33:04,428 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-02-06 09:33:04,428 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 353 of 377
[2025-02-06 09:33:04,428 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-02-06 09:33:04,555 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([792] L880-->L880-2: Formula: (= |v_#race~num~0_9| 0)  InVars {}  OutVars{#race~num~0=|v_#race~num~0_9|}  AuxVars[]  AssignedVars[#race~num~0][294], [57#L880-2true, Black: 384#true, 400#(= ~num~0 0), 391#(= thread2Thread1of1ForFork0_~j~0 0), 262#L914-1true, Black: 395#(= |thread1Thread1of1ForFork1_#t~nondet8| |#race~num~0|), 393#true, 232#L894-1true])
[2025-02-06 09:33:04,555 INFO  L294   olderBase$Statistics]: this new event has 304 ancestors and is cut-off event
[2025-02-06 09:33:04,555 INFO  L297   olderBase$Statistics]:   existing Event has 279 ancestors and is cut-off event
[2025-02-06 09:33:04,555 INFO  L297   olderBase$Statistics]:   existing Event has 274 ancestors and is cut-off event
[2025-02-06 09:33:04,555 INFO  L297   olderBase$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2025-02-06 09:33:04,714 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([792] L880-->L880-2: Formula: (= |v_#race~num~0_9| 0)  InVars {}  OutVars{#race~num~0=|v_#race~num~0_9|}  AuxVars[]  AssignedVars[#race~num~0][294], [57#L880-2true, Black: 384#true, 398#true, 262#L914-1true, Black: 391#(= thread2Thread1of1ForFork0_~j~0 0), Black: 395#(= |thread1Thread1of1ForFork1_#t~nondet8| |#race~num~0|), 393#true, 232#L894-1true])
[2025-02-06 09:33:04,714 INFO  L294   olderBase$Statistics]: this new event has 346 ancestors and is cut-off event
[2025-02-06 09:33:04,714 INFO  L297   olderBase$Statistics]:   existing Event has 321 ancestors and is cut-off event
[2025-02-06 09:33:04,714 INFO  L297   olderBase$Statistics]:   existing Event has 326 ancestors and is cut-off event
[2025-02-06 09:33:04,714 INFO  L297   olderBase$Statistics]:   existing Event has 321 ancestors and is cut-off event
[2025-02-06 09:33:04,719 INFO  L292   olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([792] L880-->L880-2: Formula: (= |v_#race~num~0_9| 0)  InVars {}  OutVars{#race~num~0=|v_#race~num~0_9|}  AuxVars[]  AssignedVars[#race~num~0][294], [57#L880-2true, Black: 384#true, 398#true, 262#L914-1true, Black: 391#(= thread2Thread1of1ForFork0_~j~0 0), Black: 395#(= |thread1Thread1of1ForFork1_#t~nondet8| |#race~num~0|), 393#true, 232#L894-1true])
[2025-02-06 09:33:04,719 INFO  L294   olderBase$Statistics]: this new event has 351 ancestors and is cut-off event
[2025-02-06 09:33:04,719 INFO  L297   olderBase$Statistics]:   existing Event has 321 ancestors and is cut-off event
[2025-02-06 09:33:04,719 INFO  L297   olderBase$Statistics]:   existing Event has 346 ancestors and is cut-off event
[2025-02-06 09:33:04,719 INFO  L297   olderBase$Statistics]:   existing Event has 326 ancestors and is cut-off event
[2025-02-06 09:33:04,719 INFO  L297   olderBase$Statistics]:   existing Event has 321 ancestors and is cut-off event
[2025-02-06 09:33:04,719 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([792] L880-->L880-2: Formula: (= |v_#race~num~0_9| 0)  InVars {}  OutVars{#race~num~0=|v_#race~num~0_9|}  AuxVars[]  AssignedVars[#race~num~0][294], [57#L880-2true, Black: 384#true, 398#true, 262#L914-1true, Black: 391#(= thread2Thread1of1ForFork0_~j~0 0), 252#L894-2true, Black: 395#(= |thread1Thread1of1ForFork1_#t~nondet8| |#race~num~0|), 393#true])
[2025-02-06 09:33:04,719 INFO  L294   olderBase$Statistics]: this new event has 350 ancestors and is cut-off event
[2025-02-06 09:33:04,719 INFO  L297   olderBase$Statistics]:   existing Event has 320 ancestors and is cut-off event
[2025-02-06 09:33:04,719 INFO  L297   olderBase$Statistics]:   existing Event has 345 ancestors and is cut-off event
[2025-02-06 09:33:04,719 INFO  L297   olderBase$Statistics]:   existing Event has 325 ancestors and is cut-off event
[2025-02-06 09:33:04,720 INFO  L124   PetriNetUnfolderBase]: 542/2486 cut-off events.
[2025-02-06 09:33:04,720 INFO  L125   PetriNetUnfolderBase]: For 440/476 co-relation queries the response was YES.
[2025-02-06 09:33:04,726 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4134 conditions, 2486 events. 542/2486 cut-off events. For 440/476 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 16009 event pairs, 154 based on Foata normal form. 21/2212 useless extension candidates. Maximal degree in co-relation 3514. Up to 449 conditions per place. 
[2025-02-06 09:33:04,732 INFO  L140   encePairwiseOnDemand]: 372/377 looper letters, 27 selfloop transitions, 3 changer transitions 0/387 dead transitions.
[2025-02-06 09:33:04,732 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 387 transitions, 966 flow
[2025-02-06 09:33:04,732 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-06 09:33:04,732 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-02-06 09:33:04,733 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1091 transitions.
[2025-02-06 09:33:04,734 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.964633068081344
[2025-02-06 09:33:04,734 INFO  L175             Difference]: Start difference. First operand has 364 places, 376 transitions, 882 flow. Second operand 3 states and 1091 transitions.
[2025-02-06 09:33:04,734 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 387 transitions, 966 flow
[2025-02-06 09:33:04,737 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 387 transitions, 946 flow, removed 0 selfloop flow, removed 2 redundant places.
[2025-02-06 09:33:04,739 INFO  L231             Difference]: Finished difference. Result has 366 places, 378 transitions, 886 flow
[2025-02-06 09:33:04,740 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=377, PETRI_DIFFERENCE_MINUEND_FLOW=862, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=376, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=373, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=886, PETRI_PLACES=366, PETRI_TRANSITIONS=378}
[2025-02-06 09:33:04,740 INFO  L279   CegarLoopForPetriNet]: 362 programPoint places, 4 predicate places.
[2025-02-06 09:33:04,740 INFO  L471      AbstractCegarLoop]: Abstraction has has 366 places, 378 transitions, 886 flow
[2025-02-06 09:33:04,741 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 355.0) internal successors, (1065), 3 states have internal predecessors, (1065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-06 09:33:04,741 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-02-06 09:33:04,741 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 09:33:04,741 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-02-06 09:33:04,741 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err2ASSERT_VIOLATIONDATA_RACE (and 24 more)] ===
[2025-02-06 09:33:04,742 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 09:33:04,742 INFO  L85        PathProgramCache]: Analyzing trace with hash 1139931514, now seen corresponding path program 1 times
[2025-02-06 09:33:04,742 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 09:33:04,742 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48414749]
[2025-02-06 09:33:04,742 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 09:33:04,742 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 09:33:04,764 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 282 statements into 1 equivalence classes.
[2025-02-06 09:33:04,775 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 282 of 282 statements.
[2025-02-06 09:33:04,775 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 09:33:04,775 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 09:33:04,982 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-06 09:33:04,983 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 09:33:04,983 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48414749]
[2025-02-06 09:33:04,983 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48414749] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 09:33:04,983 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 09:33:04,983 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-06 09:33:04,983 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220364004]
[2025-02-06 09:33:04,983 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 09:33:04,984 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-06 09:33:04,985 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 09:33:04,985 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-06 09:33:04,985 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-06 09:33:05,005 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 358 out of 377
[2025-02-06 09:33:05,007 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 378 transitions, 886 flow. Second operand  has 3 states, 3 states have (on average 360.0) internal successors, (1080), 3 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-06 09:33:05,007 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-02-06 09:33:05,007 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 358 of 377
[2025-02-06 09:33:05,007 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-02-06 09:33:05,139 INFO  L124   PetriNetUnfolderBase]: 51/770 cut-off events.
[2025-02-06 09:33:05,139 INFO  L125   PetriNetUnfolderBase]: For 61/61 co-relation queries the response was YES.
[2025-02-06 09:33:05,141 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1079 conditions, 770 events. 51/770 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2218 event pairs, 7 based on Foata normal form. 22/759 useless extension candidates. Maximal degree in co-relation 553. Up to 87 conditions per place. 
[2025-02-06 09:33:05,142 INFO  L140   encePairwiseOnDemand]: 369/377 looper letters, 8 selfloop transitions, 8 changer transitions 0/359 dead transitions.
[2025-02-06 09:33:05,143 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 359 transitions, 822 flow
[2025-02-06 09:33:05,143 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-06 09:33:05,143 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-02-06 09:33:05,144 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1094 transitions.
[2025-02-06 09:33:05,145 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.9672855879752431
[2025-02-06 09:33:05,145 INFO  L175             Difference]: Start difference. First operand has 366 places, 378 transitions, 886 flow. Second operand 3 states and 1094 transitions.
[2025-02-06 09:33:05,145 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 359 transitions, 822 flow
[2025-02-06 09:33:05,148 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 359 transitions, 790 flow, removed 11 selfloop flow, removed 4 redundant places.
[2025-02-06 09:33:05,152 INFO  L231             Difference]: Finished difference. Result has 359 places, 357 transitions, 768 flow
[2025-02-06 09:33:05,152 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=377, PETRI_DIFFERENCE_MINUEND_FLOW=752, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=349, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=768, PETRI_PLACES=359, PETRI_TRANSITIONS=357}
[2025-02-06 09:33:05,154 INFO  L279   CegarLoopForPetriNet]: 362 programPoint places, -3 predicate places.
[2025-02-06 09:33:05,154 INFO  L471      AbstractCegarLoop]: Abstraction has has 359 places, 357 transitions, 768 flow
[2025-02-06 09:33:05,154 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 360.0) internal successors, (1080), 3 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-06 09:33:05,155 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-02-06 09:33:05,155 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-06 09:33:05,155 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-02-06 09:33:05,155 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err2ASSERT_VIOLATIONDATA_RACE (and 24 more)] ===
[2025-02-06 09:33:05,156 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 09:33:05,156 INFO  L85        PathProgramCache]: Analyzing trace with hash -1526605791, now seen corresponding path program 1 times
[2025-02-06 09:33:05,156 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 09:33:05,156 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557517164]
[2025-02-06 09:33:05,156 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 09:33:05,156 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 09:33:05,194 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 289 statements into 1 equivalence classes.
[2025-02-06 09:33:05,206 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 289 of 289 statements.
[2025-02-06 09:33:05,206 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 09:33:05,206 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 09:33:05,258 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-06 09:33:05,261 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 09:33:05,261 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557517164]
[2025-02-06 09:33:05,261 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557517164] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 09:33:05,261 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 09:33:05,261 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-06 09:33:05,261 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421955868]
[2025-02-06 09:33:05,261 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 09:33:05,261 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-06 09:33:05,262 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 09:33:05,262 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-06 09:33:05,262 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-06 09:33:05,283 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 348 out of 377
[2025-02-06 09:33:05,284 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 357 transitions, 768 flow. Second operand  has 3 states, 3 states have (on average 350.6666666666667) internal successors, (1052), 3 states have internal predecessors, (1052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-06 09:33:05,284 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-02-06 09:33:05,284 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 348 of 377
[2025-02-06 09:33:05,284 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-02-06 09:33:05,400 INFO  L124   PetriNetUnfolderBase]: 80/845 cut-off events.
[2025-02-06 09:33:05,400 INFO  L125   PetriNetUnfolderBase]: For 84/84 co-relation queries the response was YES.
[2025-02-06 09:33:05,401 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1208 conditions, 845 events. 80/845 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2899 event pairs, 22 based on Foata normal form. 1/812 useless extension candidates. Maximal degree in co-relation 674. Up to 115 conditions per place. 
[2025-02-06 09:33:05,403 INFO  L140   encePairwiseOnDemand]: 369/377 looper letters, 20 selfloop transitions, 4 changer transitions 3/359 dead transitions.
[2025-02-06 09:33:05,403 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 359 transitions, 831 flow
[2025-02-06 09:33:05,404 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-06 09:33:05,404 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-02-06 09:33:05,405 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1072 transitions.
[2025-02-06 09:33:05,406 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.9478337754199824
[2025-02-06 09:33:05,406 INFO  L175             Difference]: Start difference. First operand has 359 places, 357 transitions, 768 flow. Second operand 3 states and 1072 transitions.
[2025-02-06 09:33:05,406 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 358 places, 359 transitions, 831 flow
[2025-02-06 09:33:05,408 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 359 transitions, 819 flow, removed 0 selfloop flow, removed 1 redundant places.
[2025-02-06 09:33:05,410 INFO  L231             Difference]: Finished difference. Result has 357 places, 351 transitions, 756 flow
[2025-02-06 09:33:05,411 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=377, PETRI_DIFFERENCE_MINUEND_FLOW=754, PETRI_DIFFERENCE_MINUEND_PLACES=355, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=350, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=756, PETRI_PLACES=357, PETRI_TRANSITIONS=351}
[2025-02-06 09:33:05,411 INFO  L279   CegarLoopForPetriNet]: 362 programPoint places, -5 predicate places.
[2025-02-06 09:33:05,412 INFO  L471      AbstractCegarLoop]: Abstraction has has 357 places, 351 transitions, 756 flow
[2025-02-06 09:33:05,413 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 350.6666666666667) internal successors, (1052), 3 states have internal predecessors, (1052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-06 09:33:05,413 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-02-06 09:33:05,413 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-06 09:33:05,413 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-02-06 09:33:05,414 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err2ASSERT_VIOLATIONDATA_RACE (and 24 more)] ===
[2025-02-06 09:33:05,415 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 09:33:05,415 INFO  L85        PathProgramCache]: Analyzing trace with hash 1456836323, now seen corresponding path program 1 times
[2025-02-06 09:33:05,415 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 09:33:05,415 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284889464]
[2025-02-06 09:33:05,415 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 09:33:05,415 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 09:33:05,453 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 293 statements into 1 equivalence classes.
[2025-02-06 09:33:05,471 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 293 of 293 statements.
[2025-02-06 09:33:05,472 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 09:33:05,472 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 09:33:05,526 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-06 09:33:05,527 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 09:33:05,527 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284889464]
[2025-02-06 09:33:05,527 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284889464] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 09:33:05,527 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 09:33:05,527 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-06 09:33:05,527 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214631596]
[2025-02-06 09:33:05,527 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 09:33:05,528 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-06 09:33:05,528 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 09:33:05,528 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-06 09:33:05,528 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-06 09:33:05,557 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 350 out of 377
[2025-02-06 09:33:05,558 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 351 transitions, 756 flow. Second operand  has 3 states, 3 states have (on average 353.3333333333333) internal successors, (1060), 3 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-06 09:33:05,559 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-02-06 09:33:05,559 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 350 of 377
[2025-02-06 09:33:05,559 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-02-06 09:33:05,663 INFO  L124   PetriNetUnfolderBase]: 75/808 cut-off events.
[2025-02-06 09:33:05,663 INFO  L125   PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES.
[2025-02-06 09:33:05,665 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1132 conditions, 808 events. 75/808 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2681 event pairs, 29 based on Foata normal form. 0/783 useless extension candidates. Maximal degree in co-relation 598. Up to 142 conditions per place. 
[2025-02-06 09:33:05,666 INFO  L140   encePairwiseOnDemand]: 374/377 looper letters, 19 selfloop transitions, 2 changer transitions 0/351 dead transitions.
[2025-02-06 09:33:05,666 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 355 places, 351 transitions, 799 flow
[2025-02-06 09:33:05,667 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-06 09:33:05,667 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-02-06 09:33:05,668 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1072 transitions.
[2025-02-06 09:33:05,668 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.9478337754199824
[2025-02-06 09:33:05,669 INFO  L175             Difference]: Start difference. First operand has 357 places, 351 transitions, 756 flow. Second operand 3 states and 1072 transitions.
[2025-02-06 09:33:05,669 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 355 places, 351 transitions, 799 flow
[2025-02-06 09:33:05,670 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 353 places, 351 transitions, 791 flow, removed 0 selfloop flow, removed 2 redundant places.
[2025-02-06 09:33:05,673 INFO  L231             Difference]: Finished difference. Result has 353 places, 350 transitions, 750 flow
[2025-02-06 09:33:05,673 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=377, PETRI_DIFFERENCE_MINUEND_FLOW=746, PETRI_DIFFERENCE_MINUEND_PLACES=351, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=348, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=750, PETRI_PLACES=353, PETRI_TRANSITIONS=350}
[2025-02-06 09:33:05,673 INFO  L279   CegarLoopForPetriNet]: 362 programPoint places, -9 predicate places.
[2025-02-06 09:33:05,674 INFO  L471      AbstractCegarLoop]: Abstraction has has 353 places, 350 transitions, 750 flow
[2025-02-06 09:33:05,674 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 353.3333333333333) internal successors, (1060), 3 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-06 09:33:05,674 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-02-06 09:33:05,674 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-06 09:33:05,675 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-02-06 09:33:05,675 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err2ASSERT_VIOLATIONDATA_RACE (and 24 more)] ===
[2025-02-06 09:33:05,675 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 09:33:05,675 INFO  L85        PathProgramCache]: Analyzing trace with hash 1736703467, now seen corresponding path program 1 times
[2025-02-06 09:33:05,676 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 09:33:05,676 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30898236]
[2025-02-06 09:33:05,676 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 09:33:05,676 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 09:33:05,700 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 301 statements into 1 equivalence classes.
[2025-02-06 09:33:05,712 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 301 of 301 statements.
[2025-02-06 09:33:05,712 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 09:33:05,712 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 09:33:05,765 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-06 09:33:05,765 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 09:33:05,765 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30898236]
[2025-02-06 09:33:05,765 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30898236] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 09:33:05,766 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 09:33:05,766 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-06 09:33:05,766 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726983664]
[2025-02-06 09:33:05,766 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 09:33:05,766 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-06 09:33:05,767 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 09:33:05,767 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-06 09:33:05,767 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-06 09:33:05,792 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 349 out of 377
[2025-02-06 09:33:05,794 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 353 places, 350 transitions, 750 flow. Second operand  has 3 states, 3 states have (on average 353.6666666666667) internal successors, (1061), 3 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-06 09:33:05,794 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-02-06 09:33:05,794 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 349 of 377
[2025-02-06 09:33:05,794 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-02-06 09:33:05,880 INFO  L124   PetriNetUnfolderBase]: 71/763 cut-off events.
[2025-02-06 09:33:05,880 INFO  L125   PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES.
[2025-02-06 09:33:05,881 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1100 conditions, 763 events. 71/763 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2357 event pairs, 30 based on Foata normal form. 0/744 useless extension candidates. Maximal degree in co-relation 611. Up to 176 conditions per place. 
[2025-02-06 09:33:05,882 INFO  L140   encePairwiseOnDemand]: 374/377 looper letters, 23 selfloop transitions, 2 changer transitions 0/350 dead transitions.
[2025-02-06 09:33:05,882 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 354 places, 350 transitions, 801 flow
[2025-02-06 09:33:05,883 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-06 09:33:05,883 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-02-06 09:33:05,884 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1071 transitions.
[2025-02-06 09:33:05,885 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.946949602122016
[2025-02-06 09:33:05,885 INFO  L175             Difference]: Start difference. First operand has 353 places, 350 transitions, 750 flow. Second operand 3 states and 1071 transitions.
[2025-02-06 09:33:05,885 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 354 places, 350 transitions, 801 flow
[2025-02-06 09:33:05,886 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 352 places, 350 transitions, 797 flow, removed 0 selfloop flow, removed 2 redundant places.
[2025-02-06 09:33:05,889 INFO  L231             Difference]: Finished difference. Result has 352 places, 349 transitions, 748 flow
[2025-02-06 09:33:05,889 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=377, PETRI_DIFFERENCE_MINUEND_FLOW=744, PETRI_DIFFERENCE_MINUEND_PLACES=350, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=349, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=347, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=748, PETRI_PLACES=352, PETRI_TRANSITIONS=349}
[2025-02-06 09:33:05,890 INFO  L279   CegarLoopForPetriNet]: 362 programPoint places, -10 predicate places.
[2025-02-06 09:33:05,890 INFO  L471      AbstractCegarLoop]: Abstraction has has 352 places, 349 transitions, 748 flow
[2025-02-06 09:33:05,890 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 353.6666666666667) internal successors, (1061), 3 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-06 09:33:05,890 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-02-06 09:33:05,890 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-06 09:33:05,891 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-02-06 09:33:05,891 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err2ASSERT_VIOLATIONDATA_RACE (and 24 more)] ===
[2025-02-06 09:33:05,896 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 09:33:05,896 INFO  L85        PathProgramCache]: Analyzing trace with hash -170592985, now seen corresponding path program 1 times
[2025-02-06 09:33:05,896 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 09:33:05,896 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003497878]
[2025-02-06 09:33:05,896 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 09:33:05,896 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 09:33:05,928 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 315 statements into 1 equivalence classes.
[2025-02-06 09:33:05,940 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 315 of 315 statements.
[2025-02-06 09:33:05,940 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 09:33:05,940 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 09:33:06,080 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-06 09:33:06,081 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 09:33:06,081 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003497878]
[2025-02-06 09:33:06,081 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003497878] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 09:33:06,081 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 09:33:06,081 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-06 09:33:06,081 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243469465]
[2025-02-06 09:33:06,081 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 09:33:06,082 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-06 09:33:06,082 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 09:33:06,082 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-06 09:33:06,082 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-06 09:33:06,094 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 354 out of 377
[2025-02-06 09:33:06,096 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 352 places, 349 transitions, 748 flow. Second operand  has 5 states, 5 states have (on average 356.4) internal successors, (1782), 5 states have internal predecessors, (1782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-06 09:33:06,096 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-02-06 09:33:06,096 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 354 of 377
[2025-02-06 09:33:06,096 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-02-06 09:33:06,290 INFO  L124   PetriNetUnfolderBase]: 146/1208 cut-off events.
[2025-02-06 09:33:06,290 INFO  L125   PetriNetUnfolderBase]: For 105/106 co-relation queries the response was YES.
[2025-02-06 09:33:06,292 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1748 conditions, 1208 events. 146/1208 cut-off events. For 105/106 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 4939 event pairs, 34 based on Foata normal form. 7/1177 useless extension candidates. Maximal degree in co-relation 1150. Up to 127 conditions per place. 
[2025-02-06 09:33:06,294 INFO  L140   encePairwiseOnDemand]: 372/377 looper letters, 46 selfloop transitions, 5 changer transitions 0/381 dead transitions.
[2025-02-06 09:33:06,294 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 381 transitions, 944 flow
[2025-02-06 09:33:06,295 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-06 09:33:06,295 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2025-02-06 09:33:06,297 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2176 transitions.
[2025-02-06 09:33:06,298 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.9619805481874447
[2025-02-06 09:33:06,298 INFO  L175             Difference]: Start difference. First operand has 352 places, 349 transitions, 748 flow. Second operand 6 states and 2176 transitions.
[2025-02-06 09:33:06,298 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 381 transitions, 944 flow
[2025-02-06 09:33:06,299 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 381 transitions, 940 flow, removed 0 selfloop flow, removed 2 redundant places.
[2025-02-06 09:33:06,302 INFO  L231             Difference]: Finished difference. Result has 358 places, 352 transitions, 776 flow
[2025-02-06 09:33:06,303 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=377, PETRI_DIFFERENCE_MINUEND_FLOW=744, PETRI_DIFFERENCE_MINUEND_PLACES=350, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=349, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=344, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=776, PETRI_PLACES=358, PETRI_TRANSITIONS=352}
[2025-02-06 09:33:06,303 INFO  L279   CegarLoopForPetriNet]: 362 programPoint places, -4 predicate places.
[2025-02-06 09:33:06,303 INFO  L471      AbstractCegarLoop]: Abstraction has has 358 places, 352 transitions, 776 flow
[2025-02-06 09:33:06,304 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 356.4) internal successors, (1782), 5 states have internal predecessors, (1782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-06 09:33:06,304 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-02-06 09:33:06,304 INFO  L206   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 09:33:06,304 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-02-06 09:33:06,305 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err2ASSERT_VIOLATIONDATA_RACE (and 24 more)] ===
[2025-02-06 09:33:06,305 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 09:33:06,305 INFO  L85        PathProgramCache]: Analyzing trace with hash 1483381454, now seen corresponding path program 2 times
[2025-02-06 09:33:06,306 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 09:33:06,306 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851022312]
[2025-02-06 09:33:06,306 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-02-06 09:33:06,306 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 09:33:06,331 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 342 statements into 2 equivalence classes.
[2025-02-06 09:33:06,342 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 288 of 342 statements.
[2025-02-06 09:33:06,343 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2025-02-06 09:33:06,343 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 09:33:06,390 INFO  L134       CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked.
[2025-02-06 09:33:06,391 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 09:33:06,391 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851022312]
[2025-02-06 09:33:06,391 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851022312] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 09:33:06,391 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 09:33:06,391 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-06 09:33:06,391 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864890359]
[2025-02-06 09:33:06,391 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 09:33:06,391 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-06 09:33:06,392 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 09:33:06,392 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-06 09:33:06,392 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-06 09:33:06,425 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 350 out of 377
[2025-02-06 09:33:06,426 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 352 transitions, 776 flow. Second operand  has 3 states, 3 states have (on average 354.3333333333333) internal successors, (1063), 3 states have internal predecessors, (1063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-06 09:33:06,426 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-02-06 09:33:06,426 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 350 of 377
[2025-02-06 09:33:06,427 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-02-06 09:33:06,559 INFO  L124   PetriNetUnfolderBase]: 111/1060 cut-off events.
[2025-02-06 09:33:06,559 INFO  L125   PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES.
[2025-02-06 09:33:06,561 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1528 conditions, 1060 events. 111/1060 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 4058 event pairs, 39 based on Foata normal form. 0/1033 useless extension candidates. Maximal degree in co-relation 933. Up to 189 conditions per place. 
[2025-02-06 09:33:06,564 INFO  L140   encePairwiseOnDemand]: 374/377 looper letters, 23 selfloop transitions, 2 changer transitions 0/356 dead transitions.
[2025-02-06 09:33:06,564 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 356 transitions, 839 flow
[2025-02-06 09:33:06,566 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-06 09:33:06,566 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-02-06 09:33:06,567 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1076 transitions.
[2025-02-06 09:33:06,567 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.9513704686118479
[2025-02-06 09:33:06,567 INFO  L175             Difference]: Start difference. First operand has 358 places, 352 transitions, 776 flow. Second operand 3 states and 1076 transitions.
[2025-02-06 09:33:06,567 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 356 transitions, 839 flow
[2025-02-06 09:33:06,569 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 356 transitions, 833 flow, removed 1 selfloop flow, removed 2 redundant places.
[2025-02-06 09:33:06,572 INFO  L231             Difference]: Finished difference. Result has 357 places, 351 transitions, 772 flow
[2025-02-06 09:33:06,573 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=377, PETRI_DIFFERENCE_MINUEND_FLOW=768, PETRI_DIFFERENCE_MINUEND_PLACES=355, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=349, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=772, PETRI_PLACES=357, PETRI_TRANSITIONS=351}
[2025-02-06 09:33:06,574 INFO  L279   CegarLoopForPetriNet]: 362 programPoint places, -5 predicate places.
[2025-02-06 09:33:06,574 INFO  L471      AbstractCegarLoop]: Abstraction has has 357 places, 351 transitions, 772 flow
[2025-02-06 09:33:06,575 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 354.3333333333333) internal successors, (1063), 3 states have internal predecessors, (1063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-06 09:33:06,575 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-02-06 09:33:06,575 INFO  L206   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 09:33:06,575 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-02-06 09:33:06,576 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err2ASSERT_VIOLATIONDATA_RACE (and 24 more)] ===
[2025-02-06 09:33:06,576 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 09:33:06,577 INFO  L85        PathProgramCache]: Analyzing trace with hash -1666946333, now seen corresponding path program 1 times
[2025-02-06 09:33:06,577 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 09:33:06,577 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123574023]
[2025-02-06 09:33:06,577 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 09:33:06,577 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 09:33:06,601 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 347 statements into 1 equivalence classes.
[2025-02-06 09:33:06,615 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 347 of 347 statements.
[2025-02-06 09:33:06,615 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 09:33:06,615 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 09:33:06,692 INFO  L134       CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked.
[2025-02-06 09:33:06,692 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 09:33:06,692 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123574023]
[2025-02-06 09:33:06,692 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123574023] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 09:33:06,692 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 09:33:06,692 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-06 09:33:06,692 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882630221]
[2025-02-06 09:33:06,692 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 09:33:06,693 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-06 09:33:06,693 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 09:33:06,693 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-06 09:33:06,693 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-06 09:33:06,702 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 354 out of 377
[2025-02-06 09:33:06,703 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 351 transitions, 772 flow. Second operand  has 3 states, 3 states have (on average 357.0) internal successors, (1071), 3 states have internal predecessors, (1071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-06 09:33:06,703 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-02-06 09:33:06,703 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 354 of 377
[2025-02-06 09:33:06,703 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-02-06 09:33:06,841 INFO  L124   PetriNetUnfolderBase]: 98/1009 cut-off events.
[2025-02-06 09:33:06,841 INFO  L125   PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES.
[2025-02-06 09:33:06,842 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1433 conditions, 1009 events. 98/1009 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3567 event pairs, 29 based on Foata normal form. 0/985 useless extension candidates. Maximal degree in co-relation 1191. Up to 153 conditions per place. 
[2025-02-06 09:33:06,845 INFO  L140   encePairwiseOnDemand]: 374/377 looper letters, 20 selfloop transitions, 2 changer transitions 0/355 dead transitions.
[2025-02-06 09:33:06,845 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 355 transitions, 829 flow
[2025-02-06 09:33:06,845 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-06 09:33:06,845 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-02-06 09:33:06,846 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1085 transitions.
[2025-02-06 09:33:06,847 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.9593280282935456
[2025-02-06 09:33:06,847 INFO  L175             Difference]: Start difference. First operand has 357 places, 351 transitions, 772 flow. Second operand 3 states and 1085 transitions.
[2025-02-06 09:33:06,847 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 358 places, 355 transitions, 829 flow
[2025-02-06 09:33:06,849 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 355 transitions, 825 flow, removed 0 selfloop flow, removed 2 redundant places.
[2025-02-06 09:33:06,852 INFO  L231             Difference]: Finished difference. Result has 356 places, 350 transitions, 770 flow
[2025-02-06 09:33:06,852 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=377, PETRI_DIFFERENCE_MINUEND_FLOW=766, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=348, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=770, PETRI_PLACES=356, PETRI_TRANSITIONS=350}
[2025-02-06 09:33:06,852 INFO  L279   CegarLoopForPetriNet]: 362 programPoint places, -6 predicate places.
[2025-02-06 09:33:06,852 INFO  L471      AbstractCegarLoop]: Abstraction has has 356 places, 350 transitions, 770 flow
[2025-02-06 09:33:06,853 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 357.0) internal successors, (1071), 3 states have internal predecessors, (1071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-06 09:33:06,853 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-02-06 09:33:06,853 INFO  L206   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 09:33:06,854 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-02-06 09:33:06,854 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err2ASSERT_VIOLATIONDATA_RACE (and 24 more)] ===
[2025-02-06 09:33:06,855 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 09:33:06,855 INFO  L85        PathProgramCache]: Analyzing trace with hash 60415503, now seen corresponding path program 1 times
[2025-02-06 09:33:06,855 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 09:33:06,855 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837168794]
[2025-02-06 09:33:06,855 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 09:33:06,855 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 09:33:06,887 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 363 statements into 1 equivalence classes.
[2025-02-06 09:33:06,897 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 363 of 363 statements.
[2025-02-06 09:33:06,897 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 09:33:06,897 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 09:33:07,020 INFO  L134       CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked.
[2025-02-06 09:33:07,021 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 09:33:07,021 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837168794]
[2025-02-06 09:33:07,021 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837168794] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 09:33:07,021 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 09:33:07,021 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-06 09:33:07,021 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653483243]
[2025-02-06 09:33:07,021 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 09:33:07,022 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-06 09:33:07,022 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 09:33:07,022 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-06 09:33:07,022 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-06 09:33:07,028 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 354 out of 377
[2025-02-06 09:33:07,030 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 350 transitions, 770 flow. Second operand  has 5 states, 5 states have (on average 356.8) internal successors, (1784), 5 states have internal predecessors, (1784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-06 09:33:07,030 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-02-06 09:33:07,030 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 354 of 377
[2025-02-06 09:33:07,030 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-02-06 09:33:07,296 INFO  L124   PetriNetUnfolderBase]: 275/2010 cut-off events.
[2025-02-06 09:33:07,296 INFO  L125   PetriNetUnfolderBase]: For 127/140 co-relation queries the response was YES.
[2025-02-06 09:33:07,299 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3059 conditions, 2010 events. 275/2010 cut-off events. For 127/140 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 10663 event pairs, 74 based on Foata normal form. 21/1971 useless extension candidates. Maximal degree in co-relation 3010. Up to 298 conditions per place. 
[2025-02-06 09:33:07,303 INFO  L140   encePairwiseOnDemand]: 372/377 looper letters, 44 selfloop transitions, 5 changer transitions 0/381 dead transitions.
[2025-02-06 09:33:07,303 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 381 transitions, 956 flow
[2025-02-06 09:33:07,303 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-06 09:33:07,303 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2025-02-06 09:33:07,306 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2175 transitions.
[2025-02-06 09:33:07,307 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.9615384615384616
[2025-02-06 09:33:07,307 INFO  L175             Difference]: Start difference. First operand has 356 places, 350 transitions, 770 flow. Second operand 6 states and 2175 transitions.
[2025-02-06 09:33:07,307 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 361 places, 381 transitions, 956 flow
[2025-02-06 09:33:07,309 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 381 transitions, 952 flow, removed 0 selfloop flow, removed 2 redundant places.
[2025-02-06 09:33:07,311 INFO  L231             Difference]: Finished difference. Result has 362 places, 354 transitions, 800 flow
[2025-02-06 09:33:07,312 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=377, PETRI_DIFFERENCE_MINUEND_FLOW=766, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=346, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=800, PETRI_PLACES=362, PETRI_TRANSITIONS=354}
[2025-02-06 09:33:07,312 INFO  L279   CegarLoopForPetriNet]: 362 programPoint places, 0 predicate places.
[2025-02-06 09:33:07,313 INFO  L471      AbstractCegarLoop]: Abstraction has has 362 places, 354 transitions, 800 flow
[2025-02-06 09:33:07,313 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 356.8) internal successors, (1784), 5 states have internal predecessors, (1784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-06 09:33:07,313 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-02-06 09:33:07,314 INFO  L206   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 09:33:07,314 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-02-06 09:33:07,314 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err2ASSERT_VIOLATIONDATA_RACE (and 24 more)] ===
[2025-02-06 09:33:07,315 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 09:33:07,315 INFO  L85        PathProgramCache]: Analyzing trace with hash 569067212, now seen corresponding path program 2 times
[2025-02-06 09:33:07,315 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 09:33:07,315 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223708262]
[2025-02-06 09:33:07,315 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-02-06 09:33:07,315 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 09:33:07,342 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 383 statements into 2 equivalence classes.
[2025-02-06 09:33:07,351 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 336 of 383 statements.
[2025-02-06 09:33:07,351 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2025-02-06 09:33:07,351 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 09:33:07,401 INFO  L134       CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked.
[2025-02-06 09:33:07,401 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 09:33:07,401 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223708262]
[2025-02-06 09:33:07,401 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223708262] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 09:33:07,402 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 09:33:07,402 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-06 09:33:07,402 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844961641]
[2025-02-06 09:33:07,402 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 09:33:07,402 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-06 09:33:07,403 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 09:33:07,403 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-06 09:33:07,403 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-06 09:33:07,412 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 356 out of 377
[2025-02-06 09:33:07,413 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 354 transitions, 800 flow. Second operand  has 3 states, 3 states have (on average 359.6666666666667) internal successors, (1079), 3 states have internal predecessors, (1079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-06 09:33:07,413 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-02-06 09:33:07,413 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 356 of 377
[2025-02-06 09:33:07,414 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-02-06 09:33:07,612 INFO  L124   PetriNetUnfolderBase]: 119/1509 cut-off events.
[2025-02-06 09:33:07,612 INFO  L125   PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES.
[2025-02-06 09:33:07,616 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2196 conditions, 1509 events. 119/1509 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 7167 event pairs, 44 based on Foata normal form. 1/1484 useless extension candidates. Maximal degree in co-relation 1570. Up to 228 conditions per place. 
[2025-02-06 09:33:07,617 INFO  L140   encePairwiseOnDemand]: 375/377 looper letters, 0 selfloop transitions, 0 changer transitions 353/353 dead transitions.
[2025-02-06 09:33:07,617 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 353 transitions, 826 flow
[2025-02-06 09:33:07,618 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-06 09:33:07,618 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-02-06 09:33:07,619 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1083 transitions.
[2025-02-06 09:33:07,620 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.9575596816976127
[2025-02-06 09:33:07,620 INFO  L175             Difference]: Start difference. First operand has 362 places, 354 transitions, 800 flow. Second operand 3 states and 1083 transitions.
[2025-02-06 09:33:07,620 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 353 transitions, 826 flow
[2025-02-06 09:33:07,622 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 353 transitions, 826 flow, removed 0 selfloop flow, removed 0 redundant places.
[2025-02-06 09:33:07,623 INFO  L231             Difference]: Finished difference. Result has 363 places, 0 transitions, 0 flow
[2025-02-06 09:33:07,624 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=377, PETRI_DIFFERENCE_MINUEND_FLOW=798, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=363, PETRI_TRANSITIONS=0}
[2025-02-06 09:33:07,624 INFO  L279   CegarLoopForPetriNet]: 362 programPoint places, 1 predicate places.
[2025-02-06 09:33:07,624 INFO  L471      AbstractCegarLoop]: Abstraction has has 363 places, 0 transitions, 0 flow
[2025-02-06 09:33:07,625 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 359.6666666666667) internal successors, (1079), 3 states have internal predecessors, (1079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-06 09:33:07,627 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (27 of 28 remaining)
[2025-02-06 09:33:07,627 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (26 of 28 remaining)
[2025-02-06 09:33:07,627 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (25 of 28 remaining)
[2025-02-06 09:33:07,627 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (24 of 28 remaining)
[2025-02-06 09:33:07,627 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (23 of 28 remaining)
[2025-02-06 09:33:07,628 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (22 of 28 remaining)
[2025-02-06 09:33:07,628 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (21 of 28 remaining)
[2025-02-06 09:33:07,628 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (20 of 28 remaining)
[2025-02-06 09:33:07,628 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (19 of 28 remaining)
[2025-02-06 09:33:07,628 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (18 of 28 remaining)
[2025-02-06 09:33:07,628 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (17 of 28 remaining)
[2025-02-06 09:33:07,628 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (16 of 28 remaining)
[2025-02-06 09:33:07,628 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (15 of 28 remaining)
[2025-02-06 09:33:07,628 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (14 of 28 remaining)
[2025-02-06 09:33:07,629 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (13 of 28 remaining)
[2025-02-06 09:33:07,629 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 28 remaining)
[2025-02-06 09:33:07,629 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 28 remaining)
[2025-02-06 09:33:07,629 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (10 of 28 remaining)
[2025-02-06 09:33:07,629 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (9 of 28 remaining)
[2025-02-06 09:33:07,629 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (8 of 28 remaining)
[2025-02-06 09:33:07,629 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (7 of 28 remaining)
[2025-02-06 09:33:07,629 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (6 of 28 remaining)
[2025-02-06 09:33:07,629 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (5 of 28 remaining)
[2025-02-06 09:33:07,629 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (4 of 28 remaining)
[2025-02-06 09:33:07,629 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (3 of 28 remaining)
[2025-02-06 09:33:07,629 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (2 of 28 remaining)
[2025-02-06 09:33:07,629 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (1 of 28 remaining)
[2025-02-06 09:33:07,629 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (0 of 28 remaining)
[2025-02-06 09:33:07,630 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-02-06 09:33:07,630 INFO  L422         BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-06 09:33:07,634 INFO  L241   ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2025-02-06 09:33:07,634 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2025-02-06 09:33:07,641 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 09:33:07 BasicIcfg
[2025-02-06 09:33:07,641 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-02-06 09:33:07,641 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2025-02-06 09:33:07,641 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2025-02-06 09:33:07,641 INFO  L274        PluginConnector]: Witness Printer initialized
[2025-02-06 09:33:07,642 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:33:01" (3/4) ...
[2025-02-06 09:33:07,643 INFO  L146         WitnessPrinter]: Generating witness for correct program
[2025-02-06 09:33:07,645 INFO  L385     IcfgBacktranslator]: Ignoring RootEdge to procedure thread1
[2025-02-06 09:33:07,645 INFO  L385     IcfgBacktranslator]: Ignoring RootEdge to procedure thread2
[2025-02-06 09:33:07,652 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges
[2025-02-06 09:33:07,652 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges
[2025-02-06 09:33:07,652 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges
[2025-02-06 09:33:07,653 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges
[2025-02-06 09:33:07,728 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml
[2025-02-06 09:33:07,728 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml
[2025-02-06 09:33:07,728 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2025-02-06 09:33:07,729 INFO  L158              Benchmark]: Toolchain (without parser) took 6961.97ms. Allocated memory was 167.8MB in the beginning and 377.5MB in the end (delta: 209.7MB). Free memory was 133.2MB in the beginning and 335.2MB in the end (delta: -202.0MB). Peak memory consumption was 226.7MB. Max. memory is 16.1GB.
[2025-02-06 09:33:07,729 INFO  L158              Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory was 126.2MB in the beginning and 125.9MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB.
[2025-02-06 09:33:07,729 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 412.19ms. Allocated memory is still 167.8MB. Free memory was 132.7MB in the beginning and 104.9MB in the end (delta: 27.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
[2025-02-06 09:33:07,730 INFO  L158              Benchmark]: Boogie Procedure Inliner took 39.61ms. Allocated memory is still 167.8MB. Free memory was 104.9MB in the beginning and 102.4MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2025-02-06 09:33:07,730 INFO  L158              Benchmark]: Boogie Preprocessor took 23.91ms. Allocated memory is still 167.8MB. Free memory was 102.4MB in the beginning and 100.1MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB.
[2025-02-06 09:33:07,730 INFO  L158              Benchmark]: IcfgBuilder took 496.58ms. Allocated memory is still 167.8MB. Free memory was 100.1MB in the beginning and 72.6MB in the end (delta: 27.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
[2025-02-06 09:33:07,730 INFO  L158              Benchmark]: TraceAbstraction took 5896.28ms. Allocated memory was 167.8MB in the beginning and 377.5MB in the end (delta: 209.7MB). Free memory was 71.7MB in the beginning and 124.1MB in the end (delta: -52.4MB). Peak memory consumption was 159.5MB. Max. memory is 16.1GB.
[2025-02-06 09:33:07,730 INFO  L158              Benchmark]: Witness Printer took 87.16ms. Allocated memory is still 377.5MB. Free memory was 124.1MB in the beginning and 335.2MB in the end (delta: -211.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2025-02-06 09:33:07,731 INFO  L338   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory was 126.2MB in the beginning and 125.9MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 412.19ms. Allocated memory is still 167.8MB. Free memory was 132.7MB in the beginning and 104.9MB in the end (delta: 27.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 39.61ms. Allocated memory is still 167.8MB. Free memory was 104.9MB in the beginning and 102.4MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 23.91ms. Allocated memory is still 167.8MB. Free memory was 102.4MB in the beginning and 100.1MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB.
 * IcfgBuilder took 496.58ms. Allocated memory is still 167.8MB. Free memory was 100.1MB in the beginning and 72.6MB in the end (delta: 27.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
 * TraceAbstraction took 5896.28ms. Allocated memory was 167.8MB in the beginning and 377.5MB in the end (delta: 209.7MB). Free memory was 71.7MB in the beginning and 124.1MB in the end (delta: -52.4MB). Peak memory consumption was 159.5MB. Max. memory is 16.1GB.
 * Witness Printer took 87.16ms. Allocated memory is still 377.5MB. Free memory was 124.1MB in the beginning and 335.2MB in the end (delta: -211.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - PositiveResult [Line: 880]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 882]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 882]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 902]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 894]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 896]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 902]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 896]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 903]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 897]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 897]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 908]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 909]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 917]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 918]: there are no data races
    For all program executions holds that there are no data races at this location
  - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
    CFG has 5 procedures, 457 locations, 28 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 5.8s, OverallIterations: 15, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 496 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 233 mSDsluCounter, 104 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11 mSDsCounter, 37 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 852 IncrementalHoareTripleChecker+Invalid, 889 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 37 mSolverCounterUnsat, 93 mSDtfsCounter, 852 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=886occurred in iteration=6, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 4469 NumberOfCodeBlocks, 4368 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 4454 ConstructedInterpolants, 0 QuantifiedInterpolants, 4718 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 129/129 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available
  - AllSpecificationsHoldResult: All specifications hold
    15 specifications checked. All of them hold
RESULT: Ultimate proved your program to be correct!
[2025-02-06 09:33:07,749 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
--- End real Ultimate output ---

Execution finished normally
Writing output log to file Ultimate.log
Result:
TRUE