./Ultimate.py --spec /mnt/goblint-svcomp/goblint-bench/bench/concrat/properties/no-data-race.prp --file /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct-tid-join.i --full-output --architecture 32bit


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


Checking for data races
Using default analysis
Version 0e0057cc
Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data -tc /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/config/AutomizerReach.xml -i /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct-tid-join.i -s /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /mnt/goblint-svcomp/benchexec/tools-pldi24/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 69187aa9c34da6f8049b900330a58db2edffb8545f28d350ef716aef0984845f
--- Real Ultimate output ---
This is Ultimate 0.2.4-dev-0e0057c
[2024-03-09 06:13:14,073 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-03-09 06:13:14,110 INFO  L114        SettingsManager]: Loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2024-03-09 06:13:14,113 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-03-09 06:13:14,114 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-03-09 06:13:14,128 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-03-09 06:13:14,128 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-03-09 06:13:14,128 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-03-09 06:13:14,129 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-03-09 06:13:14,129 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-03-09 06:13:14,130 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-03-09 06:13:14,130 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-03-09 06:13:14,130 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-03-09 06:13:14,130 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-03-09 06:13:14,131 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-03-09 06:13:14,131 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-03-09 06:13:14,131 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-03-09 06:13:14,132 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-03-09 06:13:14,132 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-03-09 06:13:14,132 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-03-09 06:13:14,132 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-03-09 06:13:14,133 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-03-09 06:13:14,133 INFO  L153        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2024-03-09 06:13:14,133 INFO  L153        SettingsManager]:  * Check unreachability of reach_error function=false
[2024-03-09 06:13:14,133 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-03-09 06:13:14,133 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-03-09 06:13:14,134 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-03-09 06:13:14,134 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-03-09 06:13:14,134 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-03-09 06:13:14,134 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-03-09 06:13:14,134 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-03-09 06:13:14,135 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-03-09 06:13:14,135 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-03-09 06:13:14,135 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-03-09 06:13:14,135 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-03-09 06:13:14,135 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-03-09 06:13:14,136 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-03-09 06:13:14,136 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-03-09 06:13:14,136 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-03-09 06:13:14,136 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-03-09 06:13:14,136 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-03-09 06:13:14,137 INFO  L153        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
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 -> /mnt/goblint-svcomp/benchexec/tools-pldi24/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 -> 69187aa9c34da6f8049b900330a58db2edffb8545f28d350ef716aef0984845f
[2024-03-09 06:13:14,309 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-03-09 06:13:14,333 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-03-09 06:13:14,335 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-03-09 06:13:14,336 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-03-09 06:13:14,337 INFO  L274        PluginConnector]: CDTParser initialized
[2024-03-09 06:13:14,339 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct-tid-join.i
[2024-03-09 06:13:15,438 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-03-09 06:13:15,617 INFO  L384              CDTParser]: Found 1 translation units.
[2024-03-09 06:13:15,618 INFO  L180              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct-tid-join.i
[2024-03-09 06:13:15,629 INFO  L427              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data/d07e438a6/00c306869de54b4d93850727bf8f5b8f/FLAGdfe33fcfb
[2024-03-09 06:13:15,644 INFO  L435              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data/d07e438a6/00c306869de54b4d93850727bf8f5b8f
[2024-03-09 06:13:15,647 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-03-09 06:13:15,648 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-03-09 06:13:15,650 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-03-09 06:13:15,650 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-03-09 06:13:15,656 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-03-09 06:13:15,656 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:13:15" (1/1) ...
[2024-03-09 06:13:15,657 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4175dc11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:13:15, skipping insertion in model container
[2024-03-09 06:13:15,657 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:13:15" (1/1) ...
[2024-03-09 06:13:15,692 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-03-09 06:13:16,001 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2024-03-09 06:13:16,011 INFO  L202         MainTranslator]: Completed pre-run
[2024-03-09 06:13:16,038 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2024-03-09 06:13:16,073 INFO  L206         MainTranslator]: Completed translation
[2024-03-09 06:13:16,073 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:13:16 WrapperNode
[2024-03-09 06:13:16,074 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-03-09 06:13:16,074 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-03-09 06:13:16,074 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-03-09 06:13:16,075 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-03-09 06:13:16,080 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:13:16" (1/1) ...
[2024-03-09 06:13:16,101 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:13:16" (1/1) ...
[2024-03-09 06:13:16,120 INFO  L138                Inliner]: procedures = 267, calls = 21, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 86
[2024-03-09 06:13:16,120 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-03-09 06:13:16,121 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-03-09 06:13:16,121 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-03-09 06:13:16,121 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-03-09 06:13:16,134 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:13:16" (1/1) ...
[2024-03-09 06:13:16,134 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:13:16" (1/1) ...
[2024-03-09 06:13:16,137 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:13:16" (1/1) ...
[2024-03-09 06:13:16,137 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:13:16" (1/1) ...
[2024-03-09 06:13:16,143 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:13:16" (1/1) ...
[2024-03-09 06:13:16,146 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:13:16" (1/1) ...
[2024-03-09 06:13:16,147 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:13:16" (1/1) ...
[2024-03-09 06:13:16,148 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:13:16" (1/1) ...
[2024-03-09 06:13:16,150 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-03-09 06:13:16,151 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-03-09 06:13:16,151 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-03-09 06:13:16,151 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-03-09 06:13:16,152 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:13:16" (1/1) ...
[2024-03-09 06:13:16,156 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-03-09 06:13:16,164 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 06:13:16,177 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-03-09 06:13:16,182 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-03-09 06:13:16,205 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2024-03-09 06:13:16,205 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-03-09 06:13:16,205 INFO  L130     BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock
[2024-03-09 06:13:16,205 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2024-03-09 06:13:16,205 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2024-03-09 06:13:16,205 INFO  L130     BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock
[2024-03-09 06:13:16,205 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2024-03-09 06:13:16,206 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-03-09 06:13:16,206 INFO  L130     BoogieDeclarations]: Found specification of procedure write~$Pointer$
[2024-03-09 06:13:16,206 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2024-03-09 06:13:16,206 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2024-03-09 06:13:16,206 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2024-03-09 06:13:16,206 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-03-09 06:13:16,206 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-03-09 06:13:16,207 WARN  L213             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-03-09 06:13:16,345 INFO  L241             CfgBuilder]: Building ICFG
[2024-03-09 06:13:16,347 INFO  L267             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-03-09 06:13:16,526 INFO  L282             CfgBuilder]: Performing block encoding
[2024-03-09 06:13:16,540 INFO  L304             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-03-09 06:13:16,540 INFO  L309             CfgBuilder]: Removed 2 assume(true) statements.
[2024-03-09 06:13:16,541 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.03 06:13:16 BoogieIcfgContainer
[2024-03-09 06:13:16,541 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-03-09 06:13:16,543 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-03-09 06:13:16,543 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-03-09 06:13:16,545 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-03-09 06:13:16,545 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 06:13:15" (1/3) ...
[2024-03-09 06:13:16,546 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6faf08fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 06:13:16, skipping insertion in model container
[2024-03-09 06:13:16,546 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:13:16" (2/3) ...
[2024-03-09 06:13:16,546 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6faf08fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 06:13:16, skipping insertion in model container
[2024-03-09 06:13:16,546 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.03 06:13:16" (3/3) ...
[2024-03-09 06:13:16,547 INFO  L112   eAbstractionObserver]: Analyzing ICFG per-thread-struct-tid-join.i
[2024-03-09 06:13:16,553 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2024-03-09 06:13:16,560 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-03-09 06:13:16,560 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations.
[2024-03-09 06:13:16,561 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-03-09 06:13:16,601 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2024-03-09 06:13:16,624 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 111 places, 112 transitions, 231 flow
[2024-03-09 06:13:16,668 INFO  L124   PetriNetUnfolderBase]: 6/158 cut-off events.
[2024-03-09 06:13:16,668 INFO  L125   PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES.
[2024-03-09 06:13:16,672 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 163 conditions, 158 events. 6/158 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 256 event pairs, 0 based on Foata normal form. 0/139 useless extension candidates. Maximal degree in co-relation 74. Up to 4 conditions per place. 
[2024-03-09 06:13:16,673 INFO  L82        GeneralOperation]: Start removeDead. Operand has 111 places, 112 transitions, 231 flow
[2024-03-09 06:13:16,676 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 111 places, 112 transitions, 231 flow
[2024-03-09 06:13:16,683 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-09 06:13:16,688 INFO  L357      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, mHoare=true, 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;@47f4dfca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-03-09 06:13:16,689 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 8 error locations.
[2024-03-09 06:13:16,697 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-03-09 06:13:16,697 INFO  L124   PetriNetUnfolderBase]: 3/50 cut-off events.
[2024-03-09 06:13:16,697 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-03-09 06:13:16,697 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:13:16,698 INFO  L208   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]
[2024-03-09 06:13:16,698 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-09 06:13:16,702 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:13:16,702 INFO  L85        PathProgramCache]: Analyzing trace with hash 1678757547, now seen corresponding path program 1 times
[2024-03-09 06:13:16,709 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:13:16,710 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555030014]
[2024-03-09 06:13:16,710 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:13:16,710 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:13:16,794 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:13:16,878 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:13:16,878 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:13:16,879 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555030014]
[2024-03-09 06:13:16,880 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555030014] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:13:16,880 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:13:16,880 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-09 06:13:16,881 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504285839]
[2024-03-09 06:13:16,882 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:13:16,888 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 06:13:16,892 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:13:16,912 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 06:13:16,912 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 06:13:16,926 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 101 out of 112
[2024-03-09 06:13:16,929 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 112 transitions, 231 flow. Second operand  has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 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)
[2024-03-09 06:13:16,929 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:13:16,929 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 112
[2024-03-09 06:13:16,930 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:13:17,019 INFO  L124   PetriNetUnfolderBase]: 8/196 cut-off events.
[2024-03-09 06:13:17,019 INFO  L125   PetriNetUnfolderBase]: For 4/7 co-relation queries the response was YES.
[2024-03-09 06:13:17,020 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 230 conditions, 196 events. 8/196 cut-off events. For 4/7 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 486 event pairs, 1 based on Foata normal form. 9/185 useless extension candidates. Maximal degree in co-relation 133. Up to 16 conditions per place. 
[2024-03-09 06:13:17,021 INFO  L140   encePairwiseOnDemand]: 105/112 looper letters, 8 selfloop transitions, 3 changer transitions 2/113 dead transitions.
[2024-03-09 06:13:17,022 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 113 transitions, 257 flow
[2024-03-09 06:13:17,023 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 06:13:17,025 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 06:13:17,030 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 319 transitions.
[2024-03-09 06:13:17,032 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9494047619047619
[2024-03-09 06:13:17,033 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 319 transitions.
[2024-03-09 06:13:17,033 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 319 transitions.
[2024-03-09 06:13:17,034 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:13:17,036 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 319 transitions.
[2024-03-09 06:13:17,038 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 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)
[2024-03-09 06:13:17,042 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 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)
[2024-03-09 06:13:17,042 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 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)
[2024-03-09 06:13:17,044 INFO  L175             Difference]: Start difference. First operand has 111 places, 112 transitions, 231 flow. Second operand 3 states and 319 transitions.
[2024-03-09 06:13:17,044 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 113 transitions, 257 flow
[2024-03-09 06:13:17,047 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 113 transitions, 257 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-09 06:13:17,049 INFO  L231             Difference]: Finished difference. Result has 115 places, 110 transitions, 245 flow
[2024-03-09 06:13:17,050 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=245, PETRI_PLACES=115, PETRI_TRANSITIONS=110}
[2024-03-09 06:13:17,053 INFO  L281   CegarLoopForPetriNet]: 111 programPoint places, 4 predicate places.
[2024-03-09 06:13:17,054 INFO  L495      AbstractCegarLoop]: Abstraction has has 115 places, 110 transitions, 245 flow
[2024-03-09 06:13:17,054 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 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)
[2024-03-09 06:13:17,054 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:13:17,054 INFO  L208   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]
[2024-03-09 06:13:17,054 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-03-09 06:13:17,055 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-09 06:13:17,055 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:13:17,055 INFO  L85        PathProgramCache]: Analyzing trace with hash -486785488, now seen corresponding path program 1 times
[2024-03-09 06:13:17,056 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:13:17,056 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433636319]
[2024-03-09 06:13:17,056 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:13:17,056 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:13:17,082 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:13:17,189 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:13:17,189 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:13:17,190 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433636319]
[2024-03-09 06:13:17,190 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433636319] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:13:17,190 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:13:17,190 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 06:13:17,190 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919959452]
[2024-03-09 06:13:17,190 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:13:17,191 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-03-09 06:13:17,192 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:13:17,192 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-03-09 06:13:17,192 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-03-09 06:13:17,346 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 94 out of 112
[2024-03-09 06:13:17,347 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 110 transitions, 245 flow. Second operand  has 5 states, 5 states have (on average 95.4) internal successors, (477), 5 states have internal predecessors, (477), 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)
[2024-03-09 06:13:17,347 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:13:17,347 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 112
[2024-03-09 06:13:17,348 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:13:17,407 INFO  L124   PetriNetUnfolderBase]: 17/278 cut-off events.
[2024-03-09 06:13:17,407 INFO  L125   PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES.
[2024-03-09 06:13:17,408 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 368 conditions, 278 events. 17/278 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 952 event pairs, 7 based on Foata normal form. 1/257 useless extension candidates. Maximal degree in co-relation 266. Up to 49 conditions per place. 
[2024-03-09 06:13:17,409 INFO  L140   encePairwiseOnDemand]: 104/112 looper letters, 15 selfloop transitions, 2 changer transitions 5/117 dead transitions.
[2024-03-09 06:13:17,409 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 117 transitions, 303 flow
[2024-03-09 06:13:17,409 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 06:13:17,410 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 06:13:17,411 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 587 transitions.
[2024-03-09 06:13:17,412 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8735119047619048
[2024-03-09 06:13:17,412 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 587 transitions.
[2024-03-09 06:13:17,412 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 587 transitions.
[2024-03-09 06:13:17,413 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:13:17,413 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 587 transitions.
[2024-03-09 06:13:17,414 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 97.83333333333333) internal successors, (587), 6 states have internal predecessors, (587), 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)
[2024-03-09 06:13:17,417 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 112.0) internal successors, (784), 7 states have internal predecessors, (784), 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)
[2024-03-09 06:13:17,417 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 112.0) internal successors, (784), 7 states have internal predecessors, (784), 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)
[2024-03-09 06:13:17,417 INFO  L175             Difference]: Start difference. First operand has 115 places, 110 transitions, 245 flow. Second operand 6 states and 587 transitions.
[2024-03-09 06:13:17,417 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 117 transitions, 303 flow
[2024-03-09 06:13:17,419 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 117 transitions, 297 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-09 06:13:17,421 INFO  L231             Difference]: Finished difference. Result has 121 places, 110 transitions, 257 flow
[2024-03-09 06:13:17,421 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=257, PETRI_PLACES=121, PETRI_TRANSITIONS=110}
[2024-03-09 06:13:17,422 INFO  L281   CegarLoopForPetriNet]: 111 programPoint places, 10 predicate places.
[2024-03-09 06:13:17,422 INFO  L495      AbstractCegarLoop]: Abstraction has has 121 places, 110 transitions, 257 flow
[2024-03-09 06:13:17,422 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 95.4) internal successors, (477), 5 states have internal predecessors, (477), 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)
[2024-03-09 06:13:17,423 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:13:17,423 INFO  L208   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]
[2024-03-09 06:13:17,423 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-03-09 06:13:17,423 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-09 06:13:17,424 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:13:17,424 INFO  L85        PathProgramCache]: Analyzing trace with hash -1518449972, now seen corresponding path program 1 times
[2024-03-09 06:13:17,424 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:13:17,424 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972832190]
[2024-03-09 06:13:17,424 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:13:17,424 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:13:17,442 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:13:17,714 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:13:17,714 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:13:17,714 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972832190]
[2024-03-09 06:13:17,714 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972832190] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:13:17,715 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:13:17,715 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 06:13:17,715 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738663562]
[2024-03-09 06:13:17,715 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:13:17,715 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 06:13:17,716 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:13:17,716 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 06:13:17,716 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 06:13:17,858 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 79 out of 112
[2024-03-09 06:13:17,858 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 110 transitions, 257 flow. Second operand  has 6 states, 6 states have (on average 80.5) internal successors, (483), 6 states have internal predecessors, (483), 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)
[2024-03-09 06:13:17,858 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:13:17,859 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 112
[2024-03-09 06:13:17,859 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:13:17,948 INFO  L124   PetriNetUnfolderBase]: 38/336 cut-off events.
[2024-03-09 06:13:17,948 INFO  L125   PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES.
[2024-03-09 06:13:17,949 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 509 conditions, 336 events. 38/336 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1438 event pairs, 27 based on Foata normal form. 0/303 useless extension candidates. Maximal degree in co-relation 411. Up to 93 conditions per place. 
[2024-03-09 06:13:17,950 INFO  L140   encePairwiseOnDemand]: 106/112 looper letters, 32 selfloop transitions, 5 changer transitions 0/117 dead transitions.
[2024-03-09 06:13:17,950 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 117 transitions, 345 flow
[2024-03-09 06:13:17,951 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 06:13:17,951 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 06:13:17,952 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 512 transitions.
[2024-03-09 06:13:17,952 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.7619047619047619
[2024-03-09 06:13:17,952 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 512 transitions.
[2024-03-09 06:13:17,952 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 512 transitions.
[2024-03-09 06:13:17,953 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:13:17,953 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 512 transitions.
[2024-03-09 06:13:17,954 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 85.33333333333333) internal successors, (512), 6 states have internal predecessors, (512), 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)
[2024-03-09 06:13:17,956 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 112.0) internal successors, (784), 7 states have internal predecessors, (784), 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)
[2024-03-09 06:13:17,956 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 112.0) internal successors, (784), 7 states have internal predecessors, (784), 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)
[2024-03-09 06:13:17,956 INFO  L175             Difference]: Start difference. First operand has 121 places, 110 transitions, 257 flow. Second operand 6 states and 512 transitions.
[2024-03-09 06:13:17,956 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 117 transitions, 345 flow
[2024-03-09 06:13:17,958 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 117 transitions, 331 flow, removed 5 selfloop flow, removed 5 redundant places.
[2024-03-09 06:13:17,960 INFO  L231             Difference]: Finished difference. Result has 117 places, 109 transitions, 251 flow
[2024-03-09 06:13:17,961 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=251, PETRI_PLACES=117, PETRI_TRANSITIONS=109}
[2024-03-09 06:13:17,961 INFO  L281   CegarLoopForPetriNet]: 111 programPoint places, 6 predicate places.
[2024-03-09 06:13:17,962 INFO  L495      AbstractCegarLoop]: Abstraction has has 117 places, 109 transitions, 251 flow
[2024-03-09 06:13:17,962 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 80.5) internal successors, (483), 6 states have internal predecessors, (483), 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)
[2024-03-09 06:13:17,962 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:13:17,962 INFO  L208   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]
[2024-03-09 06:13:17,962 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-03-09 06:13:17,963 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-09 06:13:17,963 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:13:17,964 INFO  L85        PathProgramCache]: Analyzing trace with hash -1524640108, now seen corresponding path program 1 times
[2024-03-09 06:13:17,964 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:13:17,964 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845633664]
[2024-03-09 06:13:17,964 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:13:17,964 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:13:17,982 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:13:18,003 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:13:18,003 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:13:18,003 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845633664]
[2024-03-09 06:13:18,004 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845633664] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:13:18,004 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:13:18,004 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-09 06:13:18,004 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975798004]
[2024-03-09 06:13:18,004 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:13:18,004 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 06:13:18,005 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:13:18,005 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 06:13:18,005 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 06:13:18,014 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 99 out of 112
[2024-03-09 06:13:18,015 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 109 transitions, 251 flow. Second operand  has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 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)
[2024-03-09 06:13:18,015 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:13:18,015 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 112
[2024-03-09 06:13:18,015 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:13:18,040 INFO  L124   PetriNetUnfolderBase]: 5/204 cut-off events.
[2024-03-09 06:13:18,040 INFO  L125   PetriNetUnfolderBase]: For 12/24 co-relation queries the response was YES.
[2024-03-09 06:13:18,040 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 275 conditions, 204 events. 5/204 cut-off events. For 12/24 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 559 event pairs, 3 based on Foata normal form. 1/191 useless extension candidates. Maximal degree in co-relation 211. Up to 25 conditions per place. 
[2024-03-09 06:13:18,041 INFO  L140   encePairwiseOnDemand]: 107/112 looper letters, 8 selfloop transitions, 4 changer transitions 3/112 dead transitions.
[2024-03-09 06:13:18,041 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 112 transitions, 287 flow
[2024-03-09 06:13:18,041 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 06:13:18,041 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 06:13:18,042 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 311 transitions.
[2024-03-09 06:13:18,042 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9255952380952381
[2024-03-09 06:13:18,042 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 311 transitions.
[2024-03-09 06:13:18,042 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 311 transitions.
[2024-03-09 06:13:18,042 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:13:18,043 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 311 transitions.
[2024-03-09 06:13:18,043 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 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)
[2024-03-09 06:13:18,044 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 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)
[2024-03-09 06:13:18,044 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 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)
[2024-03-09 06:13:18,044 INFO  L175             Difference]: Start difference. First operand has 117 places, 109 transitions, 251 flow. Second operand 3 states and 311 transitions.
[2024-03-09 06:13:18,044 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 112 transitions, 287 flow
[2024-03-09 06:13:18,046 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 112 transitions, 277 flow, removed 0 selfloop flow, removed 5 redundant places.
[2024-03-09 06:13:18,047 INFO  L231             Difference]: Finished difference. Result has 116 places, 109 transitions, 263 flow
[2024-03-09 06:13:18,047 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=263, PETRI_PLACES=116, PETRI_TRANSITIONS=109}
[2024-03-09 06:13:18,048 INFO  L281   CegarLoopForPetriNet]: 111 programPoint places, 5 predicate places.
[2024-03-09 06:13:18,048 INFO  L495      AbstractCegarLoop]: Abstraction has has 116 places, 109 transitions, 263 flow
[2024-03-09 06:13:18,048 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 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)
[2024-03-09 06:13:18,048 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:13:18,048 INFO  L208   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]
[2024-03-09 06:13:18,049 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-03-09 06:13:18,049 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-09 06:13:18,049 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:13:18,049 INFO  L85        PathProgramCache]: Analyzing trace with hash 1709824943, now seen corresponding path program 1 times
[2024-03-09 06:13:18,049 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:13:18,050 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570642376]
[2024-03-09 06:13:18,050 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:13:18,050 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:13:18,070 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:13:18,342 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-09 06:13:18,342 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:13:18,343 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570642376]
[2024-03-09 06:13:18,343 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570642376] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:13:18,343 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:13:18,343 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 06:13:18,343 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738875757]
[2024-03-09 06:13:18,344 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:13:18,344 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 06:13:18,344 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:13:18,345 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 06:13:18,345 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 06:13:18,522 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 83 out of 112
[2024-03-09 06:13:18,523 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 109 transitions, 263 flow. Second operand  has 6 states, 6 states have (on average 85.16666666666667) internal successors, (511), 6 states have internal predecessors, (511), 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)
[2024-03-09 06:13:18,523 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:13:18,524 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 112
[2024-03-09 06:13:18,524 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:13:18,613 INFO  L124   PetriNetUnfolderBase]: 25/328 cut-off events.
[2024-03-09 06:13:18,613 INFO  L125   PetriNetUnfolderBase]: For 50/53 co-relation queries the response was YES.
[2024-03-09 06:13:18,617 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 509 conditions, 328 events. 25/328 cut-off events. For 50/53 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1388 event pairs, 15 based on Foata normal form. 0/315 useless extension candidates. Maximal degree in co-relation 395. Up to 55 conditions per place. 
[2024-03-09 06:13:18,618 INFO  L140   encePairwiseOnDemand]: 105/112 looper letters, 27 selfloop transitions, 5 changer transitions 0/115 dead transitions.
[2024-03-09 06:13:18,619 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 115 transitions, 339 flow
[2024-03-09 06:13:18,620 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 06:13:18,620 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 06:13:18,624 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 532 transitions.
[2024-03-09 06:13:18,625 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.7916666666666666
[2024-03-09 06:13:18,625 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 532 transitions.
[2024-03-09 06:13:18,625 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 532 transitions.
[2024-03-09 06:13:18,625 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:13:18,626 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 532 transitions.
[2024-03-09 06:13:18,627 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 88.66666666666667) internal successors, (532), 6 states have internal predecessors, (532), 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)
[2024-03-09 06:13:18,628 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 112.0) internal successors, (784), 7 states have internal predecessors, (784), 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)
[2024-03-09 06:13:18,628 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 112.0) internal successors, (784), 7 states have internal predecessors, (784), 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)
[2024-03-09 06:13:18,628 INFO  L175             Difference]: Start difference. First operand has 116 places, 109 transitions, 263 flow. Second operand 6 states and 532 transitions.
[2024-03-09 06:13:18,628 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 115 transitions, 339 flow
[2024-03-09 06:13:18,632 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 115 transitions, 331 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-09 06:13:18,633 INFO  L231             Difference]: Finished difference. Result has 117 places, 107 transitions, 261 flow
[2024-03-09 06:13:18,633 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=261, PETRI_PLACES=117, PETRI_TRANSITIONS=107}
[2024-03-09 06:13:18,636 INFO  L281   CegarLoopForPetriNet]: 111 programPoint places, 6 predicate places.
[2024-03-09 06:13:18,636 INFO  L495      AbstractCegarLoop]: Abstraction has has 117 places, 107 transitions, 261 flow
[2024-03-09 06:13:18,636 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 85.16666666666667) internal successors, (511), 6 states have internal predecessors, (511), 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)
[2024-03-09 06:13:18,636 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:13:18,636 INFO  L208   CegarLoopForPetriNet]: trace histogram [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]
[2024-03-09 06:13:18,637 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-03-09 06:13:18,637 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-09 06:13:18,640 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:13:18,640 INFO  L85        PathProgramCache]: Analyzing trace with hash 330308076, now seen corresponding path program 1 times
[2024-03-09 06:13:18,640 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:13:18,640 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130458516]
[2024-03-09 06:13:18,640 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:13:18,640 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:13:18,685 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-09 06:13:18,686 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-03-09 06:13:18,699 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-09 06:13:18,728 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-03-09 06:13:18,728 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-03-09 06:13:18,729 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining)
[2024-03-09 06:13:18,730 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (6 of 8 remaining)
[2024-03-09 06:13:18,731 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 8 remaining)
[2024-03-09 06:13:18,731 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 8 remaining)
[2024-03-09 06:13:18,731 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (3 of 8 remaining)
[2024-03-09 06:13:18,731 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (2 of 8 remaining)
[2024-03-09 06:13:18,731 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 8 remaining)
[2024-03-09 06:13:18,732 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 8 remaining)
[2024-03-09 06:13:18,732 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-03-09 06:13:18,732 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1]
[2024-03-09 06:13:18,734 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-03-09 06:13:18,734 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2024-03-09 06:13:18,759 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2024-03-09 06:13:18,764 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 130 places, 130 transitions, 276 flow
[2024-03-09 06:13:18,786 INFO  L124   PetriNetUnfolderBase]: 11/283 cut-off events.
[2024-03-09 06:13:18,786 INFO  L125   PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES.
[2024-03-09 06:13:18,786 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 295 conditions, 283 events. 11/283 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 570 event pairs, 0 based on Foata normal form. 0/248 useless extension candidates. Maximal degree in co-relation 160. Up to 8 conditions per place. 
[2024-03-09 06:13:18,786 INFO  L82        GeneralOperation]: Start removeDead. Operand has 130 places, 130 transitions, 276 flow
[2024-03-09 06:13:18,788 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 130 places, 130 transitions, 276 flow
[2024-03-09 06:13:18,789 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-09 06:13:18,795 INFO  L357      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, mHoare=true, 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;@47f4dfca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-03-09 06:13:18,795 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 9 error locations.
[2024-03-09 06:13:18,799 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-03-09 06:13:18,799 INFO  L124   PetriNetUnfolderBase]: 3/50 cut-off events.
[2024-03-09 06:13:18,799 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-03-09 06:13:18,799 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:13:18,800 INFO  L208   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]
[2024-03-09 06:13:18,800 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-09 06:13:18,800 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:13:18,800 INFO  L85        PathProgramCache]: Analyzing trace with hash 1997562603, now seen corresponding path program 1 times
[2024-03-09 06:13:18,801 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:13:18,801 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109146216]
[2024-03-09 06:13:18,801 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:13:18,801 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:13:18,810 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:13:18,822 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:13:18,822 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:13:18,822 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109146216]
[2024-03-09 06:13:18,822 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109146216] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:13:18,822 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:13:18,822 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-09 06:13:18,822 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035946794]
[2024-03-09 06:13:18,823 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:13:18,823 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 06:13:18,823 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:13:18,823 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 06:13:18,823 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 06:13:18,833 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 114 out of 130
[2024-03-09 06:13:18,834 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 130 transitions, 276 flow. Second operand  has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 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)
[2024-03-09 06:13:18,834 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:13:18,834 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 130
[2024-03-09 06:13:18,834 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:13:18,923 INFO  L124   PetriNetUnfolderBase]: 119/853 cut-off events.
[2024-03-09 06:13:18,923 INFO  L125   PetriNetUnfolderBase]: For 56/99 co-relation queries the response was YES.
[2024-03-09 06:13:18,925 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1125 conditions, 853 events. 119/853 cut-off events. For 56/99 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 4780 event pairs, 50 based on Foata normal form. 39/792 useless extension candidates. Maximal degree in co-relation 828. Up to 139 conditions per place. 
[2024-03-09 06:13:18,927 INFO  L140   encePairwiseOnDemand]: 122/130 looper letters, 16 selfloop transitions, 4 changer transitions 1/134 dead transitions.
[2024-03-09 06:13:18,927 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 134 transitions, 324 flow
[2024-03-09 06:13:18,927 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 06:13:18,928 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 06:13:18,928 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 366 transitions.
[2024-03-09 06:13:18,928 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9384615384615385
[2024-03-09 06:13:18,928 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 366 transitions.
[2024-03-09 06:13:18,928 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 366 transitions.
[2024-03-09 06:13:18,929 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:13:18,929 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 366 transitions.
[2024-03-09 06:13:18,929 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 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)
[2024-03-09 06:13:18,930 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 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)
[2024-03-09 06:13:18,930 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 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)
[2024-03-09 06:13:18,930 INFO  L175             Difference]: Start difference. First operand has 130 places, 130 transitions, 276 flow. Second operand 3 states and 366 transitions.
[2024-03-09 06:13:18,930 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 134 transitions, 324 flow
[2024-03-09 06:13:18,931 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 134 transitions, 324 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-09 06:13:18,932 INFO  L231             Difference]: Finished difference. Result has 134 places, 129 transitions, 298 flow
[2024-03-09 06:13:18,933 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=298, PETRI_PLACES=134, PETRI_TRANSITIONS=129}
[2024-03-09 06:13:18,933 INFO  L281   CegarLoopForPetriNet]: 130 programPoint places, 4 predicate places.
[2024-03-09 06:13:18,933 INFO  L495      AbstractCegarLoop]: Abstraction has has 134 places, 129 transitions, 298 flow
[2024-03-09 06:13:18,933 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 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)
[2024-03-09 06:13:18,933 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:13:18,933 INFO  L208   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]
[2024-03-09 06:13:18,934 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-03-09 06:13:18,934 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-09 06:13:18,934 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:13:18,934 INFO  L85        PathProgramCache]: Analyzing trace with hash 942199472, now seen corresponding path program 1 times
[2024-03-09 06:13:18,934 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:13:18,934 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940577261]
[2024-03-09 06:13:18,934 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:13:18,934 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:13:18,942 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:13:18,981 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:13:18,981 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:13:18,982 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940577261]
[2024-03-09 06:13:18,982 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940577261] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:13:18,982 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:13:18,982 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 06:13:18,982 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953901205]
[2024-03-09 06:13:18,982 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:13:18,982 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-03-09 06:13:18,982 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:13:18,983 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-03-09 06:13:18,983 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-03-09 06:13:19,108 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 108 out of 130
[2024-03-09 06:13:19,108 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 129 transitions, 298 flow. Second operand  has 5 states, 5 states have (on average 109.4) internal successors, (547), 5 states have internal predecessors, (547), 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)
[2024-03-09 06:13:19,108 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:13:19,108 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 130
[2024-03-09 06:13:19,109 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:13:19,263 INFO  L124   PetriNetUnfolderBase]: 189/1333 cut-off events.
[2024-03-09 06:13:19,263 INFO  L125   PetriNetUnfolderBase]: For 71/72 co-relation queries the response was YES.
[2024-03-09 06:13:19,265 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1833 conditions, 1333 events. 189/1333 cut-off events. For 71/72 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 9364 event pairs, 131 based on Foata normal form. 1/1218 useless extension candidates. Maximal degree in co-relation 1232. Up to 314 conditions per place. 
[2024-03-09 06:13:19,268 INFO  L140   encePairwiseOnDemand]: 122/130 looper letters, 20 selfloop transitions, 2 changer transitions 5/137 dead transitions.
[2024-03-09 06:13:19,268 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 137 transitions, 368 flow
[2024-03-09 06:13:19,269 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 06:13:19,269 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 06:13:19,270 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 676 transitions.
[2024-03-09 06:13:19,270 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8666666666666667
[2024-03-09 06:13:19,270 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 676 transitions.
[2024-03-09 06:13:19,270 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 676 transitions.
[2024-03-09 06:13:19,271 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:13:19,271 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 676 transitions.
[2024-03-09 06:13:19,272 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 112.66666666666667) internal successors, (676), 6 states have internal predecessors, (676), 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)
[2024-03-09 06:13:19,273 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 130.0) internal successors, (910), 7 states have internal predecessors, (910), 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)
[2024-03-09 06:13:19,274 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 130.0) internal successors, (910), 7 states have internal predecessors, (910), 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)
[2024-03-09 06:13:19,274 INFO  L175             Difference]: Start difference. First operand has 134 places, 129 transitions, 298 flow. Second operand 6 states and 676 transitions.
[2024-03-09 06:13:19,274 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 137 transitions, 368 flow
[2024-03-09 06:13:19,275 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 137 transitions, 360 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-09 06:13:19,276 INFO  L231             Difference]: Finished difference. Result has 140 places, 130 transitions, 312 flow
[2024-03-09 06:13:19,276 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=312, PETRI_PLACES=140, PETRI_TRANSITIONS=130}
[2024-03-09 06:13:19,277 INFO  L281   CegarLoopForPetriNet]: 130 programPoint places, 10 predicate places.
[2024-03-09 06:13:19,277 INFO  L495      AbstractCegarLoop]: Abstraction has has 140 places, 130 transitions, 312 flow
[2024-03-09 06:13:19,277 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 109.4) internal successors, (547), 5 states have internal predecessors, (547), 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)
[2024-03-09 06:13:19,277 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:13:19,277 INFO  L208   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]
[2024-03-09 06:13:19,278 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-03-09 06:13:19,278 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-09 06:13:19,278 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:13:19,278 INFO  L85        PathProgramCache]: Analyzing trace with hash -169589042, now seen corresponding path program 1 times
[2024-03-09 06:13:19,278 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:13:19,278 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670172467]
[2024-03-09 06:13:19,278 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:13:19,278 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:13:19,295 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:13:19,483 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:13:19,484 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:13:19,484 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670172467]
[2024-03-09 06:13:19,484 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670172467] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:13:19,484 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:13:19,485 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 06:13:19,485 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177184381]
[2024-03-09 06:13:19,485 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:13:19,486 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 06:13:19,486 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:13:19,487 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 06:13:19,487 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 06:13:19,638 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 93 out of 130
[2024-03-09 06:13:19,638 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 130 transitions, 312 flow. Second operand  has 6 states, 6 states have (on average 94.5) internal successors, (567), 6 states have internal predecessors, (567), 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)
[2024-03-09 06:13:19,638 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:13:19,638 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 130
[2024-03-09 06:13:19,639 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:13:19,896 INFO  L124   PetriNetUnfolderBase]: 384/2007 cut-off events.
[2024-03-09 06:13:19,896 INFO  L125   PetriNetUnfolderBase]: For 97/97 co-relation queries the response was YES.
[2024-03-09 06:13:19,899 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2972 conditions, 2007 events. 384/2007 cut-off events. For 97/97 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 16062 event pairs, 278 based on Foata normal form. 0/1782 useless extension candidates. Maximal degree in co-relation 2873. Up to 545 conditions per place. 
[2024-03-09 06:13:19,904 INFO  L140   encePairwiseOnDemand]: 124/130 looper letters, 45 selfloop transitions, 5 changer transitions 0/145 dead transitions.
[2024-03-09 06:13:19,904 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 145 transitions, 442 flow
[2024-03-09 06:13:19,905 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 06:13:19,905 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 06:13:19,906 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 608 transitions.
[2024-03-09 06:13:19,906 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.7794871794871795
[2024-03-09 06:13:19,906 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 608 transitions.
[2024-03-09 06:13:19,906 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 608 transitions.
[2024-03-09 06:13:19,907 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:13:19,907 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 608 transitions.
[2024-03-09 06:13:19,908 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 101.33333333333333) internal successors, (608), 6 states have internal predecessors, (608), 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)
[2024-03-09 06:13:19,909 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 130.0) internal successors, (910), 7 states have internal predecessors, (910), 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)
[2024-03-09 06:13:19,909 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 130.0) internal successors, (910), 7 states have internal predecessors, (910), 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)
[2024-03-09 06:13:19,909 INFO  L175             Difference]: Start difference. First operand has 140 places, 130 transitions, 312 flow. Second operand 6 states and 608 transitions.
[2024-03-09 06:13:19,910 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 145 transitions, 442 flow
[2024-03-09 06:13:19,911 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 145 transitions, 430 flow, removed 5 selfloop flow, removed 4 redundant places.
[2024-03-09 06:13:19,912 INFO  L231             Difference]: Finished difference. Result has 137 places, 129 transitions, 308 flow
[2024-03-09 06:13:19,912 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=308, PETRI_PLACES=137, PETRI_TRANSITIONS=129}
[2024-03-09 06:13:19,913 INFO  L281   CegarLoopForPetriNet]: 130 programPoint places, 7 predicate places.
[2024-03-09 06:13:19,913 INFO  L495      AbstractCegarLoop]: Abstraction has has 137 places, 129 transitions, 308 flow
[2024-03-09 06:13:19,913 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 94.5) internal successors, (567), 6 states have internal predecessors, (567), 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)
[2024-03-09 06:13:19,913 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:13:19,913 INFO  L208   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]
[2024-03-09 06:13:19,913 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-03-09 06:13:19,913 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-09 06:13:19,914 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:13:19,914 INFO  L85        PathProgramCache]: Analyzing trace with hash 95869638, now seen corresponding path program 1 times
[2024-03-09 06:13:19,914 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:13:19,914 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982882148]
[2024-03-09 06:13:19,914 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:13:19,914 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:13:19,930 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:13:19,952 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:13:19,953 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:13:19,953 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982882148]
[2024-03-09 06:13:19,953 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982882148] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:13:19,953 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:13:19,953 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-09 06:13:19,953 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183749428]
[2024-03-09 06:13:19,954 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:13:19,954 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 06:13:19,954 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:13:19,955 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 06:13:19,955 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 06:13:19,971 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 112 out of 130
[2024-03-09 06:13:19,971 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 129 transitions, 308 flow. Second operand  has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 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)
[2024-03-09 06:13:19,971 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:13:19,971 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 130
[2024-03-09 06:13:19,971 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:13:20,085 INFO  L124   PetriNetUnfolderBase]: 172/1259 cut-off events.
[2024-03-09 06:13:20,085 INFO  L125   PetriNetUnfolderBase]: For 198/359 co-relation queries the response was YES.
[2024-03-09 06:13:20,088 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1842 conditions, 1259 events. 172/1259 cut-off events. For 198/359 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 8821 event pairs, 75 based on Foata normal form. 4/1103 useless extension candidates. Maximal degree in co-relation 1561. Up to 270 conditions per place. 
[2024-03-09 06:13:20,091 INFO  L140   encePairwiseOnDemand]: 124/130 looper letters, 19 selfloop transitions, 7 changer transitions 0/138 dead transitions.
[2024-03-09 06:13:20,091 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 138 transitions, 392 flow
[2024-03-09 06:13:20,092 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 06:13:20,092 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 06:13:20,092 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 360 transitions.
[2024-03-09 06:13:20,093 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9230769230769231
[2024-03-09 06:13:20,093 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 360 transitions.
[2024-03-09 06:13:20,093 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 360 transitions.
[2024-03-09 06:13:20,093 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:13:20,093 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 360 transitions.
[2024-03-09 06:13:20,094 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 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)
[2024-03-09 06:13:20,095 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 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)
[2024-03-09 06:13:20,095 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 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)
[2024-03-09 06:13:20,095 INFO  L175             Difference]: Start difference. First operand has 137 places, 129 transitions, 308 flow. Second operand 3 states and 360 transitions.
[2024-03-09 06:13:20,095 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 138 transitions, 392 flow
[2024-03-09 06:13:20,096 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 138 transitions, 382 flow, removed 0 selfloop flow, removed 5 redundant places.
[2024-03-09 06:13:20,097 INFO  L231             Difference]: Finished difference. Result has 136 places, 134 transitions, 354 flow
[2024-03-09 06:13:20,097 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=354, PETRI_PLACES=136, PETRI_TRANSITIONS=134}
[2024-03-09 06:13:20,098 INFO  L281   CegarLoopForPetriNet]: 130 programPoint places, 6 predicate places.
[2024-03-09 06:13:20,098 INFO  L495      AbstractCegarLoop]: Abstraction has has 136 places, 134 transitions, 354 flow
[2024-03-09 06:13:20,098 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 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)
[2024-03-09 06:13:20,098 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:13:20,098 INFO  L208   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]
[2024-03-09 06:13:20,098 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-03-09 06:13:20,099 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-09 06:13:20,099 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:13:20,099 INFO  L85        PathProgramCache]: Analyzing trace with hash -1939836127, now seen corresponding path program 1 times
[2024-03-09 06:13:20,099 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:13:20,099 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533717451]
[2024-03-09 06:13:20,099 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:13:20,099 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:13:20,117 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:13:20,319 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-09 06:13:20,319 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:13:20,319 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533717451]
[2024-03-09 06:13:20,319 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533717451] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:13:20,319 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:13:20,319 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 06:13:20,319 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253158310]
[2024-03-09 06:13:20,319 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:13:20,320 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 06:13:20,320 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:13:20,320 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 06:13:20,320 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 06:13:20,514 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 97 out of 130
[2024-03-09 06:13:20,515 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 134 transitions, 354 flow. Second operand  has 6 states, 6 states have (on average 99.16666666666667) internal successors, (595), 6 states have internal predecessors, (595), 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)
[2024-03-09 06:13:20,515 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:13:20,515 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 130
[2024-03-09 06:13:20,516 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:13:20,740 INFO  L124   PetriNetUnfolderBase]: 383/2112 cut-off events.
[2024-03-09 06:13:20,740 INFO  L125   PetriNetUnfolderBase]: For 322/359 co-relation queries the response was YES.
[2024-03-09 06:13:20,745 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3366 conditions, 2112 events. 383/2112 cut-off events. For 322/359 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 17575 event pairs, 180 based on Foata normal form. 3/1933 useless extension candidates. Maximal degree in co-relation 2625. Up to 362 conditions per place. 
[2024-03-09 06:13:20,751 INFO  L140   encePairwiseOnDemand]: 123/130 looper letters, 39 selfloop transitions, 5 changer transitions 0/148 dead transitions.
[2024-03-09 06:13:20,751 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 148 transitions, 470 flow
[2024-03-09 06:13:20,752 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 06:13:20,752 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 06:13:20,753 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 628 transitions.
[2024-03-09 06:13:20,753 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8051282051282052
[2024-03-09 06:13:20,753 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 628 transitions.
[2024-03-09 06:13:20,753 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 628 transitions.
[2024-03-09 06:13:20,753 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:13:20,753 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 628 transitions.
[2024-03-09 06:13:20,755 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 104.66666666666667) internal successors, (628), 6 states have internal predecessors, (628), 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)
[2024-03-09 06:13:20,765 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 130.0) internal successors, (910), 7 states have internal predecessors, (910), 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)
[2024-03-09 06:13:20,765 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 130.0) internal successors, (910), 7 states have internal predecessors, (910), 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)
[2024-03-09 06:13:20,765 INFO  L175             Difference]: Start difference. First operand has 136 places, 134 transitions, 354 flow. Second operand 6 states and 628 transitions.
[2024-03-09 06:13:20,765 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 148 transitions, 470 flow
[2024-03-09 06:13:20,767 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 148 transitions, 456 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-09 06:13:20,768 INFO  L231             Difference]: Finished difference. Result has 137 places, 132 transitions, 346 flow
[2024-03-09 06:13:20,769 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=346, PETRI_PLACES=137, PETRI_TRANSITIONS=132}
[2024-03-09 06:13:20,769 INFO  L281   CegarLoopForPetriNet]: 130 programPoint places, 7 predicate places.
[2024-03-09 06:13:20,769 INFO  L495      AbstractCegarLoop]: Abstraction has has 137 places, 132 transitions, 346 flow
[2024-03-09 06:13:20,769 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 99.16666666666667) internal successors, (595), 6 states have internal predecessors, (595), 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)
[2024-03-09 06:13:20,769 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:13:20,770 INFO  L208   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]
[2024-03-09 06:13:20,770 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-03-09 06:13:20,770 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-09 06:13:20,770 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:13:20,770 INFO  L85        PathProgramCache]: Analyzing trace with hash 773970806, now seen corresponding path program 1 times
[2024-03-09 06:13:20,770 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:13:20,770 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342332542]
[2024-03-09 06:13:20,770 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:13:20,770 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:13:20,782 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:13:20,844 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:13:20,844 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:13:20,844 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342332542]
[2024-03-09 06:13:20,844 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342332542] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 06:13:20,844 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1253976399]
[2024-03-09 06:13:20,844 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:13:20,844 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 06:13:20,845 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 06:13:20,848 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 06:13:20,851 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-03-09 06:13:20,962 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:13:20,963 INFO  L262         TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 4 conjunts are in the unsatisfiable core
[2024-03-09 06:13:20,965 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 06:13:21,057 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:13:21,057 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 06:13:21,111 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:13:21,112 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1253976399] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 06:13:21,112 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 06:13:21,112 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9
[2024-03-09 06:13:21,112 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052136635]
[2024-03-09 06:13:21,112 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 06:13:21,113 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-03-09 06:13:21,113 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:13:21,113 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-03-09 06:13:21,114 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2024-03-09 06:13:21,402 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 106 out of 130
[2024-03-09 06:13:21,403 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 132 transitions, 346 flow. Second operand  has 9 states, 9 states have (on average 108.22222222222223) internal successors, (974), 9 states have internal predecessors, (974), 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)
[2024-03-09 06:13:21,403 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:13:21,403 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 130
[2024-03-09 06:13:21,403 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:13:21,586 INFO  L124   PetriNetUnfolderBase]: 159/1312 cut-off events.
[2024-03-09 06:13:21,586 INFO  L125   PetriNetUnfolderBase]: For 133/156 co-relation queries the response was YES.
[2024-03-09 06:13:21,588 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1939 conditions, 1312 events. 159/1312 cut-off events. For 133/156 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 8853 event pairs, 50 based on Foata normal form. 0/1218 useless extension candidates. Maximal degree in co-relation 983. Up to 159 conditions per place. 
[2024-03-09 06:13:21,591 INFO  L140   encePairwiseOnDemand]: 120/130 looper letters, 32 selfloop transitions, 10 changer transitions 3/154 dead transitions.
[2024-03-09 06:13:21,591 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 154 transitions, 484 flow
[2024-03-09 06:13:21,591 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-03-09 06:13:21,591 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-03-09 06:13:21,592 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 894 transitions.
[2024-03-09 06:13:21,593 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8596153846153847
[2024-03-09 06:13:21,593 INFO  L72            ComplementDD]: Start complementDD. Operand 8 states and 894 transitions.
[2024-03-09 06:13:21,593 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 8 states and 894 transitions.
[2024-03-09 06:13:21,594 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:13:21,594 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 894 transitions.
[2024-03-09 06:13:21,595 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 9 states, 8 states have (on average 111.75) internal successors, (894), 8 states have internal predecessors, (894), 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)
[2024-03-09 06:13:21,597 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 9 states, 9 states have (on average 130.0) internal successors, (1170), 9 states have internal predecessors, (1170), 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)
[2024-03-09 06:13:21,597 INFO  L81            ComplementDD]: Finished complementDD. Result  has 9 states, 9 states have (on average 130.0) internal successors, (1170), 9 states have internal predecessors, (1170), 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)
[2024-03-09 06:13:21,597 INFO  L175             Difference]: Start difference. First operand has 137 places, 132 transitions, 346 flow. Second operand 8 states and 894 transitions.
[2024-03-09 06:13:21,597 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 154 transitions, 484 flow
[2024-03-09 06:13:21,598 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 154 transitions, 472 flow, removed 0 selfloop flow, removed 5 redundant places.
[2024-03-09 06:13:21,600 INFO  L231             Difference]: Finished difference. Result has 142 places, 134 transitions, 374 flow
[2024-03-09 06:13:21,600 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=374, PETRI_PLACES=142, PETRI_TRANSITIONS=134}
[2024-03-09 06:13:21,600 INFO  L281   CegarLoopForPetriNet]: 130 programPoint places, 12 predicate places.
[2024-03-09 06:13:21,600 INFO  L495      AbstractCegarLoop]: Abstraction has has 142 places, 134 transitions, 374 flow
[2024-03-09 06:13:21,601 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 108.22222222222223) internal successors, (974), 9 states have internal predecessors, (974), 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)
[2024-03-09 06:13:21,601 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:13:21,601 INFO  L208   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]
[2024-03-09 06:13:21,607 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2024-03-09 06:13:21,805 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,2 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 06:13:21,805 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-09 06:13:21,806 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:13:21,806 INFO  L85        PathProgramCache]: Analyzing trace with hash 1586129916, now seen corresponding path program 1 times
[2024-03-09 06:13:21,806 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:13:21,807 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820677677]
[2024-03-09 06:13:21,807 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:13:21,807 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:13:21,832 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:13:22,017 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-09 06:13:22,017 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:13:22,017 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820677677]
[2024-03-09 06:13:22,017 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820677677] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:13:22,017 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:13:22,017 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 06:13:22,017 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78916528]
[2024-03-09 06:13:22,017 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:13:22,018 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 06:13:22,018 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:13:22,018 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 06:13:22,018 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 06:13:22,169 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 105 out of 130
[2024-03-09 06:13:22,170 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 134 transitions, 374 flow. Second operand  has 6 states, 6 states have (on average 107.0) internal successors, (642), 6 states have internal predecessors, (642), 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)
[2024-03-09 06:13:22,170 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:13:22,170 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 130
[2024-03-09 06:13:22,170 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:13:22,331 INFO  L124   PetriNetUnfolderBase]: 249/1397 cut-off events.
[2024-03-09 06:13:22,331 INFO  L125   PetriNetUnfolderBase]: For 119/142 co-relation queries the response was YES.
[2024-03-09 06:13:22,334 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2226 conditions, 1397 events. 249/1397 cut-off events. For 119/142 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 9923 event pairs, 114 based on Foata normal form. 0/1310 useless extension candidates. Maximal degree in co-relation 1598. Up to 236 conditions per place. 
[2024-03-09 06:13:22,337 INFO  L140   encePairwiseOnDemand]: 124/130 looper letters, 32 selfloop transitions, 5 changer transitions 1/149 dead transitions.
[2024-03-09 06:13:22,337 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 149 transitions, 478 flow
[2024-03-09 06:13:22,337 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 06:13:22,337 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 06:13:22,338 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 668 transitions.
[2024-03-09 06:13:22,339 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8564102564102564
[2024-03-09 06:13:22,339 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 668 transitions.
[2024-03-09 06:13:22,339 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 668 transitions.
[2024-03-09 06:13:22,339 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:13:22,339 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 668 transitions.
[2024-03-09 06:13:22,340 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 111.33333333333333) internal successors, (668), 6 states have internal predecessors, (668), 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)
[2024-03-09 06:13:22,341 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 130.0) internal successors, (910), 7 states have internal predecessors, (910), 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)
[2024-03-09 06:13:22,342 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 130.0) internal successors, (910), 7 states have internal predecessors, (910), 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)
[2024-03-09 06:13:22,342 INFO  L175             Difference]: Start difference. First operand has 142 places, 134 transitions, 374 flow. Second operand 6 states and 668 transitions.
[2024-03-09 06:13:22,342 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 149 transitions, 478 flow
[2024-03-09 06:13:22,343 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 149 transitions, 472 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-03-09 06:13:22,344 INFO  L231             Difference]: Finished difference. Result has 143 places, 132 transitions, 371 flow
[2024-03-09 06:13:22,345 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=366, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=371, PETRI_PLACES=143, PETRI_TRANSITIONS=132}
[2024-03-09 06:13:22,345 INFO  L281   CegarLoopForPetriNet]: 130 programPoint places, 13 predicate places.
[2024-03-09 06:13:22,345 INFO  L495      AbstractCegarLoop]: Abstraction has has 143 places, 132 transitions, 371 flow
[2024-03-09 06:13:22,345 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 107.0) internal successors, (642), 6 states have internal predecessors, (642), 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)
[2024-03-09 06:13:22,345 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:13:22,345 INFO  L208   CegarLoopForPetriNet]: trace histogram [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]
[2024-03-09 06:13:22,346 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-03-09 06:13:22,346 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-09 06:13:22,346 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:13:22,346 INFO  L85        PathProgramCache]: Analyzing trace with hash -1175743644, now seen corresponding path program 1 times
[2024-03-09 06:13:22,346 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:13:22,346 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312484258]
[2024-03-09 06:13:22,346 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:13:22,346 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:13:22,372 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:13:22,394 INFO  L134       CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked.
[2024-03-09 06:13:22,394 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:13:22,394 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312484258]
[2024-03-09 06:13:22,394 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312484258] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:13:22,394 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:13:22,394 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-09 06:13:22,395 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923693668]
[2024-03-09 06:13:22,395 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:13:22,395 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 06:13:22,395 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:13:22,395 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 06:13:22,395 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 06:13:22,408 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 112 out of 130
[2024-03-09 06:13:22,409 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 132 transitions, 371 flow. Second operand  has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 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)
[2024-03-09 06:13:22,409 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:13:22,409 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 130
[2024-03-09 06:13:22,409 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:13:22,496 INFO  L124   PetriNetUnfolderBase]: 56/857 cut-off events.
[2024-03-09 06:13:22,496 INFO  L125   PetriNetUnfolderBase]: For 243/428 co-relation queries the response was YES.
[2024-03-09 06:13:22,498 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1348 conditions, 857 events. 56/857 cut-off events. For 243/428 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 5261 event pairs, 30 based on Foata normal form. 3/835 useless extension candidates. Maximal degree in co-relation 1184. Up to 119 conditions per place. 
[2024-03-09 06:13:22,500 INFO  L140   encePairwiseOnDemand]: 124/130 looper letters, 19 selfloop transitions, 7 changer transitions 1/139 dead transitions.
[2024-03-09 06:13:22,500 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 139 transitions, 448 flow
[2024-03-09 06:13:22,501 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 06:13:22,501 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 06:13:22,501 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 359 transitions.
[2024-03-09 06:13:22,502 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9205128205128205
[2024-03-09 06:13:22,502 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 359 transitions.
[2024-03-09 06:13:22,502 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 359 transitions.
[2024-03-09 06:13:22,502 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:13:22,502 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 359 transitions.
[2024-03-09 06:13:22,503 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 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)
[2024-03-09 06:13:22,503 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 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)
[2024-03-09 06:13:22,503 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 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)
[2024-03-09 06:13:22,504 INFO  L175             Difference]: Start difference. First operand has 143 places, 132 transitions, 371 flow. Second operand 3 states and 359 transitions.
[2024-03-09 06:13:22,504 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 139 transitions, 448 flow
[2024-03-09 06:13:22,505 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 139 transitions, 438 flow, removed 0 selfloop flow, removed 5 redundant places.
[2024-03-09 06:13:22,506 INFO  L231             Difference]: Finished difference. Result has 142 places, 135 transitions, 411 flow
[2024-03-09 06:13:22,506 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=361, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=411, PETRI_PLACES=142, PETRI_TRANSITIONS=135}
[2024-03-09 06:13:22,507 INFO  L281   CegarLoopForPetriNet]: 130 programPoint places, 12 predicate places.
[2024-03-09 06:13:22,507 INFO  L495      AbstractCegarLoop]: Abstraction has has 142 places, 135 transitions, 411 flow
[2024-03-09 06:13:22,507 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 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)
[2024-03-09 06:13:22,507 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:13:22,507 INFO  L208   CegarLoopForPetriNet]: trace histogram [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]
[2024-03-09 06:13:22,507 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-03-09 06:13:22,508 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-09 06:13:22,508 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:13:22,508 INFO  L85        PathProgramCache]: Analyzing trace with hash -453610322, now seen corresponding path program 1 times
[2024-03-09 06:13:22,508 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:13:22,508 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370543427]
[2024-03-09 06:13:22,508 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:13:22,508 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:13:22,530 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:13:22,580 INFO  L134       CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked.
[2024-03-09 06:13:22,580 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:13:22,580 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370543427]
[2024-03-09 06:13:22,580 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370543427] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:13:22,580 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:13:22,580 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-03-09 06:13:22,580 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262594521]
[2024-03-09 06:13:22,580 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:13:22,581 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 06:13:22,581 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:13:22,581 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 06:13:22,581 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 06:13:22,591 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 118 out of 130
[2024-03-09 06:13:22,592 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 135 transitions, 411 flow. Second operand  has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 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)
[2024-03-09 06:13:22,592 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:13:22,592 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 130
[2024-03-09 06:13:22,592 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:13:22,663 INFO  L124   PetriNetUnfolderBase]: 12/507 cut-off events.
[2024-03-09 06:13:22,663 INFO  L125   PetriNetUnfolderBase]: For 125/146 co-relation queries the response was YES.
[2024-03-09 06:13:22,664 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 744 conditions, 507 events. 12/507 cut-off events. For 125/146 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2220 event pairs, 2 based on Foata normal form. 4/505 useless extension candidates. Maximal degree in co-relation 570. Up to 26 conditions per place. 
[2024-03-09 06:13:22,664 INFO  L140   encePairwiseOnDemand]: 126/130 looper letters, 8 selfloop transitions, 4 changer transitions 4/136 dead transitions.
[2024-03-09 06:13:22,665 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 136 transitions, 432 flow
[2024-03-09 06:13:22,665 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 06:13:22,665 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 06:13:22,666 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 368 transitions.
[2024-03-09 06:13:22,666 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9435897435897436
[2024-03-09 06:13:22,666 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 368 transitions.
[2024-03-09 06:13:22,666 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 368 transitions.
[2024-03-09 06:13:22,666 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:13:22,666 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 368 transitions.
[2024-03-09 06:13:22,667 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 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)
[2024-03-09 06:13:22,668 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 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)
[2024-03-09 06:13:22,668 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 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)
[2024-03-09 06:13:22,668 INFO  L175             Difference]: Start difference. First operand has 142 places, 135 transitions, 411 flow. Second operand 3 states and 368 transitions.
[2024-03-09 06:13:22,668 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 136 transitions, 432 flow
[2024-03-09 06:13:22,669 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 136 transitions, 420 flow, removed 1 selfloop flow, removed 2 redundant places.
[2024-03-09 06:13:22,670 INFO  L231             Difference]: Finished difference. Result has 142 places, 129 transitions, 371 flow
[2024-03-09 06:13:22,671 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=379, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=371, PETRI_PLACES=142, PETRI_TRANSITIONS=129}
[2024-03-09 06:13:22,671 INFO  L281   CegarLoopForPetriNet]: 130 programPoint places, 12 predicate places.
[2024-03-09 06:13:22,671 INFO  L495      AbstractCegarLoop]: Abstraction has has 142 places, 129 transitions, 371 flow
[2024-03-09 06:13:22,671 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 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)
[2024-03-09 06:13:22,671 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:13:22,672 INFO  L208   CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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]
[2024-03-09 06:13:22,672 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-03-09 06:13:22,672 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-09 06:13:22,672 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:13:22,672 INFO  L85        PathProgramCache]: Analyzing trace with hash -2094452676, now seen corresponding path program 1 times
[2024-03-09 06:13:22,672 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:13:22,672 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867622792]
[2024-03-09 06:13:22,672 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:13:22,673 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:13:22,699 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-09 06:13:22,699 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-03-09 06:13:22,710 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-09 06:13:22,718 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-03-09 06:13:22,719 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-03-09 06:13:22,719 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining)
[2024-03-09 06:13:22,719 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining)
[2024-03-09 06:13:22,719 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining)
[2024-03-09 06:13:22,719 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining)
[2024-03-09 06:13:22,719 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining)
[2024-03-09 06:13:22,719 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining)
[2024-03-09 06:13:22,719 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining)
[2024-03-09 06:13:22,719 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining)
[2024-03-09 06:13:22,720 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining)
[2024-03-09 06:13:22,720 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-03-09 06:13:22,720 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 06:13:22,720 WARN  L233   ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-03-09 06:13:22,720 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances.
[2024-03-09 06:13:22,737 INFO  L144    ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions.
[2024-03-09 06:13:22,739 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 149 places, 148 transitions, 323 flow
[2024-03-09 06:13:22,770 INFO  L124   PetriNetUnfolderBase]: 21/493 cut-off events.
[2024-03-09 06:13:22,770 INFO  L125   PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES.
[2024-03-09 06:13:22,771 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 518 conditions, 493 events. 21/493 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1332 event pairs, 1 based on Foata normal form. 0/430 useless extension candidates. Maximal degree in co-relation 291. Up to 16 conditions per place. 
[2024-03-09 06:13:22,771 INFO  L82        GeneralOperation]: Start removeDead. Operand has 149 places, 148 transitions, 323 flow
[2024-03-09 06:13:22,772 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 149 places, 148 transitions, 323 flow
[2024-03-09 06:13:22,773 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-09 06:13:22,773 INFO  L357      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, mHoare=true, 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;@47f4dfca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-03-09 06:13:22,773 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 10 error locations.
[2024-03-09 06:13:22,775 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-03-09 06:13:22,775 INFO  L124   PetriNetUnfolderBase]: 3/50 cut-off events.
[2024-03-09 06:13:22,775 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-03-09 06:13:22,775 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:13:22,776 INFO  L208   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]
[2024-03-09 06:13:22,776 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-09 06:13:22,776 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:13:22,776 INFO  L85        PathProgramCache]: Analyzing trace with hash 774675819, now seen corresponding path program 1 times
[2024-03-09 06:13:22,776 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:13:22,776 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705518547]
[2024-03-09 06:13:22,776 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:13:22,776 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:13:22,781 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:13:22,790 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:13:22,790 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:13:22,790 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705518547]
[2024-03-09 06:13:22,790 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705518547] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:13:22,790 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:13:22,790 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-09 06:13:22,790 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374360138]
[2024-03-09 06:13:22,791 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:13:22,791 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 06:13:22,791 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:13:22,791 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 06:13:22,791 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 06:13:22,805 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 127 out of 148
[2024-03-09 06:13:22,805 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 148 transitions, 323 flow. Second operand  has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 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)
[2024-03-09 06:13:22,805 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:13:22,805 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 148
[2024-03-09 06:13:22,805 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:13:23,224 INFO  L124   PetriNetUnfolderBase]: 1071/4713 cut-off events.
[2024-03-09 06:13:23,224 INFO  L125   PetriNetUnfolderBase]: For 375/723 co-relation queries the response was YES.
[2024-03-09 06:13:23,232 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6628 conditions, 4713 events. 1071/4713 cut-off events. For 375/723 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 42263 event pairs, 542 based on Foata normal form. 178/4381 useless extension candidates. Maximal degree in co-relation 5211. Up to 1110 conditions per place. 
[2024-03-09 06:13:23,245 INFO  L140   encePairwiseOnDemand]: 139/148 looper letters, 23 selfloop transitions, 5 changer transitions 1/155 dead transitions.
[2024-03-09 06:13:23,246 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 155 transitions, 393 flow
[2024-03-09 06:13:23,246 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 06:13:23,246 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 06:13:23,247 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 413 transitions.
[2024-03-09 06:13:23,247 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9301801801801802
[2024-03-09 06:13:23,247 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 413 transitions.
[2024-03-09 06:13:23,247 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 413 transitions.
[2024-03-09 06:13:23,248 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:13:23,248 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 413 transitions.
[2024-03-09 06:13:23,248 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 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)
[2024-03-09 06:13:23,249 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 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)
[2024-03-09 06:13:23,249 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 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)
[2024-03-09 06:13:23,249 INFO  L175             Difference]: Start difference. First operand has 149 places, 148 transitions, 323 flow. Second operand 3 states and 413 transitions.
[2024-03-09 06:13:23,249 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 155 transitions, 393 flow
[2024-03-09 06:13:23,250 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 155 transitions, 393 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-09 06:13:23,251 INFO  L231             Difference]: Finished difference. Result has 153 places, 148 transitions, 353 flow
[2024-03-09 06:13:23,252 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=353, PETRI_PLACES=153, PETRI_TRANSITIONS=148}
[2024-03-09 06:13:23,252 INFO  L281   CegarLoopForPetriNet]: 149 programPoint places, 4 predicate places.
[2024-03-09 06:13:23,252 INFO  L495      AbstractCegarLoop]: Abstraction has has 153 places, 148 transitions, 353 flow
[2024-03-09 06:13:23,252 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 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)
[2024-03-09 06:13:23,252 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:13:23,253 INFO  L208   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]
[2024-03-09 06:13:23,253 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-03-09 06:13:23,253 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-09 06:13:23,253 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:13:23,253 INFO  L85        PathProgramCache]: Analyzing trace with hash -1725923408, now seen corresponding path program 1 times
[2024-03-09 06:13:23,253 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:13:23,253 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362325540]
[2024-03-09 06:13:23,253 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:13:23,253 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:13:23,260 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:13:23,301 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:13:23,301 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:13:23,301 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362325540]
[2024-03-09 06:13:23,302 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362325540] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:13:23,302 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:13:23,302 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 06:13:23,302 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940601729]
[2024-03-09 06:13:23,302 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:13:23,302 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-03-09 06:13:23,302 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:13:23,302 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-03-09 06:13:23,303 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-03-09 06:13:23,383 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 122 out of 148
[2024-03-09 06:13:23,384 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 148 transitions, 353 flow. Second operand  has 5 states, 5 states have (on average 123.4) internal successors, (617), 5 states have internal predecessors, (617), 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)
[2024-03-09 06:13:23,384 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:13:23,384 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 148
[2024-03-09 06:13:23,384 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:13:23,947 INFO  L124   PetriNetUnfolderBase]: 1326/6647 cut-off events.
[2024-03-09 06:13:23,947 INFO  L125   PetriNetUnfolderBase]: For 408/416 co-relation queries the response was YES.
[2024-03-09 06:13:23,959 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9469 conditions, 6647 events. 1326/6647 cut-off events. For 408/416 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 65551 event pairs, 760 based on Foata normal form. 1/5867 useless extension candidates. Maximal degree in co-relation 5824. Up to 1720 conditions per place. 
[2024-03-09 06:13:23,974 INFO  L140   encePairwiseOnDemand]: 140/148 looper letters, 24 selfloop transitions, 2 changer transitions 5/156 dead transitions.
[2024-03-09 06:13:23,974 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 156 transitions, 431 flow
[2024-03-09 06:13:23,974 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 06:13:23,975 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 06:13:23,976 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 764 transitions.
[2024-03-09 06:13:23,976 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8603603603603603
[2024-03-09 06:13:23,976 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 764 transitions.
[2024-03-09 06:13:23,976 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 764 transitions.
[2024-03-09 06:13:23,977 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:13:23,977 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 764 transitions.
[2024-03-09 06:13:23,978 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 127.33333333333333) internal successors, (764), 6 states have internal predecessors, (764), 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)
[2024-03-09 06:13:23,980 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 148.0) internal successors, (1036), 7 states have internal predecessors, (1036), 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)
[2024-03-09 06:13:23,980 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 148.0) internal successors, (1036), 7 states have internal predecessors, (1036), 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)
[2024-03-09 06:13:23,980 INFO  L175             Difference]: Start difference. First operand has 153 places, 148 transitions, 353 flow. Second operand 6 states and 764 transitions.
[2024-03-09 06:13:23,980 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 156 transitions, 431 flow
[2024-03-09 06:13:23,985 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 156 transitions, 421 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-09 06:13:23,986 INFO  L231             Difference]: Finished difference. Result has 159 places, 149 transitions, 365 flow
[2024-03-09 06:13:23,987 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=343, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=365, PETRI_PLACES=159, PETRI_TRANSITIONS=149}
[2024-03-09 06:13:23,987 INFO  L281   CegarLoopForPetriNet]: 149 programPoint places, 10 predicate places.
[2024-03-09 06:13:23,987 INFO  L495      AbstractCegarLoop]: Abstraction has has 159 places, 149 transitions, 365 flow
[2024-03-09 06:13:23,987 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 123.4) internal successors, (617), 5 states have internal predecessors, (617), 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)
[2024-03-09 06:13:23,987 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:13:23,988 INFO  L208   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]
[2024-03-09 06:13:23,988 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-03-09 06:13:23,988 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-09 06:13:23,988 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:13:23,988 INFO  L85        PathProgramCache]: Analyzing trace with hash -1277019550, now seen corresponding path program 1 times
[2024-03-09 06:13:23,988 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:13:23,988 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840611082]
[2024-03-09 06:13:23,988 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:13:23,988 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:13:24,017 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:13:24,175 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:13:24,176 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:13:24,176 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840611082]
[2024-03-09 06:13:24,176 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840611082] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:13:24,176 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:13:24,176 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 06:13:24,176 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495950532]
[2024-03-09 06:13:24,176 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:13:24,176 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 06:13:24,177 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:13:24,177 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 06:13:24,177 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 06:13:24,333 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 107 out of 148
[2024-03-09 06:13:24,334 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 149 transitions, 365 flow. Second operand  has 6 states, 6 states have (on average 108.5) internal successors, (651), 6 states have internal predecessors, (651), 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)
[2024-03-09 06:13:24,334 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:13:24,334 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 148
[2024-03-09 06:13:24,335 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:13:25,372 INFO  L124   PetriNetUnfolderBase]: 2795/10801 cut-off events.
[2024-03-09 06:13:25,373 INFO  L125   PetriNetUnfolderBase]: For 513/515 co-relation queries the response was YES.
[2024-03-09 06:13:25,394 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16323 conditions, 10801 events. 2795/10801 cut-off events. For 513/515 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 114610 event pairs, 2100 based on Foata normal form. 0/9424 useless extension candidates. Maximal degree in co-relation 16223. Up to 3268 conditions per place. 
[2024-03-09 06:13:25,419 INFO  L140   encePairwiseOnDemand]: 142/148 looper letters, 57 selfloop transitions, 5 changer transitions 0/172 dead transitions.
[2024-03-09 06:13:25,419 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 172 transitions, 535 flow
[2024-03-09 06:13:25,420 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 06:13:25,420 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 06:13:25,421 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 704 transitions.
[2024-03-09 06:13:25,421 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.7927927927927928
[2024-03-09 06:13:25,421 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 704 transitions.
[2024-03-09 06:13:25,422 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 704 transitions.
[2024-03-09 06:13:25,422 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:13:25,422 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 704 transitions.
[2024-03-09 06:13:25,423 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 117.33333333333333) internal successors, (704), 6 states have internal predecessors, (704), 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)
[2024-03-09 06:13:25,424 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 148.0) internal successors, (1036), 7 states have internal predecessors, (1036), 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)
[2024-03-09 06:13:25,425 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 148.0) internal successors, (1036), 7 states have internal predecessors, (1036), 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)
[2024-03-09 06:13:25,425 INFO  L175             Difference]: Start difference. First operand has 159 places, 149 transitions, 365 flow. Second operand 6 states and 704 transitions.
[2024-03-09 06:13:25,425 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 172 transitions, 535 flow
[2024-03-09 06:13:25,429 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 172 transitions, 523 flow, removed 5 selfloop flow, removed 4 redundant places.
[2024-03-09 06:13:25,431 INFO  L231             Difference]: Finished difference. Result has 156 places, 148 transitions, 361 flow
[2024-03-09 06:13:25,431 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=351, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=361, PETRI_PLACES=156, PETRI_TRANSITIONS=148}
[2024-03-09 06:13:25,431 INFO  L281   CegarLoopForPetriNet]: 149 programPoint places, 7 predicate places.
[2024-03-09 06:13:25,431 INFO  L495      AbstractCegarLoop]: Abstraction has has 156 places, 148 transitions, 361 flow
[2024-03-09 06:13:25,432 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 108.5) internal successors, (651), 6 states have internal predecessors, (651), 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)
[2024-03-09 06:13:25,432 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:13:25,432 INFO  L208   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]
[2024-03-09 06:13:25,432 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-03-09 06:13:25,432 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-09 06:13:25,432 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:13:25,432 INFO  L85        PathProgramCache]: Analyzing trace with hash 1968266986, now seen corresponding path program 1 times
[2024-03-09 06:13:25,433 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:13:25,433 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81998558]
[2024-03-09 06:13:25,433 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:13:25,433 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:13:25,443 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:13:25,457 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:13:25,457 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:13:25,458 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81998558]
[2024-03-09 06:13:25,458 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81998558] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:13:25,458 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:13:25,458 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-09 06:13:25,458 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742895268]
[2024-03-09 06:13:25,458 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:13:25,458 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 06:13:25,458 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:13:25,459 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 06:13:25,459 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 06:13:25,485 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 125 out of 148
[2024-03-09 06:13:25,485 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 148 transitions, 361 flow. Second operand  has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 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)
[2024-03-09 06:13:25,486 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:13:25,486 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 148
[2024-03-09 06:13:25,486 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:13:26,190 INFO  L124   PetriNetUnfolderBase]: 1743/7636 cut-off events.
[2024-03-09 06:13:26,190 INFO  L125   PetriNetUnfolderBase]: For 1574/2656 co-relation queries the response was YES.
[2024-03-09 06:13:26,204 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11967 conditions, 7636 events. 1743/7636 cut-off events. For 1574/2656 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 79311 event pairs, 967 based on Foata normal form. 10/6732 useless extension candidates. Maximal degree in co-relation 10404. Up to 2242 conditions per place. 
[2024-03-09 06:13:26,220 INFO  L140   encePairwiseOnDemand]: 141/148 looper letters, 29 selfloop transitions, 9 changer transitions 0/163 dead transitions.
[2024-03-09 06:13:26,220 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 163 transitions, 495 flow
[2024-03-09 06:13:26,221 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 06:13:26,221 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 06:13:26,222 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 409 transitions.
[2024-03-09 06:13:26,222 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9211711711711712
[2024-03-09 06:13:26,222 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 409 transitions.
[2024-03-09 06:13:26,222 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 409 transitions.
[2024-03-09 06:13:26,222 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:13:26,222 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 409 transitions.
[2024-03-09 06:13:26,223 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 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)
[2024-03-09 06:13:26,224 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 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)
[2024-03-09 06:13:26,224 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 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)
[2024-03-09 06:13:26,224 INFO  L175             Difference]: Start difference. First operand has 156 places, 148 transitions, 361 flow. Second operand 3 states and 409 transitions.
[2024-03-09 06:13:26,224 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 163 transitions, 495 flow
[2024-03-09 06:13:26,225 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 163 transitions, 485 flow, removed 0 selfloop flow, removed 5 redundant places.
[2024-03-09 06:13:26,226 INFO  L231             Difference]: Finished difference. Result has 155 places, 155 transitions, 427 flow
[2024-03-09 06:13:26,226 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=351, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=427, PETRI_PLACES=155, PETRI_TRANSITIONS=155}
[2024-03-09 06:13:26,227 INFO  L281   CegarLoopForPetriNet]: 149 programPoint places, 6 predicate places.
[2024-03-09 06:13:26,227 INFO  L495      AbstractCegarLoop]: Abstraction has has 155 places, 155 transitions, 427 flow
[2024-03-09 06:13:26,227 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 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)
[2024-03-09 06:13:26,227 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:13:26,227 INFO  L208   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]
[2024-03-09 06:13:26,227 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2024-03-09 06:13:26,227 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-09 06:13:26,228 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:13:26,228 INFO  L85        PathProgramCache]: Analyzing trace with hash 124079013, now seen corresponding path program 1 times
[2024-03-09 06:13:26,228 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:13:26,228 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594537099]
[2024-03-09 06:13:26,228 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:13:26,228 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:13:26,241 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:13:26,403 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-09 06:13:26,403 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:13:26,403 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594537099]
[2024-03-09 06:13:26,404 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594537099] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:13:26,404 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:13:26,404 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 06:13:26,404 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667243152]
[2024-03-09 06:13:26,404 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:13:26,404 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 06:13:26,404 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:13:26,405 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 06:13:26,405 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 06:13:26,565 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 111 out of 148
[2024-03-09 06:13:26,566 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 155 transitions, 427 flow. Second operand  has 6 states, 6 states have (on average 113.16666666666667) internal successors, (679), 6 states have internal predecessors, (679), 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)
[2024-03-09 06:13:26,566 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:13:26,566 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 148
[2024-03-09 06:13:26,566 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:13:27,630 INFO  L124   PetriNetUnfolderBase]: 3239/12110 cut-off events.
[2024-03-09 06:13:27,631 INFO  L125   PetriNetUnfolderBase]: For 1843/2394 co-relation queries the response was YES.
[2024-03-09 06:13:27,656 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19965 conditions, 12110 events. 3239/12110 cut-off events. For 1843/2394 co-relation queries the response was YES. Maximal size of possible extension queue 468. Compared 132762 event pairs, 1413 based on Foata normal form. 17/10821 useless extension candidates. Maximal degree in co-relation 15509. Up to 2157 conditions per place. 
[2024-03-09 06:13:27,682 INFO  L140   encePairwiseOnDemand]: 141/148 looper letters, 51 selfloop transitions, 5 changer transitions 0/177 dead transitions.
[2024-03-09 06:13:27,683 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 177 transitions, 583 flow
[2024-03-09 06:13:27,684 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 06:13:27,684 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 06:13:27,685 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 724 transitions.
[2024-03-09 06:13:27,685 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8153153153153153
[2024-03-09 06:13:27,685 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 724 transitions.
[2024-03-09 06:13:27,685 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 724 transitions.
[2024-03-09 06:13:27,685 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:13:27,685 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 724 transitions.
[2024-03-09 06:13:27,687 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 120.66666666666667) internal successors, (724), 6 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:13:27,688 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 148.0) internal successors, (1036), 7 states have internal predecessors, (1036), 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)
[2024-03-09 06:13:27,688 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 148.0) internal successors, (1036), 7 states have internal predecessors, (1036), 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)
[2024-03-09 06:13:27,688 INFO  L175             Difference]: Start difference. First operand has 155 places, 155 transitions, 427 flow. Second operand 6 states and 724 transitions.
[2024-03-09 06:13:27,688 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 177 transitions, 583 flow
[2024-03-09 06:13:27,694 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 177 transitions, 565 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-09 06:13:27,696 INFO  L231             Difference]: Finished difference. Result has 156 places, 153 transitions, 415 flow
[2024-03-09 06:13:27,696 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=405, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=415, PETRI_PLACES=156, PETRI_TRANSITIONS=153}
[2024-03-09 06:13:27,696 INFO  L281   CegarLoopForPetriNet]: 149 programPoint places, 7 predicate places.
[2024-03-09 06:13:27,696 INFO  L495      AbstractCegarLoop]: Abstraction has has 156 places, 153 transitions, 415 flow
[2024-03-09 06:13:27,697 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 113.16666666666667) internal successors, (679), 6 states have internal predecessors, (679), 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)
[2024-03-09 06:13:27,697 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:13:27,697 INFO  L208   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]
[2024-03-09 06:13:27,697 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2024-03-09 06:13:27,697 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-09 06:13:27,697 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:13:27,697 INFO  L85        PathProgramCache]: Analyzing trace with hash -687312094, now seen corresponding path program 1 times
[2024-03-09 06:13:27,697 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:13:27,698 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043445297]
[2024-03-09 06:13:27,698 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:13:27,698 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:13:27,709 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:13:27,766 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:13:27,766 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:13:27,766 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043445297]
[2024-03-09 06:13:27,767 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043445297] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 06:13:27,767 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [222650042]
[2024-03-09 06:13:27,767 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:13:27,767 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 06:13:27,767 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 06:13:27,768 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 06:13:27,772 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2024-03-09 06:13:27,889 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:13:27,890 INFO  L262         TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 4 conjunts are in the unsatisfiable core
[2024-03-09 06:13:27,891 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 06:13:27,961 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:13:27,961 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 06:13:28,027 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:13:28,028 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [222650042] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 06:13:28,028 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 06:13:28,028 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9
[2024-03-09 06:13:28,028 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986971517]
[2024-03-09 06:13:28,028 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 06:13:28,029 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-03-09 06:13:28,029 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:13:28,029 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-03-09 06:13:28,029 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2024-03-09 06:13:28,304 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 120 out of 148
[2024-03-09 06:13:28,305 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 153 transitions, 415 flow. Second operand  has 9 states, 9 states have (on average 122.22222222222223) internal successors, (1100), 9 states have internal predecessors, (1100), 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)
[2024-03-09 06:13:28,305 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:13:28,305 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 148
[2024-03-09 06:13:28,305 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:13:29,279 INFO  L124   PetriNetUnfolderBase]: 1466/8030 cut-off events.
[2024-03-09 06:13:29,279 INFO  L125   PetriNetUnfolderBase]: For 963/1188 co-relation queries the response was YES.
[2024-03-09 06:13:29,302 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12365 conditions, 8030 events. 1466/8030 cut-off events. For 963/1188 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 83353 event pairs, 536 based on Foata normal form. 1/7296 useless extension candidates. Maximal degree in co-relation 6750. Up to 1078 conditions per place. 
[2024-03-09 06:13:29,321 INFO  L140   encePairwiseOnDemand]: 138/148 looper letters, 48 selfloop transitions, 10 changer transitions 0/185 dead transitions.
[2024-03-09 06:13:29,321 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 185 transitions, 606 flow
[2024-03-09 06:13:29,322 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-03-09 06:13:29,322 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-03-09 06:13:29,324 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1019 transitions.
[2024-03-09 06:13:29,324 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8606418918918919
[2024-03-09 06:13:29,324 INFO  L72            ComplementDD]: Start complementDD. Operand 8 states and 1019 transitions.
[2024-03-09 06:13:29,324 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 8 states and 1019 transitions.
[2024-03-09 06:13:29,325 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:13:29,325 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1019 transitions.
[2024-03-09 06:13:29,326 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 9 states, 8 states have (on average 127.375) internal successors, (1019), 8 states have internal predecessors, (1019), 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)
[2024-03-09 06:13:29,328 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 9 states, 9 states have (on average 148.0) internal successors, (1332), 9 states have internal predecessors, (1332), 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)
[2024-03-09 06:13:29,328 INFO  L81            ComplementDD]: Finished complementDD. Result  has 9 states, 9 states have (on average 148.0) internal successors, (1332), 9 states have internal predecessors, (1332), 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)
[2024-03-09 06:13:29,328 INFO  L175             Difference]: Start difference. First operand has 156 places, 153 transitions, 415 flow. Second operand 8 states and 1019 transitions.
[2024-03-09 06:13:29,328 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 185 transitions, 606 flow
[2024-03-09 06:13:29,332 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 185 transitions, 594 flow, removed 0 selfloop flow, removed 5 redundant places.
[2024-03-09 06:13:29,334 INFO  L231             Difference]: Finished difference. Result has 161 places, 156 transitions, 449 flow
[2024-03-09 06:13:29,334 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=405, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=449, PETRI_PLACES=161, PETRI_TRANSITIONS=156}
[2024-03-09 06:13:29,334 INFO  L281   CegarLoopForPetriNet]: 149 programPoint places, 12 predicate places.
[2024-03-09 06:13:29,334 INFO  L495      AbstractCegarLoop]: Abstraction has has 161 places, 156 transitions, 449 flow
[2024-03-09 06:13:29,335 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 122.22222222222223) internal successors, (1100), 9 states have internal predecessors, (1100), 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)
[2024-03-09 06:13:29,335 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:13:29,335 INFO  L208   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]
[2024-03-09 06:13:29,344 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2024-03-09 06:13:29,536 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21
[2024-03-09 06:13:29,537 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-09 06:13:29,537 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:13:29,537 INFO  L85        PathProgramCache]: Analyzing trace with hash 339486976, now seen corresponding path program 1 times
[2024-03-09 06:13:29,537 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:13:29,538 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546122036]
[2024-03-09 06:13:29,538 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:13:29,538 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:13:29,564 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:13:29,756 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-09 06:13:29,757 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:13:29,757 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546122036]
[2024-03-09 06:13:29,757 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546122036] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:13:29,757 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:13:29,757 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 06:13:29,757 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177009070]
[2024-03-09 06:13:29,757 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:13:29,758 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 06:13:29,758 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:13:29,758 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 06:13:29,758 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 06:13:29,870 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 119 out of 148
[2024-03-09 06:13:29,871 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 156 transitions, 449 flow. Second operand  has 6 states, 6 states have (on average 121.0) internal successors, (726), 6 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:13:29,871 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:13:29,871 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 148
[2024-03-09 06:13:29,872 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:13:30,642 INFO  L124   PetriNetUnfolderBase]: 2161/8242 cut-off events.
[2024-03-09 06:13:30,642 INFO  L125   PetriNetUnfolderBase]: For 834/1139 co-relation queries the response was YES.
[2024-03-09 06:13:30,665 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13644 conditions, 8242 events. 2161/8242 cut-off events. For 834/1139 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 84066 event pairs, 945 based on Foata normal form. 6/7479 useless extension candidates. Maximal degree in co-relation 9840. Up to 1477 conditions per place. 
[2024-03-09 06:13:30,683 INFO  L140   encePairwiseOnDemand]: 142/148 looper letters, 44 selfloop transitions, 5 changer transitions 0/179 dead transitions.
[2024-03-09 06:13:30,683 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 179 transitions, 593 flow
[2024-03-09 06:13:30,684 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 06:13:30,684 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 06:13:30,685 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 764 transitions.
[2024-03-09 06:13:30,686 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8603603603603603
[2024-03-09 06:13:30,686 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 764 transitions.
[2024-03-09 06:13:30,686 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 764 transitions.
[2024-03-09 06:13:30,686 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:13:30,686 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 764 transitions.
[2024-03-09 06:13:30,688 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 127.33333333333333) internal successors, (764), 6 states have internal predecessors, (764), 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)
[2024-03-09 06:13:30,690 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 148.0) internal successors, (1036), 7 states have internal predecessors, (1036), 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)
[2024-03-09 06:13:30,690 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 148.0) internal successors, (1036), 7 states have internal predecessors, (1036), 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)
[2024-03-09 06:13:30,690 INFO  L175             Difference]: Start difference. First operand has 161 places, 156 transitions, 449 flow. Second operand 6 states and 764 transitions.
[2024-03-09 06:13:30,690 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 179 transitions, 593 flow
[2024-03-09 06:13:30,693 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 179 transitions, 587 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-03-09 06:13:30,695 INFO  L231             Difference]: Finished difference. Result has 162 places, 155 transitions, 451 flow
[2024-03-09 06:13:30,695 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=441, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=451, PETRI_PLACES=162, PETRI_TRANSITIONS=155}
[2024-03-09 06:13:30,695 INFO  L281   CegarLoopForPetriNet]: 149 programPoint places, 13 predicate places.
[2024-03-09 06:13:30,695 INFO  L495      AbstractCegarLoop]: Abstraction has has 162 places, 155 transitions, 451 flow
[2024-03-09 06:13:30,696 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 121.0) internal successors, (726), 6 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:13:30,696 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:13:30,696 INFO  L208   CegarLoopForPetriNet]: trace histogram [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]
[2024-03-09 06:13:30,696 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2024-03-09 06:13:30,696 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-09 06:13:30,696 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:13:30,696 INFO  L85        PathProgramCache]: Analyzing trace with hash -1989409948, now seen corresponding path program 1 times
[2024-03-09 06:13:30,696 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:13:30,697 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040250585]
[2024-03-09 06:13:30,697 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:13:30,697 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:13:30,709 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:13:30,723 INFO  L134       CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked.
[2024-03-09 06:13:30,723 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:13:30,723 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040250585]
[2024-03-09 06:13:30,723 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040250585] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:13:30,723 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:13:30,723 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-09 06:13:30,723 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270628296]
[2024-03-09 06:13:30,723 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:13:30,724 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 06:13:30,724 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:13:30,724 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 06:13:30,724 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 06:13:30,739 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 125 out of 148
[2024-03-09 06:13:30,740 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 155 transitions, 451 flow. Second operand  has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 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)
[2024-03-09 06:13:30,740 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:13:30,740 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 148
[2024-03-09 06:13:30,740 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:13:31,357 INFO  L124   PetriNetUnfolderBase]: 1085/6141 cut-off events.
[2024-03-09 06:13:31,358 INFO  L125   PetriNetUnfolderBase]: For 2620/4043 co-relation queries the response was YES.
[2024-03-09 06:13:31,377 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10781 conditions, 6141 events. 1085/6141 cut-off events. For 2620/4043 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 66147 event pairs, 578 based on Foata normal form. 14/5714 useless extension candidates. Maximal degree in co-relation 9687. Up to 1449 conditions per place. 
[2024-03-09 06:13:31,394 INFO  L140   encePairwiseOnDemand]: 141/148 looper letters, 31 selfloop transitions, 13 changer transitions 0/171 dead transitions.
[2024-03-09 06:13:31,394 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 171 transitions, 612 flow
[2024-03-09 06:13:31,395 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 06:13:31,395 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 06:13:31,395 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 408 transitions.
[2024-03-09 06:13:31,395 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.918918918918919
[2024-03-09 06:13:31,396 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 408 transitions.
[2024-03-09 06:13:31,396 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 408 transitions.
[2024-03-09 06:13:31,396 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:13:31,396 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 408 transitions.
[2024-03-09 06:13:31,397 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 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)
[2024-03-09 06:13:31,397 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 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)
[2024-03-09 06:13:31,397 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 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)
[2024-03-09 06:13:31,397 INFO  L175             Difference]: Start difference. First operand has 162 places, 155 transitions, 451 flow. Second operand 3 states and 408 transitions.
[2024-03-09 06:13:31,397 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 171 transitions, 612 flow
[2024-03-09 06:13:31,403 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 171 transitions, 602 flow, removed 0 selfloop flow, removed 5 redundant places.
[2024-03-09 06:13:31,404 INFO  L231             Difference]: Finished difference. Result has 161 places, 164 transitions, 559 flow
[2024-03-09 06:13:31,404 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=441, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=559, PETRI_PLACES=161, PETRI_TRANSITIONS=164}
[2024-03-09 06:13:31,405 INFO  L281   CegarLoopForPetriNet]: 149 programPoint places, 12 predicate places.
[2024-03-09 06:13:31,405 INFO  L495      AbstractCegarLoop]: Abstraction has has 161 places, 164 transitions, 559 flow
[2024-03-09 06:13:31,405 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 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)
[2024-03-09 06:13:31,405 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:13:31,405 INFO  L208   CegarLoopForPetriNet]: trace histogram [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]
[2024-03-09 06:13:31,405 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2024-03-09 06:13:31,405 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-09 06:13:31,406 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:13:31,406 INFO  L85        PathProgramCache]: Analyzing trace with hash 318942446, now seen corresponding path program 1 times
[2024-03-09 06:13:31,406 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:13:31,406 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367868261]
[2024-03-09 06:13:31,406 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:13:31,406 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:13:31,422 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:13:31,470 INFO  L134       CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked.
[2024-03-09 06:13:31,470 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:13:31,470 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367868261]
[2024-03-09 06:13:31,470 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367868261] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:13:31,471 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:13:31,471 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-03-09 06:13:31,471 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585338089]
[2024-03-09 06:13:31,471 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:13:31,471 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 06:13:31,471 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:13:31,472 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 06:13:31,472 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 06:13:31,482 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 132 out of 148
[2024-03-09 06:13:31,482 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 164 transitions, 559 flow. Second operand  has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 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)
[2024-03-09 06:13:31,482 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:13:31,482 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 148
[2024-03-09 06:13:31,482 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:13:31,667 INFO  L124   PetriNetUnfolderBase]: 117/1837 cut-off events.
[2024-03-09 06:13:31,667 INFO  L125   PetriNetUnfolderBase]: For 754/934 co-relation queries the response was YES.
[2024-03-09 06:13:31,671 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2964 conditions, 1837 events. 117/1837 cut-off events. For 754/934 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 14391 event pairs, 43 based on Foata normal form. 24/1785 useless extension candidates. Maximal degree in co-relation 2347. Up to 144 conditions per place. 
[2024-03-09 06:13:31,673 INFO  L140   encePairwiseOnDemand]: 142/148 looper letters, 12 selfloop transitions, 6 changer transitions 0/159 dead transitions.
[2024-03-09 06:13:31,673 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 159 transitions, 532 flow
[2024-03-09 06:13:31,673 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 06:13:31,673 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 06:13:31,674 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 417 transitions.
[2024-03-09 06:13:31,674 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9391891891891891
[2024-03-09 06:13:31,674 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 417 transitions.
[2024-03-09 06:13:31,674 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 417 transitions.
[2024-03-09 06:13:31,674 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:13:31,674 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 417 transitions.
[2024-03-09 06:13:31,675 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 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)
[2024-03-09 06:13:31,675 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 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)
[2024-03-09 06:13:31,675 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 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)
[2024-03-09 06:13:31,675 INFO  L175             Difference]: Start difference. First operand has 161 places, 164 transitions, 559 flow. Second operand 3 states and 417 transitions.
[2024-03-09 06:13:31,676 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 159 transitions, 532 flow
[2024-03-09 06:13:31,678 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 159 transitions, 518 flow, removed 2 selfloop flow, removed 2 redundant places.
[2024-03-09 06:13:31,679 INFO  L231             Difference]: Finished difference. Result has 161 places, 154 transitions, 463 flow
[2024-03-09 06:13:31,679 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=451, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=463, PETRI_PLACES=161, PETRI_TRANSITIONS=154}
[2024-03-09 06:13:31,680 INFO  L281   CegarLoopForPetriNet]: 149 programPoint places, 12 predicate places.
[2024-03-09 06:13:31,680 INFO  L495      AbstractCegarLoop]: Abstraction has has 161 places, 154 transitions, 463 flow
[2024-03-09 06:13:31,680 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 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)
[2024-03-09 06:13:31,680 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:13:31,680 INFO  L208   CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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]
[2024-03-09 06:13:31,680 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2024-03-09 06:13:31,680 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-09 06:13:31,680 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:13:31,681 INFO  L85        PathProgramCache]: Analyzing trace with hash -431818199, now seen corresponding path program 1 times
[2024-03-09 06:13:31,681 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:13:31,681 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024964089]
[2024-03-09 06:13:31,681 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:13:31,681 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:13:31,704 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:13:31,722 INFO  L134       CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked.
[2024-03-09 06:13:31,722 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:13:31,722 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024964089]
[2024-03-09 06:13:31,722 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024964089] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:13:31,722 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:13:31,722 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-09 06:13:31,723 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295249647]
[2024-03-09 06:13:31,723 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:13:31,723 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 06:13:31,723 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:13:31,723 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 06:13:31,723 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 06:13:31,735 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 125 out of 148
[2024-03-09 06:13:31,736 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 154 transitions, 463 flow. Second operand  has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 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)
[2024-03-09 06:13:31,736 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:13:31,736 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 148
[2024-03-09 06:13:31,736 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:13:31,957 INFO  L124   PetriNetUnfolderBase]: 203/2114 cut-off events.
[2024-03-09 06:13:31,957 INFO  L125   PetriNetUnfolderBase]: For 1411/1902 co-relation queries the response was YES.
[2024-03-09 06:13:31,960 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3807 conditions, 2114 events. 203/2114 cut-off events. For 1411/1902 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 17872 event pairs, 134 based on Foata normal form. 3/1970 useless extension candidates. Maximal degree in co-relation 3127. Up to 435 conditions per place. 
[2024-03-09 06:13:31,962 INFO  L140   encePairwiseOnDemand]: 143/148 looper letters, 25 selfloop transitions, 5 changer transitions 0/159 dead transitions.
[2024-03-09 06:13:31,962 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 159 transitions, 545 flow
[2024-03-09 06:13:31,962 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 06:13:31,963 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 06:13:31,963 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 401 transitions.
[2024-03-09 06:13:31,963 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9031531531531531
[2024-03-09 06:13:31,963 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 401 transitions.
[2024-03-09 06:13:31,963 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 401 transitions.
[2024-03-09 06:13:31,963 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:13:31,963 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 401 transitions.
[2024-03-09 06:13:31,964 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 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)
[2024-03-09 06:13:31,964 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 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)
[2024-03-09 06:13:31,965 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 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)
[2024-03-09 06:13:31,965 INFO  L175             Difference]: Start difference. First operand has 161 places, 154 transitions, 463 flow. Second operand 3 states and 401 transitions.
[2024-03-09 06:13:31,965 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 159 transitions, 545 flow
[2024-03-09 06:13:31,966 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 159 transitions, 539 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-09 06:13:31,968 INFO  L231             Difference]: Finished difference. Result has 164 places, 157 transitions, 497 flow
[2024-03-09 06:13:31,968 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=457, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=497, PETRI_PLACES=164, PETRI_TRANSITIONS=157}
[2024-03-09 06:13:31,968 INFO  L281   CegarLoopForPetriNet]: 149 programPoint places, 15 predicate places.
[2024-03-09 06:13:31,968 INFO  L495      AbstractCegarLoop]: Abstraction has has 164 places, 157 transitions, 497 flow
[2024-03-09 06:13:31,968 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 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)
[2024-03-09 06:13:31,968 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:13:31,969 INFO  L208   CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 06:13:31,969 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2024-03-09 06:13:31,969 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-09 06:13:31,969 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:13:31,969 INFO  L85        PathProgramCache]: Analyzing trace with hash -192084319, now seen corresponding path program 1 times
[2024-03-09 06:13:31,969 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:13:31,969 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594189978]
[2024-03-09 06:13:31,969 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:13:31,969 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:13:32,008 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-09 06:13:32,009 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-03-09 06:13:32,025 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-09 06:13:32,035 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-03-09 06:13:32,035 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-03-09 06:13:32,036 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining)
[2024-03-09 06:13:32,036 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining)
[2024-03-09 06:13:32,036 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining)
[2024-03-09 06:13:32,036 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining)
[2024-03-09 06:13:32,036 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining)
[2024-03-09 06:13:32,036 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining)
[2024-03-09 06:13:32,036 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining)
[2024-03-09 06:13:32,036 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining)
[2024-03-09 06:13:32,036 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining)
[2024-03-09 06:13:32,036 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining)
[2024-03-09 06:13:32,036 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2024-03-09 06:13:32,037 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 06:13:32,037 WARN  L233   ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-03-09 06:13:32,037 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances.
[2024-03-09 06:13:32,054 INFO  L144    ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions.
[2024-03-09 06:13:32,055 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 168 places, 166 transitions, 372 flow
[2024-03-09 06:13:32,120 INFO  L124   PetriNetUnfolderBase]: 43/875 cut-off events.
[2024-03-09 06:13:32,120 INFO  L125   PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES.
[2024-03-09 06:13:32,122 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 926 conditions, 875 events. 43/875 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3140 event pairs, 6 based on Foata normal form. 0/760 useless extension candidates. Maximal degree in co-relation 513. Up to 32 conditions per place. 
[2024-03-09 06:13:32,122 INFO  L82        GeneralOperation]: Start removeDead. Operand has 168 places, 166 transitions, 372 flow
[2024-03-09 06:13:32,124 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 168 places, 166 transitions, 372 flow
[2024-03-09 06:13:32,124 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-09 06:13:32,125 INFO  L357      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, mHoare=true, 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;@47f4dfca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-03-09 06:13:32,125 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 11 error locations.
[2024-03-09 06:13:32,126 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-03-09 06:13:32,127 INFO  L124   PetriNetUnfolderBase]: 3/50 cut-off events.
[2024-03-09 06:13:32,127 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-03-09 06:13:32,127 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:13:32,127 INFO  L208   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]
[2024-03-09 06:13:32,127 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-09 06:13:32,127 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:13:32,127 INFO  L85        PathProgramCache]: Analyzing trace with hash -1989902805, now seen corresponding path program 1 times
[2024-03-09 06:13:32,127 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:13:32,127 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924082315]
[2024-03-09 06:13:32,127 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:13:32,127 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:13:32,133 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:13:32,141 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:13:32,141 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:13:32,141 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924082315]
[2024-03-09 06:13:32,141 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924082315] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:13:32,141 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:13:32,141 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-09 06:13:32,142 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685826362]
[2024-03-09 06:13:32,142 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:13:32,142 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 06:13:32,142 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:13:32,142 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 06:13:32,142 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 06:13:32,160 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 140 out of 166
[2024-03-09 06:13:32,160 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 166 transitions, 372 flow. Second operand  has 3 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 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)
[2024-03-09 06:13:32,160 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:13:32,161 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 166
[2024-03-09 06:13:32,161 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:13:34,910 INFO  L124   PetriNetUnfolderBase]: 7859/26495 cut-off events.
[2024-03-09 06:13:34,910 INFO  L125   PetriNetUnfolderBase]: For 2416/4639 co-relation queries the response was YES.
[2024-03-09 06:13:34,957 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 38845 conditions, 26495 events. 7859/26495 cut-off events. For 2416/4639 co-relation queries the response was YES. Maximal size of possible extension queue 729. Compared 307503 event pairs, 4292 based on Foata normal form. 814/24648 useless extension candidates. Maximal degree in co-relation 30842. Up to 7653 conditions per place. 
[2024-03-09 06:13:35,022 INFO  L140   encePairwiseOnDemand]: 156/166 looper letters, 30 selfloop transitions, 6 changer transitions 1/176 dead transitions.
[2024-03-09 06:13:35,022 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 176 transitions, 464 flow
[2024-03-09 06:13:35,024 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 06:13:35,024 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 06:13:35,025 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 460 transitions.
[2024-03-09 06:13:35,025 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9236947791164659
[2024-03-09 06:13:35,025 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 460 transitions.
[2024-03-09 06:13:35,025 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 460 transitions.
[2024-03-09 06:13:35,025 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:13:35,025 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 460 transitions.
[2024-03-09 06:13:35,026 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 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)
[2024-03-09 06:13:35,027 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 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)
[2024-03-09 06:13:35,027 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 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)
[2024-03-09 06:13:35,028 INFO  L175             Difference]: Start difference. First operand has 168 places, 166 transitions, 372 flow. Second operand 3 states and 460 transitions.
[2024-03-09 06:13:35,028 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 176 transitions, 464 flow
[2024-03-09 06:13:35,029 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 176 transitions, 464 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-09 06:13:35,031 INFO  L231             Difference]: Finished difference. Result has 172 places, 167 transitions, 410 flow
[2024-03-09 06:13:35,032 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=366, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=410, PETRI_PLACES=172, PETRI_TRANSITIONS=167}
[2024-03-09 06:13:35,032 INFO  L281   CegarLoopForPetriNet]: 168 programPoint places, 4 predicate places.
[2024-03-09 06:13:35,032 INFO  L495      AbstractCegarLoop]: Abstraction has has 172 places, 167 transitions, 410 flow
[2024-03-09 06:13:35,033 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 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)
[2024-03-09 06:13:35,033 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:13:35,033 INFO  L208   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]
[2024-03-09 06:13:35,033 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2024-03-09 06:13:35,033 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-09 06:13:35,033 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:13:35,034 INFO  L85        PathProgramCache]: Analyzing trace with hash 98780464, now seen corresponding path program 1 times
[2024-03-09 06:13:35,034 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:13:35,034 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814624604]
[2024-03-09 06:13:35,034 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:13:35,034 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:13:35,041 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:13:35,069 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:13:35,070 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:13:35,070 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814624604]
[2024-03-09 06:13:35,070 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814624604] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:13:35,070 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:13:35,070 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 06:13:35,070 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386636010]
[2024-03-09 06:13:35,070 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:13:35,070 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-03-09 06:13:35,070 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:13:35,071 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-03-09 06:13:35,071 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-03-09 06:13:35,179 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 136 out of 166
[2024-03-09 06:13:35,180 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 167 transitions, 410 flow. Second operand  has 5 states, 5 states have (on average 137.4) internal successors, (687), 5 states have internal predecessors, (687), 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)
[2024-03-09 06:13:35,180 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:13:35,180 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 166
[2024-03-09 06:13:35,180 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:13:38,655 INFO  L124   PetriNetUnfolderBase]: 9343/35718 cut-off events.
[2024-03-09 06:13:38,656 INFO  L125   PetriNetUnfolderBase]: For 2608/2732 co-relation queries the response was YES.
[2024-03-09 06:13:38,757 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 52635 conditions, 35718 events. 9343/35718 cut-off events. For 2608/2732 co-relation queries the response was YES. Maximal size of possible extension queue 838. Compared 446962 event pairs, 7523 based on Foata normal form. 1/31492 useless extension candidates. Maximal degree in co-relation 32417. Up to 10778 conditions per place. 
[2024-03-09 06:13:38,861 INFO  L140   encePairwiseOnDemand]: 158/166 looper letters, 28 selfloop transitions, 2 changer transitions 5/175 dead transitions.
[2024-03-09 06:13:38,861 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 175 transitions, 496 flow
[2024-03-09 06:13:38,862 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 06:13:38,862 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 06:13:38,863 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 852 transitions.
[2024-03-09 06:13:38,863 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8554216867469879
[2024-03-09 06:13:38,863 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 852 transitions.
[2024-03-09 06:13:38,863 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 852 transitions.
[2024-03-09 06:13:38,864 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:13:38,864 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 852 transitions.
[2024-03-09 06:13:38,865 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 142.0) internal successors, (852), 6 states have internal predecessors, (852), 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)
[2024-03-09 06:13:38,866 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 166.0) internal successors, (1162), 7 states have internal predecessors, (1162), 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)
[2024-03-09 06:13:38,866 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 166.0) internal successors, (1162), 7 states have internal predecessors, (1162), 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)
[2024-03-09 06:13:38,866 INFO  L175             Difference]: Start difference. First operand has 172 places, 167 transitions, 410 flow. Second operand 6 states and 852 transitions.
[2024-03-09 06:13:38,866 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 175 transitions, 496 flow
[2024-03-09 06:13:38,907 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 175 transitions, 484 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-09 06:13:38,909 INFO  L231             Difference]: Finished difference. Result has 178 places, 168 transitions, 420 flow
[2024-03-09 06:13:38,909 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=398, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=420, PETRI_PLACES=178, PETRI_TRANSITIONS=168}
[2024-03-09 06:13:38,909 INFO  L281   CegarLoopForPetriNet]: 168 programPoint places, 10 predicate places.
[2024-03-09 06:13:38,909 INFO  L495      AbstractCegarLoop]: Abstraction has has 178 places, 168 transitions, 420 flow
[2024-03-09 06:13:38,910 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 137.4) internal successors, (687), 5 states have internal predecessors, (687), 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)
[2024-03-09 06:13:38,910 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:13:38,910 INFO  L208   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]
[2024-03-09 06:13:38,910 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2024-03-09 06:13:38,910 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-09 06:13:38,910 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:13:38,910 INFO  L85        PathProgramCache]: Analyzing trace with hash -545774200, now seen corresponding path program 1 times
[2024-03-09 06:13:38,910 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:13:38,911 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013286238]
[2024-03-09 06:13:38,911 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:13:38,911 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:13:38,920 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:13:39,071 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:13:39,071 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:13:39,072 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013286238]
[2024-03-09 06:13:39,072 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013286238] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:13:39,072 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:13:39,072 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 06:13:39,072 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062429276]
[2024-03-09 06:13:39,072 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:13:39,073 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 06:13:39,073 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:13:39,073 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 06:13:39,074 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 06:13:39,276 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 121 out of 166
[2024-03-09 06:13:39,277 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 168 transitions, 420 flow. Second operand  has 6 states, 6 states have (on average 122.5) internal successors, (735), 6 states have internal predecessors, (735), 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)
[2024-03-09 06:13:39,277 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:13:39,277 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 166
[2024-03-09 06:13:39,277 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:13:45,155 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([645] L1036-1-->L1037: Formula: (= |v_#race~data~0_1| 0)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_1|}  AuxVars[]  AssignedVars[#race~data~0][69], [189#true, threadThread1of4ForFork0InUse, 161#L1019-5true, 37#L1019-5true, threadThread2of4ForFork0InUse, threadThread3of4ForFork0InUse, threadThread4of4ForFork0NotInUse, 47#L1037true, Black: 171#true, 177#true, 112#L1020-3true, Black: 183#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 179#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 181#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 180#(<= |ULTIMATE.start_main_~threads_total~0#1| 0)])
[2024-03-09 06:13:45,156 INFO  L294   olderBase$Statistics]: this new event has 187 ancestors and is cut-off event
[2024-03-09 06:13:45,156 INFO  L297   olderBase$Statistics]:   existing Event has 124 ancestors and is cut-off event
[2024-03-09 06:13:45,156 INFO  L297   olderBase$Statistics]:   existing Event has 187 ancestors and is cut-off event
[2024-03-09 06:13:45,156 INFO  L297   olderBase$Statistics]:   existing Event has 187 ancestors and is cut-off event
[2024-03-09 06:13:46,129 INFO  L124   PetriNetUnfolderBase]: 18626/62194 cut-off events.
[2024-03-09 06:13:46,129 INFO  L125   PetriNetUnfolderBase]: For 2773/2795 co-relation queries the response was YES.
[2024-03-09 06:13:46,323 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 94160 conditions, 62194 events. 18626/62194 cut-off events. For 2773/2795 co-relation queries the response was YES. Maximal size of possible extension queue 1466. Compared 812796 event pairs, 14621 based on Foata normal form. 0/53689 useless extension candidates. Maximal degree in co-relation 94059. Up to 19383 conditions per place. 
[2024-03-09 06:13:46,516 INFO  L140   encePairwiseOnDemand]: 160/166 looper letters, 69 selfloop transitions, 5 changer transitions 0/199 dead transitions.
[2024-03-09 06:13:46,516 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 199 transitions, 630 flow
[2024-03-09 06:13:46,517 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 06:13:46,517 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 06:13:46,517 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 800 transitions.
[2024-03-09 06:13:46,518 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8032128514056225
[2024-03-09 06:13:46,518 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 800 transitions.
[2024-03-09 06:13:46,518 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 800 transitions.
[2024-03-09 06:13:46,518 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:13:46,518 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 800 transitions.
[2024-03-09 06:13:46,519 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 133.33333333333334) internal successors, (800), 6 states have internal predecessors, (800), 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)
[2024-03-09 06:13:46,520 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 166.0) internal successors, (1162), 7 states have internal predecessors, (1162), 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)
[2024-03-09 06:13:46,520 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 166.0) internal successors, (1162), 7 states have internal predecessors, (1162), 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)
[2024-03-09 06:13:46,520 INFO  L175             Difference]: Start difference. First operand has 178 places, 168 transitions, 420 flow. Second operand 6 states and 800 transitions.
[2024-03-09 06:13:46,520 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 199 transitions, 630 flow
[2024-03-09 06:13:46,566 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 199 transitions, 618 flow, removed 5 selfloop flow, removed 4 redundant places.
[2024-03-09 06:13:46,568 INFO  L231             Difference]: Finished difference. Result has 175 places, 167 transitions, 416 flow
[2024-03-09 06:13:46,568 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=416, PETRI_PLACES=175, PETRI_TRANSITIONS=167}
[2024-03-09 06:13:46,568 INFO  L281   CegarLoopForPetriNet]: 168 programPoint places, 7 predicate places.
[2024-03-09 06:13:46,568 INFO  L495      AbstractCegarLoop]: Abstraction has has 175 places, 167 transitions, 416 flow
[2024-03-09 06:13:46,569 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 122.5) internal successors, (735), 6 states have internal predecessors, (735), 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)
[2024-03-09 06:13:46,569 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:13:46,569 INFO  L208   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]
[2024-03-09 06:13:46,569 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2024-03-09 06:13:46,569 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-09 06:13:46,569 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:13:46,569 INFO  L85        PathProgramCache]: Analyzing trace with hash 321620656, now seen corresponding path program 1 times
[2024-03-09 06:13:46,569 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:13:46,569 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697082967]
[2024-03-09 06:13:46,569 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:13:46,570 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:13:46,579 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:13:46,589 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:13:46,589 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:13:46,589 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697082967]
[2024-03-09 06:13:46,589 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697082967] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:13:46,589 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:13:46,589 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-09 06:13:46,589 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135107202]
[2024-03-09 06:13:46,590 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:13:46,590 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 06:13:46,590 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:13:46,590 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 06:13:46,590 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 06:13:46,610 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 138 out of 166
[2024-03-09 06:13:46,610 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 167 transitions, 416 flow. Second operand  has 3 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 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)
[2024-03-09 06:13:46,610 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:13:46,610 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 166
[2024-03-09 06:13:46,610 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:13:51,637 INFO  L124   PetriNetUnfolderBase]: 13833/49472 cut-off events.
[2024-03-09 06:13:51,637 INFO  L125   PetriNetUnfolderBase]: For 11568/20327 co-relation queries the response was YES.
[2024-03-09 06:13:51,793 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 79192 conditions, 49472 events. 13833/49472 cut-off events. For 11568/20327 co-relation queries the response was YES. Maximal size of possible extension queue 1463. Compared 657348 event pairs, 7275 based on Foata normal form. 42/43145 useless extension candidates. Maximal degree in co-relation 35845. Up to 16026 conditions per place. 
[2024-03-09 06:13:52,079 INFO  L140   encePairwiseOnDemand]: 158/166 looper letters, 39 selfloop transitions, 11 changer transitions 0/188 dead transitions.
[2024-03-09 06:13:52,080 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 188 transitions, 602 flow
[2024-03-09 06:13:52,080 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 06:13:52,080 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 06:13:52,081 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 458 transitions.
[2024-03-09 06:13:52,081 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9196787148594378
[2024-03-09 06:13:52,081 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 458 transitions.
[2024-03-09 06:13:52,081 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 458 transitions.
[2024-03-09 06:13:52,081 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:13:52,081 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 458 transitions.
[2024-03-09 06:13:52,082 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 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)
[2024-03-09 06:13:52,082 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 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)
[2024-03-09 06:13:52,083 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 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)
[2024-03-09 06:13:52,083 INFO  L175             Difference]: Start difference. First operand has 175 places, 167 transitions, 416 flow. Second operand 3 states and 458 transitions.
[2024-03-09 06:13:52,083 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 188 transitions, 602 flow
[2024-03-09 06:13:52,086 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 188 transitions, 592 flow, removed 0 selfloop flow, removed 5 redundant places.
[2024-03-09 06:13:52,088 INFO  L231             Difference]: Finished difference. Result has 174 places, 176 transitions, 502 flow
[2024-03-09 06:13:52,088 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=502, PETRI_PLACES=174, PETRI_TRANSITIONS=176}
[2024-03-09 06:13:52,088 INFO  L281   CegarLoopForPetriNet]: 168 programPoint places, 6 predicate places.
[2024-03-09 06:13:52,089 INFO  L495      AbstractCegarLoop]: Abstraction has has 174 places, 176 transitions, 502 flow
[2024-03-09 06:13:52,089 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 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)
[2024-03-09 06:13:52,089 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:13:52,089 INFO  L208   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]
[2024-03-09 06:13:52,089 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2024-03-09 06:13:52,089 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-09 06:13:52,089 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:13:52,089 INFO  L85        PathProgramCache]: Analyzing trace with hash -688364229, now seen corresponding path program 1 times
[2024-03-09 06:13:52,089 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:13:52,090 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968664479]
[2024-03-09 06:13:52,090 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:13:52,090 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:13:52,101 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:13:52,237 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-09 06:13:52,237 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:13:52,237 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968664479]
[2024-03-09 06:13:52,237 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968664479] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:13:52,237 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:13:52,237 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 06:13:52,237 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729354492]
[2024-03-09 06:13:52,237 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:13:52,238 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 06:13:52,238 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:13:52,238 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 06:13:52,238 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 06:13:52,394 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 125 out of 166
[2024-03-09 06:13:52,394 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 176 transitions, 502 flow. Second operand  has 6 states, 6 states have (on average 127.16666666666667) internal successors, (763), 6 states have internal predecessors, (763), 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)
[2024-03-09 06:13:52,394 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:13:52,394 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 166
[2024-03-09 06:13:52,394 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:13:58,440 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([705] L1019-4-->L1019-5: Formula: (= |v_#race~data~0_4| |v_threadThread3of4ForFork0_#t~nondet5_3|)  InVars {threadThread3of4ForFork0_#t~nondet5=|v_threadThread3of4ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of4ForFork0_#t~nondet5=|v_threadThread3of4ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][169], [72#L1018-3true, threadThread1of4ForFork0InUse, 37#L1019-5true, threadThread2of4ForFork0InUse, threadThread3of4ForFork0InUse, threadThread4of4ForFork0NotInUse, Black: 198#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), Black: 173#(= |#race~data~0| 0), 141#L1020true, Black: 179#(= |ULTIMATE.start_main_~i~0#1| 0), 129#L1037-1true, 196#true, 202#true])
[2024-03-09 06:13:58,440 INFO  L294   olderBase$Statistics]: this new event has 181 ancestors and is cut-off event
[2024-03-09 06:13:58,441 INFO  L297   olderBase$Statistics]:   existing Event has 118 ancestors and is cut-off event
[2024-03-09 06:13:58,441 INFO  L297   olderBase$Statistics]:   existing Event has 181 ancestors and is cut-off event
[2024-03-09 06:13:58,441 INFO  L297   olderBase$Statistics]:   existing Event has 118 ancestors and is cut-off event
[2024-03-09 06:13:58,563 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([753] L1019-4-->L1019-5: Formula: (= |v_threadThread4of4ForFork0_#t~nondet5_3| |v_#race~data~0_4|)  InVars {threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|}  OutVars{threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_4|}  AuxVars[]  AssignedVars[#race~data~0][204], [threadThread1of4ForFork0InUse, threadThread2of4ForFork0NotInUse, 99#L1019-6true, 37#L1019-5true, threadThread3of4ForFork0InUse, Black: 198#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), threadThread4of4ForFork0InUse, Black: 173#(= |#race~data~0| 0), 4#L1019-5true, Black: 179#(= |ULTIMATE.start_main_~i~0#1| 0), 129#L1037-1true, 196#true, 202#true])
[2024-03-09 06:13:58,563 INFO  L294   olderBase$Statistics]: this new event has 185 ancestors and is cut-off event
[2024-03-09 06:13:58,563 INFO  L297   olderBase$Statistics]:   existing Event has 185 ancestors and is cut-off event
[2024-03-09 06:13:58,563 INFO  L297   olderBase$Statistics]:   existing Event has 185 ancestors and is cut-off event
[2024-03-09 06:13:58,563 INFO  L297   olderBase$Statistics]:   existing Event has 185 ancestors and is cut-off event
[2024-03-09 06:13:58,621 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([705] L1019-4-->L1019-5: Formula: (= |v_#race~data~0_4| |v_threadThread3of4ForFork0_#t~nondet5_3|)  InVars {threadThread3of4ForFork0_#t~nondet5=|v_threadThread3of4ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of4ForFork0_#t~nondet5=|v_threadThread3of4ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][169], [threadThread1of4ForFork0InUse, 37#L1019-5true, threadThread2of4ForFork0InUse, threadThread3of4ForFork0InUse, threadThread4of4ForFork0NotInUse, Black: 198#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), Black: 173#(= |#race~data~0| 0), 35#L1019-5true, Black: 179#(= |ULTIMATE.start_main_~i~0#1| 0), 129#L1037-1true, 196#true, 202#true, 23#threadErr0ASSERT_VIOLATIONDATA_RACEtrue])
[2024-03-09 06:13:58,622 INFO  L294   olderBase$Statistics]: this new event has 185 ancestors and is cut-off event
[2024-03-09 06:13:58,622 INFO  L297   olderBase$Statistics]:   existing Event has 122 ancestors and is cut-off event
[2024-03-09 06:13:58,622 INFO  L297   olderBase$Statistics]:   existing Event has 185 ancestors and is cut-off event
[2024-03-09 06:13:58,622 INFO  L297   olderBase$Statistics]:   existing Event has 122 ancestors and is cut-off event
[2024-03-09 06:13:59,131 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([753] L1019-4-->L1019-5: Formula: (= |v_threadThread4of4ForFork0_#t~nondet5_3| |v_#race~data~0_4|)  InVars {threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|}  OutVars{threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_4|}  AuxVars[]  AssignedVars[#race~data~0][198], [threadThread1of4ForFork0InUse, 37#L1019-5true, threadThread2of4ForFork0NotInUse, threadThread3of4ForFork0InUse, Black: 198#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), threadThread4of4ForFork0InUse, Black: 173#(= |#race~data~0| 0), 4#L1019-5true, 141#L1020true, Black: 179#(= |ULTIMATE.start_main_~i~0#1| 0), 129#L1037-1true, 196#true, 202#true])
[2024-03-09 06:13:59,131 INFO  L294   olderBase$Statistics]: this new event has 187 ancestors and is not cut-off event
[2024-03-09 06:13:59,131 INFO  L297   olderBase$Statistics]:   existing Event has 187 ancestors and is not cut-off event
[2024-03-09 06:13:59,131 INFO  L297   olderBase$Statistics]:   existing Event has 187 ancestors and is not cut-off event
[2024-03-09 06:13:59,131 INFO  L297   olderBase$Statistics]:   existing Event has 187 ancestors and is not cut-off event
[2024-03-09 06:13:59,993 INFO  L124   PetriNetUnfolderBase]: 23498/69422 cut-off events.
[2024-03-09 06:13:59,993 INFO  L125   PetriNetUnfolderBase]: For 10458/14172 co-relation queries the response was YES.
[2024-03-09 06:14:00,251 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 117984 conditions, 69422 events. 23498/69422 cut-off events. For 10458/14172 co-relation queries the response was YES. Maximal size of possible extension queue 1887. Compared 907171 event pairs, 9806 based on Foata normal form. 80/61261 useless extension candidates. Maximal degree in co-relation 91134. Up to 12712 conditions per place. 
[2024-03-09 06:14:00,489 INFO  L140   encePairwiseOnDemand]: 159/166 looper letters, 63 selfloop transitions, 5 changer transitions 0/206 dead transitions.
[2024-03-09 06:14:00,489 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 206 transitions, 698 flow
[2024-03-09 06:14:00,490 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 06:14:00,490 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 06:14:00,491 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 820 transitions.
[2024-03-09 06:14:00,491 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8232931726907631
[2024-03-09 06:14:00,491 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 820 transitions.
[2024-03-09 06:14:00,491 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 820 transitions.
[2024-03-09 06:14:00,491 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:14:00,491 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 820 transitions.
[2024-03-09 06:14:00,492 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 136.66666666666666) internal successors, (820), 6 states have internal predecessors, (820), 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)
[2024-03-09 06:14:00,493 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 166.0) internal successors, (1162), 7 states have internal predecessors, (1162), 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)
[2024-03-09 06:14:00,493 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 166.0) internal successors, (1162), 7 states have internal predecessors, (1162), 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)
[2024-03-09 06:14:00,493 INFO  L175             Difference]: Start difference. First operand has 174 places, 176 transitions, 502 flow. Second operand 6 states and 820 transitions.
[2024-03-09 06:14:00,493 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 206 transitions, 698 flow
[2024-03-09 06:14:00,560 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 206 transitions, 676 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-09 06:14:00,561 INFO  L231             Difference]: Finished difference. Result has 175 places, 174 transitions, 486 flow
[2024-03-09 06:14:00,561 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=486, PETRI_PLACES=175, PETRI_TRANSITIONS=174}
[2024-03-09 06:14:00,562 INFO  L281   CegarLoopForPetriNet]: 168 programPoint places, 7 predicate places.
[2024-03-09 06:14:00,562 INFO  L495      AbstractCegarLoop]: Abstraction has has 175 places, 174 transitions, 486 flow
[2024-03-09 06:14:00,562 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 127.16666666666667) internal successors, (763), 6 states have internal predecessors, (763), 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)
[2024-03-09 06:14:00,562 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:14:00,562 INFO  L208   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]
[2024-03-09 06:14:00,562 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2024-03-09 06:14:00,562 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-09 06:14:00,562 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:14:00,563 INFO  L85        PathProgramCache]: Analyzing trace with hash -664645664, now seen corresponding path program 1 times
[2024-03-09 06:14:00,563 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:14:00,563 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423057680]
[2024-03-09 06:14:00,563 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:14:00,563 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:14:00,574 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:14:00,619 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:14:00,619 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:14:00,620 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423057680]
[2024-03-09 06:14:00,620 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423057680] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 06:14:00,620 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1415230572]
[2024-03-09 06:14:00,620 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:14:00,620 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 06:14:00,620 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 06:14:00,621 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 06:14:00,623 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2024-03-09 06:14:00,729 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:14:00,730 INFO  L262         TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 4 conjunts are in the unsatisfiable core
[2024-03-09 06:14:00,732 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 06:14:00,792 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:14:00,793 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 06:14:00,847 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:14:00,847 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1415230572] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 06:14:00,847 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 06:14:00,848 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9
[2024-03-09 06:14:00,848 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402392292]
[2024-03-09 06:14:00,848 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 06:14:00,848 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-03-09 06:14:00,849 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:14:00,849 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-03-09 06:14:00,849 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2024-03-09 06:14:01,012 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 134 out of 166
[2024-03-09 06:14:01,012 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 174 transitions, 486 flow. Second operand  has 9 states, 9 states have (on average 136.22222222222223) internal successors, (1226), 9 states have internal predecessors, (1226), 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)
[2024-03-09 06:14:01,013 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:14:01,013 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 166
[2024-03-09 06:14:01,013 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:14:04,680 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([753] L1019-4-->L1019-5: Formula: (= |v_threadThread4of4ForFork0_#t~nondet5_3| |v_#race~data~0_4|)  InVars {threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|}  OutVars{threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_4|}  AuxVars[]  AssignedVars[#race~data~0][212], [threadThread1of4ForFork0InUse, threadThread2of4ForFork0NotInUse, 99#L1019-6true, 37#L1019-5true, threadThread3of4ForFork0InUse, Black: 198#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), threadThread4of4ForFork0InUse, 213#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), Black: 173#(= |#race~data~0| 0), 4#L1019-5true, Black: 179#(= |ULTIMATE.start_main_~i~0#1| 0), 129#L1037-1true, 202#true])
[2024-03-09 06:14:04,680 INFO  L294   olderBase$Statistics]: this new event has 185 ancestors and is cut-off event
[2024-03-09 06:14:04,680 INFO  L297   olderBase$Statistics]:   existing Event has 185 ancestors and is cut-off event
[2024-03-09 06:14:04,680 INFO  L297   olderBase$Statistics]:   existing Event has 185 ancestors and is cut-off event
[2024-03-09 06:14:04,680 INFO  L297   olderBase$Statistics]:   existing Event has 185 ancestors and is cut-off event
[2024-03-09 06:14:05,308 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([753] L1019-4-->L1019-5: Formula: (= |v_threadThread4of4ForFork0_#t~nondet5_3| |v_#race~data~0_4|)  InVars {threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|}  OutVars{threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_4|}  AuxVars[]  AssignedVars[#race~data~0][211], [threadThread1of4ForFork0InUse, 37#L1019-5true, threadThread2of4ForFork0NotInUse, threadThread3of4ForFork0InUse, Black: 198#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 213#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), threadThread4of4ForFork0InUse, Black: 173#(= |#race~data~0| 0), 4#L1019-5true, 141#L1020true, Black: 179#(= |ULTIMATE.start_main_~i~0#1| 0), 129#L1037-1true, 202#true])
[2024-03-09 06:14:05,309 INFO  L294   olderBase$Statistics]: this new event has 187 ancestors and is not cut-off event
[2024-03-09 06:14:05,309 INFO  L297   olderBase$Statistics]:   existing Event has 187 ancestors and is not cut-off event
[2024-03-09 06:14:05,309 INFO  L297   olderBase$Statistics]:   existing Event has 187 ancestors and is not cut-off event
[2024-03-09 06:14:05,309 INFO  L297   olderBase$Statistics]:   existing Event has 187 ancestors and is not cut-off event
[2024-03-09 06:14:06,215 INFO  L124   PetriNetUnfolderBase]: 11250/46416 cut-off events.
[2024-03-09 06:14:06,216 INFO  L125   PetriNetUnfolderBase]: For 6128/7899 co-relation queries the response was YES.
[2024-03-09 06:14:06,354 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 73697 conditions, 46416 events. 11250/46416 cut-off events. For 6128/7899 co-relation queries the response was YES. Maximal size of possible extension queue 1157. Compared 621045 event pairs, 4609 based on Foata normal form. 9/41398 useless extension candidates. Maximal degree in co-relation 41030. Up to 6732 conditions per place. 
[2024-03-09 06:14:06,477 INFO  L140   encePairwiseOnDemand]: 156/166 looper letters, 61 selfloop transitions, 10 changer transitions 0/215 dead transitions.
[2024-03-09 06:14:06,477 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 215 transitions, 724 flow
[2024-03-09 06:14:06,478 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-03-09 06:14:06,478 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-03-09 06:14:06,479 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1144 transitions.
[2024-03-09 06:14:06,479 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8614457831325302
[2024-03-09 06:14:06,479 INFO  L72            ComplementDD]: Start complementDD. Operand 8 states and 1144 transitions.
[2024-03-09 06:14:06,479 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 8 states and 1144 transitions.
[2024-03-09 06:14:06,480 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:14:06,480 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1144 transitions.
[2024-03-09 06:14:06,481 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 9 states, 8 states have (on average 143.0) internal successors, (1144), 8 states have internal predecessors, (1144), 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)
[2024-03-09 06:14:06,482 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 9 states, 9 states have (on average 166.0) internal successors, (1494), 9 states have internal predecessors, (1494), 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)
[2024-03-09 06:14:06,482 INFO  L81            ComplementDD]: Finished complementDD. Result  has 9 states, 9 states have (on average 166.0) internal successors, (1494), 9 states have internal predecessors, (1494), 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)
[2024-03-09 06:14:06,482 INFO  L175             Difference]: Start difference. First operand has 175 places, 174 transitions, 486 flow. Second operand 8 states and 1144 transitions.
[2024-03-09 06:14:06,482 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 215 transitions, 724 flow
[2024-03-09 06:14:06,498 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 215 transitions, 712 flow, removed 0 selfloop flow, removed 5 redundant places.
[2024-03-09 06:14:06,500 INFO  L231             Difference]: Finished difference. Result has 180 places, 177 transitions, 520 flow
[2024-03-09 06:14:06,500 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=520, PETRI_PLACES=180, PETRI_TRANSITIONS=177}
[2024-03-09 06:14:06,500 INFO  L281   CegarLoopForPetriNet]: 168 programPoint places, 12 predicate places.
[2024-03-09 06:14:06,500 INFO  L495      AbstractCegarLoop]: Abstraction has has 180 places, 177 transitions, 520 flow
[2024-03-09 06:14:06,501 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 136.22222222222223) internal successors, (1226), 9 states have internal predecessors, (1226), 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)
[2024-03-09 06:14:06,501 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:14:06,501 INFO  L208   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]
[2024-03-09 06:14:06,508 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2024-03-09 06:14:06,702 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,4 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 06:14:06,702 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-09 06:14:06,703 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:14:06,703 INFO  L85        PathProgramCache]: Analyzing trace with hash 1224009814, now seen corresponding path program 1 times
[2024-03-09 06:14:06,704 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:14:06,704 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138009604]
[2024-03-09 06:14:06,704 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:14:06,705 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:14:06,728 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:14:06,870 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-09 06:14:06,871 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:14:06,871 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138009604]
[2024-03-09 06:14:06,871 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138009604] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:14:06,871 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:14:06,871 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 06:14:06,871 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131780920]
[2024-03-09 06:14:06,871 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:14:06,872 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 06:14:06,872 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:14:06,872 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 06:14:06,872 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 06:14:07,027 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 133 out of 166
[2024-03-09 06:14:07,028 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 177 transitions, 520 flow. Second operand  has 6 states, 6 states have (on average 135.0) internal successors, (810), 6 states have internal predecessors, (810), 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)
[2024-03-09 06:14:07,028 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:14:07,028 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 166
[2024-03-09 06:14:07,028 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:14:10,758 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([753] L1019-4-->L1019-5: Formula: (= |v_threadThread4of4ForFork0_#t~nondet5_3| |v_#race~data~0_4|)  InVars {threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|}  OutVars{threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_4|}  AuxVars[]  AssignedVars[#race~data~0][207], [threadThread1of4ForFork0InUse, 37#L1019-5true, threadThread2of4ForFork0NotInUse, 99#L1019-6true, threadThread3of4ForFork0InUse, Black: 198#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 213#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), threadThread4of4ForFork0InUse, Black: 173#(= |#race~data~0| 0), 4#L1019-5true, Black: 211#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 214#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), 598#true, Black: 179#(= |ULTIMATE.start_main_~i~0#1| 0), 129#L1037-1true])
[2024-03-09 06:14:10,759 INFO  L294   olderBase$Statistics]: this new event has 185 ancestors and is cut-off event
[2024-03-09 06:14:10,759 INFO  L297   olderBase$Statistics]:   existing Event has 185 ancestors and is cut-off event
[2024-03-09 06:14:10,759 INFO  L297   olderBase$Statistics]:   existing Event has 185 ancestors and is cut-off event
[2024-03-09 06:14:10,759 INFO  L297   olderBase$Statistics]:   existing Event has 185 ancestors and is cut-off event
[2024-03-09 06:14:10,967 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([753] L1019-4-->L1019-5: Formula: (= |v_threadThread4of4ForFork0_#t~nondet5_3| |v_#race~data~0_4|)  InVars {threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|}  OutVars{threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_4|}  AuxVars[]  AssignedVars[#race~data~0][206], [threadThread1of4ForFork0InUse, 37#L1019-5true, threadThread2of4ForFork0NotInUse, threadThread3of4ForFork0InUse, Black: 198#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 213#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), threadThread4of4ForFork0InUse, Black: 173#(= |#race~data~0| 0), 4#L1019-5true, Black: 211#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 214#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), 141#L1020true, 598#true, Black: 179#(= |ULTIMATE.start_main_~i~0#1| 0), 129#L1037-1true])
[2024-03-09 06:14:10,968 INFO  L294   olderBase$Statistics]: this new event has 187 ancestors and is cut-off event
[2024-03-09 06:14:10,968 INFO  L297   olderBase$Statistics]:   existing Event has 187 ancestors and is cut-off event
[2024-03-09 06:14:10,968 INFO  L297   olderBase$Statistics]:   existing Event has 187 ancestors and is cut-off event
[2024-03-09 06:14:10,968 INFO  L297   olderBase$Statistics]:   existing Event has 187 ancestors and is cut-off event
[2024-03-09 06:14:11,973 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([705] L1019-4-->L1019-5: Formula: (= |v_#race~data~0_4| |v_threadThread3of4ForFork0_#t~nondet5_3|)  InVars {threadThread3of4ForFork0_#t~nondet5=|v_threadThread3of4ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of4ForFork0_#t~nondet5=|v_threadThread3of4ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][203], [threadThread1of4ForFork0InUse, 99#L1019-6true, 37#L1019-5true, threadThread2of4ForFork0NotInUse, threadThread3of4ForFork0InUse, Black: 198#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), threadThread4of4ForFork0NotInUse, 213#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), Black: 173#(= |#race~data~0| 0), Black: 211#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 214#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), 598#true, Black: 179#(= |ULTIMATE.start_main_~i~0#1| 0), 129#L1037-1true])
[2024-03-09 06:14:11,973 INFO  L294   olderBase$Statistics]: this new event has 219 ancestors and is cut-off event
[2024-03-09 06:14:11,973 INFO  L297   olderBase$Statistics]:   existing Event has 156 ancestors and is cut-off event
[2024-03-09 06:14:11,973 INFO  L297   olderBase$Statistics]:   existing Event has 156 ancestors and is cut-off event
[2024-03-09 06:14:11,973 INFO  L297   olderBase$Statistics]:   existing Event has 219 ancestors and is cut-off event
[2024-03-09 06:14:12,017 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([705] L1019-4-->L1019-5: Formula: (= |v_#race~data~0_4| |v_threadThread3of4ForFork0_#t~nondet5_3|)  InVars {threadThread3of4ForFork0_#t~nondet5=|v_threadThread3of4ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of4ForFork0_#t~nondet5=|v_threadThread3of4ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][202], [threadThread1of4ForFork0InUse, 37#L1019-5true, threadThread2of4ForFork0NotInUse, threadThread3of4ForFork0InUse, Black: 198#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), threadThread4of4ForFork0NotInUse, 213#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), Black: 173#(= |#race~data~0| 0), Black: 211#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 214#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), 141#L1020true, 598#true, Black: 179#(= |ULTIMATE.start_main_~i~0#1| 0), 129#L1037-1true])
[2024-03-09 06:14:12,017 INFO  L294   olderBase$Statistics]: this new event has 221 ancestors and is cut-off event
[2024-03-09 06:14:12,017 INFO  L297   olderBase$Statistics]:   existing Event has 221 ancestors and is cut-off event
[2024-03-09 06:14:12,017 INFO  L297   olderBase$Statistics]:   existing Event has 158 ancestors and is cut-off event
[2024-03-09 06:14:12,018 INFO  L297   olderBase$Statistics]:   existing Event has 158 ancestors and is cut-off event
[2024-03-09 06:14:12,080 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([645] L1036-1-->L1037: Formula: (= |v_#race~data~0_1| 0)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_1|}  AuxVars[]  AssignedVars[#race~data~0][150], [threadThread1of4ForFork0InUse, threadThread2of4ForFork0NotInUse, 37#L1019-5true, threadThread3of4ForFork0InUse, Black: 198#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), threadThread4of4ForFork0NotInUse, 47#L1037true, 213#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), Black: 171#true, Black: 211#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 214#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), 141#L1020true, 598#true, Black: 179#(= |ULTIMATE.start_main_~i~0#1| 0)])
[2024-03-09 06:14:12,081 INFO  L294   olderBase$Statistics]: this new event has 220 ancestors and is cut-off event
[2024-03-09 06:14:12,081 INFO  L297   olderBase$Statistics]:   existing Event has 157 ancestors and is cut-off event
[2024-03-09 06:14:12,081 INFO  L297   olderBase$Statistics]:   existing Event has 220 ancestors and is cut-off event
[2024-03-09 06:14:12,081 INFO  L297   olderBase$Statistics]:   existing Event has 220 ancestors and is cut-off event
[2024-03-09 06:14:12,312 INFO  L124   PetriNetUnfolderBase]: 16070/47844 cut-off events.
[2024-03-09 06:14:12,313 INFO  L125   PetriNetUnfolderBase]: For 5503/8073 co-relation queries the response was YES.
[2024-03-09 06:14:12,457 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 82394 conditions, 47844 events. 16070/47844 cut-off events. For 5503/8073 co-relation queries the response was YES. Maximal size of possible extension queue 1291. Compared 599070 event pairs, 6983 based on Foata normal form. 122/42671 useless extension candidates. Maximal degree in co-relation 59273. Up to 9119 conditions per place. 
[2024-03-09 06:14:12,595 INFO  L140   encePairwiseOnDemand]: 160/166 looper letters, 56 selfloop transitions, 5 changer transitions 0/208 dead transitions.
[2024-03-09 06:14:12,595 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 208 transitions, 704 flow
[2024-03-09 06:14:12,596 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 06:14:12,596 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 06:14:12,597 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 860 transitions.
[2024-03-09 06:14:12,597 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8634538152610441
[2024-03-09 06:14:12,597 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 860 transitions.
[2024-03-09 06:14:12,597 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 860 transitions.
[2024-03-09 06:14:12,598 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:14:12,598 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 860 transitions.
[2024-03-09 06:14:12,599 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 143.33333333333334) internal successors, (860), 6 states have internal predecessors, (860), 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)
[2024-03-09 06:14:12,599 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 166.0) internal successors, (1162), 7 states have internal predecessors, (1162), 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)
[2024-03-09 06:14:12,600 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 166.0) internal successors, (1162), 7 states have internal predecessors, (1162), 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)
[2024-03-09 06:14:12,600 INFO  L175             Difference]: Start difference. First operand has 180 places, 177 transitions, 520 flow. Second operand 6 states and 860 transitions.
[2024-03-09 06:14:12,600 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 208 transitions, 704 flow
[2024-03-09 06:14:12,611 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 208 transitions, 698 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-03-09 06:14:12,612 INFO  L231             Difference]: Finished difference. Result has 181 places, 176 transitions, 522 flow
[2024-03-09 06:14:12,613 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=512, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=522, PETRI_PLACES=181, PETRI_TRANSITIONS=176}
[2024-03-09 06:14:12,613 INFO  L281   CegarLoopForPetriNet]: 168 programPoint places, 13 predicate places.
[2024-03-09 06:14:12,613 INFO  L495      AbstractCegarLoop]: Abstraction has has 181 places, 176 transitions, 522 flow
[2024-03-09 06:14:12,613 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 135.0) internal successors, (810), 6 states have internal predecessors, (810), 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)
[2024-03-09 06:14:12,613 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:14:12,614 INFO  L208   CegarLoopForPetriNet]: trace histogram [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]
[2024-03-09 06:14:12,614 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2024-03-09 06:14:12,614 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-09 06:14:12,614 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:14:12,614 INFO  L85        PathProgramCache]: Analyzing trace with hash 1672764532, now seen corresponding path program 1 times
[2024-03-09 06:14:12,614 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:14:12,615 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694659148]
[2024-03-09 06:14:12,615 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:14:12,615 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:14:12,630 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:14:12,646 INFO  L134       CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked.
[2024-03-09 06:14:12,646 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:14:12,646 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694659148]
[2024-03-09 06:14:12,646 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694659148] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:14:12,646 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:14:12,646 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-09 06:14:12,647 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450402007]
[2024-03-09 06:14:12,647 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:14:12,647 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 06:14:12,647 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:14:12,647 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 06:14:12,648 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 06:14:12,672 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 138 out of 166
[2024-03-09 06:14:12,673 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 176 transitions, 522 flow. Second operand  has 3 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 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)
[2024-03-09 06:14:12,673 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:14:12,673 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 166
[2024-03-09 06:14:12,673 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:14:17,967 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([645] L1036-1-->L1037: Formula: (= |v_#race~data~0_1| 0)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_1|}  AuxVars[]  AssignedVars[#race~data~0][183], [threadThread1of4ForFork0InUse, 99#L1019-6true, threadThread2of4ForFork0InUse, threadThread3of4ForFork0NotInUse, threadThread4of4ForFork0NotInUse, 41#L1020true, Black: 198#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 213#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), 47#L1037true, Black: 171#true, Black: 211#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 214#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), 598#true, Black: 179#(= |ULTIMATE.start_main_~i~0#1| 0), 605#true])
[2024-03-09 06:14:17,967 INFO  L294   olderBase$Statistics]: this new event has 221 ancestors and is cut-off event
[2024-03-09 06:14:17,967 INFO  L297   olderBase$Statistics]:   existing Event has 158 ancestors and is cut-off event
[2024-03-09 06:14:17,967 INFO  L297   olderBase$Statistics]:   existing Event has 221 ancestors and is cut-off event
[2024-03-09 06:14:17,968 INFO  L297   olderBase$Statistics]:   existing Event has 158 ancestors and is cut-off event
[2024-03-09 06:14:17,983 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([645] L1036-1-->L1037: Formula: (= |v_#race~data~0_1| 0)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_1|}  AuxVars[]  AssignedVars[#race~data~0][183], [threadThread1of4ForFork0InUse, 99#L1019-6true, threadThread2of4ForFork0InUse, threadThread3of4ForFork0NotInUse, threadThread4of4ForFork0NotInUse, Black: 198#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 47#L1037true, 213#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), Black: 171#true, 112#L1020-3true, Black: 211#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 214#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), 598#true, Black: 179#(= |ULTIMATE.start_main_~i~0#1| 0), 605#true])
[2024-03-09 06:14:17,983 INFO  L294   olderBase$Statistics]: this new event has 222 ancestors and is cut-off event
[2024-03-09 06:14:17,983 INFO  L297   olderBase$Statistics]:   existing Event has 222 ancestors and is cut-off event
[2024-03-09 06:14:17,983 INFO  L297   olderBase$Statistics]:   existing Event has 159 ancestors and is cut-off event
[2024-03-09 06:14:17,983 INFO  L297   olderBase$Statistics]:   existing Event has 159 ancestors and is cut-off event
[2024-03-09 06:14:18,086 INFO  L124   PetriNetUnfolderBase]: 11770/46164 cut-off events.
[2024-03-09 06:14:18,086 INFO  L125   PetriNetUnfolderBase]: For 23976/36637 co-relation queries the response was YES.
[2024-03-09 06:14:18,250 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 85233 conditions, 46164 events. 11770/46164 cut-off events. For 23976/36637 co-relation queries the response was YES. Maximal size of possible extension queue 1508. Compared 643519 event pairs, 6450 based on Foata normal form. 50/41999 useless extension candidates. Maximal degree in co-relation 76233. Up to 13606 conditions per place. 
[2024-03-09 06:14:18,387 INFO  L140   encePairwiseOnDemand]: 158/166 looper letters, 43 selfloop transitions, 18 changer transitions 0/201 dead transitions.
[2024-03-09 06:14:18,388 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 201 transitions, 767 flow
[2024-03-09 06:14:18,389 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 06:14:18,389 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 06:14:18,389 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 457 transitions.
[2024-03-09 06:14:18,389 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9176706827309237
[2024-03-09 06:14:18,389 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 457 transitions.
[2024-03-09 06:14:18,390 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 457 transitions.
[2024-03-09 06:14:18,390 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:14:18,390 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 457 transitions.
[2024-03-09 06:14:18,390 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 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)
[2024-03-09 06:14:18,391 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 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)
[2024-03-09 06:14:18,391 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 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)
[2024-03-09 06:14:18,391 INFO  L175             Difference]: Start difference. First operand has 181 places, 176 transitions, 522 flow. Second operand 3 states and 457 transitions.
[2024-03-09 06:14:18,391 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 201 transitions, 767 flow
[2024-03-09 06:14:18,426 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 201 transitions, 757 flow, removed 0 selfloop flow, removed 5 redundant places.
[2024-03-09 06:14:18,428 INFO  L231             Difference]: Finished difference. Result has 180 places, 190 transitions, 690 flow
[2024-03-09 06:14:18,429 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=512, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=690, PETRI_PLACES=180, PETRI_TRANSITIONS=190}
[2024-03-09 06:14:18,429 INFO  L281   CegarLoopForPetriNet]: 168 programPoint places, 12 predicate places.
[2024-03-09 06:14:18,429 INFO  L495      AbstractCegarLoop]: Abstraction has has 180 places, 190 transitions, 690 flow
[2024-03-09 06:14:18,429 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 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)
[2024-03-09 06:14:18,429 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:14:18,430 INFO  L208   CegarLoopForPetriNet]: trace histogram [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]
[2024-03-09 06:14:18,430 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2024-03-09 06:14:18,430 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-09 06:14:18,430 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:14:18,430 INFO  L85        PathProgramCache]: Analyzing trace with hash 849959134, now seen corresponding path program 1 times
[2024-03-09 06:14:18,430 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:14:18,431 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362918198]
[2024-03-09 06:14:18,431 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:14:18,431 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:14:18,446 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:14:18,478 INFO  L134       CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked.
[2024-03-09 06:14:18,479 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:14:18,479 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362918198]
[2024-03-09 06:14:18,479 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362918198] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:14:18,479 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:14:18,479 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-03-09 06:14:18,479 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101520569]
[2024-03-09 06:14:18,480 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:14:18,480 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 06:14:18,480 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:14:18,480 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 06:14:18,480 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 06:14:18,490 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 146 out of 166
[2024-03-09 06:14:18,491 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 190 transitions, 690 flow. Second operand  has 3 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 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)
[2024-03-09 06:14:18,491 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:14:18,491 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 166
[2024-03-09 06:14:18,491 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:14:19,295 INFO  L124   PetriNetUnfolderBase]: 660/7154 cut-off events.
[2024-03-09 06:14:19,295 INFO  L125   PetriNetUnfolderBase]: For 3309/4024 co-relation queries the response was YES.
[2024-03-09 06:14:19,315 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11917 conditions, 7154 events. 660/7154 cut-off events. For 3309/4024 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 80144 event pairs, 237 based on Foata normal form. 185/6908 useless extension candidates. Maximal degree in co-relation 9194. Up to 678 conditions per place. 
[2024-03-09 06:14:19,325 INFO  L140   encePairwiseOnDemand]: 158/166 looper letters, 16 selfloop transitions, 8 changer transitions 0/180 dead transitions.
[2024-03-09 06:14:19,326 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 180 transitions, 623 flow
[2024-03-09 06:14:19,326 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 06:14:19,327 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 06:14:19,327 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 466 transitions.
[2024-03-09 06:14:19,327 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9357429718875502
[2024-03-09 06:14:19,327 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 466 transitions.
[2024-03-09 06:14:19,327 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 466 transitions.
[2024-03-09 06:14:19,328 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:14:19,328 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 466 transitions.
[2024-03-09 06:14:19,328 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 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)
[2024-03-09 06:14:19,329 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 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)
[2024-03-09 06:14:19,329 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 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)
[2024-03-09 06:14:19,329 INFO  L175             Difference]: Start difference. First operand has 180 places, 190 transitions, 690 flow. Second operand 3 states and 466 transitions.
[2024-03-09 06:14:19,329 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 180 transitions, 623 flow
[2024-03-09 06:14:19,338 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 180 transitions, 609 flow, removed 2 selfloop flow, removed 2 redundant places.
[2024-03-09 06:14:19,339 INFO  L231             Difference]: Finished difference. Result has 180 places, 173 transitions, 530 flow
[2024-03-09 06:14:19,340 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=514, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=530, PETRI_PLACES=180, PETRI_TRANSITIONS=173}
[2024-03-09 06:14:19,340 INFO  L281   CegarLoopForPetriNet]: 168 programPoint places, 12 predicate places.
[2024-03-09 06:14:19,340 INFO  L495      AbstractCegarLoop]: Abstraction has has 180 places, 173 transitions, 530 flow
[2024-03-09 06:14:19,341 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 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)
[2024-03-09 06:14:19,341 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:14:19,341 INFO  L208   CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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]
[2024-03-09 06:14:19,341 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35
[2024-03-09 06:14:19,341 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-09 06:14:19,342 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:14:19,342 INFO  L85        PathProgramCache]: Analyzing trace with hash -1875256257, now seen corresponding path program 1 times
[2024-03-09 06:14:19,342 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:14:19,342 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857848625]
[2024-03-09 06:14:19,342 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:14:19,342 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:14:19,364 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:14:19,388 INFO  L134       CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked.
[2024-03-09 06:14:19,389 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:14:19,389 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857848625]
[2024-03-09 06:14:19,389 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857848625] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:14:19,389 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:14:19,389 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-09 06:14:19,390 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034239268]
[2024-03-09 06:14:19,390 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:14:19,390 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 06:14:19,390 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:14:19,391 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 06:14:19,391 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 06:14:19,415 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 138 out of 166
[2024-03-09 06:14:19,416 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 173 transitions, 530 flow. Second operand  has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 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)
[2024-03-09 06:14:19,416 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:14:19,416 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 166
[2024-03-09 06:14:19,416 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:14:20,483 INFO  L124   PetriNetUnfolderBase]: 1138/9053 cut-off events.
[2024-03-09 06:14:20,483 INFO  L125   PetriNetUnfolderBase]: For 6897/8926 co-relation queries the response was YES.
[2024-03-09 06:14:20,500 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16816 conditions, 9053 events. 1138/9053 cut-off events. For 6897/8926 co-relation queries the response was YES. Maximal size of possible extension queue 340. Compared 107015 event pairs, 661 based on Foata normal form. 13/8292 useless extension candidates. Maximal degree in co-relation 13201. Up to 2082 conditions per place. 
[2024-03-09 06:14:20,510 INFO  L140   encePairwiseOnDemand]: 161/166 looper letters, 33 selfloop transitions, 5 changer transitions 0/180 dead transitions.
[2024-03-09 06:14:20,510 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 180 transitions, 644 flow
[2024-03-09 06:14:20,511 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 06:14:20,511 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 06:14:20,511 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 447 transitions.
[2024-03-09 06:14:20,512 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8975903614457831
[2024-03-09 06:14:20,512 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 447 transitions.
[2024-03-09 06:14:20,512 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 447 transitions.
[2024-03-09 06:14:20,512 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:14:20,512 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 447 transitions.
[2024-03-09 06:14:20,513 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 149.0) internal successors, (447), 3 states have internal predecessors, (447), 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)
[2024-03-09 06:14:20,513 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 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)
[2024-03-09 06:14:20,513 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 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)
[2024-03-09 06:14:20,514 INFO  L175             Difference]: Start difference. First operand has 180 places, 173 transitions, 530 flow. Second operand 3 states and 447 transitions.
[2024-03-09 06:14:20,514 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 180 transitions, 644 flow
[2024-03-09 06:14:20,518 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 180 transitions, 636 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-09 06:14:20,519 INFO  L231             Difference]: Finished difference. Result has 183 places, 176 transitions, 562 flow
[2024-03-09 06:14:20,519 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=522, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=562, PETRI_PLACES=183, PETRI_TRANSITIONS=176}
[2024-03-09 06:14:20,520 INFO  L281   CegarLoopForPetriNet]: 168 programPoint places, 15 predicate places.
[2024-03-09 06:14:20,520 INFO  L495      AbstractCegarLoop]: Abstraction has has 183 places, 176 transitions, 562 flow
[2024-03-09 06:14:20,520 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 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)
[2024-03-09 06:14:20,520 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:14:20,520 INFO  L208   CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 06:14:20,521 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36
[2024-03-09 06:14:20,521 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-09 06:14:20,521 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:14:20,521 INFO  L85        PathProgramCache]: Analyzing trace with hash 868185731, now seen corresponding path program 1 times
[2024-03-09 06:14:20,521 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:14:20,521 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438964386]
[2024-03-09 06:14:20,522 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:14:20,522 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:14:20,543 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:14:20,564 INFO  L134       CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked.
[2024-03-09 06:14:20,564 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:14:20,564 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438964386]
[2024-03-09 06:14:20,564 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438964386] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:14:20,565 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:14:20,565 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-09 06:14:20,565 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704621512]
[2024-03-09 06:14:20,565 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:14:20,565 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 06:14:20,565 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:14:20,566 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 06:14:20,566 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 06:14:20,589 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 138 out of 166
[2024-03-09 06:14:20,589 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 176 transitions, 562 flow. Second operand  has 3 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 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)
[2024-03-09 06:14:20,590 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:14:20,590 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 166
[2024-03-09 06:14:20,590 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:14:21,581 INFO  L124   PetriNetUnfolderBase]: 1121/8783 cut-off events.
[2024-03-09 06:14:21,581 INFO  L125   PetriNetUnfolderBase]: For 9167/11724 co-relation queries the response was YES.
[2024-03-09 06:14:21,608 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17181 conditions, 8783 events. 1121/8783 cut-off events. For 9167/11724 co-relation queries the response was YES. Maximal size of possible extension queue 368. Compared 103784 event pairs, 707 based on Foata normal form. 13/8087 useless extension candidates. Maximal degree in co-relation 13650. Up to 2095 conditions per place. 
[2024-03-09 06:14:21,622 INFO  L140   encePairwiseOnDemand]: 161/166 looper letters, 33 selfloop transitions, 5 changer transitions 0/182 dead transitions.
[2024-03-09 06:14:21,622 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 182 transitions, 667 flow
[2024-03-09 06:14:21,623 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 06:14:21,623 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 06:14:21,623 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 446 transitions.
[2024-03-09 06:14:21,624 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8955823293172691
[2024-03-09 06:14:21,624 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 446 transitions.
[2024-03-09 06:14:21,624 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 446 transitions.
[2024-03-09 06:14:21,624 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:14:21,624 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 446 transitions.
[2024-03-09 06:14:21,625 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 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)
[2024-03-09 06:14:21,625 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 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)
[2024-03-09 06:14:21,626 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 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)
[2024-03-09 06:14:21,626 INFO  L175             Difference]: Start difference. First operand has 183 places, 176 transitions, 562 flow. Second operand 3 states and 446 transitions.
[2024-03-09 06:14:21,626 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 182 transitions, 667 flow
[2024-03-09 06:14:21,636 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 182 transitions, 653 flow, removed 2 selfloop flow, removed 2 redundant places.
[2024-03-09 06:14:21,638 INFO  L231             Difference]: Finished difference. Result has 185 places, 179 transitions, 590 flow
[2024-03-09 06:14:21,638 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=548, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=590, PETRI_PLACES=185, PETRI_TRANSITIONS=179}
[2024-03-09 06:14:21,638 INFO  L281   CegarLoopForPetriNet]: 168 programPoint places, 17 predicate places.
[2024-03-09 06:14:21,638 INFO  L495      AbstractCegarLoop]: Abstraction has has 185 places, 179 transitions, 590 flow
[2024-03-09 06:14:21,639 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 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)
[2024-03-09 06:14:21,639 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:14:21,639 INFO  L208   CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 06:14:21,639 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37
[2024-03-09 06:14:21,639 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-09 06:14:21,639 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:14:21,640 INFO  L85        PathProgramCache]: Analyzing trace with hash -1880205221, now seen corresponding path program 1 times
[2024-03-09 06:14:21,640 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:14:21,640 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432232423]
[2024-03-09 06:14:21,640 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:14:21,640 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:14:21,681 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-09 06:14:21,681 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-03-09 06:14:21,700 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-09 06:14:21,713 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-03-09 06:14:21,713 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-03-09 06:14:21,713 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining)
[2024-03-09 06:14:21,713 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining)
[2024-03-09 06:14:21,714 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining)
[2024-03-09 06:14:21,714 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining)
[2024-03-09 06:14:21,714 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining)
[2024-03-09 06:14:21,714 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining)
[2024-03-09 06:14:21,714 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining)
[2024-03-09 06:14:21,714 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining)
[2024-03-09 06:14:21,715 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining)
[2024-03-09 06:14:21,715 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining)
[2024-03-09 06:14:21,715 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining)
[2024-03-09 06:14:21,715 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38
[2024-03-09 06:14:21,715 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 06:14:21,716 WARN  L233   ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-03-09 06:14:21,716 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances.
[2024-03-09 06:14:21,733 INFO  L144    ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions.
[2024-03-09 06:14:21,734 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 187 places, 184 transitions, 423 flow
[2024-03-09 06:14:21,888 INFO  L124   PetriNetUnfolderBase]: 93/1605 cut-off events.
[2024-03-09 06:14:21,888 INFO  L125   PetriNetUnfolderBase]: For 110/110 co-relation queries the response was YES.
[2024-03-09 06:14:21,894 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1711 conditions, 1605 events. 93/1605 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 7686 event pairs, 23 based on Foata normal form. 0/1390 useless extension candidates. Maximal degree in co-relation 920. Up to 80 conditions per place. 
[2024-03-09 06:14:21,894 INFO  L82        GeneralOperation]: Start removeDead. Operand has 187 places, 184 transitions, 423 flow
[2024-03-09 06:14:21,898 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 187 places, 184 transitions, 423 flow
[2024-03-09 06:14:21,898 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-09 06:14:21,899 INFO  L357      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, mHoare=true, 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;@47f4dfca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-03-09 06:14:21,899 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 12 error locations.
[2024-03-09 06:14:21,901 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-03-09 06:14:21,901 INFO  L124   PetriNetUnfolderBase]: 3/50 cut-off events.
[2024-03-09 06:14:21,901 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-03-09 06:14:21,901 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:14:21,901 INFO  L208   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]
[2024-03-09 06:14:21,901 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] ===
[2024-03-09 06:14:21,902 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:14:21,902 INFO  L85        PathProgramCache]: Analyzing trace with hash -2001205973, now seen corresponding path program 1 times
[2024-03-09 06:14:21,902 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:14:21,902 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127436685]
[2024-03-09 06:14:21,902 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:14:21,902 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:14:21,908 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:14:21,914 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:14:21,915 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:14:21,915 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127436685]
[2024-03-09 06:14:21,915 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127436685] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:14:21,915 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:14:21,915 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-09 06:14:21,916 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631521822]
[2024-03-09 06:14:21,916 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:14:21,916 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 06:14:21,916 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:14:21,916 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 06:14:21,917 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 06:14:21,941 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 153 out of 184
[2024-03-09 06:14:21,941 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 184 transitions, 423 flow. Second operand  has 3 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 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)
[2024-03-09 06:14:21,942 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:14:21,942 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 184
[2024-03-09 06:14:21,942 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:14:38,590 INFO  L124   PetriNetUnfolderBase]: 51883/146711 cut-off events.
[2024-03-09 06:14:38,591 INFO  L125   PetriNetUnfolderBase]: For 16265/29379 co-relation queries the response was YES.
[2024-03-09 06:14:39,165 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 222016 conditions, 146711 events. 51883/146711 cut-off events. For 16265/29379 co-relation queries the response was YES. Maximal size of possible extension queue 3112. Compared 2013095 event pairs, 29580 based on Foata normal form. 3730/136571 useless extension candidates. Maximal degree in co-relation 176681. Up to 48608 conditions per place. 
[2024-03-09 06:14:39,842 INFO  L140   encePairwiseOnDemand]: 173/184 looper letters, 37 selfloop transitions, 7 changer transitions 1/197 dead transitions.
[2024-03-09 06:14:39,843 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 197 transitions, 537 flow
[2024-03-09 06:14:39,843 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 06:14:39,844 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 06:14:39,844 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 507 transitions.
[2024-03-09 06:14:39,844 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9184782608695652
[2024-03-09 06:14:39,844 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 507 transitions.
[2024-03-09 06:14:39,844 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 507 transitions.
[2024-03-09 06:14:39,845 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:14:39,845 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 507 transitions.
[2024-03-09 06:14:39,845 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 169.0) internal successors, (507), 3 states have internal predecessors, (507), 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)
[2024-03-09 06:14:39,846 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 184.0) internal successors, (736), 4 states have internal predecessors, (736), 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)
[2024-03-09 06:14:39,846 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 184.0) internal successors, (736), 4 states have internal predecessors, (736), 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)
[2024-03-09 06:14:39,846 INFO  L175             Difference]: Start difference. First operand has 187 places, 184 transitions, 423 flow. Second operand 3 states and 507 transitions.
[2024-03-09 06:14:39,846 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 197 transitions, 537 flow
[2024-03-09 06:14:39,869 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 197 transitions, 537 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-09 06:14:39,871 INFO  L231             Difference]: Finished difference. Result has 191 places, 186 transitions, 469 flow
[2024-03-09 06:14:39,871 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=184, PETRI_DIFFERENCE_MINUEND_FLOW=417, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=469, PETRI_PLACES=191, PETRI_TRANSITIONS=186}
[2024-03-09 06:14:39,872 INFO  L281   CegarLoopForPetriNet]: 187 programPoint places, 4 predicate places.
[2024-03-09 06:14:39,872 INFO  L495      AbstractCegarLoop]: Abstraction has has 191 places, 186 transitions, 469 flow
[2024-03-09 06:14:39,872 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 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)
[2024-03-09 06:14:39,872 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:14:39,872 INFO  L208   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]
[2024-03-09 06:14:39,873 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39
[2024-03-09 06:14:39,873 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] ===
[2024-03-09 06:14:39,873 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:14:39,873 INFO  L85        PathProgramCache]: Analyzing trace with hash 2121343792, now seen corresponding path program 1 times
[2024-03-09 06:14:39,873 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:14:39,874 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427822191]
[2024-03-09 06:14:39,874 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:14:39,874 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:14:39,891 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:14:39,923 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:14:39,924 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:14:39,924 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427822191]
[2024-03-09 06:14:39,924 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427822191] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:14:39,924 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:14:39,924 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 06:14:39,924 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341764081]
[2024-03-09 06:14:39,925 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:14:39,925 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-03-09 06:14:39,925 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:14:39,925 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-03-09 06:14:39,926 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-03-09 06:14:40,001 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 150 out of 184
[2024-03-09 06:14:40,002 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 186 transitions, 469 flow. Second operand  has 5 states, 5 states have (on average 151.4) internal successors, (757), 5 states have internal predecessors, (757), 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)
[2024-03-09 06:14:40,002 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:14:40,002 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 184
[2024-03-09 06:14:40,002 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:15:02,277 INFO  L124   PetriNetUnfolderBase]: 56512/185999 cut-off events.
[2024-03-09 06:15:02,277 INFO  L125   PetriNetUnfolderBase]: For 14079/14858 co-relation queries the response was YES.
[2024-03-09 06:15:03,214 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 281841 conditions, 185999 events. 56512/185999 cut-off events. For 14079/14858 co-relation queries the response was YES. Maximal size of possible extension queue 3453. Compared 2770356 event pairs, 39436 based on Foata normal form. 1/159996 useless extension candidates. Maximal degree in co-relation 152584. Up to 58232 conditions per place. 
[2024-03-09 06:15:03,992 INFO  L140   encePairwiseOnDemand]: 176/184 looper letters, 32 selfloop transitions, 2 changer transitions 5/194 dead transitions.
[2024-03-09 06:15:03,993 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 194 transitions, 563 flow
[2024-03-09 06:15:03,993 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 06:15:03,994 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 06:15:03,994 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 940 transitions.
[2024-03-09 06:15:03,994 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8514492753623188
[2024-03-09 06:15:03,995 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 940 transitions.
[2024-03-09 06:15:03,995 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 940 transitions.
[2024-03-09 06:15:03,995 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:15:03,995 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 940 transitions.
[2024-03-09 06:15:03,996 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 156.66666666666666) internal successors, (940), 6 states have internal predecessors, (940), 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)
[2024-03-09 06:15:03,997 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 184.0) internal successors, (1288), 7 states have internal predecessors, (1288), 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)
[2024-03-09 06:15:03,997 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 184.0) internal successors, (1288), 7 states have internal predecessors, (1288), 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)
[2024-03-09 06:15:03,997 INFO  L175             Difference]: Start difference. First operand has 191 places, 186 transitions, 469 flow. Second operand 6 states and 940 transitions.
[2024-03-09 06:15:03,997 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 194 transitions, 563 flow
[2024-03-09 06:15:05,833 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 194 transitions, 549 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-09 06:15:05,835 INFO  L231             Difference]: Finished difference. Result has 197 places, 187 transitions, 477 flow
[2024-03-09 06:15:05,835 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=184, PETRI_DIFFERENCE_MINUEND_FLOW=455, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=477, PETRI_PLACES=197, PETRI_TRANSITIONS=187}
[2024-03-09 06:15:05,835 INFO  L281   CegarLoopForPetriNet]: 187 programPoint places, 10 predicate places.
[2024-03-09 06:15:05,836 INFO  L495      AbstractCegarLoop]: Abstraction has has 197 places, 187 transitions, 477 flow
[2024-03-09 06:15:05,836 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 151.4) internal successors, (757), 5 states have internal predecessors, (757), 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)
[2024-03-09 06:15:05,836 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:15:05,836 INFO  L208   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]
[2024-03-09 06:15:05,836 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40
[2024-03-09 06:15:05,836 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] ===
[2024-03-09 06:15:05,837 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:15:05,837 INFO  L85        PathProgramCache]: Analyzing trace with hash 2024147008, now seen corresponding path program 1 times
[2024-03-09 06:15:05,837 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:15:05,837 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939032835]
[2024-03-09 06:15:05,837 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:15:05,837 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:15:05,845 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:15:05,948 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:15:05,948 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:15:05,949 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939032835]
[2024-03-09 06:15:05,949 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939032835] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:15:05,949 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:15:05,949 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 06:15:05,949 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478337187]
[2024-03-09 06:15:05,949 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:15:05,950 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 06:15:05,950 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:15:05,950 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 06:15:05,950 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 06:15:06,087 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 135 out of 184
[2024-03-09 06:15:06,088 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 187 transitions, 477 flow. Second operand  has 6 states, 6 states have (on average 136.5) internal successors, (819), 6 states have internal predecessors, (819), 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)
[2024-03-09 06:15:06,088 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:15:06,088 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 184
[2024-03-09 06:15:06,088 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:15:27,845 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([829] L1036-1-->L1037: Formula: (= |v_#race~data~0_1| 0)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_1|}  AuxVars[]  AssignedVars[#race~data~0][68], [8#L1019-5true, Black: 190#true, 50#L1037true, 152#L1020-3true, Black: 200#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 199#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), Black: 198#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 202#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 208#true, threadThread1of5ForFork0InUse, threadThread2of5ForFork0InUse, threadThread3of5ForFork0InUse, threadThread4of5ForFork0NotInUse, threadThread5of5ForFork0NotInUse, 196#true, 92#L1019-5true])
[2024-03-09 06:15:27,845 INFO  L294   olderBase$Statistics]: this new event has 187 ancestors and is cut-off event
[2024-03-09 06:15:27,845 INFO  L297   olderBase$Statistics]:   existing Event has 124 ancestors and is cut-off event
[2024-03-09 06:15:27,846 INFO  L297   olderBase$Statistics]:   existing Event has 187 ancestors and is cut-off event
[2024-03-09 06:15:27,846 INFO  L297   olderBase$Statistics]:   existing Event has 187 ancestors and is cut-off event
[2024-03-09 06:15:28,843 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([874] L-1-2-->ULTIMATE.startFINAL: Formula: true  InVars {}  OutVars{ULTIMATE.start_main_#t~malloc8#1.offset=|v_ULTIMATE.start_main_#t~malloc8#1.offset_5|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_22|, ULTIMATE.start_main_~ts~0#1.offset=|v_ULTIMATE.start_main_~ts~0#1.offset_25|, ULTIMATE.start_main_#t~malloc10#1.offset=|v_ULTIMATE.start_main_#t~malloc10#1.offset_5|, ULTIMATE.start_main_#t~mem15#1.base=|v_ULTIMATE.start_main_#t~mem15#1.base_11|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_4|, ULTIMATE.start_main_#t~mem15#1.offset=|v_ULTIMATE.start_main_#t~mem15#1.offset_11|, ULTIMATE.start_main_#t~post14#1=|v_ULTIMATE.start_main_#t~post14#1_5|, ULTIMATE.start_main_~ts~0#1.base=|v_ULTIMATE.start_main_~ts~0#1.base_25|, ULTIMATE.start_main_#t~malloc10#1.base=|v_ULTIMATE.start_main_#t~malloc10#1.base_5|, ULTIMATE.start_main_#t~mem17#1.offset=|v_ULTIMATE.start_main_#t~mem17#1.offset_5|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_5|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_10|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_15|, ULTIMATE.start_main_#t~mem17#1.base=|v_ULTIMATE.start_main_#t~mem17#1.base_5|, ULTIMATE.start_main_~t~0#1.offset=|v_ULTIMATE.start_main_~t~0#1.offset_6|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_6|, ULTIMATE.start_main_#t~malloc8#1.base=|v_ULTIMATE.start_main_#t~malloc8#1.base_5|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_3|, ULTIMATE.start_main_#t~post9#1=|v_ULTIMATE.start_main_#t~post9#1_5|, ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_9|, ULTIMATE.start_main_~t~0#1.base=|v_ULTIMATE.start_main_~t~0#1.base_6|}  AuxVars[]  AssignedVars[ULTIMATE.start_main_#t~malloc8#1.offset, ULTIMATE.start_main_~i~1#1, ULTIMATE.start_main_~ts~0#1.offset, ULTIMATE.start_main_#t~malloc10#1.offset, ULTIMATE.start_main_#t~mem15#1.base, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_#t~mem15#1.offset, ULTIMATE.start_main_#t~post14#1, ULTIMATE.start_main_~ts~0#1.base, ULTIMATE.start_main_#t~malloc10#1.base, ULTIMATE.start_main_#t~mem17#1.offset, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_#t~mem17#1.base, ULTIMATE.start_main_~t~0#1.offset, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~malloc8#1.base, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~post9#1, ULTIMATE.start_main_~threads_total~0#1, ULTIMATE.start_main_~t~0#1.base][86], [8#L1019-5true, Black: 190#true, 133#L1019-5true, 152#L1020-3true, Black: 200#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 199#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), Black: 198#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 202#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 136#L1020-3true, 208#true, threadThread1of5ForFork0InUse, threadThread2of5ForFork0InUse, threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, 82#ULTIMATE.startFINALtrue, threadThread5of5ForFork0InUse, 196#true, 92#L1019-5true])
[2024-03-09 06:15:28,844 INFO  L294   olderBase$Statistics]: this new event has 190 ancestors and is cut-off event
[2024-03-09 06:15:28,844 INFO  L297   olderBase$Statistics]:   existing Event has 190 ancestors and is cut-off event
[2024-03-09 06:15:28,844 INFO  L297   olderBase$Statistics]:   existing Event has 190 ancestors and is cut-off event
[2024-03-09 06:15:28,844 INFO  L297   olderBase$Statistics]:   existing Event has 190 ancestors and is cut-off event
[2024-03-09 06:15:38,470 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([874] L-1-2-->ULTIMATE.startFINAL: Formula: true  InVars {}  OutVars{ULTIMATE.start_main_#t~malloc8#1.offset=|v_ULTIMATE.start_main_#t~malloc8#1.offset_5|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_22|, ULTIMATE.start_main_~ts~0#1.offset=|v_ULTIMATE.start_main_~ts~0#1.offset_25|, ULTIMATE.start_main_#t~malloc10#1.offset=|v_ULTIMATE.start_main_#t~malloc10#1.offset_5|, ULTIMATE.start_main_#t~mem15#1.base=|v_ULTIMATE.start_main_#t~mem15#1.base_11|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_4|, ULTIMATE.start_main_#t~mem15#1.offset=|v_ULTIMATE.start_main_#t~mem15#1.offset_11|, ULTIMATE.start_main_#t~post14#1=|v_ULTIMATE.start_main_#t~post14#1_5|, ULTIMATE.start_main_~ts~0#1.base=|v_ULTIMATE.start_main_~ts~0#1.base_25|, ULTIMATE.start_main_#t~malloc10#1.base=|v_ULTIMATE.start_main_#t~malloc10#1.base_5|, ULTIMATE.start_main_#t~mem17#1.offset=|v_ULTIMATE.start_main_#t~mem17#1.offset_5|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_5|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_10|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_15|, ULTIMATE.start_main_#t~mem17#1.base=|v_ULTIMATE.start_main_#t~mem17#1.base_5|, ULTIMATE.start_main_~t~0#1.offset=|v_ULTIMATE.start_main_~t~0#1.offset_6|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_6|, ULTIMATE.start_main_#t~malloc8#1.base=|v_ULTIMATE.start_main_#t~malloc8#1.base_5|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_3|, ULTIMATE.start_main_#t~post9#1=|v_ULTIMATE.start_main_#t~post9#1_5|, ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_9|, ULTIMATE.start_main_~t~0#1.base=|v_ULTIMATE.start_main_~t~0#1.base_6|}  AuxVars[]  AssignedVars[ULTIMATE.start_main_#t~malloc8#1.offset, ULTIMATE.start_main_~i~1#1, ULTIMATE.start_main_~ts~0#1.offset, ULTIMATE.start_main_#t~malloc10#1.offset, ULTIMATE.start_main_#t~mem15#1.base, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_#t~mem15#1.offset, ULTIMATE.start_main_#t~post14#1, ULTIMATE.start_main_~ts~0#1.base, ULTIMATE.start_main_#t~malloc10#1.base, ULTIMATE.start_main_#t~mem17#1.offset, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_#t~mem17#1.base, ULTIMATE.start_main_~t~0#1.offset, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~malloc8#1.base, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~post9#1, ULTIMATE.start_main_~threads_total~0#1, ULTIMATE.start_main_~t~0#1.base][86], [8#L1019-5true, Black: 190#true, 59#L1018-3true, 41#L1018-3true, Black: 200#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 199#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), Black: 198#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 202#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 208#true, threadThread1of5ForFork0InUse, threadThread2of5ForFork0InUse, threadThread3of5ForFork0InUse, 21#L1020-3true, threadThread4of5ForFork0InUse, threadThread5of5ForFork0NotInUse, 82#ULTIMATE.startFINALtrue, 196#true])
[2024-03-09 06:15:38,471 INFO  L294   olderBase$Statistics]: this new event has 208 ancestors and is cut-off event
[2024-03-09 06:15:38,471 INFO  L297   olderBase$Statistics]:   existing Event has 145 ancestors and is cut-off event
[2024-03-09 06:15:38,471 INFO  L297   olderBase$Statistics]:   existing Event has 208 ancestors and is cut-off event
[2024-03-09 06:15:38,471 INFO  L297   olderBase$Statistics]:   existing Event has 145 ancestors and is cut-off event
[2024-03-09 06:15:38,488 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([829] L1036-1-->L1037: Formula: (= |v_#race~data~0_1| 0)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_1|}  AuxVars[]  AssignedVars[#race~data~0][68], [8#L1019-5true, Black: 190#true, 50#L1037true, 152#L1020-3true, Black: 200#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 199#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), Black: 198#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 202#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 208#true, threadThread1of5ForFork0InUse, threadThread2of5ForFork0InUse, threadThread3of5ForFork0InUse, 13#$Ultimate##0true, threadThread4of5ForFork0InUse, threadThread5of5ForFork0NotInUse, 196#true, 92#L1019-5true])
[2024-03-09 06:15:38,488 INFO  L294   olderBase$Statistics]: this new event has 208 ancestors and is cut-off event
[2024-03-09 06:15:38,489 INFO  L297   olderBase$Statistics]:   existing Event has 208 ancestors and is cut-off event
[2024-03-09 06:15:38,489 INFO  L297   olderBase$Statistics]:   existing Event has 145 ancestors and is cut-off event
[2024-03-09 06:15:38,489 INFO  L297   olderBase$Statistics]:   existing Event has 208 ancestors and is cut-off event
[2024-03-09 06:15:42,458 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([874] L-1-2-->ULTIMATE.startFINAL: Formula: true  InVars {}  OutVars{ULTIMATE.start_main_#t~malloc8#1.offset=|v_ULTIMATE.start_main_#t~malloc8#1.offset_5|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_22|, ULTIMATE.start_main_~ts~0#1.offset=|v_ULTIMATE.start_main_~ts~0#1.offset_25|, ULTIMATE.start_main_#t~malloc10#1.offset=|v_ULTIMATE.start_main_#t~malloc10#1.offset_5|, ULTIMATE.start_main_#t~mem15#1.base=|v_ULTIMATE.start_main_#t~mem15#1.base_11|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_4|, ULTIMATE.start_main_#t~mem15#1.offset=|v_ULTIMATE.start_main_#t~mem15#1.offset_11|, ULTIMATE.start_main_#t~post14#1=|v_ULTIMATE.start_main_#t~post14#1_5|, ULTIMATE.start_main_~ts~0#1.base=|v_ULTIMATE.start_main_~ts~0#1.base_25|, ULTIMATE.start_main_#t~malloc10#1.base=|v_ULTIMATE.start_main_#t~malloc10#1.base_5|, ULTIMATE.start_main_#t~mem17#1.offset=|v_ULTIMATE.start_main_#t~mem17#1.offset_5|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_5|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_10|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_15|, ULTIMATE.start_main_#t~mem17#1.base=|v_ULTIMATE.start_main_#t~mem17#1.base_5|, ULTIMATE.start_main_~t~0#1.offset=|v_ULTIMATE.start_main_~t~0#1.offset_6|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_6|, ULTIMATE.start_main_#t~malloc8#1.base=|v_ULTIMATE.start_main_#t~malloc8#1.base_5|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_3|, ULTIMATE.start_main_#t~post9#1=|v_ULTIMATE.start_main_#t~post9#1_5|, ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_9|, ULTIMATE.start_main_~t~0#1.base=|v_ULTIMATE.start_main_~t~0#1.base_6|}  AuxVars[]  AssignedVars[ULTIMATE.start_main_#t~malloc8#1.offset, ULTIMATE.start_main_~i~1#1, ULTIMATE.start_main_~ts~0#1.offset, ULTIMATE.start_main_#t~malloc10#1.offset, ULTIMATE.start_main_#t~mem15#1.base, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_#t~mem15#1.offset, ULTIMATE.start_main_#t~post14#1, ULTIMATE.start_main_~ts~0#1.base, ULTIMATE.start_main_#t~malloc10#1.base, ULTIMATE.start_main_#t~mem17#1.offset, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_#t~mem17#1.base, ULTIMATE.start_main_~t~0#1.offset, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~malloc8#1.base, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~post9#1, ULTIMATE.start_main_~threads_total~0#1, ULTIMATE.start_main_~t~0#1.base][86], [120#L1020-3true, Black: 190#true, 42#L1019-5true, 37#$Ultimate##0true, Black: 200#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 199#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), Black: 198#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 202#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 208#true, threadThread1of5ForFork0InUse, threadThread2of5ForFork0InUse, threadThread3of5ForFork0InUse, 21#L1020-3true, threadThread4of5ForFork0InUse, threadThread5of5ForFork0NotInUse, 82#ULTIMATE.startFINALtrue, 196#true])
[2024-03-09 06:15:42,459 INFO  L294   olderBase$Statistics]: this new event has 216 ancestors and is cut-off event
[2024-03-09 06:15:42,459 INFO  L297   olderBase$Statistics]:   existing Event has 153 ancestors and is cut-off event
[2024-03-09 06:15:42,459 INFO  L297   olderBase$Statistics]:   existing Event has 153 ancestors and is cut-off event
[2024-03-09 06:15:42,459 INFO  L297   olderBase$Statistics]:   existing Event has 153 ancestors and is cut-off event
[2024-03-09 06:15:42,847 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([874] L-1-2-->ULTIMATE.startFINAL: Formula: true  InVars {}  OutVars{ULTIMATE.start_main_#t~malloc8#1.offset=|v_ULTIMATE.start_main_#t~malloc8#1.offset_5|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_22|, ULTIMATE.start_main_~ts~0#1.offset=|v_ULTIMATE.start_main_~ts~0#1.offset_25|, ULTIMATE.start_main_#t~malloc10#1.offset=|v_ULTIMATE.start_main_#t~malloc10#1.offset_5|, ULTIMATE.start_main_#t~mem15#1.base=|v_ULTIMATE.start_main_#t~mem15#1.base_11|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_4|, ULTIMATE.start_main_#t~mem15#1.offset=|v_ULTIMATE.start_main_#t~mem15#1.offset_11|, ULTIMATE.start_main_#t~post14#1=|v_ULTIMATE.start_main_#t~post14#1_5|, ULTIMATE.start_main_~ts~0#1.base=|v_ULTIMATE.start_main_~ts~0#1.base_25|, ULTIMATE.start_main_#t~malloc10#1.base=|v_ULTIMATE.start_main_#t~malloc10#1.base_5|, ULTIMATE.start_main_#t~mem17#1.offset=|v_ULTIMATE.start_main_#t~mem17#1.offset_5|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_5|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_10|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_15|, ULTIMATE.start_main_#t~mem17#1.base=|v_ULTIMATE.start_main_#t~mem17#1.base_5|, ULTIMATE.start_main_~t~0#1.offset=|v_ULTIMATE.start_main_~t~0#1.offset_6|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_6|, ULTIMATE.start_main_#t~malloc8#1.base=|v_ULTIMATE.start_main_#t~malloc8#1.base_5|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_3|, ULTIMATE.start_main_#t~post9#1=|v_ULTIMATE.start_main_#t~post9#1_5|, ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_9|, ULTIMATE.start_main_~t~0#1.base=|v_ULTIMATE.start_main_~t~0#1.base_6|}  AuxVars[]  AssignedVars[ULTIMATE.start_main_#t~malloc8#1.offset, ULTIMATE.start_main_~i~1#1, ULTIMATE.start_main_~ts~0#1.offset, ULTIMATE.start_main_#t~malloc10#1.offset, ULTIMATE.start_main_#t~mem15#1.base, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_#t~mem15#1.offset, ULTIMATE.start_main_#t~post14#1, ULTIMATE.start_main_~ts~0#1.base, ULTIMATE.start_main_#t~malloc10#1.base, ULTIMATE.start_main_#t~mem17#1.offset, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_#t~mem17#1.base, ULTIMATE.start_main_~t~0#1.offset, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~malloc8#1.base, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~post9#1, ULTIMATE.start_main_~threads_total~0#1, ULTIMATE.start_main_~t~0#1.base][86], [Black: 190#true, 8#L1019-5true, 41#L1018-3true, 152#L1020-3true, Black: 200#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 199#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), Black: 198#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 202#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 208#true, threadThread1of5ForFork0InUse, threadThread2of5ForFork0InUse, threadThread3of5ForFork0InUse, 21#L1020-3true, threadThread4of5ForFork0InUse, threadThread5of5ForFork0NotInUse, 82#ULTIMATE.startFINALtrue, 196#true])
[2024-03-09 06:15:42,847 INFO  L294   olderBase$Statistics]: this new event has 218 ancestors and is cut-off event
[2024-03-09 06:15:42,847 INFO  L297   olderBase$Statistics]:   existing Event has 218 ancestors and is cut-off event
[2024-03-09 06:15:42,847 INFO  L297   olderBase$Statistics]:   existing Event has 155 ancestors and is cut-off event
[2024-03-09 06:15:42,847 INFO  L297   olderBase$Statistics]:   existing Event has 155 ancestors and is cut-off event
[2024-03-09 06:15:43,014 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([874] L-1-2-->ULTIMATE.startFINAL: Formula: true  InVars {}  OutVars{ULTIMATE.start_main_#t~malloc8#1.offset=|v_ULTIMATE.start_main_#t~malloc8#1.offset_5|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_22|, ULTIMATE.start_main_~ts~0#1.offset=|v_ULTIMATE.start_main_~ts~0#1.offset_25|, ULTIMATE.start_main_#t~malloc10#1.offset=|v_ULTIMATE.start_main_#t~malloc10#1.offset_5|, ULTIMATE.start_main_#t~mem15#1.base=|v_ULTIMATE.start_main_#t~mem15#1.base_11|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_4|, ULTIMATE.start_main_#t~mem15#1.offset=|v_ULTIMATE.start_main_#t~mem15#1.offset_11|, ULTIMATE.start_main_#t~post14#1=|v_ULTIMATE.start_main_#t~post14#1_5|, ULTIMATE.start_main_~ts~0#1.base=|v_ULTIMATE.start_main_~ts~0#1.base_25|, ULTIMATE.start_main_#t~malloc10#1.base=|v_ULTIMATE.start_main_#t~malloc10#1.base_5|, ULTIMATE.start_main_#t~mem17#1.offset=|v_ULTIMATE.start_main_#t~mem17#1.offset_5|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_5|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_10|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_15|, ULTIMATE.start_main_#t~mem17#1.base=|v_ULTIMATE.start_main_#t~mem17#1.base_5|, ULTIMATE.start_main_~t~0#1.offset=|v_ULTIMATE.start_main_~t~0#1.offset_6|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_6|, ULTIMATE.start_main_#t~malloc8#1.base=|v_ULTIMATE.start_main_#t~malloc8#1.base_5|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_3|, ULTIMATE.start_main_#t~post9#1=|v_ULTIMATE.start_main_#t~post9#1_5|, ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_9|, ULTIMATE.start_main_~t~0#1.base=|v_ULTIMATE.start_main_~t~0#1.base_6|}  AuxVars[]  AssignedVars[ULTIMATE.start_main_#t~malloc8#1.offset, ULTIMATE.start_main_~i~1#1, ULTIMATE.start_main_~ts~0#1.offset, ULTIMATE.start_main_#t~malloc10#1.offset, ULTIMATE.start_main_#t~mem15#1.base, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_#t~mem15#1.offset, ULTIMATE.start_main_#t~post14#1, ULTIMATE.start_main_~ts~0#1.base, ULTIMATE.start_main_#t~malloc10#1.base, ULTIMATE.start_main_#t~mem17#1.offset, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_#t~mem17#1.base, ULTIMATE.start_main_~t~0#1.offset, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~malloc8#1.base, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~post9#1, ULTIMATE.start_main_~threads_total~0#1, ULTIMATE.start_main_~t~0#1.base][86], [120#L1020-3true, 111#L1018-3true, 42#L1019-5true, Black: 190#true, Black: 200#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 199#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), Black: 198#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 202#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 208#true, threadThread1of5ForFork0InUse, threadThread2of5ForFork0InUse, threadThread3of5ForFork0InUse, 21#L1020-3true, threadThread4of5ForFork0InUse, threadThread5of5ForFork0NotInUse, 82#ULTIMATE.startFINALtrue, 196#true])
[2024-03-09 06:15:43,015 INFO  L294   olderBase$Statistics]: this new event has 218 ancestors and is cut-off event
[2024-03-09 06:15:43,015 INFO  L297   olderBase$Statistics]:   existing Event has 155 ancestors and is cut-off event
[2024-03-09 06:15:43,015 INFO  L297   olderBase$Statistics]:   existing Event has 155 ancestors and is cut-off event
[2024-03-09 06:15:43,015 INFO  L297   olderBase$Statistics]:   existing Event has 155 ancestors and is cut-off event
[2024-03-09 06:15:44,411 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([874] L-1-2-->ULTIMATE.startFINAL: Formula: true  InVars {}  OutVars{ULTIMATE.start_main_#t~malloc8#1.offset=|v_ULTIMATE.start_main_#t~malloc8#1.offset_5|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_22|, ULTIMATE.start_main_~ts~0#1.offset=|v_ULTIMATE.start_main_~ts~0#1.offset_25|, ULTIMATE.start_main_#t~malloc10#1.offset=|v_ULTIMATE.start_main_#t~malloc10#1.offset_5|, ULTIMATE.start_main_#t~mem15#1.base=|v_ULTIMATE.start_main_#t~mem15#1.base_11|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_4|, ULTIMATE.start_main_#t~mem15#1.offset=|v_ULTIMATE.start_main_#t~mem15#1.offset_11|, ULTIMATE.start_main_#t~post14#1=|v_ULTIMATE.start_main_#t~post14#1_5|, ULTIMATE.start_main_~ts~0#1.base=|v_ULTIMATE.start_main_~ts~0#1.base_25|, ULTIMATE.start_main_#t~malloc10#1.base=|v_ULTIMATE.start_main_#t~malloc10#1.base_5|, ULTIMATE.start_main_#t~mem17#1.offset=|v_ULTIMATE.start_main_#t~mem17#1.offset_5|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_5|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_10|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_15|, ULTIMATE.start_main_#t~mem17#1.base=|v_ULTIMATE.start_main_#t~mem17#1.base_5|, ULTIMATE.start_main_~t~0#1.offset=|v_ULTIMATE.start_main_~t~0#1.offset_6|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_6|, ULTIMATE.start_main_#t~malloc8#1.base=|v_ULTIMATE.start_main_#t~malloc8#1.base_5|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_3|, ULTIMATE.start_main_#t~post9#1=|v_ULTIMATE.start_main_#t~post9#1_5|, ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_9|, ULTIMATE.start_main_~t~0#1.base=|v_ULTIMATE.start_main_~t~0#1.base_6|}  AuxVars[]  AssignedVars[ULTIMATE.start_main_#t~malloc8#1.offset, ULTIMATE.start_main_~i~1#1, ULTIMATE.start_main_~ts~0#1.offset, ULTIMATE.start_main_#t~malloc10#1.offset, ULTIMATE.start_main_#t~mem15#1.base, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_#t~mem15#1.offset, ULTIMATE.start_main_#t~post14#1, ULTIMATE.start_main_~ts~0#1.base, ULTIMATE.start_main_#t~malloc10#1.base, ULTIMATE.start_main_#t~mem17#1.offset, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_#t~mem17#1.base, ULTIMATE.start_main_~t~0#1.offset, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~malloc8#1.base, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~post9#1, ULTIMATE.start_main_~threads_total~0#1, ULTIMATE.start_main_~t~0#1.base][86], [120#L1020-3true, 8#L1019-5true, Black: 190#true, 152#L1020-3true, Black: 200#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 199#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), Black: 198#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 202#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 208#true, threadThread1of5ForFork0InUse, threadThread2of5ForFork0InUse, threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0NotInUse, 82#ULTIMATE.startFINALtrue, 196#true, 92#L1019-5true])
[2024-03-09 06:15:44,412 INFO  L294   olderBase$Statistics]: this new event has 224 ancestors and is cut-off event
[2024-03-09 06:15:44,412 INFO  L297   olderBase$Statistics]:   existing Event has 161 ancestors and is cut-off event
[2024-03-09 06:15:44,412 INFO  L297   olderBase$Statistics]:   existing Event has 161 ancestors and is cut-off event
[2024-03-09 06:15:44,412 INFO  L297   olderBase$Statistics]:   existing Event has 161 ancestors and is cut-off event
[2024-03-09 06:15:45,417 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([874] L-1-2-->ULTIMATE.startFINAL: Formula: true  InVars {}  OutVars{ULTIMATE.start_main_#t~malloc8#1.offset=|v_ULTIMATE.start_main_#t~malloc8#1.offset_5|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_22|, ULTIMATE.start_main_~ts~0#1.offset=|v_ULTIMATE.start_main_~ts~0#1.offset_25|, ULTIMATE.start_main_#t~malloc10#1.offset=|v_ULTIMATE.start_main_#t~malloc10#1.offset_5|, ULTIMATE.start_main_#t~mem15#1.base=|v_ULTIMATE.start_main_#t~mem15#1.base_11|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_4|, ULTIMATE.start_main_#t~mem15#1.offset=|v_ULTIMATE.start_main_#t~mem15#1.offset_11|, ULTIMATE.start_main_#t~post14#1=|v_ULTIMATE.start_main_#t~post14#1_5|, ULTIMATE.start_main_~ts~0#1.base=|v_ULTIMATE.start_main_~ts~0#1.base_25|, ULTIMATE.start_main_#t~malloc10#1.base=|v_ULTIMATE.start_main_#t~malloc10#1.base_5|, ULTIMATE.start_main_#t~mem17#1.offset=|v_ULTIMATE.start_main_#t~mem17#1.offset_5|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_5|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_10|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_15|, ULTIMATE.start_main_#t~mem17#1.base=|v_ULTIMATE.start_main_#t~mem17#1.base_5|, ULTIMATE.start_main_~t~0#1.offset=|v_ULTIMATE.start_main_~t~0#1.offset_6|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_6|, ULTIMATE.start_main_#t~malloc8#1.base=|v_ULTIMATE.start_main_#t~malloc8#1.base_5|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_3|, ULTIMATE.start_main_#t~post9#1=|v_ULTIMATE.start_main_#t~post9#1_5|, ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_9|, ULTIMATE.start_main_~t~0#1.base=|v_ULTIMATE.start_main_~t~0#1.base_6|}  AuxVars[]  AssignedVars[ULTIMATE.start_main_#t~malloc8#1.offset, ULTIMATE.start_main_~i~1#1, ULTIMATE.start_main_~ts~0#1.offset, ULTIMATE.start_main_#t~malloc10#1.offset, ULTIMATE.start_main_#t~mem15#1.base, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_#t~mem15#1.offset, ULTIMATE.start_main_#t~post14#1, ULTIMATE.start_main_~ts~0#1.base, ULTIMATE.start_main_#t~malloc10#1.base, ULTIMATE.start_main_#t~mem17#1.offset, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_#t~mem17#1.base, ULTIMATE.start_main_~t~0#1.offset, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~malloc8#1.base, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~post9#1, ULTIMATE.start_main_~threads_total~0#1, ULTIMATE.start_main_~t~0#1.base][86], [120#L1020-3true, Black: 190#true, 42#L1019-5true, 36#L1020-3true, Black: 200#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 199#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), Black: 198#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 202#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 208#true, threadThread1of5ForFork0InUse, threadThread2of5ForFork0InUse, threadThread3of5ForFork0InUse, 21#L1020-3true, threadThread4of5ForFork0InUse, threadThread5of5ForFork0NotInUse, 82#ULTIMATE.startFINALtrue, 196#true])
[2024-03-09 06:15:45,417 INFO  L294   olderBase$Statistics]: this new event has 228 ancestors and is cut-off event
[2024-03-09 06:15:45,417 INFO  L297   olderBase$Statistics]:   existing Event has 165 ancestors and is cut-off event
[2024-03-09 06:15:45,418 INFO  L297   olderBase$Statistics]:   existing Event has 165 ancestors and is cut-off event
[2024-03-09 06:15:45,418 INFO  L297   olderBase$Statistics]:   existing Event has 165 ancestors and is cut-off event
[2024-03-09 06:15:47,856 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([829] L1036-1-->L1037: Formula: (= |v_#race~data~0_1| 0)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_1|}  AuxVars[]  AssignedVars[#race~data~0][68], [42#L1019-5true, 8#L1019-5true, Black: 190#true, 50#L1037true, Black: 200#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 199#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), Black: 198#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 202#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 208#true, threadThread1of5ForFork0InUse, threadThread2of5ForFork0InUse, threadThread3of5ForFork0InUse, threadThread4of5ForFork0NotInUse, threadThread5of5ForFork0NotInUse, 196#true, 92#L1019-5true])
[2024-03-09 06:15:47,856 INFO  L294   olderBase$Statistics]: this new event has 246 ancestors and is cut-off event
[2024-03-09 06:15:47,856 INFO  L297   olderBase$Statistics]:   existing Event has 120 ancestors and is cut-off event
[2024-03-09 06:15:47,856 INFO  L297   olderBase$Statistics]:   existing Event has 183 ancestors and is cut-off event
[2024-03-09 06:15:47,857 INFO  L297   olderBase$Statistics]:   existing Event has 183 ancestors and is cut-off event
[2024-03-09 06:15:53,174 INFO  L124   PetriNetUnfolderBase]: 118478/344314 cut-off events.
[2024-03-09 06:15:53,175 INFO  L125   PetriNetUnfolderBase]: For 15389/15543 co-relation queries the response was YES.
[2024-03-09 06:15:55,433 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 529896 conditions, 344314 events. 118478/344314 cut-off events. For 15389/15543 co-relation queries the response was YES. Maximal size of possible extension queue 6260. Compared 5279882 event pairs, 95879 based on Foata normal form. 0/294188 useless extension candidates. Maximal degree in co-relation 529794. Up to 115602 conditions per place. 
[2024-03-09 06:15:57,002 INFO  L140   encePairwiseOnDemand]: 178/184 looper letters, 81 selfloop transitions, 5 changer transitions 0/226 dead transitions.
[2024-03-09 06:15:57,002 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 226 transitions, 727 flow
[2024-03-09 06:15:57,003 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 06:15:57,003 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 06:15:57,003 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 896 transitions.
[2024-03-09 06:15:57,004 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8115942028985508
[2024-03-09 06:15:57,004 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 896 transitions.
[2024-03-09 06:15:57,004 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 896 transitions.
[2024-03-09 06:15:57,004 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:15:57,004 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 896 transitions.
[2024-03-09 06:15:57,005 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 149.33333333333334) internal successors, (896), 6 states have internal predecessors, (896), 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)
[2024-03-09 06:15:57,006 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 184.0) internal successors, (1288), 7 states have internal predecessors, (1288), 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)
[2024-03-09 06:15:57,006 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 184.0) internal successors, (1288), 7 states have internal predecessors, (1288), 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)
[2024-03-09 06:15:57,006 INFO  L175             Difference]: Start difference. First operand has 197 places, 187 transitions, 477 flow. Second operand 6 states and 896 transitions.
[2024-03-09 06:15:57,007 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 226 transitions, 727 flow
[2024-03-09 06:15:58,281 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 226 transitions, 715 flow, removed 5 selfloop flow, removed 4 redundant places.
[2024-03-09 06:15:58,283 INFO  L231             Difference]: Finished difference. Result has 194 places, 186 transitions, 473 flow
[2024-03-09 06:15:58,284 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=184, PETRI_DIFFERENCE_MINUEND_FLOW=463, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=473, PETRI_PLACES=194, PETRI_TRANSITIONS=186}
[2024-03-09 06:15:58,284 INFO  L281   CegarLoopForPetriNet]: 187 programPoint places, 7 predicate places.
[2024-03-09 06:15:58,284 INFO  L495      AbstractCegarLoop]: Abstraction has has 194 places, 186 transitions, 473 flow
[2024-03-09 06:15:58,284 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 136.5) internal successors, (819), 6 states have internal predecessors, (819), 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)
[2024-03-09 06:15:58,284 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:15:58,285 INFO  L208   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]
[2024-03-09 06:15:58,285 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41
[2024-03-09 06:15:58,285 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] ===
[2024-03-09 06:15:58,285 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:15:58,285 INFO  L85        PathProgramCache]: Analyzing trace with hash 1713456712, now seen corresponding path program 1 times
[2024-03-09 06:15:58,285 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:15:58,286 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855875052]
[2024-03-09 06:15:58,286 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:15:58,286 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:15:58,294 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:15:58,304 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:15:58,304 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:15:58,304 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855875052]
[2024-03-09 06:15:58,305 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855875052] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:15:58,305 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:15:58,305 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-09 06:15:58,305 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51062979]
[2024-03-09 06:15:58,305 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:15:58,305 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 06:15:58,306 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:15:58,306 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 06:15:58,306 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 06:15:58,337 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 151 out of 184
[2024-03-09 06:15:58,337 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 186 transitions, 473 flow. Second operand  has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 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)
[2024-03-09 06:15:58,337 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:15:58,337 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 184
[2024-03-09 06:15:58,337 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:16:30,352 INFO  L124   PetriNetUnfolderBase]: 93052/264108 cut-off events.
[2024-03-09 06:16:30,352 INFO  L125   PetriNetUnfolderBase]: For 66173/108457 co-relation queries the response was YES.
[2024-03-09 06:16:31,658 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 448745 conditions, 264108 events. 93052/264108 cut-off events. For 66173/108457 co-relation queries the response was YES. Maximal size of possible extension queue 6330. Compared 3939571 event pairs, 55488 based on Foata normal form. 145/232364 useless extension candidates. Maximal degree in co-relation 379478. Up to 102672 conditions per place. 
