./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/thread-join-array-dynamic-race-3.i --full-output --architecture 32bit


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


Checking for data races
Using default analysis
Version 2329fc70
Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data -tc /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/AutomizerReach.xml -i /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/thread-join-array-dynamic-race-3.i -s /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --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 31dfdfa92c5c53fb82a3ae1f815657fc1f0623ee273c9cb92b1530040e1501c3
--- Real Ultimate output ---
This is Ultimate 0.2.2-dev-2329fc7
[2023-11-03 13:14:08,124 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2023-11-03 13:14:08,126 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2023-11-03 13:14:08,153 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2023-11-03 13:14:08,153 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2023-11-03 13:14:08,154 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2023-11-03 13:14:08,155 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2023-11-03 13:14:08,156 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2023-11-03 13:14:08,157 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2023-11-03 13:14:08,157 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2023-11-03 13:14:08,158 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2023-11-03 13:14:08,159 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2023-11-03 13:14:08,159 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2023-11-03 13:14:08,160 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2023-11-03 13:14:08,160 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2023-11-03 13:14:08,161 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2023-11-03 13:14:08,162 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2023-11-03 13:14:08,163 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2023-11-03 13:14:08,164 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2023-11-03 13:14:08,165 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2023-11-03 13:14:08,166 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2023-11-03 13:14:08,167 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2023-11-03 13:14:08,168 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2023-11-03 13:14:08,169 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2023-11-03 13:14:08,171 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2023-11-03 13:14:08,171 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2023-11-03 13:14:08,171 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2023-11-03 13:14:08,172 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2023-11-03 13:14:08,172 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2023-11-03 13:14:08,173 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2023-11-03 13:14:08,173 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2023-11-03 13:14:08,174 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2023-11-03 13:14:08,174 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2023-11-03 13:14:08,175 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2023-11-03 13:14:08,175 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2023-11-03 13:14:08,176 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2023-11-03 13:14:08,176 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2023-11-03 13:14:08,176 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2023-11-03 13:14:08,176 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2023-11-03 13:14:08,177 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2023-11-03 13:14:08,177 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2023-11-03 13:14:08,178 INFO  L101        SettingsManager]: Beginning loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2023-11-03 13:14:08,194 INFO  L113        SettingsManager]: Loading preferences was successful
[2023-11-03 13:14:08,194 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2023-11-03 13:14:08,194 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-11-03 13:14:08,194 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-11-03 13:14:08,195 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-11-03 13:14:08,195 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-11-03 13:14:08,195 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-11-03 13:14:08,195 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2023-11-03 13:14:08,196 INFO  L138        SettingsManager]:  * Use SBE=true
[2023-11-03 13:14:08,196 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-11-03 13:14:08,196 INFO  L138        SettingsManager]:  * sizeof long=4
[2023-11-03 13:14:08,196 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2023-11-03 13:14:08,196 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2023-11-03 13:14:08,196 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2023-11-03 13:14:08,196 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2023-11-03 13:14:08,196 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2023-11-03 13:14:08,197 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-11-03 13:14:08,197 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2023-11-03 13:14:08,197 INFO  L138        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2023-11-03 13:14:08,197 INFO  L138        SettingsManager]:  * sizeof long double=12
[2023-11-03 13:14:08,197 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2023-11-03 13:14:08,197 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2023-11-03 13:14:08,197 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2023-11-03 13:14:08,197 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-11-03 13:14:08,197 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2023-11-03 13:14:08,197 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2023-11-03 13:14:08,198 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-03 13:14:08,198 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-11-03 13:14:08,198 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2023-11-03 13:14:08,198 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2023-11-03 13:14:08,198 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2023-11-03 13:14:08,198 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-11-03 13:14:08,198 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2023-11-03 13:14:08,198 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-11-03 13:14:08,199 INFO  L138        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2023-11-03 13:14:08,199 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2023-11-03 13:14:08,199 INFO  L138        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2023-11-03 13:14:08,199 INFO  L138        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-pldi/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-pldi/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml
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 -> 31dfdfa92c5c53fb82a3ae1f815657fc1f0623ee273c9cb92b1530040e1501c3
[2023-11-03 13:14:08,368 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2023-11-03 13:14:08,385 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-11-03 13:14:08,387 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-11-03 13:14:08,388 INFO  L271        PluginConnector]: Initializing CDTParser...
[2023-11-03 13:14:08,388 INFO  L275        PluginConnector]: CDTParser initialized
[2023-11-03 13:14:08,389 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/thread-join-array-dynamic-race-3.i
[2023-11-03 13:14:09,432 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2023-11-03 13:14:09,681 INFO  L351              CDTParser]: Found 1 translation units.
[2023-11-03 13:14:09,681 INFO  L172              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/thread-join-array-dynamic-race-3.i
[2023-11-03 13:14:09,691 INFO  L394              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/030d3d4d9/901f5767afc24452a5001e5776f58820/FLAG08f386bc9
[2023-11-03 13:14:10,035 INFO  L402              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/030d3d4d9/901f5767afc24452a5001e5776f58820
[2023-11-03 13:14:10,037 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-11-03 13:14:10,038 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2023-11-03 13:14:10,039 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-11-03 13:14:10,039 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-11-03 13:14:10,044 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2023-11-03 13:14:10,045 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:14:10" (1/1) ...
[2023-11-03 13:14:10,046 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d47f505 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:14:10, skipping insertion in model container
[2023-11-03 13:14:10,047 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:14:10" (1/1) ...
[2023-11-03 13:14:10,054 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2023-11-03 13:14:10,087 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2023-11-03 13:14:10,200 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2023-11-03 13:14:10,331 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-11-03 13:14:10,340 INFO  L203         MainTranslator]: Completed pre-run
[2023-11-03 13:14:10,350 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2023-11-03 13:14:10,375 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-11-03 13:14:10,412 INFO  L208         MainTranslator]: Completed translation
[2023-11-03 13:14:10,413 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:14:10 WrapperNode
[2023-11-03 13:14:10,413 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-11-03 13:14:10,414 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-11-03 13:14:10,414 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-11-03 13:14:10,414 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2023-11-03 13:14:10,419 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:14:10" (1/1) ...
[2023-11-03 13:14:10,434 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:14:10" (1/1) ...
[2023-11-03 13:14:10,453 INFO  L138                Inliner]: procedures = 269, calls = 26, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 97
[2023-11-03 13:14:10,453 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-11-03 13:14:10,453 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-11-03 13:14:10,454 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2023-11-03 13:14:10,454 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2023-11-03 13:14:10,461 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:14:10" (1/1) ...
[2023-11-03 13:14:10,461 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:14:10" (1/1) ...
[2023-11-03 13:14:10,464 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:14:10" (1/1) ...
[2023-11-03 13:14:10,464 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:14:10" (1/1) ...
[2023-11-03 13:14:10,471 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:14:10" (1/1) ...
[2023-11-03 13:14:10,474 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:14:10" (1/1) ...
[2023-11-03 13:14:10,476 INFO  L185        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:14:10" (1/1) ...
[2023-11-03 13:14:10,477 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:14:10" (1/1) ...
[2023-11-03 13:14:10,479 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-11-03 13:14:10,480 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-11-03 13:14:10,480 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2023-11-03 13:14:10,480 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2023-11-03 13:14:10,481 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:14:10" (1/1) ...
[2023-11-03 13:14:10,485 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-03 13:14:10,494 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 13:14:10,505 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2023-11-03 13:14:10,508 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2023-11-03 13:14:10,530 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2023-11-03 13:14:10,530 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2023-11-03 13:14:10,530 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-11-03 13:14:10,530 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2023-11-03 13:14:10,530 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2023-11-03 13:14:10,531 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2023-11-03 13:14:10,531 INFO  L130     BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock
[2023-11-03 13:14:10,531 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2023-11-03 13:14:10,531 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2023-11-03 13:14:10,531 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2023-11-03 13:14:10,531 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2023-11-03 13:14:10,531 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2023-11-03 13:14:10,531 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-11-03 13:14:10,531 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-11-03 13:14:10,532 WARN  L209             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2023-11-03 13:14:10,650 INFO  L235             CfgBuilder]: Building ICFG
[2023-11-03 13:14:10,652 INFO  L261             CfgBuilder]: Building CFG for each procedure with an implementation
[2023-11-03 13:14:10,876 INFO  L276             CfgBuilder]: Performing block encoding
[2023-11-03 13:14:10,883 INFO  L295             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-11-03 13:14:10,883 INFO  L300             CfgBuilder]: Removed 2 assume(true) statements.
[2023-11-03 13:14:10,885 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:14:10 BoogieIcfgContainer
[2023-11-03 13:14:10,885 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-11-03 13:14:10,887 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-11-03 13:14:10,887 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2023-11-03 13:14:10,889 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2023-11-03 13:14:10,889 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 01:14:10" (1/3) ...
[2023-11-03 13:14:10,890 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a3d5bb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 01:14:10, skipping insertion in model container
[2023-11-03 13:14:10,890 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:14:10" (2/3) ...
[2023-11-03 13:14:10,890 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a3d5bb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 01:14:10, skipping insertion in model container
[2023-11-03 13:14:10,891 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:14:10" (3/3) ...
[2023-11-03 13:14:10,892 INFO  L112   eAbstractionObserver]: Analyzing ICFG thread-join-array-dynamic-race-3.i
[2023-11-03 13:14:10,898 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2023-11-03 13:14:10,905 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-11-03 13:14:10,905 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations.
[2023-11-03 13:14:10,906 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2023-11-03 13:14:10,951 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2023-11-03 13:14:10,979 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 140 places, 139 transitions, 294 flow
[2023-11-03 13:14:11,057 INFO  L130       PetriNetUnfolder]: 9/297 cut-off events.
[2023-11-03 13:14:11,057 INFO  L131       PetriNetUnfolder]: For 4/4 co-relation queries the response was YES.
[2023-11-03 13:14:11,062 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 311 conditions, 297 events. 9/297 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 802 event pairs, 0 based on Foata normal form. 0/261 useless extension candidates. Maximal degree in co-relation 153. Up to 8 conditions per place. 
[2023-11-03 13:14:11,063 INFO  L82        GeneralOperation]: Start removeDead. Operand has 140 places, 139 transitions, 294 flow
[2023-11-03 13:14:11,067 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 139 places, 138 transitions, 290 flow
[2023-11-03 13:14:11,072 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-11-03 13:14:11,081 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 138 transitions, 290 flow
[2023-11-03 13:14:11,083 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 138 transitions, 290 flow
[2023-11-03 13:14:11,083 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 139 places, 138 transitions, 290 flow
[2023-11-03 13:14:11,124 INFO  L130       PetriNetUnfolder]: 9/297 cut-off events.
[2023-11-03 13:14:11,124 INFO  L131       PetriNetUnfolder]: For 4/4 co-relation queries the response was YES.
[2023-11-03 13:14:11,125 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 311 conditions, 297 events. 9/297 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 809 event pairs, 0 based on Foata normal form. 0/261 useless extension candidates. Maximal degree in co-relation 153. Up to 8 conditions per place. 
[2023-11-03 13:14:11,128 INFO  L119        LiptonReduction]: Number of co-enabled transitions 3780
[2023-11-03 13:14:15,967 INFO  L134        LiptonReduction]: Checked pairs total: 7183
[2023-11-03 13:14:15,968 INFO  L136        LiptonReduction]: Total number of compositions: 121
[2023-11-03 13:14:15,983 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-03 13:14:15,989 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=LoopsAndPotentialCycles, 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;@4f3470bf, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-11-03 13:14:15,989 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 11 error locations.
[2023-11-03 13:14:15,991 INFO  L130       PetriNetUnfolder]: 0/2 cut-off events.
[2023-11-03 13:14:15,991 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-11-03 13:14:15,991 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:14:15,992 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1]
[2023-11-03 13:14:15,992 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-11-03 13:14:15,996 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:14:15,997 INFO  L85        PathProgramCache]: Analyzing trace with hash 14455, now seen corresponding path program 1 times
[2023-11-03 13:14:16,004 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:14:16,004 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879938807]
[2023-11-03 13:14:16,005 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:14:16,005 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:14:16,080 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:14:16,133 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:14:16,134 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:14:16,134 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879938807]
[2023-11-03 13:14:16,135 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879938807] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:14:16,135 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:14:16,135 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2023-11-03 13:14:16,138 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469130621]
[2023-11-03 13:14:16,138 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:14:16,145 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-11-03 13:14:16,146 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:14:16,163 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-11-03 13:14:16,165 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-11-03 13:14:16,167 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 132 out of 260
[2023-11-03 13:14:16,169 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 34 transitions, 82 flow. Second operand  has 2 states, 2 states have (on average 133.0) internal successors, (266), 2 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:14:16,169 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:14:16,169 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 260
[2023-11-03 13:14:16,170 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:14:16,321 INFO  L130       PetriNetUnfolder]: 342/709 cut-off events.
[2023-11-03 13:14:16,321 INFO  L131       PetriNetUnfolder]: For 20/20 co-relation queries the response was YES.
[2023-11-03 13:14:16,323 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1365 conditions, 709 events. 342/709 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3500 event pairs, 335 based on Foata normal form. 0/632 useless extension candidates. Maximal degree in co-relation 1173. Up to 621 conditions per place. 
[2023-11-03 13:14:16,327 INFO  L137   encePairwiseOnDemand]: 255/260 looper letters, 23 selfloop transitions, 0 changer transitions 0/29 dead transitions.
[2023-11-03 13:14:16,327 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 29 transitions, 118 flow
[2023-11-03 13:14:16,328 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-11-03 13:14:16,330 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-11-03 13:14:16,336 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 292 transitions.
[2023-11-03 13:14:16,339 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5615384615384615
[2023-11-03 13:14:16,339 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 292 transitions.
[2023-11-03 13:14:16,340 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 292 transitions.
[2023-11-03 13:14:16,341 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:14:16,343 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 292 transitions.
[2023-11-03 13:14:16,345 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 146.0) internal successors, (292), 2 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:14:16,350 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 260.0) internal successors, (780), 3 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:14:16,351 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 260.0) internal successors, (780), 3 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:14:16,352 INFO  L175             Difference]: Start difference. First operand has 38 places, 34 transitions, 82 flow. Second operand 2 states and 292 transitions.
[2023-11-03 13:14:16,353 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 29 transitions, 118 flow
[2023-11-03 13:14:16,356 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 29 transitions, 114 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-03 13:14:16,358 INFO  L231             Difference]: Finished difference. Result has 32 places, 29 transitions, 68 flow
[2023-11-03 13:14:16,359 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=68, PETRI_PLACES=32, PETRI_TRANSITIONS=29}
[2023-11-03 13:14:16,362 INFO  L288   CegarLoopForPetriNet]: 38 programPoint places, -6 predicate places.
[2023-11-03 13:14:16,362 INFO  L495      AbstractCegarLoop]: Abstraction has has 32 places, 29 transitions, 68 flow
[2023-11-03 13:14:16,363 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 133.0) internal successors, (266), 2 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:14:16,363 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:14:16,363 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1]
[2023-11-03 13:14:16,363 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-11-03 13:14:16,364 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-11-03 13:14:16,364 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:14:16,364 INFO  L85        PathProgramCache]: Analyzing trace with hash 474762153, now seen corresponding path program 1 times
[2023-11-03 13:14:16,364 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:14:16,364 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297381762]
[2023-11-03 13:14:16,365 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:14:16,365 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:14:16,409 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-03 13:14:16,410 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-11-03 13:14:16,431 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-03 13:14:16,449 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-11-03 13:14:16,450 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-11-03 13:14:16,451 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining)
[2023-11-03 13:14:16,453 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining)
[2023-11-03 13:14:16,453 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining)
[2023-11-03 13:14:16,453 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining)
[2023-11-03 13:14:16,453 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining)
[2023-11-03 13:14:16,453 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining)
[2023-11-03 13:14:16,454 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining)
[2023-11-03 13:14:16,454 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 11 remaining)
[2023-11-03 13:14:16,454 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining)
[2023-11-03 13:14:16,454 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining)
[2023-11-03 13:14:16,454 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining)
[2023-11-03 13:14:16,455 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-11-03 13:14:16,455 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1]
[2023-11-03 13:14:16,457 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-11-03 13:14:16,457 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2023-11-03 13:14:16,479 INFO  L144    ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions.
[2023-11-03 13:14:16,482 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 174 places, 171 transitions, 378 flow
[2023-11-03 13:14:16,530 INFO  L130       PetriNetUnfolder]: 19/528 cut-off events.
[2023-11-03 13:14:16,530 INFO  L131       PetriNetUnfolder]: For 14/14 co-relation queries the response was YES.
[2023-11-03 13:14:16,532 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 558 conditions, 528 events. 19/528 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1823 event pairs, 1 based on Foata normal form. 0/462 useless extension candidates. Maximal degree in co-relation 553. Up to 16 conditions per place. 
[2023-11-03 13:14:16,532 INFO  L82        GeneralOperation]: Start removeDead. Operand has 174 places, 171 transitions, 378 flow
[2023-11-03 13:14:16,534 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 156 places, 154 transitions, 332 flow
[2023-11-03 13:14:16,534 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-11-03 13:14:16,534 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 156 places, 154 transitions, 332 flow
[2023-11-03 13:14:16,534 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 156 places, 154 transitions, 332 flow
[2023-11-03 13:14:16,534 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 156 places, 154 transitions, 332 flow
[2023-11-03 13:14:16,575 INFO  L130       PetriNetUnfolder]: 19/528 cut-off events.
[2023-11-03 13:14:16,576 INFO  L131       PetriNetUnfolder]: For 14/14 co-relation queries the response was YES.
[2023-11-03 13:14:16,577 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 557 conditions, 528 events. 19/528 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1811 event pairs, 1 based on Foata normal form. 0/462 useless extension candidates. Maximal degree in co-relation 306. Up to 16 conditions per place. 
[2023-11-03 13:14:16,585 INFO  L119        LiptonReduction]: Number of co-enabled transitions 6804
[2023-11-03 13:14:20,714 INFO  L134        LiptonReduction]: Checked pairs total: 13340
[2023-11-03 13:14:20,714 INFO  L136        LiptonReduction]: Total number of compositions: 127
[2023-11-03 13:14:20,716 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-03 13:14:20,717 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=LoopsAndPotentialCycles, 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;@4f3470bf, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-11-03 13:14:20,717 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 13 error locations.
[2023-11-03 13:14:20,718 INFO  L130       PetriNetUnfolder]: 0/2 cut-off events.
[2023-11-03 13:14:20,719 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-11-03 13:14:20,719 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:14:20,719 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1]
[2023-11-03 13:14:20,719 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-11-03 13:14:20,719 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:14:20,719 INFO  L85        PathProgramCache]: Analyzing trace with hash 24542, now seen corresponding path program 1 times
[2023-11-03 13:14:20,719 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:14:20,719 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092747705]
[2023-11-03 13:14:20,720 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:14:20,720 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:14:20,729 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:14:20,741 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:14:20,741 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:14:20,741 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092747705]
[2023-11-03 13:14:20,741 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092747705] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:14:20,741 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:14:20,741 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2023-11-03 13:14:20,742 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982198141]
[2023-11-03 13:14:20,742 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:14:20,742 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-11-03 13:14:20,742 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:14:20,742 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-11-03 13:14:20,743 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-11-03 13:14:20,743 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 160 out of 298
[2023-11-03 13:14:20,744 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 43 transitions, 110 flow. Second operand  has 2 states, 2 states have (on average 161.0) internal successors, (322), 2 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:14:20,744 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:14:20,744 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 298
[2023-11-03 13:14:20,744 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:14:21,092 INFO  L130       PetriNetUnfolder]: 3192/5371 cut-off events.
[2023-11-03 13:14:21,092 INFO  L131       PetriNetUnfolder]: For 286/286 co-relation queries the response was YES.
[2023-11-03 13:14:21,098 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10447 conditions, 5371 events. 3192/5371 cut-off events. For 286/286 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 32762 event pairs, 3143 based on Foata normal form. 0/4939 useless extension candidates. Maximal degree in co-relation 4034. Up to 4842 conditions per place. 
[2023-11-03 13:14:21,118 INFO  L137   encePairwiseOnDemand]: 293/298 looper letters, 29 selfloop transitions, 0 changer transitions 0/38 dead transitions.
[2023-11-03 13:14:21,118 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 38 transitions, 158 flow
[2023-11-03 13:14:21,119 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-11-03 13:14:21,119 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-11-03 13:14:21,121 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 354 transitions.
[2023-11-03 13:14:21,121 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5939597315436241
[2023-11-03 13:14:21,121 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 354 transitions.
[2023-11-03 13:14:21,121 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 354 transitions.
[2023-11-03 13:14:21,122 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:14:21,122 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 354 transitions.
[2023-11-03 13:14:21,123 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 177.0) internal successors, (354), 2 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:14:21,125 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 298.0) internal successors, (894), 3 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)
[2023-11-03 13:14:21,126 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 298.0) internal successors, (894), 3 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)
[2023-11-03 13:14:21,126 INFO  L175             Difference]: Start difference. First operand has 48 places, 43 transitions, 110 flow. Second operand 2 states and 354 transitions.
[2023-11-03 13:14:21,126 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 38 transitions, 158 flow
[2023-11-03 13:14:21,129 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 38 transitions, 154 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-03 13:14:21,129 INFO  L231             Difference]: Finished difference. Result has 42 places, 38 transitions, 96 flow
[2023-11-03 13:14:21,129 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=96, PETRI_PLACES=42, PETRI_TRANSITIONS=38}
[2023-11-03 13:14:21,130 INFO  L288   CegarLoopForPetriNet]: 48 programPoint places, -6 predicate places.
[2023-11-03 13:14:21,130 INFO  L495      AbstractCegarLoop]: Abstraction has has 42 places, 38 transitions, 96 flow
[2023-11-03 13:14:21,130 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 161.0) internal successors, (322), 2 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:14:21,131 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:14:21,131 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2023-11-03 13:14:21,131 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-11-03 13:14:21,131 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-11-03 13:14:21,131 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:14:21,131 INFO  L85        PathProgramCache]: Analyzing trace with hash 1208009857, now seen corresponding path program 1 times
[2023-11-03 13:14:21,131 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:14:21,131 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412205507]
[2023-11-03 13:14:21,132 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:14:21,132 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:14:21,148 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:14:21,177 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:14:21,177 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:14:21,177 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412205507]
[2023-11-03 13:14:21,178 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412205507] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:14:21,178 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:14:21,178 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-03 13:14:21,178 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846221682]
[2023-11-03 13:14:21,178 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:14:21,178 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 13:14:21,178 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:14:21,179 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 13:14:21,179 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 13:14:21,199 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 153 out of 298
[2023-11-03 13:14:21,200 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 38 transitions, 96 flow. Second operand  has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:14:21,200 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:14:21,200 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 298
[2023-11-03 13:14:21,200 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:14:21,770 INFO  L130       PetriNetUnfolder]: 6632/10522 cut-off events.
[2023-11-03 13:14:21,771 INFO  L131       PetriNetUnfolder]: For 202/202 co-relation queries the response was YES.
[2023-11-03 13:14:21,779 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20715 conditions, 10522 events. 6632/10522 cut-off events. For 202/202 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 64415 event pairs, 3912 based on Foata normal form. 0/9850 useless extension candidates. Maximal degree in co-relation 20710. Up to 6948 conditions per place. 
[2023-11-03 13:14:21,813 INFO  L137   encePairwiseOnDemand]: 292/298 looper letters, 44 selfloop transitions, 5 changer transitions 0/55 dead transitions.
[2023-11-03 13:14:21,813 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 55 transitions, 228 flow
[2023-11-03 13:14:21,814 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 13:14:21,814 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 13:14:21,815 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 509 transitions.
[2023-11-03 13:14:21,816 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.569351230425056
[2023-11-03 13:14:21,816 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 509 transitions.
[2023-11-03 13:14:21,816 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 509 transitions.
[2023-11-03 13:14:21,816 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:14:21,816 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 509 transitions.
[2023-11-03 13:14:21,818 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 169.66666666666666) internal successors, (509), 3 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:14:21,820 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:14:21,821 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:14:21,821 INFO  L175             Difference]: Start difference. First operand has 42 places, 38 transitions, 96 flow. Second operand 3 states and 509 transitions.
[2023-11-03 13:14:21,821 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 55 transitions, 228 flow
[2023-11-03 13:14:21,823 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 55 transitions, 228 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 13:14:21,824 INFO  L231             Difference]: Finished difference. Result has 46 places, 42 transitions, 134 flow
[2023-11-03 13:14:21,824 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=134, PETRI_PLACES=46, PETRI_TRANSITIONS=42}
[2023-11-03 13:14:21,825 INFO  L288   CegarLoopForPetriNet]: 48 programPoint places, -2 predicate places.
[2023-11-03 13:14:21,825 INFO  L495      AbstractCegarLoop]: Abstraction has has 46 places, 42 transitions, 134 flow
[2023-11-03 13:14:21,826 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:14:21,826 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:14:21,826 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:14:21,826 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2023-11-03 13:14:21,826 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-11-03 13:14:21,826 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:14:21,826 INFO  L85        PathProgramCache]: Analyzing trace with hash -1208502027, now seen corresponding path program 1 times
[2023-11-03 13:14:21,826 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:14:21,827 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299476315]
[2023-11-03 13:14:21,827 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:14:21,827 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:14:21,840 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:14:21,861 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:14:21,862 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:14:21,862 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299476315]
[2023-11-03 13:14:21,862 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299476315] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:14:21,862 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:14:21,862 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-03 13:14:21,862 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817180466]
[2023-11-03 13:14:21,862 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:14:21,863 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 13:14:21,863 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:14:21,863 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 13:14:21,863 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 13:14:21,890 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 151 out of 298
[2023-11-03 13:14:21,891 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 42 transitions, 134 flow. Second operand  has 3 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)
[2023-11-03 13:14:21,891 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:14:21,891 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 298
[2023-11-03 13:14:21,891 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:14:22,696 INFO  L130       PetriNetUnfolder]: 7625/12270 cut-off events.
[2023-11-03 13:14:22,696 INFO  L131       PetriNetUnfolder]: For 3305/3316 co-relation queries the response was YES.
[2023-11-03 13:14:22,710 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27565 conditions, 12270 events. 7625/12270 cut-off events. For 3305/3316 co-relation queries the response was YES. Maximal size of possible extension queue 528. Compared 81366 event pairs, 4713 based on Foata normal form. 0/11594 useless extension candidates. Maximal degree in co-relation 27558. Up to 8884 conditions per place. 
[2023-11-03 13:14:22,744 INFO  L137   encePairwiseOnDemand]: 291/298 looper letters, 46 selfloop transitions, 9 changer transitions 0/63 dead transitions.
[2023-11-03 13:14:22,744 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 63 transitions, 308 flow
[2023-11-03 13:14:22,745 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 13:14:22,745 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 13:14:22,746 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 504 transitions.
[2023-11-03 13:14:22,746 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5637583892617449
[2023-11-03 13:14:22,746 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 504 transitions.
[2023-11-03 13:14:22,746 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 504 transitions.
[2023-11-03 13:14:22,747 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:14:22,747 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 504 transitions.
[2023-11-03 13:14:22,748 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:14:22,750 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:14:22,750 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:14:22,750 INFO  L175             Difference]: Start difference. First operand has 46 places, 42 transitions, 134 flow. Second operand 3 states and 504 transitions.
[2023-11-03 13:14:22,750 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 63 transitions, 308 flow
[2023-11-03 13:14:22,787 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 63 transitions, 292 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-03 13:14:22,788 INFO  L231             Difference]: Finished difference. Result has 48 places, 49 transitions, 200 flow
[2023-11-03 13:14:22,788 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=200, PETRI_PLACES=48, PETRI_TRANSITIONS=49}
[2023-11-03 13:14:22,788 INFO  L288   CegarLoopForPetriNet]: 48 programPoint places, 0 predicate places.
[2023-11-03 13:14:22,788 INFO  L495      AbstractCegarLoop]: Abstraction has has 48 places, 49 transitions, 200 flow
[2023-11-03 13:14:22,789 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 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)
[2023-11-03 13:14:22,789 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:14:22,789 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:14:22,789 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2023-11-03 13:14:22,789 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-11-03 13:14:22,789 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:14:22,790 INFO  L85        PathProgramCache]: Analyzing trace with hash -1411186058, now seen corresponding path program 1 times
[2023-11-03 13:14:22,790 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:14:22,790 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038618262]
[2023-11-03 13:14:22,790 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:14:22,790 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:14:22,800 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:14:22,819 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:14:22,820 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:14:22,820 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038618262]
[2023-11-03 13:14:22,820 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038618262] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:14:22,820 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:14:22,820 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-03 13:14:22,820 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132815369]
[2023-11-03 13:14:22,820 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:14:22,821 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 13:14:22,821 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:14:22,821 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 13:14:22,821 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 13:14:22,841 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 151 out of 298
[2023-11-03 13:14:22,842 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 49 transitions, 200 flow. Second operand  has 3 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)
[2023-11-03 13:14:22,842 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:14:22,842 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 298
[2023-11-03 13:14:22,842 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:14:23,837 INFO  L130       PetriNetUnfolder]: 9731/15470 cut-off events.
[2023-11-03 13:14:23,838 INFO  L131       PetriNetUnfolder]: For 10784/11025 co-relation queries the response was YES.
[2023-11-03 13:14:23,854 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 39942 conditions, 15470 events. 9731/15470 cut-off events. For 10784/11025 co-relation queries the response was YES. Maximal size of possible extension queue 710. Compared 105251 event pairs, 5048 based on Foata normal form. 0/14387 useless extension candidates. Maximal degree in co-relation 39934. Up to 11067 conditions per place. 
[2023-11-03 13:14:23,898 INFO  L137   encePairwiseOnDemand]: 291/298 looper letters, 58 selfloop transitions, 14 changer transitions 0/80 dead transitions.
[2023-11-03 13:14:23,898 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 80 transitions, 470 flow
[2023-11-03 13:14:23,899 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 13:14:23,899 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 13:14:23,900 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 509 transitions.
[2023-11-03 13:14:23,900 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.569351230425056
[2023-11-03 13:14:23,900 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 509 transitions.
[2023-11-03 13:14:23,900 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 509 transitions.
[2023-11-03 13:14:23,900 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:14:23,900 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 509 transitions.
[2023-11-03 13:14:23,901 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 169.66666666666666) internal successors, (509), 3 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:14:23,903 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:14:23,903 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:14:23,903 INFO  L175             Difference]: Start difference. First operand has 48 places, 49 transitions, 200 flow. Second operand 3 states and 509 transitions.
[2023-11-03 13:14:23,903 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 80 transitions, 470 flow
[2023-11-03 13:14:23,942 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 80 transitions, 438 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-03 13:14:23,943 INFO  L231             Difference]: Finished difference. Result has 50 places, 59 transitions, 312 flow
[2023-11-03 13:14:23,944 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=312, PETRI_PLACES=50, PETRI_TRANSITIONS=59}
[2023-11-03 13:14:23,944 INFO  L288   CegarLoopForPetriNet]: 48 programPoint places, 2 predicate places.
[2023-11-03 13:14:23,945 INFO  L495      AbstractCegarLoop]: Abstraction has has 50 places, 59 transitions, 312 flow
[2023-11-03 13:14:23,945 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 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)
[2023-11-03 13:14:23,945 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:14:23,945 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:14:23,945 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2023-11-03 13:14:23,946 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-11-03 13:14:23,946 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:14:23,946 INFO  L85        PathProgramCache]: Analyzing trace with hash 204596292, now seen corresponding path program 1 times
[2023-11-03 13:14:23,946 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:14:23,947 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355708870]
[2023-11-03 13:14:23,947 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:14:23,947 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:14:23,970 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:14:24,065 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:14:24,065 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:14:24,065 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355708870]
[2023-11-03 13:14:24,066 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355708870] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:14:24,066 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:14:24,066 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-03 13:14:24,066 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302107341]
[2023-11-03 13:14:24,066 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:14:24,066 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 13:14:24,067 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:14:24,067 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 13:14:24,067 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 13:14:24,090 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 156 out of 298
[2023-11-03 13:14:24,091 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 59 transitions, 312 flow. Second operand  has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:14:24,091 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:14:24,091 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 298
[2023-11-03 13:14:24,091 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:14:25,143 INFO  L130       PetriNetUnfolder]: 8388/13739 cut-off events.
[2023-11-03 13:14:25,143 INFO  L131       PetriNetUnfolder]: For 14127/15449 co-relation queries the response was YES.
[2023-11-03 13:14:25,164 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 39149 conditions, 13739 events. 8388/13739 cut-off events. For 14127/15449 co-relation queries the response was YES. Maximal size of possible extension queue 665. Compared 96174 event pairs, 4015 based on Foata normal form. 195/13261 useless extension candidates. Maximal degree in co-relation 39140. Up to 12235 conditions per place. 
[2023-11-03 13:14:25,203 INFO  L137   encePairwiseOnDemand]: 295/298 looper letters, 50 selfloop transitions, 2 changer transitions 0/65 dead transitions.
[2023-11-03 13:14:25,203 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 65 transitions, 434 flow
[2023-11-03 13:14:25,204 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 13:14:25,204 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 13:14:25,205 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 504 transitions.
[2023-11-03 13:14:25,205 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5637583892617449
[2023-11-03 13:14:25,205 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 504 transitions.
[2023-11-03 13:14:25,205 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 504 transitions.
[2023-11-03 13:14:25,205 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:14:25,205 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 504 transitions.
[2023-11-03 13:14:25,206 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:14:25,207 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:14:25,208 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:14:25,208 INFO  L175             Difference]: Start difference. First operand has 50 places, 59 transitions, 312 flow. Second operand 3 states and 504 transitions.
[2023-11-03 13:14:25,208 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 65 transitions, 434 flow
[2023-11-03 13:14:25,226 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 65 transitions, 404 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-03 13:14:25,227 INFO  L231             Difference]: Finished difference. Result has 51 places, 60 transitions, 296 flow
[2023-11-03 13:14:25,227 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=296, PETRI_PLACES=51, PETRI_TRANSITIONS=60}
[2023-11-03 13:14:25,227 INFO  L288   CegarLoopForPetriNet]: 48 programPoint places, 3 predicate places.
[2023-11-03 13:14:25,228 INFO  L495      AbstractCegarLoop]: Abstraction has has 51 places, 60 transitions, 296 flow
[2023-11-03 13:14:25,228 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:14:25,228 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:14:25,228 INFO  L209   CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1]
[2023-11-03 13:14:25,228 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2023-11-03 13:14:25,228 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-11-03 13:14:25,229 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:14:25,229 INFO  L85        PathProgramCache]: Analyzing trace with hash -700945744, now seen corresponding path program 1 times
[2023-11-03 13:14:25,229 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:14:25,229 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128235543]
[2023-11-03 13:14:25,229 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:14:25,229 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:14:25,259 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-03 13:14:25,260 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-11-03 13:14:25,270 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-03 13:14:25,275 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-11-03 13:14:25,276 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-11-03 13:14:25,276 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining)
[2023-11-03 13:14:25,276 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (11 of 13 remaining)
[2023-11-03 13:14:25,276 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 13 remaining)
[2023-11-03 13:14:25,276 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (9 of 13 remaining)
[2023-11-03 13:14:25,276 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (8 of 13 remaining)
[2023-11-03 13:14:25,276 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (7 of 13 remaining)
[2023-11-03 13:14:25,276 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (6 of 13 remaining)
[2023-11-03 13:14:25,277 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 13 remaining)
[2023-11-03 13:14:25,277 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 13 remaining)
[2023-11-03 13:14:25,277 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 13 remaining)
[2023-11-03 13:14:25,277 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 13 remaining)
[2023-11-03 13:14:25,277 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 13 remaining)
[2023-11-03 13:14:25,277 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 13 remaining)
[2023-11-03 13:14:25,277 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2023-11-03 13:14:25,277 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1]
[2023-11-03 13:14:25,278 WARN  L233   ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-11-03 13:14:25,278 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances.
[2023-11-03 13:14:25,301 INFO  L144    ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions.
[2023-11-03 13:14:25,303 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 208 places, 203 transitions, 466 flow
[2023-11-03 13:14:25,381 INFO  L130       PetriNetUnfolder]: 41/931 cut-off events.
[2023-11-03 13:14:25,381 INFO  L131       PetriNetUnfolder]: For 39/39 co-relation queries the response was YES.
[2023-11-03 13:14:25,383 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 990 conditions, 931 events. 41/931 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 4016 event pairs, 6 based on Foata normal form. 0/811 useless extension candidates. Maximal degree in co-relation 983. Up to 32 conditions per place. 
[2023-11-03 13:14:25,383 INFO  L82        GeneralOperation]: Start removeDead. Operand has 208 places, 203 transitions, 466 flow
[2023-11-03 13:14:25,386 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 173 places, 170 transitions, 376 flow
[2023-11-03 13:14:25,386 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-11-03 13:14:25,386 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 173 places, 170 transitions, 376 flow
[2023-11-03 13:14:25,386 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 173 places, 170 transitions, 376 flow
[2023-11-03 13:14:25,386 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 173 places, 170 transitions, 376 flow
[2023-11-03 13:14:25,457 INFO  L130       PetriNetUnfolder]: 41/931 cut-off events.
[2023-11-03 13:14:25,457 INFO  L131       PetriNetUnfolder]: For 39/39 co-relation queries the response was YES.
[2023-11-03 13:14:25,460 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 988 conditions, 931 events. 41/931 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 4025 event pairs, 6 based on Foata normal form. 0/811 useless extension candidates. Maximal degree in co-relation 550. Up to 32 conditions per place. 
[2023-11-03 13:14:25,477 INFO  L119        LiptonReduction]: Number of co-enabled transitions 10304
[2023-11-03 13:14:31,007 INFO  L134        LiptonReduction]: Checked pairs total: 22351
[2023-11-03 13:14:31,007 INFO  L136        LiptonReduction]: Total number of compositions: 138
[2023-11-03 13:14:31,008 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-03 13:14:31,009 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=LoopsAndPotentialCycles, 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;@4f3470bf, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-11-03 13:14:31,009 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 15 error locations.
[2023-11-03 13:14:31,010 INFO  L130       PetriNetUnfolder]: 0/2 cut-off events.
[2023-11-03 13:14:31,010 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-11-03 13:14:31,010 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:14:31,010 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1]
[2023-11-03 13:14:31,010 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-11-03 13:14:31,011 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:14:31,011 INFO  L85        PathProgramCache]: Analyzing trace with hash 35991, now seen corresponding path program 1 times
[2023-11-03 13:14:31,011 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:14:31,011 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013285548]
[2023-11-03 13:14:31,011 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:14:31,011 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:14:31,016 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:14:31,020 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:14:31,020 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:14:31,020 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013285548]
[2023-11-03 13:14:31,020 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013285548] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:14:31,020 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:14:31,020 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2023-11-03 13:14:31,020 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614846158]
[2023-11-03 13:14:31,020 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:14:31,021 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-11-03 13:14:31,021 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:14:31,021 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-11-03 13:14:31,021 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-11-03 13:14:31,021 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 188 out of 341
[2023-11-03 13:14:31,022 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 51 transitions, 138 flow. Second operand  has 2 states, 2 states have (on average 189.0) internal successors, (378), 2 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:14:31,022 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:14:31,022 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 341
[2023-11-03 13:14:31,022 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:14:33,429 INFO  L130       PetriNetUnfolder]: 25895/40208 cut-off events.
[2023-11-03 13:14:33,429 INFO  L131       PetriNetUnfolder]: For 2471/2471 co-relation queries the response was YES.
[2023-11-03 13:14:33,485 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 77549 conditions, 40208 events. 25895/40208 cut-off events. For 2471/2471 co-relation queries the response was YES. Maximal size of possible extension queue 1200. Compared 293706 event pairs, 25552 based on Foata normal form. 0/37624 useless extension candidates. Maximal degree in co-relation 10738. Up to 35675 conditions per place. 
[2023-11-03 13:14:33,660 INFO  L137   encePairwiseOnDemand]: 336/341 looper letters, 35 selfloop transitions, 0 changer transitions 0/46 dead transitions.
[2023-11-03 13:14:33,660 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 46 transitions, 198 flow
[2023-11-03 13:14:33,661 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-11-03 13:14:33,661 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-11-03 13:14:33,662 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 416 transitions.
[2023-11-03 13:14:33,662 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6099706744868035
[2023-11-03 13:14:33,662 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 416 transitions.
[2023-11-03 13:14:33,662 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 416 transitions.
[2023-11-03 13:14:33,662 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:14:33,662 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 416 transitions.
[2023-11-03 13:14:33,663 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 208.0) internal successors, (416), 2 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:14:33,664 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 341.0) internal successors, (1023), 3 states have internal predecessors, (1023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:14:33,665 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 341.0) internal successors, (1023), 3 states have internal predecessors, (1023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:14:33,665 INFO  L175             Difference]: Start difference. First operand has 57 places, 51 transitions, 138 flow. Second operand 2 states and 416 transitions.
[2023-11-03 13:14:33,665 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 46 transitions, 198 flow
[2023-11-03 13:14:33,669 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 46 transitions, 194 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-03 13:14:33,670 INFO  L231             Difference]: Finished difference. Result has 51 places, 46 transitions, 124 flow
[2023-11-03 13:14:33,670 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=124, PETRI_PLACES=51, PETRI_TRANSITIONS=46}
[2023-11-03 13:14:33,671 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, -6 predicate places.
[2023-11-03 13:14:33,671 INFO  L495      AbstractCegarLoop]: Abstraction has has 51 places, 46 transitions, 124 flow
[2023-11-03 13:14:33,671 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 189.0) internal successors, (378), 2 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:14:33,671 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:14:33,671 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2023-11-03 13:14:33,671 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2023-11-03 13:14:33,672 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-11-03 13:14:33,672 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:14:33,672 INFO  L85        PathProgramCache]: Analyzing trace with hash -1088264775, now seen corresponding path program 1 times
[2023-11-03 13:14:33,672 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:14:33,672 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711998687]
[2023-11-03 13:14:33,672 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:14:33,672 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:14:33,682 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:14:33,698 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:14:33,699 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:14:33,699 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711998687]
[2023-11-03 13:14:33,699 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711998687] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:14:33,699 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:14:33,699 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-03 13:14:33,699 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404987]
[2023-11-03 13:14:33,699 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:14:33,700 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 13:14:33,700 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:14:33,700 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 13:14:33,700 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 13:14:33,741 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 179 out of 341
[2023-11-03 13:14:33,742 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 46 transitions, 124 flow. Second operand  has 3 states, 3 states have (on average 181.0) internal successors, (543), 3 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:14:33,742 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:14:33,742 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 341
[2023-11-03 13:14:33,742 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:14:38,407 INFO  L130       PetriNetUnfolder]: 65423/93381 cut-off events.
[2023-11-03 13:14:38,407 INFO  L131       PetriNetUnfolder]: For 2419/2419 co-relation queries the response was YES.
[2023-11-03 13:14:38,523 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 184613 conditions, 93381 events. 65423/93381 cut-off events. For 2419/2419 co-relation queries the response was YES. Maximal size of possible extension queue 2065. Compared 630166 event pairs, 40463 based on Foata normal form. 0/88533 useless extension candidates. Maximal degree in co-relation 184607. Up to 63891 conditions per place. 
[2023-11-03 13:14:38,819 INFO  L137   encePairwiseOnDemand]: 334/341 looper letters, 55 selfloop transitions, 6 changer transitions 0/68 dead transitions.
[2023-11-03 13:14:38,819 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 68 transitions, 290 flow
[2023-11-03 13:14:38,820 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 13:14:38,820 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 13:14:38,822 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 599 transitions.
[2023-11-03 13:14:38,823 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5855327468230694
[2023-11-03 13:14:38,823 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 599 transitions.
[2023-11-03 13:14:38,823 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 599 transitions.
[2023-11-03 13:14:38,823 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:14:38,823 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 599 transitions.
[2023-11-03 13:14:38,825 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 199.66666666666666) internal successors, (599), 3 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:14:38,827 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:14:38,827 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:14:38,828 INFO  L175             Difference]: Start difference. First operand has 51 places, 46 transitions, 124 flow. Second operand 3 states and 599 transitions.
[2023-11-03 13:14:38,828 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 68 transitions, 290 flow
[2023-11-03 13:14:38,830 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 68 transitions, 290 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 13:14:38,831 INFO  L231             Difference]: Finished difference. Result has 55 places, 51 transitions, 170 flow
[2023-11-03 13:14:38,831 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=170, PETRI_PLACES=55, PETRI_TRANSITIONS=51}
[2023-11-03 13:14:38,832 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, -2 predicate places.
[2023-11-03 13:14:38,832 INFO  L495      AbstractCegarLoop]: Abstraction has has 55 places, 51 transitions, 170 flow
[2023-11-03 13:14:38,832 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 181.0) internal successors, (543), 3 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:14:38,832 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:14:38,832 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:14:38,833 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2023-11-03 13:14:38,833 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-11-03 13:14:38,833 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:14:38,833 INFO  L85        PathProgramCache]: Analyzing trace with hash 475811630, now seen corresponding path program 1 times
[2023-11-03 13:14:38,833 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:14:38,834 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836032971]
[2023-11-03 13:14:38,834 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:14:38,834 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:14:38,846 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:14:38,861 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:14:38,861 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:14:38,861 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836032971]
[2023-11-03 13:14:38,862 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836032971] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:14:38,862 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:14:38,862 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-03 13:14:38,862 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732484103]
[2023-11-03 13:14:38,862 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:14:38,862 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 13:14:38,862 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:14:38,863 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 13:14:38,863 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 13:14:38,899 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 177 out of 341
[2023-11-03 13:14:38,900 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 51 transitions, 170 flow. Second operand  has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:14:38,900 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:14:38,900 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 341
[2023-11-03 13:14:38,900 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:14:44,158 INFO  L130       PetriNetUnfolder]: 70726/102789 cut-off events.
[2023-11-03 13:14:44,158 INFO  L131       PetriNetUnfolder]: For 28609/28629 co-relation queries the response was YES.
[2023-11-03 13:14:44,317 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 232032 conditions, 102789 events. 70726/102789 cut-off events. For 28609/28629 co-relation queries the response was YES. Maximal size of possible extension queue 2824. Compared 743451 event pairs, 53866 based on Foata normal form. 0/97766 useless extension candidates. Maximal degree in co-relation 232024. Up to 86448 conditions per place. 
[2023-11-03 13:14:44,671 INFO  L137   encePairwiseOnDemand]: 334/341 looper letters, 65 selfloop transitions, 10 changer transitions 0/84 dead transitions.
[2023-11-03 13:14:44,671 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 84 transitions, 428 flow
[2023-11-03 13:14:44,672 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 13:14:44,672 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 13:14:44,673 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 600 transitions.
[2023-11-03 13:14:44,673 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5865102639296188
[2023-11-03 13:14:44,673 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 600 transitions.
[2023-11-03 13:14:44,673 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 600 transitions.
[2023-11-03 13:14:44,674 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:14:44,674 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 600 transitions.
[2023-11-03 13:14:44,675 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 200.0) internal successors, (600), 3 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:14:44,676 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:14:44,676 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:14:44,676 INFO  L175             Difference]: Start difference. First operand has 55 places, 51 transitions, 170 flow. Second operand 3 states and 600 transitions.
[2023-11-03 13:14:44,677 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 84 transitions, 428 flow
[2023-11-03 13:14:46,696 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 84 transitions, 408 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-03 13:14:46,698 INFO  L231             Difference]: Finished difference. Result has 56 places, 59 transitions, 236 flow
[2023-11-03 13:14:46,698 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=236, PETRI_PLACES=56, PETRI_TRANSITIONS=59}
[2023-11-03 13:14:46,698 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, -1 predicate places.
[2023-11-03 13:14:46,698 INFO  L495      AbstractCegarLoop]: Abstraction has has 56 places, 59 transitions, 236 flow
[2023-11-03 13:14:46,699 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:14:46,699 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:14:46,699 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:14:46,699 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2023-11-03 13:14:46,699 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-11-03 13:14:46,699 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:14:46,699 INFO  L85        PathProgramCache]: Analyzing trace with hash 620261372, now seen corresponding path program 1 times
[2023-11-03 13:14:46,699 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:14:46,700 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144075396]
[2023-11-03 13:14:46,700 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:14:46,700 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:14:46,710 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:14:46,725 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:14:46,726 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:14:46,726 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144075396]
[2023-11-03 13:14:46,726 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144075396] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:14:46,726 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:14:46,726 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-03 13:14:46,726 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479808626]
[2023-11-03 13:14:46,726 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:14:46,726 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 13:14:46,727 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:14:46,727 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 13:14:46,727 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 13:14:46,763 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 177 out of 341
[2023-11-03 13:14:46,764 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 59 transitions, 236 flow. Second operand  has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:14:46,764 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:14:46,764 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 341
[2023-11-03 13:14:46,764 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:14:51,042 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([965] L1017-2-->L1017-4: Formula: (= |v_#race~data~0_37| |v_threadThread1of3ForFork1_#t~nondet5_13|)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_37|, threadThread1of3ForFork1_#t~nondet5=|v_threadThread1of3ForFork1_#t~nondet5_13|}  AuxVars[]  AssignedVars[#race~data~0, threadThread1of3ForFork1_#t~nondet5][24], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 220#true, 153#L1017-4true, threadThread1of3ForFork0InUse, 150#L1018true, threadThread2of3ForFork0InUse, 211#true, 57#L1033-2true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread3of3ForFork0InUse, 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 141#L1017-6true, Black: 216#(= |#race~data~0| 0)])
[2023-11-03 13:14:51,043 INFO  L383   tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event
[2023-11-03 13:14:51,043 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2023-11-03 13:14:51,043 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2023-11-03 13:14:51,043 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2023-11-03 13:14:51,354 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1013] L1017-2-->L1017-4: Formula: (= |v_#race~data~0_41| |v_threadThread2of3ForFork0_#t~nondet5_15|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet5=|v_threadThread2of3ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_41|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet5, #race~data~0][63], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 113#L1017-4true, 220#true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 57#L1033-2true, 225#true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread3of3ForFork0InUse, 15#threadEXITtrue, Black: 216#(= |#race~data~0| 0), 23#L1017-4true])
[2023-11-03 13:14:51,354 INFO  L383   tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event
[2023-11-03 13:14:51,354 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2023-11-03 13:14:51,354 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2023-11-03 13:14:51,355 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2023-11-03 13:14:51,361 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([894] L1017-3-->L1017-4: Formula: (= |v_threadThread3of3ForFork0_#t~nondet5_3| |v_#race~data~0_4|)  InVars {threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][75], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 113#L1017-4true, 220#true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 57#L1033-2true, 225#true, threadThread3of3ForFork0InUse, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 15#threadEXITtrue, Black: 216#(= |#race~data~0| 0), 23#L1017-4true])
[2023-11-03 13:14:51,361 INFO  L383   tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event
[2023-11-03 13:14:51,362 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2023-11-03 13:14:51,362 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2023-11-03 13:14:51,362 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2023-11-03 13:14:51,362 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([894] L1017-3-->L1017-4: Formula: (= |v_threadThread3of3ForFork0_#t~nondet5_3| |v_#race~data~0_4|)  InVars {threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][75], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 113#L1017-4true, 220#true, 37#L1018true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 150#L1018true, 211#true, 57#L1033-2true, threadThread3of3ForFork0InUse, 225#true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 216#(= |#race~data~0| 0)])
[2023-11-03 13:14:51,362 INFO  L383   tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event
[2023-11-03 13:14:51,362 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2023-11-03 13:14:51,362 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2023-11-03 13:14:51,362 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2023-11-03 13:14:51,362 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1013] L1017-2-->L1017-4: Formula: (= |v_#race~data~0_41| |v_threadThread2of3ForFork0_#t~nondet5_15|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet5=|v_threadThread2of3ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_41|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet5, #race~data~0][63], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 220#true, 37#L1018true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 57#L1033-2true, 225#true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread3of3ForFork0InUse, 141#L1017-6true, Black: 216#(= |#race~data~0| 0), 23#L1017-4true])
[2023-11-03 13:14:51,362 INFO  L383   tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event
[2023-11-03 13:14:51,362 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2023-11-03 13:14:51,363 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2023-11-03 13:14:51,363 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2023-11-03 13:14:51,443 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([965] L1017-2-->L1017-4: Formula: (= |v_#race~data~0_37| |v_threadThread1of3ForFork1_#t~nondet5_13|)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_37|, threadThread1of3ForFork1_#t~nondet5=|v_threadThread1of3ForFork1_#t~nondet5_13|}  AuxVars[]  AssignedVars[#race~data~0, threadThread1of3ForFork1_#t~nondet5][24], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 220#true, 164#threadEXITtrue, 153#L1017-4true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 57#L1033-2true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread3of3ForFork0InUse, 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 141#L1017-6true, Black: 216#(= |#race~data~0| 0)])
[2023-11-03 13:14:51,443 INFO  L383   tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event
[2023-11-03 13:14:51,443 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-11-03 13:14:51,444 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-11-03 13:14:51,444 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-11-03 13:14:51,444 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([965] L1017-2-->L1017-4: Formula: (= |v_#race~data~0_37| |v_threadThread1of3ForFork1_#t~nondet5_13|)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_37|, threadThread1of3ForFork1_#t~nondet5=|v_threadThread1of3ForFork1_#t~nondet5_13|}  AuxVars[]  AssignedVars[#race~data~0, threadThread1of3ForFork1_#t~nondet5][24], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 220#true, 153#L1017-4true, threadThread1of3ForFork0InUse, 150#L1018true, threadThread2of3ForFork0InUse, 211#true, 5#threadEXITtrue, 57#L1033-2true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread3of3ForFork0InUse, 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), Black: 216#(= |#race~data~0| 0)])
[2023-11-03 13:14:51,444 INFO  L383   tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event
[2023-11-03 13:14:51,444 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-11-03 13:14:51,444 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-11-03 13:14:51,444 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-11-03 13:14:51,456 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([894] L1017-3-->L1017-4: Formula: (= |v_threadThread3of3ForFork0_#t~nondet5_3| |v_#race~data~0_4|)  InVars {threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][53], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 113#L1017-4true, 111#ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACEtrue, 220#true, 37#L1018true, threadThread1of3ForFork0InUse, 150#L1018true, threadThread2of3ForFork0InUse, 211#true, 225#true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread3of3ForFork0InUse, Black: 216#(= |#race~data~0| 0)])
[2023-11-03 13:14:51,457 INFO  L383   tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event
[2023-11-03 13:14:51,457 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2023-11-03 13:14:51,457 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2023-11-03 13:14:51,457 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2023-11-03 13:14:51,465 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([894] L1017-3-->L1017-4: Formula: (= |v_threadThread3of3ForFork0_#t~nondet5_3| |v_#race~data~0_4|)  InVars {threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][53], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 113#L1017-4true, 111#ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACEtrue, 220#true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 225#true, threadThread3of3ForFork0InUse, 15#threadEXITtrue, Black: 216#(= |#race~data~0| 0), 23#L1017-4true])
[2023-11-03 13:14:51,465 INFO  L383   tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event
[2023-11-03 13:14:51,465 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2023-11-03 13:14:51,465 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2023-11-03 13:14:51,465 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2023-11-03 13:14:51,725 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1013] L1017-2-->L1017-4: Formula: (= |v_#race~data~0_41| |v_threadThread2of3ForFork0_#t~nondet5_15|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet5=|v_threadThread2of3ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_41|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet5, #race~data~0][63], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 220#true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 57#L1033-2true, 225#true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread3of3ForFork0InUse, 15#threadEXITtrue, 141#L1017-6true, Black: 216#(= |#race~data~0| 0), 23#L1017-4true])
[2023-11-03 13:14:51,725 INFO  L383   tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event
[2023-11-03 13:14:51,725 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-11-03 13:14:51,725 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-11-03 13:14:51,725 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-11-03 13:14:51,725 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([894] L1017-3-->L1017-4: Formula: (= |v_threadThread3of3ForFork0_#t~nondet5_3| |v_#race~data~0_4|)  InVars {threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][75], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 113#L1017-4true, 220#true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 150#L1018true, 211#true, 57#L1033-2true, threadThread3of3ForFork0InUse, 225#true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 15#threadEXITtrue, Black: 216#(= |#race~data~0| 0)])
[2023-11-03 13:14:51,726 INFO  L383   tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event
[2023-11-03 13:14:51,726 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-11-03 13:14:51,726 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-11-03 13:14:51,726 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-11-03 13:14:51,727 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([894] L1017-3-->L1017-4: Formula: (= |v_threadThread3of3ForFork0_#t~nondet5_3| |v_#race~data~0_4|)  InVars {threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][75], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 113#L1017-4true, 220#true, 37#L1018true, 164#threadEXITtrue, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 57#L1033-2true, threadThread3of3ForFork0InUse, 225#true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 216#(= |#race~data~0| 0)])
[2023-11-03 13:14:51,727 INFO  L383   tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event
[2023-11-03 13:14:51,728 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-11-03 13:14:51,728 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-11-03 13:14:51,728 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-11-03 13:14:51,728 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1013] L1017-2-->L1017-4: Formula: (= |v_#race~data~0_41| |v_threadThread2of3ForFork0_#t~nondet5_15|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet5=|v_threadThread2of3ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_41|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet5, #race~data~0][63], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 220#true, 37#L1018true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 57#L1033-2true, 5#threadEXITtrue, 225#true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread3of3ForFork0InUse, Black: 216#(= |#race~data~0| 0), 23#L1017-4true])
[2023-11-03 13:14:51,728 INFO  L383   tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event
[2023-11-03 13:14:51,728 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-11-03 13:14:51,728 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-11-03 13:14:51,728 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-11-03 13:14:51,760 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([965] L1017-2-->L1017-4: Formula: (= |v_#race~data~0_37| |v_threadThread1of3ForFork1_#t~nondet5_13|)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_37|, threadThread1of3ForFork1_#t~nondet5=|v_threadThread1of3ForFork1_#t~nondet5_13|}  AuxVars[]  AssignedVars[#race~data~0, threadThread1of3ForFork1_#t~nondet5][15], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 111#ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACEtrue, 220#true, 153#L1017-4true, threadThread1of3ForFork0InUse, 150#L1018true, threadThread2of3ForFork0InUse, 211#true, threadThread3of3ForFork0InUse, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 141#L1017-6true, Black: 216#(= |#race~data~0| 0)])
[2023-11-03 13:14:51,760 INFO  L383   tUnfolder$Statistics]: this new event has 33 ancestors and is not cut-off event
[2023-11-03 13:14:51,760 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is not cut-off event
[2023-11-03 13:14:51,761 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is not cut-off event
[2023-11-03 13:14:51,761 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is not cut-off event
[2023-11-03 13:14:51,789 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([965] L1017-2-->L1017-4: Formula: (= |v_#race~data~0_37| |v_threadThread1of3ForFork1_#t~nondet5_13|)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_37|, threadThread1of3ForFork1_#t~nondet5=|v_threadThread1of3ForFork1_#t~nondet5_13|}  AuxVars[]  AssignedVars[#race~data~0, threadThread1of3ForFork1_#t~nondet5][24], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 220#true, 164#threadEXITtrue, 153#L1017-4true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 57#L1033-2true, 5#threadEXITtrue, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread3of3ForFork0InUse, 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), Black: 216#(= |#race~data~0| 0)])
[2023-11-03 13:14:51,790 INFO  L383   tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event
[2023-11-03 13:14:51,790 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is cut-off event
[2023-11-03 13:14:51,790 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is cut-off event
[2023-11-03 13:14:51,790 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is cut-off event
[2023-11-03 13:14:51,796 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([894] L1017-3-->L1017-4: Formula: (= |v_threadThread3of3ForFork0_#t~nondet5_3| |v_#race~data~0_4|)  InVars {threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][53], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 111#ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACEtrue, 113#L1017-4true, 220#true, threadThread1of3ForFork0InUse, 150#L1018true, threadThread2of3ForFork0InUse, 211#true, 225#true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread3of3ForFork0InUse, 15#threadEXITtrue, Black: 216#(= |#race~data~0| 0)])
[2023-11-03 13:14:51,796 INFO  L383   tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event
[2023-11-03 13:14:51,796 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-11-03 13:14:51,796 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-11-03 13:14:51,797 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-11-03 13:14:51,798 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([894] L1017-3-->L1017-4: Formula: (= |v_threadThread3of3ForFork0_#t~nondet5_3| |v_#race~data~0_4|)  InVars {threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][53], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 111#ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACEtrue, 113#L1017-4true, 220#true, 37#L1018true, 164#threadEXITtrue, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 225#true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread3of3ForFork0InUse, Black: 216#(= |#race~data~0| 0)])
[2023-11-03 13:14:51,798 INFO  L383   tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event
[2023-11-03 13:14:51,798 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-11-03 13:14:51,798 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-11-03 13:14:51,798 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-11-03 13:14:52,049 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([894] L1017-3-->L1017-4: Formula: (= |v_threadThread3of3ForFork0_#t~nondet5_3| |v_#race~data~0_4|)  InVars {threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][75], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 113#L1017-4true, 220#true, 164#threadEXITtrue, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 57#L1033-2true, threadThread3of3ForFork0InUse, 225#true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 15#threadEXITtrue, Black: 216#(= |#race~data~0| 0)])
[2023-11-03 13:14:52,049 INFO  L383   tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event
[2023-11-03 13:14:52,049 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is cut-off event
[2023-11-03 13:14:52,049 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is cut-off event
[2023-11-03 13:14:52,049 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is cut-off event
[2023-11-03 13:14:52,049 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1013] L1017-2-->L1017-4: Formula: (= |v_#race~data~0_41| |v_threadThread2of3ForFork0_#t~nondet5_15|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet5=|v_threadThread2of3ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_41|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet5, #race~data~0][63], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 220#true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 57#L1033-2true, 5#threadEXITtrue, 225#true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread3of3ForFork0InUse, 15#threadEXITtrue, Black: 216#(= |#race~data~0| 0), 23#L1017-4true])
[2023-11-03 13:14:52,049 INFO  L383   tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event
[2023-11-03 13:14:52,050 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is cut-off event
[2023-11-03 13:14:52,050 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is cut-off event
[2023-11-03 13:14:52,050 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is cut-off event
[2023-11-03 13:14:52,074 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([965] L1017-2-->L1017-4: Formula: (= |v_#race~data~0_37| |v_threadThread1of3ForFork1_#t~nondet5_13|)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_37|, threadThread1of3ForFork1_#t~nondet5=|v_threadThread1of3ForFork1_#t~nondet5_13|}  AuxVars[]  AssignedVars[#race~data~0, threadThread1of3ForFork1_#t~nondet5][15], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 111#ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACEtrue, 220#true, 164#threadEXITtrue, 153#L1017-4true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread3of3ForFork0InUse, 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 141#L1017-6true, Black: 216#(= |#race~data~0| 0)])
[2023-11-03 13:14:52,074 INFO  L383   tUnfolder$Statistics]: this new event has 34 ancestors and is not cut-off event
[2023-11-03 13:14:52,075 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is not cut-off event
[2023-11-03 13:14:52,075 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is not cut-off event
[2023-11-03 13:14:52,075 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is not cut-off event
[2023-11-03 13:14:52,075 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([965] L1017-2-->L1017-4: Formula: (= |v_#race~data~0_37| |v_threadThread1of3ForFork1_#t~nondet5_13|)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_37|, threadThread1of3ForFork1_#t~nondet5=|v_threadThread1of3ForFork1_#t~nondet5_13|}  AuxVars[]  AssignedVars[#race~data~0, threadThread1of3ForFork1_#t~nondet5][15], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 111#ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACEtrue, 220#true, 153#L1017-4true, threadThread1of3ForFork0InUse, 150#L1018true, threadThread2of3ForFork0InUse, 211#true, 5#threadEXITtrue, threadThread3of3ForFork0InUse, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), Black: 216#(= |#race~data~0| 0)])
[2023-11-03 13:14:52,075 INFO  L383   tUnfolder$Statistics]: this new event has 34 ancestors and is not cut-off event
[2023-11-03 13:14:52,075 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is not cut-off event
[2023-11-03 13:14:52,075 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is not cut-off event
[2023-11-03 13:14:52,075 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is not cut-off event
[2023-11-03 13:14:52,091 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([894] L1017-3-->L1017-4: Formula: (= |v_threadThread3of3ForFork0_#t~nondet5_3| |v_#race~data~0_4|)  InVars {threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][53], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 113#L1017-4true, 111#ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACEtrue, 220#true, 164#threadEXITtrue, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 225#true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread3of3ForFork0InUse, 15#threadEXITtrue, Black: 216#(= |#race~data~0| 0)])
[2023-11-03 13:14:52,091 INFO  L383   tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event
[2023-11-03 13:14:52,091 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is cut-off event
[2023-11-03 13:14:52,091 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is cut-off event
[2023-11-03 13:14:52,091 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is cut-off event
[2023-11-03 13:14:52,338 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([965] L1017-2-->L1017-4: Formula: (= |v_#race~data~0_37| |v_threadThread1of3ForFork1_#t~nondet5_13|)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_37|, threadThread1of3ForFork1_#t~nondet5=|v_threadThread1of3ForFork1_#t~nondet5_13|}  AuxVars[]  AssignedVars[#race~data~0, threadThread1of3ForFork1_#t~nondet5][15], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 111#ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACEtrue, 220#true, 164#threadEXITtrue, 153#L1017-4true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 5#threadEXITtrue, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread3of3ForFork0InUse, 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), Black: 216#(= |#race~data~0| 0)])
[2023-11-03 13:14:52,339 INFO  L383   tUnfolder$Statistics]: this new event has 35 ancestors and is not cut-off event
[2023-11-03 13:14:52,339 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is not cut-off event
[2023-11-03 13:14:52,339 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is not cut-off event
[2023-11-03 13:14:52,339 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is not cut-off event
[2023-11-03 13:14:53,144 INFO  L130       PetriNetUnfolder]: 83569/121077 cut-off events.
[2023-11-03 13:14:53,145 INFO  L131       PetriNetUnfolder]: For 70476/72388 co-relation queries the response was YES.
[2023-11-03 13:14:53,340 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 298958 conditions, 121077 events. 83569/121077 cut-off events. For 70476/72388 co-relation queries the response was YES. Maximal size of possible extension queue 3550. Compared 895480 event pairs, 59795 based on Foata normal form. 1/113492 useless extension candidates. Maximal degree in co-relation 298949. Up to 103147 conditions per place. 
[2023-11-03 13:14:53,729 INFO  L137   encePairwiseOnDemand]: 334/341 looper letters, 65 selfloop transitions, 12 changer transitions 0/86 dead transitions.
[2023-11-03 13:14:53,730 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 86 transitions, 485 flow
[2023-11-03 13:14:53,731 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 13:14:53,731 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 13:14:53,732 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 594 transitions.
[2023-11-03 13:14:53,732 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5806451612903226
[2023-11-03 13:14:53,732 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 594 transitions.
[2023-11-03 13:14:53,732 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 594 transitions.
[2023-11-03 13:14:53,732 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:14:53,732 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 594 transitions.
[2023-11-03 13:14:53,733 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 198.0) internal successors, (594), 3 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:14:53,734 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:14:53,735 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:14:53,735 INFO  L175             Difference]: Start difference. First operand has 56 places, 59 transitions, 236 flow. Second operand 3 states and 594 transitions.
[2023-11-03 13:14:53,735 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 86 transitions, 485 flow
[2023-11-03 13:14:55,420 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 86 transitions, 473 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-11-03 13:14:55,422 INFO  L231             Difference]: Finished difference. Result has 58 places, 67 transitions, 324 flow
[2023-11-03 13:14:55,422 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=324, PETRI_PLACES=58, PETRI_TRANSITIONS=67}
[2023-11-03 13:14:55,422 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 1 predicate places.
[2023-11-03 13:14:55,422 INFO  L495      AbstractCegarLoop]: Abstraction has has 58 places, 67 transitions, 324 flow
[2023-11-03 13:14:55,423 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:14:55,423 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:14:55,423 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:14:55,423 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2023-11-03 13:14:55,423 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-11-03 13:14:55,423 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:14:55,423 INFO  L85        PathProgramCache]: Analyzing trace with hash -908940002, now seen corresponding path program 1 times
[2023-11-03 13:14:55,423 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:14:55,424 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629095632]
[2023-11-03 13:14:55,424 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:14:55,424 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:14:55,442 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:14:55,489 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:14:55,489 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:14:55,489 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629095632]
[2023-11-03 13:14:55,489 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629095632] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:14:55,490 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:14:55,490 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-03 13:14:55,491 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333249006]
[2023-11-03 13:14:55,491 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:14:55,491 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 13:14:55,491 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:14:55,492 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 13:14:55,492 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 13:14:55,514 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 184 out of 341
[2023-11-03 13:14:55,515 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 67 transitions, 324 flow. Second operand  has 3 states, 3 states have (on average 186.66666666666666) internal successors, (560), 3 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:14:55,515 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:14:55,515 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 341
[2023-11-03 13:14:55,515 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:14:58,613 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([894] L1017-3-->L1017-4: Formula: (= |v_threadThread3of3ForFork0_#t~nondet5_3| |v_#race~data~0_4|)  InVars {threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][67], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 113#L1017-4true, 37#L1018true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 57#L1033-2true, threadThread3of3ForFork0InUse, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 225#true, 22#$Ultimate##0true, Black: 216#(= |#race~data~0| 0), 230#true])
[2023-11-03 13:14:58,614 INFO  L383   tUnfolder$Statistics]: this new event has 29 ancestors and is not cut-off event
[2023-11-03 13:14:58,614 INFO  L386   tUnfolder$Statistics]:   existing Event has 29 ancestors and is not cut-off event
[2023-11-03 13:14:58,614 INFO  L386   tUnfolder$Statistics]:   existing Event has 29 ancestors and is not cut-off event
[2023-11-03 13:14:58,614 INFO  L386   tUnfolder$Statistics]:   existing Event has 29 ancestors and is not cut-off event
[2023-11-03 13:14:59,056 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([965] L1017-2-->L1017-4: Formula: (= |v_#race~data~0_37| |v_threadThread1of3ForFork1_#t~nondet5_13|)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_37|, threadThread1of3ForFork1_#t~nondet5=|v_threadThread1of3ForFork1_#t~nondet5_13|}  AuxVars[]  AssignedVars[#race~data~0, threadThread1of3ForFork1_#t~nondet5][40], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 83#L1017true, 153#L1017-4true, threadThread1of3ForFork0InUse, 150#L1018true, threadThread2of3ForFork0InUse, 211#true, 57#L1033-2true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread3of3ForFork0InUse, 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), Black: 216#(= |#race~data~0| 0), 230#true])
[2023-11-03 13:14:59,056 INFO  L383   tUnfolder$Statistics]: this new event has 30 ancestors and is not cut-off event
[2023-11-03 13:14:59,056 INFO  L386   tUnfolder$Statistics]:   existing Event has 30 ancestors and is not cut-off event
[2023-11-03 13:14:59,056 INFO  L386   tUnfolder$Statistics]:   existing Event has 30 ancestors and is not cut-off event
[2023-11-03 13:14:59,056 INFO  L386   tUnfolder$Statistics]:   existing Event has 30 ancestors and is not cut-off event
[2023-11-03 13:14:59,056 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([965] L1017-2-->L1017-4: Formula: (= |v_#race~data~0_37| |v_threadThread1of3ForFork1_#t~nondet5_13|)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_37|, threadThread1of3ForFork1_#t~nondet5=|v_threadThread1of3ForFork1_#t~nondet5_13|}  AuxVars[]  AssignedVars[#race~data~0, threadThread1of3ForFork1_#t~nondet5][40], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 153#L1017-4true, threadThread1of3ForFork0InUse, 150#L1018true, threadThread2of3ForFork0InUse, 211#true, 57#L1033-2true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread3of3ForFork0InUse, 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 181#L1017-3true, Black: 216#(= |#race~data~0| 0), 230#true])
[2023-11-03 13:14:59,056 INFO  L383   tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event
[2023-11-03 13:14:59,057 INFO  L386   tUnfolder$Statistics]:   existing Event has 31 ancestors and is cut-off event
[2023-11-03 13:14:59,057 INFO  L386   tUnfolder$Statistics]:   existing Event has 31 ancestors and is cut-off event
[2023-11-03 13:14:59,057 INFO  L386   tUnfolder$Statistics]:   existing Event has 31 ancestors and is cut-off event
[2023-11-03 13:14:59,060 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1013] L1017-2-->L1017-4: Formula: (= |v_#race~data~0_41| |v_threadThread2of3ForFork0_#t~nondet5_15|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet5=|v_threadThread2of3ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_41|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet5, #race~data~0][62], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 37#L1018true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 57#L1033-2true, threadThread3of3ForFork0InUse, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 225#true, 181#L1017-3true, Black: 216#(= |#race~data~0| 0), 230#true, 23#L1017-4true])
[2023-11-03 13:14:59,060 INFO  L383   tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event
[2023-11-03 13:14:59,060 INFO  L386   tUnfolder$Statistics]:   existing Event has 31 ancestors and is cut-off event
[2023-11-03 13:14:59,060 INFO  L386   tUnfolder$Statistics]:   existing Event has 31 ancestors and is cut-off event
[2023-11-03 13:14:59,060 INFO  L386   tUnfolder$Statistics]:   existing Event has 31 ancestors and is cut-off event
[2023-11-03 13:14:59,213 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([894] L1017-3-->L1017-4: Formula: (= |v_threadThread3of3ForFork0_#t~nondet5_3| |v_#race~data~0_4|)  InVars {threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][67], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 113#L1017-4true, 37#L1018true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 29#L1016-1true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 57#L1033-2true, 225#true, threadThread3of3ForFork0InUse, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 216#(= |#race~data~0| 0), 230#true])
[2023-11-03 13:14:59,213 INFO  L383   tUnfolder$Statistics]: this new event has 30 ancestors and is not cut-off event
[2023-11-03 13:14:59,213 INFO  L386   tUnfolder$Statistics]:   existing Event has 30 ancestors and is not cut-off event
[2023-11-03 13:14:59,213 INFO  L386   tUnfolder$Statistics]:   existing Event has 30 ancestors and is not cut-off event
[2023-11-03 13:14:59,214 INFO  L386   tUnfolder$Statistics]:   existing Event has 30 ancestors and is not cut-off event
[2023-11-03 13:14:59,611 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([965] L1017-2-->L1017-4: Formula: (= |v_#race~data~0_37| |v_threadThread1of3ForFork1_#t~nondet5_13|)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_37|, threadThread1of3ForFork1_#t~nondet5=|v_threadThread1of3ForFork1_#t~nondet5_13|}  AuxVars[]  AssignedVars[#race~data~0, threadThread1of3ForFork1_#t~nondet5][40], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 83#L1017true, 164#threadEXITtrue, 153#L1017-4true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 57#L1033-2true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread3of3ForFork0InUse, 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), Black: 216#(= |#race~data~0| 0), 230#true])
[2023-11-03 13:14:59,611 INFO  L383   tUnfolder$Statistics]: this new event has 31 ancestors and is not cut-off event
[2023-11-03 13:14:59,611 INFO  L386   tUnfolder$Statistics]:   existing Event has 31 ancestors and is not cut-off event
[2023-11-03 13:14:59,612 INFO  L386   tUnfolder$Statistics]:   existing Event has 31 ancestors and is not cut-off event
[2023-11-03 13:14:59,612 INFO  L386   tUnfolder$Statistics]:   existing Event has 31 ancestors and is not cut-off event
[2023-11-03 13:14:59,612 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([965] L1017-2-->L1017-4: Formula: (= |v_#race~data~0_37| |v_threadThread1of3ForFork1_#t~nondet5_13|)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_37|, threadThread1of3ForFork1_#t~nondet5=|v_threadThread1of3ForFork1_#t~nondet5_13|}  AuxVars[]  AssignedVars[#race~data~0, threadThread1of3ForFork1_#t~nondet5][40], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 164#threadEXITtrue, 153#L1017-4true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 57#L1033-2true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread3of3ForFork0InUse, 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 181#L1017-3true, Black: 216#(= |#race~data~0| 0), 230#true])
[2023-11-03 13:14:59,612 INFO  L383   tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event
[2023-11-03 13:14:59,612 INFO  L386   tUnfolder$Statistics]:   existing Event has 32 ancestors and is cut-off event
[2023-11-03 13:14:59,612 INFO  L386   tUnfolder$Statistics]:   existing Event has 32 ancestors and is cut-off event
[2023-11-03 13:14:59,612 INFO  L386   tUnfolder$Statistics]:   existing Event has 32 ancestors and is cut-off event
[2023-11-03 13:14:59,617 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1013] L1017-2-->L1017-4: Formula: (= |v_#race~data~0_41| |v_threadThread2of3ForFork0_#t~nondet5_15|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet5=|v_threadThread2of3ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_41|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet5, #race~data~0][62], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 57#L1033-2true, threadThread3of3ForFork0InUse, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 225#true, 15#threadEXITtrue, 181#L1017-3true, Black: 216#(= |#race~data~0| 0), 230#true, 23#L1017-4true])
[2023-11-03 13:14:59,617 INFO  L383   tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event
[2023-11-03 13:14:59,617 INFO  L386   tUnfolder$Statistics]:   existing Event has 32 ancestors and is cut-off event
[2023-11-03 13:14:59,617 INFO  L386   tUnfolder$Statistics]:   existing Event has 32 ancestors and is cut-off event
[2023-11-03 13:14:59,617 INFO  L386   tUnfolder$Statistics]:   existing Event has 32 ancestors and is cut-off event
[2023-11-03 13:14:59,619 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([894] L1017-3-->L1017-4: Formula: (= |v_threadThread3of3ForFork0_#t~nondet5_3| |v_#race~data~0_4|)  InVars {threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][67], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 113#L1017-4true, 37#L1018true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 57#L1033-2true, threadThread3of3ForFork0InUse, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 225#true, Black: 216#(= |#race~data~0| 0), 230#true, 144#L1017-2true])
[2023-11-03 13:14:59,619 INFO  L383   tUnfolder$Statistics]: this new event has 31 ancestors and is not cut-off event
[2023-11-03 13:14:59,619 INFO  L386   tUnfolder$Statistics]:   existing Event has 31 ancestors and is not cut-off event
[2023-11-03 13:14:59,619 INFO  L386   tUnfolder$Statistics]:   existing Event has 31 ancestors and is not cut-off event
[2023-11-03 13:14:59,619 INFO  L386   tUnfolder$Statistics]:   existing Event has 31 ancestors and is not cut-off event
[2023-11-03 13:15:00,035 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([894] L1017-3-->L1017-4: Formula: (= |v_threadThread3of3ForFork0_#t~nondet5_3| |v_#race~data~0_4|)  InVars {threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][67], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 113#L1017-4true, 37#L1018true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 57#L1033-2true, 225#true, threadThread3of3ForFork0InUse, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 216#(= |#race~data~0| 0), 230#true, 23#L1017-4true])
[2023-11-03 13:15:00,035 INFO  L383   tUnfolder$Statistics]: this new event has 32 ancestors and is not cut-off event
[2023-11-03 13:15:00,035 INFO  L386   tUnfolder$Statistics]:   existing Event has 32 ancestors and is not cut-off event
[2023-11-03 13:15:00,035 INFO  L386   tUnfolder$Statistics]:   existing Event has 32 ancestors and is not cut-off event
[2023-11-03 13:15:00,035 INFO  L386   tUnfolder$Statistics]:   existing Event has 32 ancestors and is not cut-off event
[2023-11-03 13:15:00,047 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1013] L1017-2-->L1017-4: Formula: (= |v_#race~data~0_41| |v_threadThread2of3ForFork0_#t~nondet5_15|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet5=|v_threadThread2of3ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_41|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet5, #race~data~0][62], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 37#L1018true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 57#L1033-2true, threadThread3of3ForFork0InUse, 225#true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 141#L1017-6true, Black: 216#(= |#race~data~0| 0), 230#true, 23#L1017-4true])
[2023-11-03 13:15:00,047 INFO  L383   tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event
[2023-11-03 13:15:00,047 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2023-11-03 13:15:00,047 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2023-11-03 13:15:00,047 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2023-11-03 13:15:00,072 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1013] L1017-2-->L1017-4: Formula: (= |v_#race~data~0_41| |v_threadThread2of3ForFork0_#t~nondet5_15|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet5=|v_threadThread2of3ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_41|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet5, #race~data~0][62], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 37#L1018true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 5#threadEXITtrue, 57#L1033-2true, threadThread3of3ForFork0InUse, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 225#true, Black: 216#(= |#race~data~0| 0), 230#true, 23#L1017-4true])
[2023-11-03 13:15:00,073 INFO  L383   tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event
[2023-11-03 13:15:00,073 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-11-03 13:15:00,073 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-11-03 13:15:00,073 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-11-03 13:15:00,148 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1013] L1017-2-->L1017-4: Formula: (= |v_#race~data~0_41| |v_threadThread2of3ForFork0_#t~nondet5_15|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet5=|v_threadThread2of3ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_41|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet5, #race~data~0][35], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 111#ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACEtrue, 37#L1018true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 148#L1017-4true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 5#threadEXITtrue, threadThread3of3ForFork0InUse, 225#true, Black: 216#(= |#race~data~0| 0), 230#true, 23#L1017-4true])
[2023-11-03 13:15:00,148 INFO  L383   tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event
[2023-11-03 13:15:00,148 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2023-11-03 13:15:00,149 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2023-11-03 13:15:00,149 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2023-11-03 13:15:00,351 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([894] L1017-3-->L1017-4: Formula: (= |v_threadThread3of3ForFork0_#t~nondet5_3| |v_#race~data~0_4|)  InVars {threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][67], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 113#L1017-4true, 37#L1018true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), threadThread1of3ForFork0InUse, 150#L1018true, threadThread2of3ForFork0InUse, 211#true, 57#L1033-2true, threadThread3of3ForFork0InUse, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 225#true, Black: 216#(= |#race~data~0| 0), 230#true])
[2023-11-03 13:15:00,351 INFO  L383   tUnfolder$Statistics]: this new event has 33 ancestors and is not cut-off event
[2023-11-03 13:15:00,351 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is not cut-off event
[2023-11-03 13:15:00,351 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is not cut-off event
[2023-11-03 13:15:00,351 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is not cut-off event
[2023-11-03 13:15:00,365 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1013] L1017-2-->L1017-4: Formula: (= |v_#race~data~0_41| |v_threadThread2of3ForFork0_#t~nondet5_15|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet5=|v_threadThread2of3ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_41|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet5, #race~data~0][26], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 111#ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACEtrue, 37#L1018true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 225#true, threadThread3of3ForFork0InUse, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 141#L1017-6true, Black: 216#(= |#race~data~0| 0), 230#true, 23#L1017-4true])
[2023-11-03 13:15:00,365 INFO  L383   tUnfolder$Statistics]: this new event has 33 ancestors and is not cut-off event
[2023-11-03 13:15:00,365 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is not cut-off event
[2023-11-03 13:15:00,365 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is not cut-off event
[2023-11-03 13:15:00,365 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is not cut-off event
[2023-11-03 13:15:00,367 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1013] L1017-2-->L1017-4: Formula: (= |v_#race~data~0_41| |v_threadThread2of3ForFork0_#t~nondet5_15|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet5=|v_threadThread2of3ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_41|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet5, #race~data~0][62], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 57#L1033-2true, threadThread3of3ForFork0InUse, 225#true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 15#threadEXITtrue, 141#L1017-6true, Black: 216#(= |#race~data~0| 0), 230#true, 23#L1017-4true])
[2023-11-03 13:15:00,367 INFO  L383   tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event
[2023-11-03 13:15:00,367 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-11-03 13:15:00,368 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-11-03 13:15:00,368 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-11-03 13:15:00,380 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1013] L1017-2-->L1017-4: Formula: (= |v_#race~data~0_41| |v_threadThread2of3ForFork0_#t~nondet5_15|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet5=|v_threadThread2of3ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_41|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet5, #race~data~0][62], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 57#L1033-2true, 5#threadEXITtrue, threadThread3of3ForFork0InUse, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 225#true, 15#threadEXITtrue, Black: 216#(= |#race~data~0| 0), 230#true, 23#L1017-4true])
[2023-11-03 13:15:00,381 INFO  L383   tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event
[2023-11-03 13:15:00,381 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is cut-off event
[2023-11-03 13:15:00,381 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is cut-off event
[2023-11-03 13:15:00,381 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is cut-off event
[2023-11-03 13:15:00,406 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1013] L1017-2-->L1017-4: Formula: (= |v_#race~data~0_41| |v_threadThread2of3ForFork0_#t~nondet5_15|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet5=|v_threadThread2of3ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_41|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet5, #race~data~0][26], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 111#ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACEtrue, 37#L1018true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 5#threadEXITtrue, threadThread3of3ForFork0InUse, 225#true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 216#(= |#race~data~0| 0), 230#true, 23#L1017-4true])
[2023-11-03 13:15:00,406 INFO  L383   tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event
[2023-11-03 13:15:00,406 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-11-03 13:15:00,406 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-11-03 13:15:00,406 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-11-03 13:15:00,443 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1013] L1017-2-->L1017-4: Formula: (= |v_#race~data~0_41| |v_threadThread2of3ForFork0_#t~nondet5_15|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet5=|v_threadThread2of3ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_41|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet5, #race~data~0][35], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 111#ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACEtrue, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 148#L1017-4true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 5#threadEXITtrue, threadThread3of3ForFork0InUse, 225#true, 15#threadEXITtrue, Black: 216#(= |#race~data~0| 0), 230#true, 23#L1017-4true])
[2023-11-03 13:15:00,443 INFO  L383   tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event
[2023-11-03 13:15:00,443 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-11-03 13:15:00,443 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-11-03 13:15:00,443 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-11-03 13:15:00,685 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([894] L1017-3-->L1017-4: Formula: (= |v_threadThread3of3ForFork0_#t~nondet5_3| |v_#race~data~0_4|)  InVars {threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][67], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 113#L1017-4true, 37#L1018true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 164#threadEXITtrue, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 57#L1033-2true, threadThread3of3ForFork0InUse, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 225#true, Black: 216#(= |#race~data~0| 0), 230#true])
[2023-11-03 13:15:00,685 INFO  L383   tUnfolder$Statistics]: this new event has 34 ancestors and is not cut-off event
[2023-11-03 13:15:00,685 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is not cut-off event
[2023-11-03 13:15:00,685 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is not cut-off event
[2023-11-03 13:15:00,685 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is not cut-off event
[2023-11-03 13:15:00,701 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1013] L1017-2-->L1017-4: Formula: (= |v_#race~data~0_41| |v_threadThread2of3ForFork0_#t~nondet5_15|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet5=|v_threadThread2of3ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_41|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet5, #race~data~0][26], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 111#ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACEtrue, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 225#true, threadThread3of3ForFork0InUse, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 15#threadEXITtrue, 141#L1017-6true, Black: 216#(= |#race~data~0| 0), 230#true, 23#L1017-4true])
[2023-11-03 13:15:00,701 INFO  L383   tUnfolder$Statistics]: this new event has 34 ancestors and is not cut-off event
[2023-11-03 13:15:00,701 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is not cut-off event
[2023-11-03 13:15:00,701 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is not cut-off event
[2023-11-03 13:15:00,701 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is not cut-off event
[2023-11-03 13:15:00,727 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1013] L1017-2-->L1017-4: Formula: (= |v_#race~data~0_41| |v_threadThread2of3ForFork0_#t~nondet5_15|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet5=|v_threadThread2of3ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_41|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet5, #race~data~0][26], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 111#ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACEtrue, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 5#threadEXITtrue, threadThread3of3ForFork0InUse, 225#true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 15#threadEXITtrue, Black: 216#(= |#race~data~0| 0), 230#true, 23#L1017-4true])
[2023-11-03 13:15:00,727 INFO  L383   tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event
[2023-11-03 13:15:00,727 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is cut-off event
[2023-11-03 13:15:00,727 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is cut-off event
[2023-11-03 13:15:00,727 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is cut-off event
[2023-11-03 13:15:01,599 INFO  L130       PetriNetUnfolder]: 68016/102342 cut-off events.
[2023-11-03 13:15:01,599 INFO  L131       PetriNetUnfolder]: For 108037/120330 co-relation queries the response was YES.
[2023-11-03 13:15:01,880 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 271307 conditions, 102342 events. 68016/102342 cut-off events. For 108037/120330 co-relation queries the response was YES. Maximal size of possible extension queue 3443. Compared 809054 event pairs, 39581 based on Foata normal form. 1957/98421 useless extension candidates. Maximal degree in co-relation 271297. Up to 88600 conditions per place. 
[2023-11-03 13:15:02,220 INFO  L137   encePairwiseOnDemand]: 338/341 looper letters, 51 selfloop transitions, 2 changer transitions 0/73 dead transitions.
[2023-11-03 13:15:02,221 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 73 transitions, 444 flow
[2023-11-03 13:15:02,221 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 13:15:02,221 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 13:15:02,223 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 594 transitions.
[2023-11-03 13:15:02,223 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5806451612903226
[2023-11-03 13:15:02,223 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 594 transitions.
[2023-11-03 13:15:02,223 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 594 transitions.
[2023-11-03 13:15:02,223 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:15:02,223 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 594 transitions.
[2023-11-03 13:15:02,224 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 198.0) internal successors, (594), 3 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:15:02,226 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:15:02,226 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:15:02,226 INFO  L175             Difference]: Start difference. First operand has 58 places, 67 transitions, 324 flow. Second operand 3 states and 594 transitions.
[2023-11-03 13:15:02,226 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 73 transitions, 444 flow
[2023-11-03 13:15:03,811 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 73 transitions, 432 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-11-03 13:15:03,812 INFO  L231             Difference]: Finished difference. Result has 60 places, 68 transitions, 324 flow
[2023-11-03 13:15:03,812 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=324, PETRI_PLACES=60, PETRI_TRANSITIONS=68}
[2023-11-03 13:15:03,813 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 3 predicate places.
[2023-11-03 13:15:03,813 INFO  L495      AbstractCegarLoop]: Abstraction has has 60 places, 68 transitions, 324 flow
[2023-11-03 13:15:03,813 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 186.66666666666666) internal successors, (560), 3 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:15:03,814 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:15:03,814 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:15:03,815 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2023-11-03 13:15:03,815 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-11-03 13:15:03,815 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:15:03,815 INFO  L85        PathProgramCache]: Analyzing trace with hash -1014108095, now seen corresponding path program 1 times
[2023-11-03 13:15:03,815 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:15:03,816 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585405875]
[2023-11-03 13:15:03,816 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:15:03,816 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:15:03,831 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:15:03,854 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2023-11-03 13:15:03,855 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:15:03,855 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585405875]
[2023-11-03 13:15:03,855 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585405875] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:15:03,855 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:15:03,855 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-03 13:15:03,855 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24142532]
[2023-11-03 13:15:03,856 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:15:03,856 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 13:15:03,856 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:15:03,857 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 13:15:03,857 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 13:15:03,904 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 177 out of 341
[2023-11-03 13:15:03,905 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 68 transitions, 324 flow. Second operand  has 3 states, 3 states have (on average 180.0) internal successors, (540), 3 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:15:03,905 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:15:03,905 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 341
[2023-11-03 13:15:03,905 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:15:07,727 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([894] L1017-3-->L1017-4: Formula: (= |v_threadThread3of3ForFork0_#t~nondet5_3| |v_#race~data~0_4|)  InVars {threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][86], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 113#L1017-4true, 235#true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), Black: 232#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 57#L1033-2true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread3of3ForFork0InUse, 15#threadEXITtrue, 22#$Ultimate##0true, Black: 216#(= |#race~data~0| 0), 230#true])
[2023-11-03 13:15:07,727 INFO  L383   tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event
[2023-11-03 13:15:07,727 INFO  L386   tUnfolder$Statistics]:   existing Event has 30 ancestors and is cut-off event
[2023-11-03 13:15:07,727 INFO  L386   tUnfolder$Statistics]:   existing Event has 30 ancestors and is cut-off event
[2023-11-03 13:15:07,727 INFO  L386   tUnfolder$Statistics]:   existing Event has 30 ancestors and is cut-off event
[2023-11-03 13:15:08,346 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([894] L1017-3-->L1017-4: Formula: (= |v_threadThread3of3ForFork0_#t~nondet5_3| |v_#race~data~0_4|)  InVars {threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][86], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 113#L1017-4true, 235#true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 29#L1016-1true, Black: 232#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 57#L1033-2true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread3of3ForFork0InUse, 15#threadEXITtrue, Black: 216#(= |#race~data~0| 0), 230#true])
[2023-11-03 13:15:08,346 INFO  L383   tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event
[2023-11-03 13:15:08,346 INFO  L386   tUnfolder$Statistics]:   existing Event has 31 ancestors and is cut-off event
[2023-11-03 13:15:08,346 INFO  L386   tUnfolder$Statistics]:   existing Event has 31 ancestors and is cut-off event
[2023-11-03 13:15:08,346 INFO  L386   tUnfolder$Statistics]:   existing Event has 31 ancestors and is cut-off event
[2023-11-03 13:15:08,372 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([894] L1017-3-->L1017-4: Formula: (= |v_threadThread3of3ForFork0_#t~nondet5_3| |v_#race~data~0_4|)  InVars {threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][86], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 113#L1017-4true, 8#$Ultimate##0true, 235#true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 164#threadEXITtrue, Black: 232#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 57#L1033-2true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread3of3ForFork0InUse, Black: 216#(= |#race~data~0| 0), 230#true])
[2023-11-03 13:15:08,373 INFO  L383   tUnfolder$Statistics]: this new event has 30 ancestors and is not cut-off event
[2023-11-03 13:15:08,373 INFO  L386   tUnfolder$Statistics]:   existing Event has 30 ancestors and is not cut-off event
[2023-11-03 13:15:08,373 INFO  L386   tUnfolder$Statistics]:   existing Event has 30 ancestors and is not cut-off event
[2023-11-03 13:15:08,373 INFO  L386   tUnfolder$Statistics]:   existing Event has 30 ancestors and is not cut-off event
[2023-11-03 13:15:08,879 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1013] L1017-2-->L1017-4: Formula: (= |v_#race~data~0_41| |v_threadThread2of3ForFork0_#t~nondet5_15|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet5=|v_threadThread2of3ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_41|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet5, #race~data~0][69], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), Black: 232#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread1of3ForFork0InUse, 237#(= |threadThread2of3ForFork0_#t~nondet5| |#race~data~0|), threadThread2of3ForFork0InUse, 211#true, 57#L1033-2true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread3of3ForFork0InUse, 15#threadEXITtrue, 181#L1017-3true, Black: 216#(= |#race~data~0| 0), 230#true, 23#L1017-4true])
[2023-11-03 13:15:08,879 INFO  L383   tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event
[2023-11-03 13:15:08,879 INFO  L386   tUnfolder$Statistics]:   existing Event has 32 ancestors and is cut-off event
[2023-11-03 13:15:08,879 INFO  L386   tUnfolder$Statistics]:   existing Event has 32 ancestors and is cut-off event
[2023-11-03 13:15:08,879 INFO  L386   tUnfolder$Statistics]:   existing Event has 32 ancestors and is cut-off event
[2023-11-03 13:15:08,880 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([894] L1017-3-->L1017-4: Formula: (= |v_threadThread3of3ForFork0_#t~nondet5_3| |v_#race~data~0_4|)  InVars {threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][86], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 113#L1017-4true, 235#true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), Black: 232#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 57#L1033-2true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread3of3ForFork0InUse, 15#threadEXITtrue, Black: 216#(= |#race~data~0| 0), 230#true, 144#L1017-2true])
[2023-11-03 13:15:08,880 INFO  L383   tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event
[2023-11-03 13:15:08,880 INFO  L386   tUnfolder$Statistics]:   existing Event has 32 ancestors and is cut-off event
[2023-11-03 13:15:08,880 INFO  L386   tUnfolder$Statistics]:   existing Event has 32 ancestors and is cut-off event
[2023-11-03 13:15:08,880 INFO  L386   tUnfolder$Statistics]:   existing Event has 32 ancestors and is cut-off event
[2023-11-03 13:15:08,973 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([894] L1017-3-->L1017-4: Formula: (= |v_threadThread3of3ForFork0_#t~nondet5_3| |v_#race~data~0_4|)  InVars {threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][86], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 113#L1017-4true, 235#true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 164#threadEXITtrue, Black: 232#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 57#L1033-2true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread3of3ForFork0InUse, 40#L1016-1true, Black: 216#(= |#race~data~0| 0), 230#true])
[2023-11-03 13:15:08,973 INFO  L383   tUnfolder$Statistics]: this new event has 31 ancestors and is not cut-off event
[2023-11-03 13:15:08,973 INFO  L386   tUnfolder$Statistics]:   existing Event has 31 ancestors and is not cut-off event
[2023-11-03 13:15:08,973 INFO  L386   tUnfolder$Statistics]:   existing Event has 31 ancestors and is not cut-off event
[2023-11-03 13:15:08,973 INFO  L386   tUnfolder$Statistics]:   existing Event has 31 ancestors and is not cut-off event
[2023-11-03 13:15:09,298 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([894] L1017-3-->L1017-4: Formula: (= |v_threadThread3of3ForFork0_#t~nondet5_3| |v_#race~data~0_4|)  InVars {threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][86], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 113#L1017-4true, 235#true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), Black: 232#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), 134#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 151#L1018true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 57#L1033-2true, threadThread3of3ForFork0InUse, 98#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 216#(= |#race~data~0| 0), 230#true])
[2023-11-03 13:15:09,298 INFO  L383   tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event
[2023-11-03 13:15:09,298 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2023-11-03 13:15:09,298 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2023-11-03 13:15:09,298 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2023-11-03 13:15:09,377 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1013] L1017-2-->L1017-4: Formula: (= |v_#race~data~0_41| |v_threadThread2of3ForFork0_#t~nondet5_15|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet5=|v_threadThread2of3ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_41|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet5, #race~data~0][69], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 113#L1017-4true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), Black: 232#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread1of3ForFork0InUse, 237#(= |threadThread2of3ForFork0_#t~nondet5| |#race~data~0|), threadThread2of3ForFork0InUse, 211#true, 57#L1033-2true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread3of3ForFork0InUse, 15#threadEXITtrue, Black: 216#(= |#race~data~0| 0), 230#true, 23#L1017-4true])
[2023-11-03 13:15:09,378 INFO  L383   tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event
[2023-11-03 13:15:09,378 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2023-11-03 13:15:09,378 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2023-11-03 13:15:09,378 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2023-11-03 13:15:09,378 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1013] L1017-2-->L1017-4: Formula: (= |v_#race~data~0_41| |v_threadThread2of3ForFork0_#t~nondet5_15|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet5=|v_threadThread2of3ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_41|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet5, #race~data~0][69], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 37#L1018true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), Black: 232#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread1of3ForFork0InUse, 237#(= |threadThread2of3ForFork0_#t~nondet5| |#race~data~0|), threadThread2of3ForFork0InUse, 211#true, 57#L1033-2true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread3of3ForFork0InUse, 141#L1017-6true, Black: 216#(= |#race~data~0| 0), 230#true, 23#L1017-4true])
[2023-11-03 13:15:09,378 INFO  L383   tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event
[2023-11-03 13:15:09,378 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2023-11-03 13:15:09,378 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2023-11-03 13:15:09,378 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2023-11-03 13:15:09,385 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([965] L1017-2-->L1017-4: Formula: (= |v_#race~data~0_37| |v_threadThread1of3ForFork1_#t~nondet5_13|)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_37|, threadThread1of3ForFork1_#t~nondet5=|v_threadThread1of3ForFork1_#t~nondet5_13|}  AuxVars[]  AssignedVars[#race~data~0, threadThread1of3ForFork1_#t~nondet5][35], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 235#true, 164#threadEXITtrue, Black: 232#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), 153#L1017-4true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 57#L1033-2true, threadThread3of3ForFork0InUse, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 181#L1017-3true, Black: 216#(= |#race~data~0| 0), 230#true])
[2023-11-03 13:15:09,385 INFO  L383   tUnfolder$Statistics]: this new event has 32 ancestors and is not cut-off event
[2023-11-03 13:15:09,385 INFO  L386   tUnfolder$Statistics]:   existing Event has 32 ancestors and is not cut-off event
[2023-11-03 13:15:09,385 INFO  L386   tUnfolder$Statistics]:   existing Event has 32 ancestors and is not cut-off event
[2023-11-03 13:15:09,385 INFO  L386   tUnfolder$Statistics]:   existing Event has 32 ancestors and is not cut-off event
[2023-11-03 13:15:09,386 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([894] L1017-3-->L1017-4: Formula: (= |v_threadThread3of3ForFork0_#t~nondet5_3| |v_#race~data~0_4|)  InVars {threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][86], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 113#L1017-4true, 235#true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 164#threadEXITtrue, Black: 232#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 57#L1033-2true, threadThread3of3ForFork0InUse, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 12#L1017-2true, Black: 216#(= |#race~data~0| 0), 230#true])
[2023-11-03 13:15:09,386 INFO  L383   tUnfolder$Statistics]: this new event has 32 ancestors and is not cut-off event
[2023-11-03 13:15:09,386 INFO  L386   tUnfolder$Statistics]:   existing Event has 32 ancestors and is not cut-off event
[2023-11-03 13:15:09,386 INFO  L386   tUnfolder$Statistics]:   existing Event has 32 ancestors and is not cut-off event
[2023-11-03 13:15:09,386 INFO  L386   tUnfolder$Statistics]:   existing Event has 32 ancestors and is not cut-off event
[2023-11-03 13:15:09,387 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([894] L1017-3-->L1017-4: Formula: (= |v_threadThread3of3ForFork0_#t~nondet5_3| |v_#race~data~0_4|)  InVars {threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][86], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 113#L1017-4true, 235#true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), Black: 232#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 150#L1018true, 211#true, 57#L1033-2true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread3of3ForFork0InUse, 98#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 216#(= |#race~data~0| 0), 230#true])
[2023-11-03 13:15:09,387 INFO  L383   tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event
[2023-11-03 13:15:09,387 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2023-11-03 13:15:09,387 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2023-11-03 13:15:09,387 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2023-11-03 13:15:09,407 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1013] L1017-2-->L1017-4: Formula: (= |v_#race~data~0_41| |v_threadThread2of3ForFork0_#t~nondet5_15|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet5=|v_threadThread2of3ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_41|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet5, #race~data~0][69], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), Black: 232#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread1of3ForFork0InUse, 237#(= |threadThread2of3ForFork0_#t~nondet5| |#race~data~0|), threadThread2of3ForFork0InUse, 211#true, 57#L1033-2true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread3of3ForFork0InUse, 15#threadEXITtrue, 141#L1017-6true, Black: 216#(= |#race~data~0| 0), 230#true, 23#L1017-4true])
[2023-11-03 13:15:09,408 INFO  L383   tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event
[2023-11-03 13:15:09,408 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-11-03 13:15:09,408 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-11-03 13:15:09,408 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-11-03 13:15:09,410 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1013] L1017-2-->L1017-4: Formula: (= |v_#race~data~0_41| |v_threadThread2of3ForFork0_#t~nondet5_15|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet5=|v_threadThread2of3ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_41|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet5, #race~data~0][69], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 37#L1018true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), Black: 232#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread1of3ForFork0InUse, 237#(= |threadThread2of3ForFork0_#t~nondet5| |#race~data~0|), threadThread2of3ForFork0InUse, 211#true, 5#threadEXITtrue, 57#L1033-2true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread3of3ForFork0InUse, Black: 216#(= |#race~data~0| 0), 230#true, 23#L1017-4true])
[2023-11-03 13:15:09,410 INFO  L383   tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event
[2023-11-03 13:15:09,410 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-11-03 13:15:09,410 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-11-03 13:15:09,410 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-11-03 13:15:09,677 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([894] L1017-3-->L1017-4: Formula: (= |v_threadThread3of3ForFork0_#t~nondet5_3| |v_#race~data~0_4|)  InVars {threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][86], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 113#L1017-4true, 235#true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 134#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 232#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread1of3ForFork0InUse, 54#threadEXITtrue, threadThread2of3ForFork0InUse, 211#true, 57#L1033-2true, threadThread3of3ForFork0InUse, 98#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 216#(= |#race~data~0| 0), 230#true])
[2023-11-03 13:15:09,677 INFO  L383   tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event
[2023-11-03 13:15:09,677 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-11-03 13:15:09,677 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-11-03 13:15:09,677 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-11-03 13:15:09,775 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([894] L1017-3-->L1017-4: Formula: (= |v_threadThread3of3ForFork0_#t~nondet5_3| |v_#race~data~0_4|)  InVars {threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][86], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 113#L1017-4true, 235#true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 164#threadEXITtrue, Black: 232#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), 151#L1018true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 57#L1033-2true, threadThread3of3ForFork0InUse, 98#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 216#(= |#race~data~0| 0), 230#true])
[2023-11-03 13:15:09,775 INFO  L383   tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event
[2023-11-03 13:15:09,775 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-11-03 13:15:09,775 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-11-03 13:15:09,775 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-11-03 13:15:09,832 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([894] L1017-3-->L1017-4: Formula: (= |v_threadThread3of3ForFork0_#t~nondet5_3| |v_#race~data~0_4|)  InVars {threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][86], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 113#L1017-4true, 235#true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), Black: 232#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread1of3ForFork0InUse, 150#L1018true, threadThread2of3ForFork0InUse, 211#true, 57#L1033-2true, threadThread3of3ForFork0InUse, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 15#threadEXITtrue, Black: 216#(= |#race~data~0| 0), 230#true])
[2023-11-03 13:15:09,832 INFO  L383   tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event
[2023-11-03 13:15:09,832 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-11-03 13:15:09,832 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-11-03 13:15:09,832 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-11-03 13:15:09,832 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([894] L1017-3-->L1017-4: Formula: (= |v_threadThread3of3ForFork0_#t~nondet5_3| |v_#race~data~0_4|)  InVars {threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][86], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 113#L1017-4true, 235#true, 37#L1018true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 164#threadEXITtrue, Black: 232#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 57#L1033-2true, threadThread3of3ForFork0InUse, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 216#(= |#race~data~0| 0), 230#true])
[2023-11-03 13:15:09,832 INFO  L383   tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event
[2023-11-03 13:15:09,832 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-11-03 13:15:09,833 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-11-03 13:15:09,833 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-11-03 13:15:09,835 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([965] L1017-2-->L1017-4: Formula: (= |v_#race~data~0_37| |v_threadThread1of3ForFork1_#t~nondet5_13|)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_37|, threadThread1of3ForFork1_#t~nondet5=|v_threadThread1of3ForFork1_#t~nondet5_13|}  AuxVars[]  AssignedVars[#race~data~0, threadThread1of3ForFork1_#t~nondet5][35], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 235#true, 164#threadEXITtrue, Black: 232#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), 153#L1017-4true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 57#L1033-2true, threadThread3of3ForFork0InUse, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 141#L1017-6true, Black: 216#(= |#race~data~0| 0), 230#true])
[2023-11-03 13:15:09,835 INFO  L383   tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event
[2023-11-03 13:15:09,835 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-11-03 13:15:09,835 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-11-03 13:15:09,836 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-11-03 13:15:09,851 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1013] L1017-2-->L1017-4: Formula: (= |v_#race~data~0_41| |v_threadThread2of3ForFork0_#t~nondet5_15|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet5=|v_threadThread2of3ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_41|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet5, #race~data~0][21], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 111#ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACEtrue, 37#L1018true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), Black: 232#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread1of3ForFork0InUse, 237#(= |threadThread2of3ForFork0_#t~nondet5| |#race~data~0|), threadThread2of3ForFork0InUse, 211#true, threadThread3of3ForFork0InUse, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 141#L1017-6true, Black: 216#(= |#race~data~0| 0), 230#true, 23#L1017-4true])
[2023-11-03 13:15:09,851 INFO  L383   tUnfolder$Statistics]: this new event has 33 ancestors and is not cut-off event
[2023-11-03 13:15:09,851 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is not cut-off event
[2023-11-03 13:15:09,851 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is not cut-off event
[2023-11-03 13:15:09,851 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is not cut-off event
[2023-11-03 13:15:09,858 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([894] L1017-3-->L1017-4: Formula: (= |v_threadThread3of3ForFork0_#t~nondet5_3| |v_#race~data~0_4|)  InVars {threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][86], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 113#L1017-4true, 235#true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 164#threadEXITtrue, Black: 232#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 57#L1033-2true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread3of3ForFork0InUse, 98#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 216#(= |#race~data~0| 0), 230#true])
[2023-11-03 13:15:09,859 INFO  L383   tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event
[2023-11-03 13:15:09,859 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-11-03 13:15:09,859 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-11-03 13:15:09,859 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-11-03 13:15:09,873 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1013] L1017-2-->L1017-4: Formula: (= |v_#race~data~0_41| |v_threadThread2of3ForFork0_#t~nondet5_15|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet5=|v_threadThread2of3ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_41|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet5, #race~data~0][69], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), Black: 232#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread1of3ForFork0InUse, 237#(= |threadThread2of3ForFork0_#t~nondet5| |#race~data~0|), threadThread2of3ForFork0InUse, 211#true, 5#threadEXITtrue, 57#L1033-2true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread3of3ForFork0InUse, 15#threadEXITtrue, Black: 216#(= |#race~data~0| 0), 230#true, 23#L1017-4true])
[2023-11-03 13:15:09,873 INFO  L383   tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event
[2023-11-03 13:15:09,873 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is cut-off event
[2023-11-03 13:15:09,873 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is cut-off event
[2023-11-03 13:15:09,873 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is cut-off event
[2023-11-03 13:15:10,069 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([894] L1017-3-->L1017-4: Formula: (= |v_threadThread3of3ForFork0_#t~nondet5_3| |v_#race~data~0_4|)  InVars {threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][86], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 113#L1017-4true, 235#true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 164#threadEXITtrue, Black: 232#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread1of3ForFork0InUse, 54#threadEXITtrue, threadThread2of3ForFork0InUse, 211#true, 57#L1033-2true, threadThread3of3ForFork0InUse, 98#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 216#(= |#race~data~0| 0), 230#true])
[2023-11-03 13:15:10,069 INFO  L383   tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event
[2023-11-03 13:15:10,069 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is cut-off event
[2023-11-03 13:15:10,069 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is cut-off event
[2023-11-03 13:15:10,069 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is cut-off event
[2023-11-03 13:15:10,306 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([894] L1017-3-->L1017-4: Formula: (= |v_threadThread3of3ForFork0_#t~nondet5_3| |v_#race~data~0_4|)  InVars {threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][86], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 113#L1017-4true, 235#true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 164#threadEXITtrue, Black: 232#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 57#L1033-2true, threadThread3of3ForFork0InUse, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 15#threadEXITtrue, Black: 216#(= |#race~data~0| 0), 230#true])
[2023-11-03 13:15:10,306 INFO  L383   tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event
[2023-11-03 13:15:10,306 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is cut-off event
[2023-11-03 13:15:10,306 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is cut-off event
[2023-11-03 13:15:10,306 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is cut-off event
[2023-11-03 13:15:10,310 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([965] L1017-2-->L1017-4: Formula: (= |v_#race~data~0_37| |v_threadThread1of3ForFork1_#t~nondet5_13|)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_37|, threadThread1of3ForFork1_#t~nondet5=|v_threadThread1of3ForFork1_#t~nondet5_13|}  AuxVars[]  AssignedVars[#race~data~0, threadThread1of3ForFork1_#t~nondet5][35], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 235#true, 164#threadEXITtrue, Black: 232#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), 153#L1017-4true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 5#threadEXITtrue, 57#L1033-2true, threadThread3of3ForFork0InUse, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), Black: 216#(= |#race~data~0| 0), 230#true])
[2023-11-03 13:15:10,310 INFO  L383   tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event
[2023-11-03 13:15:10,310 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is cut-off event
[2023-11-03 13:15:10,310 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is cut-off event
[2023-11-03 13:15:10,310 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is cut-off event
[2023-11-03 13:15:10,320 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1013] L1017-2-->L1017-4: Formula: (= |v_#race~data~0_41| |v_threadThread2of3ForFork0_#t~nondet5_15|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet5=|v_threadThread2of3ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_41|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet5, #race~data~0][21], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 111#ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACEtrue, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), Black: 232#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread1of3ForFork0InUse, 237#(= |threadThread2of3ForFork0_#t~nondet5| |#race~data~0|), threadThread2of3ForFork0InUse, 211#true, threadThread3of3ForFork0InUse, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 15#threadEXITtrue, 141#L1017-6true, Black: 216#(= |#race~data~0| 0), 230#true, 23#L1017-4true])
[2023-11-03 13:15:10,320 INFO  L383   tUnfolder$Statistics]: this new event has 34 ancestors and is not cut-off event
[2023-11-03 13:15:10,320 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is not cut-off event
[2023-11-03 13:15:10,320 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is not cut-off event
[2023-11-03 13:15:10,321 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is not cut-off event
[2023-11-03 13:15:10,321 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1013] L1017-2-->L1017-4: Formula: (= |v_#race~data~0_41| |v_threadThread2of3ForFork0_#t~nondet5_15|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet5=|v_threadThread2of3ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_41|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet5, #race~data~0][21], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 111#ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACEtrue, 37#L1018true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), Black: 232#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread1of3ForFork0InUse, 237#(= |threadThread2of3ForFork0_#t~nondet5| |#race~data~0|), threadThread2of3ForFork0InUse, 211#true, 5#threadEXITtrue, threadThread3of3ForFork0InUse, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 216#(= |#race~data~0| 0), 230#true, 23#L1017-4true])
[2023-11-03 13:15:10,322 INFO  L383   tUnfolder$Statistics]: this new event has 34 ancestors and is not cut-off event
[2023-11-03 13:15:10,322 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is not cut-off event
[2023-11-03 13:15:10,322 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is not cut-off event
[2023-11-03 13:15:10,322 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is not cut-off event
[2023-11-03 13:15:10,326 INFO  L381   tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([894] L1017-3-->L1017-4: Formula: (= |v_threadThread3of3ForFork0_#t~nondet5_3| |v_#race~data~0_4|)  InVars {threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][86], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 113#L1017-4true, 235#true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 164#threadEXITtrue, Black: 232#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 57#L1033-2true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread3of3ForFork0InUse, 98#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 216#(= |#race~data~0| 0), 230#true])
[2023-11-03 13:15:10,327 INFO  L383   tUnfolder$Statistics]: this new event has 34 ancestors and is not cut-off event
[2023-11-03 13:15:10,327 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is not cut-off event
[2023-11-03 13:15:10,327 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is not cut-off event
[2023-11-03 13:15:10,327 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is not cut-off event
[2023-11-03 13:15:10,327 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is not cut-off event
[2023-11-03 13:15:10,625 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1013] L1017-2-->L1017-4: Formula: (= |v_#race~data~0_41| |v_threadThread2of3ForFork0_#t~nondet5_15|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet5=|v_threadThread2of3ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_41|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet5, #race~data~0][21], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 111#ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACEtrue, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), Black: 232#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread1of3ForFork0InUse, 237#(= |threadThread2of3ForFork0_#t~nondet5| |#race~data~0|), threadThread2of3ForFork0InUse, 211#true, 5#threadEXITtrue, threadThread3of3ForFork0InUse, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 15#threadEXITtrue, Black: 216#(= |#race~data~0| 0), 230#true, 23#L1017-4true])
[2023-11-03 13:15:10,625 INFO  L383   tUnfolder$Statistics]: this new event has 35 ancestors and is not cut-off event
[2023-11-03 13:15:10,625 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is not cut-off event
[2023-11-03 13:15:10,625 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is not cut-off event
[2023-11-03 13:15:10,626 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is not cut-off event
[2023-11-03 13:15:11,461 INFO  L130       PetriNetUnfolder]: 96416/139811 cut-off events.
[2023-11-03 13:15:11,461 INFO  L131       PetriNetUnfolder]: For 136186/141225 co-relation queries the response was YES.
[2023-11-03 13:15:11,772 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 374460 conditions, 139811 events. 96416/139811 cut-off events. For 136186/141225 co-relation queries the response was YES. Maximal size of possible extension queue 4318. Compared 1054381 event pairs, 63536 based on Foata normal form. 91/130314 useless extension candidates. Maximal degree in co-relation 374449. Up to 118364 conditions per place. 
[2023-11-03 13:15:12,373 INFO  L137   encePairwiseOnDemand]: 334/341 looper letters, 77 selfloop transitions, 14 changer transitions 0/100 dead transitions.
[2023-11-03 13:15:12,373 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 100 transitions, 635 flow
[2023-11-03 13:15:12,374 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 13:15:12,374 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 13:15:12,375 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 599 transitions.
[2023-11-03 13:15:12,375 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5855327468230694
[2023-11-03 13:15:12,375 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 599 transitions.
[2023-11-03 13:15:12,375 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 599 transitions.
[2023-11-03 13:15:12,376 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:15:12,376 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 599 transitions.
[2023-11-03 13:15:12,377 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 199.66666666666666) internal successors, (599), 3 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:15:12,378 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:15:12,378 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:15:12,378 INFO  L175             Difference]: Start difference. First operand has 60 places, 68 transitions, 324 flow. Second operand 3 states and 599 transitions.
[2023-11-03 13:15:12,378 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 100 transitions, 635 flow
[2023-11-03 13:15:12,399 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 100 transitions, 633 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-11-03 13:15:12,400 INFO  L231             Difference]: Finished difference. Result has 62 places, 76 transitions, 440 flow
[2023-11-03 13:15:12,400 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=440, PETRI_PLACES=62, PETRI_TRANSITIONS=76}
[2023-11-03 13:15:12,401 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 5 predicate places.
[2023-11-03 13:15:12,401 INFO  L495      AbstractCegarLoop]: Abstraction has has 62 places, 76 transitions, 440 flow
[2023-11-03 13:15:12,401 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 180.0) internal successors, (540), 3 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:15:12,401 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:15:12,401 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:15:12,402 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2023-11-03 13:15:12,402 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-11-03 13:15:12,402 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:15:12,402 INFO  L85        PathProgramCache]: Analyzing trace with hash 1578593416, now seen corresponding path program 1 times
[2023-11-03 13:15:12,402 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:15:12,402 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960845678]
[2023-11-03 13:15:12,402 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:15:12,402 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:15:12,415 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:15:12,475 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:15:12,475 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:15:12,475 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960845678]
[2023-11-03 13:15:12,475 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960845678] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-03 13:15:12,475 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1361214960]
[2023-11-03 13:15:12,475 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:15:12,475 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 13:15:12,476 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 13:15:12,477 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-03 13:15:12,480 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2023-11-03 13:15:12,582 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:15:12,584 INFO  L263         TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 4 conjunts are in the unsatisfiable core
[2023-11-03 13:15:12,587 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 13:15:12,655 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:15:12,655 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-03 13:15:12,694 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:15:12,694 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1361214960] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-03 13:15:12,694 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-03 13:15:12,694 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8
[2023-11-03 13:15:12,694 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656442960]
[2023-11-03 13:15:12,694 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-03 13:15:12,695 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2023-11-03 13:15:12,695 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:15:12,695 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2023-11-03 13:15:12,695 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2023-11-03 13:15:12,822 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 178 out of 341
[2023-11-03 13:15:12,823 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 76 transitions, 440 flow. Second operand  has 9 states, 9 states have (on average 180.0) internal successors, (1620), 9 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:15:12,823 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:15:12,823 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 341
[2023-11-03 13:15:12,823 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:15:17,430 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1082] L1029-6-->L1033-1: Formula: (and (= |v_#valid_189| (store |v_#valid_190| (select (select |v_#memory_$Pointer$.base_202| |v_ULTIMATE.start_main_~#tids~0#1.base_380|) |v_ULTIMATE.start_main_~#tids~0#1.offset_366|) 0)) (= |v_#race~data~0_51| 0) (= (store |v_#race_651| |v_ULTIMATE.start_main_~#tids~0#1.base_380| (store (store (store (store (select |v_#race_651| |v_ULTIMATE.start_main_~#tids~0#1.base_380|) |v_ULTIMATE.start_main_~#tids~0#1.offset_366| 0) (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_366| 1) 0) (+ 2 |v_ULTIMATE.start_main_~#tids~0#1.offset_366|) 0) (+ 3 |v_ULTIMATE.start_main_~#tids~0#1.offset_366|) 0)) |v_#race_649|) (not (< |v_ULTIMATE.start_main_~i~1#1_178| |v_ULTIMATE.start_main_~threads_total~0#1_193|)))  InVars {#race=|v_#race_651|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_366|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_178|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_202|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_380|, #valid=|v_#valid_190|, ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_193|}  OutVars{#race=|v_#race_649|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_366|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_178|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_202|, #race~data~0=|v_#race~data~0_51|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_380|, #valid=|v_#valid_189|, ULTIMATE.start_main_#t~mem18#1.base=|v_ULTIMATE.start_main_#t~mem18#1.base_97|, ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_193|, ULTIMATE.start_main_#t~mem18#1.offset=|v_ULTIMATE.start_main_#t~mem18#1.offset_81|}  AuxVars[]  AssignedVars[#race, #race~data~0, #valid, ULTIMATE.start_main_#t~mem18#1.base, ULTIMATE.start_main_#t~mem18#1.offset][78], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 322#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), 235#true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), Black: 232#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread1of3ForFork0InUse, threadThread2of3ForFork0NotInUse, Black: 237#(= |threadThread2of3ForFork0_#t~nondet5| |#race~data~0|), 211#true, threadThread3of3ForFork0InUse, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 141#L1017-6true, Black: 214#true, 98#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 129#L1033-1true])
[2023-11-03 13:15:17,431 INFO  L383   tUnfolder$Statistics]: this new event has 38 ancestors and is not cut-off event
[2023-11-03 13:15:17,431 INFO  L386   tUnfolder$Statistics]:   existing Event has 38 ancestors and is not cut-off event
[2023-11-03 13:15:17,431 INFO  L386   tUnfolder$Statistics]:   existing Event has 38 ancestors and is not cut-off event
[2023-11-03 13:15:17,431 INFO  L386   tUnfolder$Statistics]:   existing Event has 38 ancestors and is not cut-off event
[2023-11-03 13:15:17,432 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1082] L1029-6-->L1033-1: Formula: (and (= |v_#valid_189| (store |v_#valid_190| (select (select |v_#memory_$Pointer$.base_202| |v_ULTIMATE.start_main_~#tids~0#1.base_380|) |v_ULTIMATE.start_main_~#tids~0#1.offset_366|) 0)) (= |v_#race~data~0_51| 0) (= (store |v_#race_651| |v_ULTIMATE.start_main_~#tids~0#1.base_380| (store (store (store (store (select |v_#race_651| |v_ULTIMATE.start_main_~#tids~0#1.base_380|) |v_ULTIMATE.start_main_~#tids~0#1.offset_366| 0) (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_366| 1) 0) (+ 2 |v_ULTIMATE.start_main_~#tids~0#1.offset_366|) 0) (+ 3 |v_ULTIMATE.start_main_~#tids~0#1.offset_366|) 0)) |v_#race_649|) (not (< |v_ULTIMATE.start_main_~i~1#1_178| |v_ULTIMATE.start_main_~threads_total~0#1_193|)))  InVars {#race=|v_#race_651|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_366|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_178|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_202|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_380|, #valid=|v_#valid_190|, ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_193|}  OutVars{#race=|v_#race_649|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_366|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_178|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_202|, #race~data~0=|v_#race~data~0_51|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_380|, #valid=|v_#valid_189|, ULTIMATE.start_main_#t~mem18#1.base=|v_ULTIMATE.start_main_#t~mem18#1.base_97|, ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_193|, ULTIMATE.start_main_#t~mem18#1.offset=|v_ULTIMATE.start_main_#t~mem18#1.offset_81|}  AuxVars[]  AssignedVars[#race, #race~data~0, #valid, ULTIMATE.start_main_#t~mem18#1.base, ULTIMATE.start_main_#t~mem18#1.offset][78], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 322#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), 235#true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), Black: 232#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 150#L1018true, Black: 237#(= |threadThread2of3ForFork0_#t~nondet5| |#race~data~0|), 211#true, threadThread3of3ForFork0NotInUse, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 214#true, 98#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 129#L1033-1true])
[2023-11-03 13:15:17,433 INFO  L383   tUnfolder$Statistics]: this new event has 38 ancestors and is not cut-off event
[2023-11-03 13:15:17,433 INFO  L386   tUnfolder$Statistics]:   existing Event has 38 ancestors and is not cut-off event
[2023-11-03 13:15:17,433 INFO  L386   tUnfolder$Statistics]:   existing Event has 38 ancestors and is not cut-off event
[2023-11-03 13:15:17,433 INFO  L386   tUnfolder$Statistics]:   existing Event has 38 ancestors and is not cut-off event
[2023-11-03 13:15:17,570 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1082] L1029-6-->L1033-1: Formula: (and (= |v_#valid_189| (store |v_#valid_190| (select (select |v_#memory_$Pointer$.base_202| |v_ULTIMATE.start_main_~#tids~0#1.base_380|) |v_ULTIMATE.start_main_~#tids~0#1.offset_366|) 0)) (= |v_#race~data~0_51| 0) (= (store |v_#race_651| |v_ULTIMATE.start_main_~#tids~0#1.base_380| (store (store (store (store (select |v_#race_651| |v_ULTIMATE.start_main_~#tids~0#1.base_380|) |v_ULTIMATE.start_main_~#tids~0#1.offset_366| 0) (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_366| 1) 0) (+ 2 |v_ULTIMATE.start_main_~#tids~0#1.offset_366|) 0) (+ 3 |v_ULTIMATE.start_main_~#tids~0#1.offset_366|) 0)) |v_#race_649|) (not (< |v_ULTIMATE.start_main_~i~1#1_178| |v_ULTIMATE.start_main_~threads_total~0#1_193|)))  InVars {#race=|v_#race_651|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_366|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_178|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_202|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_380|, #valid=|v_#valid_190|, ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_193|}  OutVars{#race=|v_#race_649|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_366|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_178|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_202|, #race~data~0=|v_#race~data~0_51|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_380|, #valid=|v_#valid_189|, ULTIMATE.start_main_#t~mem18#1.base=|v_ULTIMATE.start_main_#t~mem18#1.base_97|, ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_193|, ULTIMATE.start_main_#t~mem18#1.offset=|v_ULTIMATE.start_main_#t~mem18#1.offset_81|}  AuxVars[]  AssignedVars[#race, #race~data~0, #valid, ULTIMATE.start_main_#t~mem18#1.base, ULTIMATE.start_main_#t~mem18#1.offset][78], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 322#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), 235#true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), Black: 232#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread1of3ForFork0InUse, threadThread2of3ForFork0NotInUse, Black: 237#(= |threadThread2of3ForFork0_#t~nondet5| |#race~data~0|), 211#true, 5#threadEXITtrue, threadThread3of3ForFork0InUse, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 214#true, 98#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 129#L1033-1true])
[2023-11-03 13:15:17,571 INFO  L383   tUnfolder$Statistics]: this new event has 39 ancestors and is not cut-off event
[2023-11-03 13:15:17,571 INFO  L386   tUnfolder$Statistics]:   existing Event has 39 ancestors and is not cut-off event
[2023-11-03 13:15:17,571 INFO  L386   tUnfolder$Statistics]:   existing Event has 39 ancestors and is not cut-off event
[2023-11-03 13:15:17,571 INFO  L386   tUnfolder$Statistics]:   existing Event has 39 ancestors and is not cut-off event
[2023-11-03 13:15:17,572 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1082] L1029-6-->L1033-1: Formula: (and (= |v_#valid_189| (store |v_#valid_190| (select (select |v_#memory_$Pointer$.base_202| |v_ULTIMATE.start_main_~#tids~0#1.base_380|) |v_ULTIMATE.start_main_~#tids~0#1.offset_366|) 0)) (= |v_#race~data~0_51| 0) (= (store |v_#race_651| |v_ULTIMATE.start_main_~#tids~0#1.base_380| (store (store (store (store (select |v_#race_651| |v_ULTIMATE.start_main_~#tids~0#1.base_380|) |v_ULTIMATE.start_main_~#tids~0#1.offset_366| 0) (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_366| 1) 0) (+ 2 |v_ULTIMATE.start_main_~#tids~0#1.offset_366|) 0) (+ 3 |v_ULTIMATE.start_main_~#tids~0#1.offset_366|) 0)) |v_#race_649|) (not (< |v_ULTIMATE.start_main_~i~1#1_178| |v_ULTIMATE.start_main_~threads_total~0#1_193|)))  InVars {#race=|v_#race_651|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_366|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_178|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_202|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_380|, #valid=|v_#valid_190|, ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_193|}  OutVars{#race=|v_#race_649|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_366|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_178|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_202|, #race~data~0=|v_#race~data~0_51|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_380|, #valid=|v_#valid_189|, ULTIMATE.start_main_#t~mem18#1.base=|v_ULTIMATE.start_main_#t~mem18#1.base_97|, ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_193|, ULTIMATE.start_main_#t~mem18#1.offset=|v_ULTIMATE.start_main_#t~mem18#1.offset_81|}  AuxVars[]  AssignedVars[#race, #race~data~0, #valid, ULTIMATE.start_main_#t~mem18#1.base, ULTIMATE.start_main_#t~mem18#1.offset][78], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 322#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), 235#true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 164#threadEXITtrue, Black: 232#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 237#(= |threadThread2of3ForFork0_#t~nondet5| |#race~data~0|), 211#true, threadThread3of3ForFork0NotInUse, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 98#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 214#true, 129#L1033-1true])
[2023-11-03 13:15:17,573 INFO  L383   tUnfolder$Statistics]: this new event has 39 ancestors and is not cut-off event
[2023-11-03 13:15:17,573 INFO  L386   tUnfolder$Statistics]:   existing Event has 39 ancestors and is not cut-off event
[2023-11-03 13:15:17,573 INFO  L386   tUnfolder$Statistics]:   existing Event has 39 ancestors and is not cut-off event
[2023-11-03 13:15:17,573 INFO  L386   tUnfolder$Statistics]:   existing Event has 39 ancestors and is not cut-off event
[2023-11-03 13:15:17,772 INFO  L130       PetriNetUnfolder]: 49021/75386 cut-off events.
[2023-11-03 13:15:17,772 INFO  L131       PetriNetUnfolder]: For 122862/137052 co-relation queries the response was YES.
[2023-11-03 13:15:17,944 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 206178 conditions, 75386 events. 49021/75386 cut-off events. For 122862/137052 co-relation queries the response was YES. Maximal size of possible extension queue 2377. Compared 594295 event pairs, 13664 based on Foata normal form. 5116/77323 useless extension candidates. Maximal degree in co-relation 206166. Up to 36030 conditions per place. 
[2023-11-03 13:15:18,200 INFO  L137   encePairwiseOnDemand]: 335/341 looper letters, 107 selfloop transitions, 6 changer transitions 0/137 dead transitions.
[2023-11-03 13:15:18,200 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 137 transitions, 922 flow
[2023-11-03 13:15:18,201 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-03 13:15:18,201 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-03 13:15:18,203 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1152 transitions.
[2023-11-03 13:15:18,203 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5630498533724341
[2023-11-03 13:15:18,203 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 1152 transitions.
[2023-11-03 13:15:18,203 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 1152 transitions.
[2023-11-03 13:15:18,204 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:15:18,204 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1152 transitions.
[2023-11-03 13:15:18,206 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 192.0) internal successors, (1152), 6 states have internal predecessors, (1152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:15:18,208 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 341.0) internal successors, (2387), 7 states have internal predecessors, (2387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:15:18,209 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 341.0) internal successors, (2387), 7 states have internal predecessors, (2387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:15:18,209 INFO  L175             Difference]: Start difference. First operand has 62 places, 76 transitions, 440 flow. Second operand 6 states and 1152 transitions.
[2023-11-03 13:15:18,209 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 137 transitions, 922 flow
[2023-11-03 13:15:18,441 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 137 transitions, 898 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-11-03 13:15:18,443 INFO  L231             Difference]: Finished difference. Result has 68 places, 78 transitions, 459 flow
[2023-11-03 13:15:18,443 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=426, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=459, PETRI_PLACES=68, PETRI_TRANSITIONS=78}
[2023-11-03 13:15:18,444 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 11 predicate places.
[2023-11-03 13:15:18,444 INFO  L495      AbstractCegarLoop]: Abstraction has has 68 places, 78 transitions, 459 flow
[2023-11-03 13:15:18,444 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 180.0) internal successors, (1620), 9 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:15:18,444 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:15:18,445 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:15:18,454 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2023-11-03 13:15:18,645 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14
[2023-11-03 13:15:18,646 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-11-03 13:15:18,646 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:15:18,647 INFO  L85        PathProgramCache]: Analyzing trace with hash -1560409466, now seen corresponding path program 1 times
[2023-11-03 13:15:18,647 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:15:18,647 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224343749]
[2023-11-03 13:15:18,647 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:15:18,647 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:15:18,664 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:15:18,709 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:15:18,709 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:15:18,709 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224343749]
[2023-11-03 13:15:18,709 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224343749] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:15:18,709 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:15:18,710 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-03 13:15:18,710 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65212029]
[2023-11-03 13:15:18,710 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:15:18,710 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 13:15:18,710 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:15:18,711 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 13:15:18,711 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 13:15:18,739 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 175 out of 341
[2023-11-03 13:15:18,740 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 78 transitions, 459 flow. Second operand  has 3 states, 3 states have (on average 178.66666666666666) internal successors, (536), 3 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:15:18,740 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:15:18,740 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 341
[2023-11-03 13:15:18,740 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:15:19,509 INFO  L130       PetriNetUnfolder]: 3495/8052 cut-off events.
[2023-11-03 13:15:19,510 INFO  L131       PetriNetUnfolder]: For 11212/11487 co-relation queries the response was YES.
[2023-11-03 13:15:19,523 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23942 conditions, 8052 events. 3495/8052 cut-off events. For 11212/11487 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 69355 event pairs, 705 based on Foata normal form. 2474/10261 useless extension candidates. Maximal degree in co-relation 23928. Up to 5445 conditions per place. 
[2023-11-03 13:15:19,535 INFO  L137   encePairwiseOnDemand]: 333/341 looper letters, 56 selfloop transitions, 8 changer transitions 0/78 dead transitions.
[2023-11-03 13:15:19,535 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 78 transitions, 525 flow
[2023-11-03 13:15:19,536 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 13:15:19,536 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 13:15:19,537 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 579 transitions.
[2023-11-03 13:15:19,537 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5659824046920822
[2023-11-03 13:15:19,537 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 579 transitions.
[2023-11-03 13:15:19,537 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 579 transitions.
[2023-11-03 13:15:19,537 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:15:19,537 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 579 transitions.
[2023-11-03 13:15:19,538 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 193.0) internal successors, (579), 3 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:15:19,540 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:15:19,540 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:15:19,540 INFO  L175             Difference]: Start difference. First operand has 68 places, 78 transitions, 459 flow. Second operand 3 states and 579 transitions.
[2023-11-03 13:15:19,540 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 78 transitions, 525 flow
[2023-11-03 13:15:19,544 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 78 transitions, 515 flow, removed 3 selfloop flow, removed 2 redundant places.
[2023-11-03 13:15:19,545 INFO  L231             Difference]: Finished difference. Result has 68 places, 60 transitions, 310 flow
[2023-11-03 13:15:19,546 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=310, PETRI_PLACES=68, PETRI_TRANSITIONS=60}
[2023-11-03 13:15:19,546 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 11 predicate places.
[2023-11-03 13:15:19,546 INFO  L495      AbstractCegarLoop]: Abstraction has has 68 places, 60 transitions, 310 flow
[2023-11-03 13:15:19,546 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 178.66666666666666) internal successors, (536), 3 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:15:19,546 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:15:19,547 INFO  L209   CegarLoopForPetriNet]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1]
[2023-11-03 13:15:19,547 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2023-11-03 13:15:19,547 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-11-03 13:15:19,547 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:15:19,547 INFO  L85        PathProgramCache]: Analyzing trace with hash 38143271, now seen corresponding path program 1 times
[2023-11-03 13:15:19,547 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:15:19,547 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018985237]
[2023-11-03 13:15:19,547 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:15:19,547 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:15:19,566 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-03 13:15:19,567 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-11-03 13:15:19,576 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-03 13:15:19,581 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-11-03 13:15:19,581 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-11-03 13:15:19,581 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 15 remaining)
[2023-11-03 13:15:19,581 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining)
[2023-11-03 13:15:19,581 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining)
[2023-11-03 13:15:19,581 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining)
[2023-11-03 13:15:19,582 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining)
[2023-11-03 13:15:19,582 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining)
[2023-11-03 13:15:19,582 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (8 of 15 remaining)
[2023-11-03 13:15:19,582 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 15 remaining)
[2023-11-03 13:15:19,582 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining)
[2023-11-03 13:15:19,582 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining)
[2023-11-03 13:15:19,582 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 15 remaining)
[2023-11-03 13:15:19,582 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 15 remaining)
[2023-11-03 13:15:19,582 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining)
[2023-11-03 13:15:19,582 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining)
[2023-11-03 13:15:19,582 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining)
[2023-11-03 13:15:19,582 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2023-11-03 13:15:19,582 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:15:19,583 WARN  L233   ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-11-03 13:15:19,583 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances.
[2023-11-03 13:15:19,612 INFO  L144    ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions.
[2023-11-03 13:15:19,614 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 242 places, 235 transitions, 558 flow
[2023-11-03 13:15:19,773 INFO  L130       PetriNetUnfolder]: 91/1682 cut-off events.
[2023-11-03 13:15:19,773 INFO  L131       PetriNetUnfolder]: For 96/96 co-relation queries the response was YES.
[2023-11-03 13:15:19,779 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1799 conditions, 1682 events. 91/1682 cut-off events. For 96/96 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 8919 event pairs, 23 based on Foata normal form. 0/1460 useless extension candidates. Maximal degree in co-relation 1790. Up to 80 conditions per place. 
[2023-11-03 13:15:19,779 INFO  L82        GeneralOperation]: Start removeDead. Operand has 242 places, 235 transitions, 558 flow
[2023-11-03 13:15:19,783 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 190 places, 186 transitions, 422 flow
[2023-11-03 13:15:19,783 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-11-03 13:15:19,783 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 190 places, 186 transitions, 422 flow
[2023-11-03 13:15:19,783 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 190 places, 186 transitions, 422 flow
[2023-11-03 13:15:19,784 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 190 places, 186 transitions, 422 flow
[2023-11-03 13:15:19,925 INFO  L130       PetriNetUnfolder]: 91/1682 cut-off events.
[2023-11-03 13:15:19,926 INFO  L131       PetriNetUnfolder]: For 96/96 co-relation queries the response was YES.
[2023-11-03 13:15:19,930 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1796 conditions, 1682 events. 91/1682 cut-off events. For 96/96 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 8951 event pairs, 23 based on Foata normal form. 0/1460 useless extension candidates. Maximal degree in co-relation 979. Up to 80 conditions per place. 
[2023-11-03 13:15:19,950 INFO  L119        LiptonReduction]: Number of co-enabled transitions 14280
[2023-11-03 13:15:25,249 INFO  L134        LiptonReduction]: Checked pairs total: 33335
[2023-11-03 13:15:25,249 INFO  L136        LiptonReduction]: Total number of compositions: 145
[2023-11-03 13:15:25,251 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-03 13:15:25,252 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=LoopsAndPotentialCycles, 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;@4f3470bf, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-11-03 13:15:25,252 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 17 error locations.
[2023-11-03 13:15:25,253 INFO  L130       PetriNetUnfolder]: 0/2 cut-off events.
[2023-11-03 13:15:25,253 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-11-03 13:15:25,253 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:15:25,253 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1]
[2023-11-03 13:15:25,254 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] ===
[2023-11-03 13:15:25,254 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:15:25,254 INFO  L85        PathProgramCache]: Analyzing trace with hash 48699, now seen corresponding path program 1 times
[2023-11-03 13:15:25,255 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:15:25,255 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358850392]
[2023-11-03 13:15:25,255 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:15:25,255 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:15:25,260 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:15:25,263 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:15:25,263 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:15:25,263 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358850392]
[2023-11-03 13:15:25,263 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358850392] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:15:25,263 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:15:25,264 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2023-11-03 13:15:25,264 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002594611]
[2023-11-03 13:15:25,264 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:15:25,264 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-11-03 13:15:25,264 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:15:25,264 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-11-03 13:15:25,264 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-11-03 13:15:25,265 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 216 out of 380
[2023-11-03 13:15:25,265 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 59 transitions, 168 flow. Second operand  has 2 states, 2 states have (on average 217.0) internal successors, (434), 2 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:15:25,265 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:15:25,265 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 380
[2023-11-03 13:15:25,265 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:15:38,130 INFO  L130       PetriNetUnfolder]: 165209/231430 cut-off events.
[2023-11-03 13:15:38,130 INFO  L131       PetriNetUnfolder]: For 17698/17698 co-relation queries the response was YES.
[2023-11-03 13:15:38,560 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 456607 conditions, 231430 events. 165209/231430 cut-off events. For 17698/17698 co-relation queries the response was YES. Maximal size of possible extension queue 5561. Compared 1754395 event pairs, 163655 based on Foata normal form. 0/218136 useless extension candidates. Maximal degree in co-relation 65195. Up to 214973 conditions per place. 
[2023-11-03 13:15:39,504 INFO  L137   encePairwiseOnDemand]: 375/380 looper letters, 40 selfloop transitions, 0 changer transitions 0/54 dead transitions.
[2023-11-03 13:15:39,505 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 54 transitions, 238 flow
[2023-11-03 13:15:39,505 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-11-03 13:15:39,505 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-11-03 13:15:39,506 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 477 transitions.
[2023-11-03 13:15:39,506 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6276315789473684
[2023-11-03 13:15:39,506 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 477 transitions.
[2023-11-03 13:15:39,507 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 477 transitions.
[2023-11-03 13:15:39,507 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:15:39,507 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 477 transitions.
[2023-11-03 13:15:39,508 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 238.5) internal successors, (477), 2 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)
[2023-11-03 13:15:39,509 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 380.0) internal successors, (1140), 3 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:15:39,509 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 380.0) internal successors, (1140), 3 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:15:39,509 INFO  L175             Difference]: Start difference. First operand has 66 places, 59 transitions, 168 flow. Second operand 2 states and 477 transitions.
[2023-11-03 13:15:39,509 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 54 transitions, 238 flow
[2023-11-03 13:15:39,536 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 54 transitions, 234 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-03 13:15:39,536 INFO  L231             Difference]: Finished difference. Result has 60 places, 54 transitions, 154 flow
[2023-11-03 13:15:39,537 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=380, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=154, PETRI_PLACES=60, PETRI_TRANSITIONS=54}
[2023-11-03 13:15:39,537 INFO  L288   CegarLoopForPetriNet]: 66 programPoint places, -6 predicate places.
[2023-11-03 13:15:39,537 INFO  L495      AbstractCegarLoop]: Abstraction has has 60 places, 54 transitions, 154 flow
[2023-11-03 13:15:39,537 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 217.0) internal successors, (434), 2 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:15:39,537 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:15:39,537 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2023-11-03 13:15:39,538 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2023-11-03 13:15:39,538 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] ===
[2023-11-03 13:15:39,538 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:15:39,538 INFO  L85        PathProgramCache]: Analyzing trace with hash 2065214140, now seen corresponding path program 1 times
[2023-11-03 13:15:39,538 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:15:39,538 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380600692]
[2023-11-03 13:15:39,538 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:15:39,538 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:15:39,547 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:15:39,560 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:15:39,560 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:15:39,560 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380600692]
[2023-11-03 13:15:39,560 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380600692] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:15:39,561 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:15:39,561 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-03 13:15:39,561 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633434145]
[2023-11-03 13:15:39,561 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:15:39,561 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 13:15:39,561 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:15:39,562 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 13:15:39,562 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 13:15:39,608 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 205 out of 380
[2023-11-03 13:15:39,609 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 54 transitions, 154 flow. Second operand  has 3 states, 3 states have (on average 207.0) internal successors, (621), 3 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:15:39,609 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:15:39,609 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 380
[2023-11-03 13:15:39,609 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:16:14,492 INFO  L130       PetriNetUnfolder]: 499650/670505 cut-off events.
[2023-11-03 13:16:14,492 INFO  L131       PetriNetUnfolder]: For 21005/21005 co-relation queries the response was YES.
[2023-11-03 13:16:15,595 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1329073 conditions, 670505 events. 499650/670505 cut-off events. For 21005/21005 co-relation queries the response was YES. Maximal size of possible extension queue 11950. Compared 4874862 event pairs, 317175 based on Foata normal form. 0/640827 useless extension candidates. Maximal degree in co-relation 1329066. Up to 469939 conditions per place. 
[2023-11-03 13:16:18,663 INFO  L137   encePairwiseOnDemand]: 372/380 looper letters, 64 selfloop transitions, 7 changer transitions 0/80 dead transitions.
[2023-11-03 13:16:18,663 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 80 transitions, 348 flow
[2023-11-03 13:16:18,664 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 13:16:18,664 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 13:16:18,665 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 687 transitions.
[2023-11-03 13:16:18,665 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6026315789473684
[2023-11-03 13:16:18,665 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 687 transitions.
[2023-11-03 13:16:18,665 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 687 transitions.
[2023-11-03 13:16:18,666 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:16:18,666 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 687 transitions.
[2023-11-03 13:16:18,667 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 229.0) internal successors, (687), 3 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)
[2023-11-03 13:16:18,668 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 380.0) internal successors, (1520), 4 states have internal predecessors, (1520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:16:18,669 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 380.0) internal successors, (1520), 4 states have internal predecessors, (1520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:16:18,669 INFO  L175             Difference]: Start difference. First operand has 60 places, 54 transitions, 154 flow. Second operand 3 states and 687 transitions.
[2023-11-03 13:16:18,669 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 80 transitions, 348 flow
[2023-11-03 13:16:18,685 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 80 transitions, 348 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 13:16:18,686 INFO  L231             Difference]: Finished difference. Result has 64 places, 60 transitions, 208 flow
[2023-11-03 13:16:18,686 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=380, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=208, PETRI_PLACES=64, PETRI_TRANSITIONS=60}
[2023-11-03 13:16:18,687 INFO  L288   CegarLoopForPetriNet]: 66 programPoint places, -2 predicate places.
[2023-11-03 13:16:18,687 INFO  L495      AbstractCegarLoop]: Abstraction has has 64 places, 60 transitions, 208 flow
[2023-11-03 13:16:18,687 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 207.0) internal successors, (621), 3 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:16:18,687 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:16:18,687 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:16:18,688 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2023-11-03 13:16:18,688 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] ===
[2023-11-03 13:16:18,688 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:16:18,688 INFO  L85        PathProgramCache]: Analyzing trace with hash -403804841, now seen corresponding path program 1 times
[2023-11-03 13:16:18,688 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:16:18,688 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565099020]
[2023-11-03 13:16:18,688 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:16:18,688 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:16:18,696 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:16:18,708 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:16:18,708 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:16:18,708 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565099020]
[2023-11-03 13:16:18,708 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565099020] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:16:18,708 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:16:18,708 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-03 13:16:18,708 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435647515]
[2023-11-03 13:16:18,708 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:16:18,709 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 13:16:18,709 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:16:18,709 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 13:16:18,709 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 13:16:18,748 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 203 out of 380
[2023-11-03 13:16:18,749 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 60 transitions, 208 flow. Second operand  has 3 states, 3 states have (on average 205.33333333333334) internal successors, (616), 3 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:16:18,749 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:16:18,749 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 380
[2023-11-03 13:16:18,749 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:17:03,946 INFO  L130       PetriNetUnfolder]: 550253/747755 cut-off events.
[2023-11-03 13:17:03,946 INFO  L131       PetriNetUnfolder]: For 229974/230313 co-relation queries the response was YES.
[2023-11-03 13:17:05,588 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1703218 conditions, 747755 events. 550253/747755 cut-off events. For 229974/230313 co-relation queries the response was YES. Maximal size of possible extension queue 15814. Compared 5762184 event pairs, 426206 based on Foata normal form. 36/714507 useless extension candidates. Maximal degree in co-relation 1703209. Up to 642609 conditions per place. 
[2023-11-03 13:17:09,108 INFO  L137   encePairwiseOnDemand]: 372/380 looper letters, 70 selfloop transitions, 12 changer transitions 0/93 dead transitions.
[2023-11-03 13:17:09,108 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 93 transitions, 478 flow
[2023-11-03 13:17:09,109 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 13:17:09,113 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 13:17:09,115 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 683 transitions.
[2023-11-03 13:17:09,116 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5991228070175438
[2023-11-03 13:17:09,116 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 683 transitions.
[2023-11-03 13:17:09,116 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 683 transitions.
[2023-11-03 13:17:09,117 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:17:09,117 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 683 transitions.
[2023-11-03 13:17:09,119 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 227.66666666666666) internal successors, (683), 3 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:17:09,122 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 380.0) internal successors, (1520), 4 states have internal predecessors, (1520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:17:09,123 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 380.0) internal successors, (1520), 4 states have internal predecessors, (1520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:17:09,123 INFO  L175             Difference]: Start difference. First operand has 64 places, 60 transitions, 208 flow. Second operand 3 states and 683 transitions.
[2023-11-03 13:17:09,123 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 93 transitions, 478 flow
[2023-11-03 13:19:33,978 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 93 transitions, 454 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-03 13:19:33,979 INFO  L231             Difference]: Finished difference. Result has 65 places, 70 transitions, 290 flow
[2023-11-03 13:19:33,979 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=380, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=290, PETRI_PLACES=65, PETRI_TRANSITIONS=70}
[2023-11-03 13:19:33,980 INFO  L288   CegarLoopForPetriNet]: 66 programPoint places, -1 predicate places.
[2023-11-03 13:19:33,980 INFO  L495      AbstractCegarLoop]: Abstraction has has 65 places, 70 transitions, 290 flow
[2023-11-03 13:19:33,980 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 205.33333333333334) internal successors, (616), 3 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:19:33,980 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:19:33,981 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:19:33,981 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2023-11-03 13:19:33,981 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] ===
[2023-11-03 13:19:33,981 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:19:33,981 INFO  L85        PathProgramCache]: Analyzing trace with hash -351848311, now seen corresponding path program 1 times
[2023-11-03 13:19:33,981 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:19:33,982 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114225733]
[2023-11-03 13:19:33,982 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:19:33,982 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:19:33,992 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:19:34,006 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:19:34,006 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:19:34,006 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114225733]
[2023-11-03 13:19:34,006 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114225733] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:19:34,006 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:19:34,006 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-03 13:19:34,007 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061813739]
[2023-11-03 13:19:34,007 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:19:34,007 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 13:19:34,007 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:19:34,007 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 13:19:34,008 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 13:19:34,056 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 203 out of 380
[2023-11-03 13:19:34,056 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 70 transitions, 290 flow. Second operand  has 3 states, 3 states have (on average 205.33333333333334) internal successors, (616), 3 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:19:34,056 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:19:34,056 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 380
[2023-11-03 13:19:34,056 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:20:05,301 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1379] L1017-2-->L1017-4: Formula: (= |v_#race~data~0_57| |v_threadThread4of4ForFork0_#t~nondet5_15|)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_57|, threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_15|}  AuxVars[]  AssignedVars[#race~data~0, threadThread4of4ForFork0_#t~nondet5][81], [9#$Ultimate##0true, Black: 256#(= |#race~data~0| |threadThread1of4ForFork1_#t~nondet5|), threadThread1of4ForFork0InUse, threadThread2of4ForFork0InUse, 86#L1017-4true, threadThread3of4ForFork0InUse, 259#true, threadThread4of4ForFork0InUse, 254#true, 174#threadEXITtrue, 119#ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACEtrue, 4#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 245#true, Black: 250#(= |#race~data~0| 0), 163#L1018true])
[2023-11-03 13:20:05,302 INFO  L383   tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event
[2023-11-03 13:20:05,302 INFO  L386   tUnfolder$Statistics]:   existing Event has 38 ancestors and is cut-off event
[2023-11-03 13:20:05,302 INFO  L386   tUnfolder$Statistics]:   existing Event has 38 ancestors and is cut-off event
[2023-11-03 13:20:05,302 INFO  L386   tUnfolder$Statistics]:   existing Event has 38 ancestors and is cut-off event
[2023-11-03 13:20:09,044 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1379] L1017-2-->L1017-4: Formula: (= |v_#race~data~0_57| |v_threadThread4of4ForFork0_#t~nondet5_15|)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_57|, threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_15|}  AuxVars[]  AssignedVars[#race~data~0, threadThread4of4ForFork0_#t~nondet5][81], [Black: 256#(= |#race~data~0| |threadThread1of4ForFork1_#t~nondet5|), threadThread1of4ForFork0InUse, threadThread2of4ForFork0InUse, 86#L1017-4true, threadThread3of4ForFork0InUse, 259#true, 254#true, threadThread4of4ForFork0InUse, 174#threadEXITtrue, 119#ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACEtrue, 4#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 181#L1017-1true, 245#true, Black: 250#(= |#race~data~0| 0), 163#L1018true])
[2023-11-03 13:20:09,044 INFO  L383   tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event
[2023-11-03 13:20:09,044 INFO  L386   tUnfolder$Statistics]:   existing Event has 39 ancestors and is cut-off event
[2023-11-03 13:20:09,044 INFO  L386   tUnfolder$Statistics]:   existing Event has 39 ancestors and is cut-off event
[2023-11-03 13:20:09,044 INFO  L386   tUnfolder$Statistics]:   existing Event has 39 ancestors and is cut-off event
[2023-11-03 13:20:09,045 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1379] L1017-2-->L1017-4: Formula: (= |v_#race~data~0_57| |v_threadThread4of4ForFork0_#t~nondet5_15|)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_57|, threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_15|}  AuxVars[]  AssignedVars[#race~data~0, threadThread4of4ForFork0_#t~nondet5][81], [9#$Ultimate##0true, Black: 256#(= |#race~data~0| |threadThread1of4ForFork1_#t~nondet5|), threadThread1of4ForFork0InUse, 77#threadEXITtrue, threadThread2of4ForFork0InUse, 86#L1017-4true, threadThread3of4ForFork0InUse, 259#true, threadThread4of4ForFork0InUse, 254#true, 174#threadEXITtrue, 119#ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACEtrue, 4#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 245#true, Black: 250#(= |#race~data~0| 0)])
[2023-11-03 13:20:09,045 INFO  L383   tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event
[2023-11-03 13:20:09,045 INFO  L386   tUnfolder$Statistics]:   existing Event has 39 ancestors and is cut-off event
[2023-11-03 13:20:09,045 INFO  L386   tUnfolder$Statistics]:   existing Event has 39 ancestors and is cut-off event
[2023-11-03 13:20:09,045 INFO  L386   tUnfolder$Statistics]:   existing Event has 39 ancestors and is cut-off event
[2023-11-03 13:20:12,412 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1373] L1017-2-->L1017-4: Formula: (= |v_#race~data~0_55| |v_threadThread3of4ForFork0_#t~nondet5_15|)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_55|, threadThread3of4ForFork0_#t~nondet5=|v_threadThread3of4ForFork0_#t~nondet5_15|}  AuxVars[]  AssignedVars[#race~data~0, threadThread3of4ForFork0_#t~nondet5][62], [60#L1017-2true, Black: 256#(= |#race~data~0| |threadThread1of4ForFork1_#t~nondet5|), threadThread1of4ForFork0InUse, threadThread2of4ForFork0InUse, threadThread3of4ForFork0InUse, 259#true, 254#true, threadThread4of4ForFork0InUse, 174#threadEXITtrue, 119#ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACEtrue, 4#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 96#L1017-4true, 245#true, Black: 250#(= |#race~data~0| 0), 163#L1018true])
[2023-11-03 13:20:12,412 INFO  L383   tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event
[2023-11-03 13:20:12,412 INFO  L386   tUnfolder$Statistics]:   existing Event has 40 ancestors and is cut-off event
[2023-11-03 13:20:12,412 INFO  L386   tUnfolder$Statistics]:   existing Event has 40 ancestors and is cut-off event
[2023-11-03 13:20:12,412 INFO  L386   tUnfolder$Statistics]:   existing Event has 40 ancestors and is cut-off event
[2023-11-03 13:20:12,508 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1379] L1017-2-->L1017-4: Formula: (= |v_#race~data~0_57| |v_threadThread4of4ForFork0_#t~nondet5_15|)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_57|, threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_15|}  AuxVars[]  AssignedVars[#race~data~0, threadThread4of4ForFork0_#t~nondet5][81], [Black: 256#(= |#race~data~0| |threadThread1of4ForFork1_#t~nondet5|), threadThread1of4ForFork0InUse, 77#threadEXITtrue, threadThread2of4ForFork0InUse, 86#L1017-4true, threadThread3of4ForFork0InUse, 259#true, 254#true, threadThread4of4ForFork0InUse, 174#threadEXITtrue, 119#ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACEtrue, 4#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 181#L1017-1true, 245#true, Black: 250#(= |#race~data~0| 0)])
[2023-11-03 13:20:12,508 INFO  L383   tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event
[2023-11-03 13:20:12,508 INFO  L386   tUnfolder$Statistics]:   existing Event has 40 ancestors and is cut-off event
[2023-11-03 13:20:12,508 INFO  L386   tUnfolder$Statistics]:   existing Event has 40 ancestors and is cut-off event
[2023-11-03 13:20:12,508 INFO  L386   tUnfolder$Statistics]:   existing Event has 40 ancestors and is cut-off event
[2023-11-03 13:20:15,696 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1373] L1017-2-->L1017-4: Formula: (= |v_#race~data~0_55| |v_threadThread3of4ForFork0_#t~nondet5_15|)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_55|, threadThread3of4ForFork0_#t~nondet5=|v_threadThread3of4ForFork0_#t~nondet5_15|}  AuxVars[]  AssignedVars[#race~data~0, threadThread3of4ForFork0_#t~nondet5][62], [60#L1017-2true, Black: 256#(= |#race~data~0| |threadThread1of4ForFork1_#t~nondet5|), threadThread1of4ForFork0InUse, 77#threadEXITtrue, threadThread2of4ForFork0InUse, threadThread3of4ForFork0InUse, 259#true, 254#true, threadThread4of4ForFork0InUse, 174#threadEXITtrue, 119#ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACEtrue, 4#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 96#L1017-4true, 245#true, Black: 250#(= |#race~data~0| 0)])
[2023-11-03 13:20:15,696 INFO  L383   tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event
[2023-11-03 13:20:15,696 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2023-11-03 13:20:15,696 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2023-11-03 13:20:15,696 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2023-11-03 13:20:30,952 INFO  L130       PetriNetUnfolder]: 667199/907688 cut-off events.
[2023-11-03 13:20:30,952 INFO  L131       PetriNetUnfolder]: For 557493/572316 co-relation queries the response was YES.
[2023-11-03 13:20:32,997 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2261468 conditions, 907688 events. 667199/907688 cut-off events. For 557493/572316 co-relation queries the response was YES. Maximal size of possible extension queue 20659. Compared 7202022 event pairs, 484404 based on Foata normal form. 117/850893 useless extension candidates. Maximal degree in co-relation 2261458. Up to 778951 conditions per place. 
[2023-11-03 13:20:37,789 INFO  L137   encePairwiseOnDemand]: 372/380 looper letters, 85 selfloop transitions, 14 changer transitions 0/110 dead transitions.
[2023-11-03 13:20:37,789 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 110 transitions, 640 flow
[2023-11-03 13:20:37,790 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 13:20:37,790 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 13:20:37,791 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 690 transitions.
[2023-11-03 13:20:37,792 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6052631578947368
[2023-11-03 13:20:37,792 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 690 transitions.
[2023-11-03 13:20:37,792 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 690 transitions.
[2023-11-03 13:20:37,792 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:20:37,792 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 690 transitions.
[2023-11-03 13:20:37,794 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 230.0) internal successors, (690), 3 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:20:37,796 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 380.0) internal successors, (1520), 4 states have internal predecessors, (1520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:20:37,796 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 380.0) internal successors, (1520), 4 states have internal predecessors, (1520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:20:37,796 INFO  L175             Difference]: Start difference. First operand has 65 places, 70 transitions, 290 flow. Second operand 3 states and 690 transitions.
[2023-11-03 13:20:37,796 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 110 transitions, 640 flow
Killed by 15
