./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-counter-outer-race-4.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-counter-outer-race-4.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 5c4d9327c15cdd6f8cbe544af68182476337b21d5bfe21353a45ea7b3e2e4c4c
--- Real Ultimate output ---
This is Ultimate 0.2.2-dev-2329fc7
[2023-11-03 13:52:43,217 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2023-11-03 13:52:43,219 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2023-11-03 13:52:43,240 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2023-11-03 13:52:43,240 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2023-11-03 13:52:43,241 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2023-11-03 13:52:43,242 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2023-11-03 13:52:43,243 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2023-11-03 13:52:43,244 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2023-11-03 13:52:43,245 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2023-11-03 13:52:43,245 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2023-11-03 13:52:43,246 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2023-11-03 13:52:43,246 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2023-11-03 13:52:43,247 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2023-11-03 13:52:43,248 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2023-11-03 13:52:43,249 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2023-11-03 13:52:43,249 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2023-11-03 13:52:43,250 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2023-11-03 13:52:43,251 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2023-11-03 13:52:43,252 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2023-11-03 13:52:43,254 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2023-11-03 13:52:43,255 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2023-11-03 13:52:43,256 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2023-11-03 13:52:43,256 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2023-11-03 13:52:43,259 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2023-11-03 13:52:43,259 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2023-11-03 13:52:43,259 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2023-11-03 13:52:43,260 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2023-11-03 13:52:43,260 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2023-11-03 13:52:43,261 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2023-11-03 13:52:43,261 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2023-11-03 13:52:43,262 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2023-11-03 13:52:43,262 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2023-11-03 13:52:43,263 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2023-11-03 13:52:43,263 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2023-11-03 13:52:43,263 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2023-11-03 13:52:43,264 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2023-11-03 13:52:43,264 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2023-11-03 13:52:43,264 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2023-11-03 13:52:43,265 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2023-11-03 13:52:43,265 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2023-11-03 13:52:43,266 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:52:43,281 INFO  L113        SettingsManager]: Loading preferences was successful
[2023-11-03 13:52:43,282 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2023-11-03 13:52:43,282 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-11-03 13:52:43,282 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-11-03 13:52:43,282 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-11-03 13:52:43,283 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-11-03 13:52:43,283 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-11-03 13:52:43,283 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2023-11-03 13:52:43,283 INFO  L138        SettingsManager]:  * Use SBE=true
[2023-11-03 13:52:43,284 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-11-03 13:52:43,284 INFO  L138        SettingsManager]:  * sizeof long=4
[2023-11-03 13:52:43,284 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2023-11-03 13:52:43,284 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2023-11-03 13:52:43,284 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2023-11-03 13:52:43,284 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2023-11-03 13:52:43,284 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2023-11-03 13:52:43,284 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-11-03 13:52:43,284 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2023-11-03 13:52:43,284 INFO  L138        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2023-11-03 13:52:43,285 INFO  L138        SettingsManager]:  * sizeof long double=12
[2023-11-03 13:52:43,285 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2023-11-03 13:52:43,285 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2023-11-03 13:52:43,285 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2023-11-03 13:52:43,285 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-11-03 13:52:43,285 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2023-11-03 13:52:43,285 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2023-11-03 13:52:43,285 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-03 13:52:43,286 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-11-03 13:52:43,286 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2023-11-03 13:52:43,286 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2023-11-03 13:52:43,286 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2023-11-03 13:52:43,286 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-11-03 13:52:43,286 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2023-11-03 13:52:43,286 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-11-03 13:52:43,286 INFO  L138        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2023-11-03 13:52:43,287 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2023-11-03 13:52:43,287 INFO  L138        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2023-11-03 13:52:43,287 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 -> 5c4d9327c15cdd6f8cbe544af68182476337b21d5bfe21353a45ea7b3e2e4c4c
[2023-11-03 13:52:43,496 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2023-11-03 13:52:43,514 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-11-03 13:52:43,516 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-11-03 13:52:43,517 INFO  L271        PluginConnector]: Initializing CDTParser...
[2023-11-03 13:52:43,517 INFO  L275        PluginConnector]: CDTParser initialized
[2023-11-03 13:52:43,518 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/thread-join-counter-outer-race-4.i
[2023-11-03 13:52:44,490 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2023-11-03 13:52:44,716 INFO  L351              CDTParser]: Found 1 translation units.
[2023-11-03 13:52:44,716 INFO  L172              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/thread-join-counter-outer-race-4.i
[2023-11-03 13:52:44,727 INFO  L394              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/8f2debd1d/18165cafcb54480495ab9f18e905f67f/FLAG1f39c6542
[2023-11-03 13:52:45,088 INFO  L402              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/8f2debd1d/18165cafcb54480495ab9f18e905f67f
[2023-11-03 13:52:45,091 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-11-03 13:52:45,093 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2023-11-03 13:52:45,095 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-11-03 13:52:45,095 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-11-03 13:52:45,100 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2023-11-03 13:52:45,101 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:52:45" (1/1) ...
[2023-11-03 13:52:45,102 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25eb1871 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:52:45, skipping insertion in model container
[2023-11-03 13:52:45,103 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:52:45" (1/1) ...
[2023-11-03 13:52:45,109 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2023-11-03 13:52:45,137 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2023-11-03 13:52:45,319 WARN  L623        FunctionHandler]: Unknown extern function pthread_detach
[2023-11-03 13:52:45,322 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-11-03 13:52:45,333 INFO  L203         MainTranslator]: Completed pre-run
[2023-11-03 13:52:45,363 WARN  L623        FunctionHandler]: Unknown extern function pthread_detach
[2023-11-03 13:52:45,365 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-11-03 13:52:45,391 INFO  L208         MainTranslator]: Completed translation
[2023-11-03 13:52:45,391 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:52:45 WrapperNode
[2023-11-03 13:52:45,391 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-11-03 13:52:45,392 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-11-03 13:52:45,392 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-11-03 13:52:45,392 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2023-11-03 13:52:45,397 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:52:45" (1/1) ...
[2023-11-03 13:52:45,408 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:52:45" (1/1) ...
[2023-11-03 13:52:45,423 INFO  L138                Inliner]: procedures = 159, calls = 37, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 95
[2023-11-03 13:52:45,424 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-11-03 13:52:45,424 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-11-03 13:52:45,424 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2023-11-03 13:52:45,425 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2023-11-03 13:52:45,431 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:52:45" (1/1) ...
[2023-11-03 13:52:45,432 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:52:45" (1/1) ...
[2023-11-03 13:52:45,434 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:52:45" (1/1) ...
[2023-11-03 13:52:45,435 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:52:45" (1/1) ...
[2023-11-03 13:52:45,439 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:52:45" (1/1) ...
[2023-11-03 13:52:45,441 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:52:45" (1/1) ...
[2023-11-03 13:52:45,443 INFO  L185        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:52:45" (1/1) ...
[2023-11-03 13:52:45,443 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:52:45" (1/1) ...
[2023-11-03 13:52:45,446 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-11-03 13:52:45,446 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-11-03 13:52:45,447 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2023-11-03 13:52:45,447 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2023-11-03 13:52:45,447 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:52:45" (1/1) ...
[2023-11-03 13:52:45,452 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-03 13:52:45,461 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 13:52:45,477 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:52:45,480 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:52:45,504 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2023-11-03 13:52:45,504 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2023-11-03 13:52:45,504 INFO  L130     BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock
[2023-11-03 13:52:45,504 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2023-11-03 13:52:45,504 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2023-11-03 13:52:45,505 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-11-03 13:52:45,505 INFO  L130     BoogieDeclarations]: Found specification of procedure pthread_detach
[2023-11-03 13:52:45,505 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2023-11-03 13:52:45,505 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2023-11-03 13:52:45,505 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2023-11-03 13:52:45,505 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-11-03 13:52:45,505 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-11-03 13:52:45,506 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:52:45,634 INFO  L235             CfgBuilder]: Building ICFG
[2023-11-03 13:52:45,636 INFO  L261             CfgBuilder]: Building CFG for each procedure with an implementation
[2023-11-03 13:52:45,850 INFO  L276             CfgBuilder]: Performing block encoding
[2023-11-03 13:52:45,856 INFO  L295             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-11-03 13:52:45,856 INFO  L300             CfgBuilder]: Removed 2 assume(true) statements.
[2023-11-03 13:52:45,858 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:52:45 BoogieIcfgContainer
[2023-11-03 13:52:45,858 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-11-03 13:52:45,860 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-11-03 13:52:45,860 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2023-11-03 13:52:45,862 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2023-11-03 13:52:45,862 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 01:52:45" (1/3) ...
[2023-11-03 13:52:45,863 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75914ecc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 01:52:45, skipping insertion in model container
[2023-11-03 13:52:45,863 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:52:45" (2/3) ...
[2023-11-03 13:52:45,863 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75914ecc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 01:52:45, skipping insertion in model container
[2023-11-03 13:52:45,863 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:52:45" (3/3) ...
[2023-11-03 13:52:45,864 INFO  L112   eAbstractionObserver]: Analyzing ICFG thread-join-counter-outer-race-4.i
[2023-11-03 13:52:45,870 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2023-11-03 13:52:45,878 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-11-03 13:52:45,878 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations.
[2023-11-03 13:52:45,878 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2023-11-03 13:52:45,918 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2023-11-03 13:52:45,946 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 133 places, 134 transitions, 273 flow
[2023-11-03 13:52:45,997 INFO  L130       PetriNetUnfolder]: 7/174 cut-off events.
[2023-11-03 13:52:45,997 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-11-03 13:52:46,001 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 179 conditions, 174 events. 7/174 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 210 event pairs, 0 based on Foata normal form. 0/153 useless extension candidates. Maximal degree in co-relation 88. Up to 4 conditions per place. 
[2023-11-03 13:52:46,002 INFO  L82        GeneralOperation]: Start removeDead. Operand has 133 places, 134 transitions, 273 flow
[2023-11-03 13:52:46,005 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 133 places, 134 transitions, 273 flow
[2023-11-03 13:52:46,008 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-11-03 13:52:46,015 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 134 transitions, 273 flow
[2023-11-03 13:52:46,018 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 134 transitions, 273 flow
[2023-11-03 13:52:46,018 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 133 places, 134 transitions, 273 flow
[2023-11-03 13:52:46,046 INFO  L130       PetriNetUnfolder]: 7/174 cut-off events.
[2023-11-03 13:52:46,046 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-11-03 13:52:46,047 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 179 conditions, 174 events. 7/174 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 210 event pairs, 0 based on Foata normal form. 0/153 useless extension candidates. Maximal degree in co-relation 88. Up to 4 conditions per place. 
[2023-11-03 13:52:46,049 INFO  L119        LiptonReduction]: Number of co-enabled transitions 3068
[2023-11-03 13:52:48,803 INFO  L134        LiptonReduction]: Checked pairs total: 11184
[2023-11-03 13:52:48,803 INFO  L136        LiptonReduction]: Total number of compositions: 98
[2023-11-03 13:52:48,816 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-03 13:52:48,821 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;@7b891cb7, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-11-03 13:52:48,822 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 12 error locations.
[2023-11-03 13:52:48,824 INFO  L130       PetriNetUnfolder]: 0/6 cut-off events.
[2023-11-03 13:52:48,825 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-11-03 13:52:48,825 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:52:48,826 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1]
[2023-11-03 13:52:48,826 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 9 more)] ===
[2023-11-03 13:52:48,830 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:52:48,831 INFO  L85        PathProgramCache]: Analyzing trace with hash 13631503, now seen corresponding path program 1 times
[2023-11-03 13:52:48,839 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:52:48,839 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159816267]
[2023-11-03 13:52:48,839 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:52:48,840 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:52:48,932 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:52:49,004 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:52:49,005 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:52:49,005 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159816267]
[2023-11-03 13:52:49,006 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159816267] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:52:49,006 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:52:49,007 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-03 13:52:49,008 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552385617]
[2023-11-03 13:52:49,009 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:52:49,017 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 13:52:49,017 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:52:49,032 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 13:52:49,034 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 13:52:49,063 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 119 out of 232
[2023-11-03 13:52:49,066 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 44 transitions, 93 flow. Second operand  has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 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:52:49,066 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:52:49,066 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 232
[2023-11-03 13:52:49,067 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:52:49,194 INFO  L130       PetriNetUnfolder]: 134/429 cut-off events.
[2023-11-03 13:52:49,194 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-11-03 13:52:49,195 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 743 conditions, 429 events. 134/429 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2288 event pairs, 50 based on Foata normal form. 0/387 useless extension candidates. Maximal degree in co-relation 689. Up to 159 conditions per place. 
[2023-11-03 13:52:49,198 INFO  L137   encePairwiseOnDemand]: 219/232 looper letters, 39 selfloop transitions, 8 changer transitions 0/63 dead transitions.
[2023-11-03 13:52:49,198 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 63 transitions, 225 flow
[2023-11-03 13:52:49,200 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 13:52:49,202 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 13:52:49,208 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 411 transitions.
[2023-11-03 13:52:49,210 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5905172413793104
[2023-11-03 13:52:49,211 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 411 transitions.
[2023-11-03 13:52:49,211 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 411 transitions.
[2023-11-03 13:52:49,213 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:52:49,214 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 411 transitions.
[2023-11-03 13:52:49,217 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 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:52:49,223 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 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:52:49,223 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 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:52:49,224 INFO  L175             Difference]: Start difference. First operand has 45 places, 44 transitions, 93 flow. Second operand 3 states and 411 transitions.
[2023-11-03 13:52:49,225 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 63 transitions, 225 flow
[2023-11-03 13:52:49,227 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 63 transitions, 225 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 13:52:49,229 INFO  L231             Difference]: Finished difference. Result has 48 places, 50 transitions, 159 flow
[2023-11-03 13:52:49,230 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=159, PETRI_PLACES=48, PETRI_TRANSITIONS=50}
[2023-11-03 13:52:49,233 INFO  L288   CegarLoopForPetriNet]: 45 programPoint places, 3 predicate places.
[2023-11-03 13:52:49,233 INFO  L495      AbstractCegarLoop]: Abstraction has has 48 places, 50 transitions, 159 flow
[2023-11-03 13:52:49,234 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 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:52:49,234 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:52:49,234 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:52:49,234 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-11-03 13:52:49,235 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 9 more)] ===
[2023-11-03 13:52:49,235 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:52:49,235 INFO  L85        PathProgramCache]: Analyzing trace with hash 750408184, now seen corresponding path program 1 times
[2023-11-03 13:52:49,235 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:52:49,236 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195806178]
[2023-11-03 13:52:49,236 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:52:49,236 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:52:49,252 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:52:49,286 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:52:49,286 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:52:49,286 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195806178]
[2023-11-03 13:52:49,286 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195806178] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:52:49,286 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:52:49,286 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-03 13:52:49,287 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000936771]
[2023-11-03 13:52:49,287 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:52:49,288 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 13:52:49,288 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:52:49,288 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 13:52:49,289 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 13:52:49,301 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 126 out of 232
[2023-11-03 13:52:49,302 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 50 transitions, 159 flow. Second operand  has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:52:49,302 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:52:49,302 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 232
[2023-11-03 13:52:49,303 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:52:49,398 INFO  L130       PetriNetUnfolder]: 121/425 cut-off events.
[2023-11-03 13:52:49,398 INFO  L131       PetriNetUnfolder]: For 122/125 co-relation queries the response was YES.
[2023-11-03 13:52:49,400 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 863 conditions, 425 events. 121/425 cut-off events. For 122/125 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2388 event pairs, 64 based on Foata normal form. 0/391 useless extension candidates. Maximal degree in co-relation 802. Up to 205 conditions per place. 
[2023-11-03 13:52:49,401 INFO  L137   encePairwiseOnDemand]: 228/232 looper letters, 28 selfloop transitions, 3 changer transitions 2/59 dead transitions.
[2023-11-03 13:52:49,401 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 59 transitions, 249 flow
[2023-11-03 13:52:49,402 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 13:52:49,402 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 13:52:49,403 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 409 transitions.
[2023-11-03 13:52:49,404 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5876436781609196
[2023-11-03 13:52:49,404 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 409 transitions.
[2023-11-03 13:52:49,404 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 409 transitions.
[2023-11-03 13:52:49,404 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:52:49,404 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 409 transitions.
[2023-11-03 13:52:49,406 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:52:49,407 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 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:52:49,408 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 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:52:49,408 INFO  L175             Difference]: Start difference. First operand has 48 places, 50 transitions, 159 flow. Second operand 3 states and 409 transitions.
[2023-11-03 13:52:49,408 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 59 transitions, 249 flow
[2023-11-03 13:52:49,410 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 59 transitions, 231 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-03 13:52:49,415 INFO  L231             Difference]: Finished difference. Result has 50 places, 52 transitions, 165 flow
[2023-11-03 13:52:49,415 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=165, PETRI_PLACES=50, PETRI_TRANSITIONS=52}
[2023-11-03 13:52:49,416 INFO  L288   CegarLoopForPetriNet]: 45 programPoint places, 5 predicate places.
[2023-11-03 13:52:49,416 INFO  L495      AbstractCegarLoop]: Abstraction has has 50 places, 52 transitions, 165 flow
[2023-11-03 13:52:49,416 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:52:49,416 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:52:49,416 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:52:49,417 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-11-03 13:52:49,417 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 9 more)] ===
[2023-11-03 13:52:49,418 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:52:49,418 INFO  L85        PathProgramCache]: Analyzing trace with hash 439345902, now seen corresponding path program 1 times
[2023-11-03 13:52:49,418 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:52:49,418 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996332746]
[2023-11-03 13:52:49,418 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:52:49,419 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:52:49,433 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:52:49,460 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:52:49,460 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:52:49,460 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996332746]
[2023-11-03 13:52:49,460 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996332746] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:52:49,460 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:52:49,461 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-03 13:52:49,461 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239410953]
[2023-11-03 13:52:49,461 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:52:49,461 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 13:52:49,461 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:52:49,462 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 13:52:49,462 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 13:52:49,495 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 120 out of 232
[2023-11-03 13:52:49,496 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 52 transitions, 165 flow. Second operand  has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:52:49,496 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:52:49,496 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 232
[2023-11-03 13:52:49,496 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:52:49,568 INFO  L130       PetriNetUnfolder]: 120/423 cut-off events.
[2023-11-03 13:52:49,568 INFO  L131       PetriNetUnfolder]: For 82/87 co-relation queries the response was YES.
[2023-11-03 13:52:49,569 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 866 conditions, 423 events. 120/423 cut-off events. For 82/87 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2366 event pairs, 71 based on Foata normal form. 4/390 useless extension candidates. Maximal degree in co-relation 804. Up to 238 conditions per place. 
[2023-11-03 13:52:49,571 INFO  L137   encePairwiseOnDemand]: 226/232 looper letters, 30 selfloop transitions, 7 changer transitions 0/62 dead transitions.
[2023-11-03 13:52:49,571 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 62 transitions, 267 flow
[2023-11-03 13:52:49,571 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 13:52:49,571 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 13:52:49,572 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 391 transitions.
[2023-11-03 13:52:49,572 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5617816091954023
[2023-11-03 13:52:49,572 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 391 transitions.
[2023-11-03 13:52:49,573 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 391 transitions.
[2023-11-03 13:52:49,573 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:52:49,573 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 391 transitions.
[2023-11-03 13:52:49,574 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 0 states have call successors, (0), 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:52:49,576 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 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:52:49,576 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 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:52:49,576 INFO  L175             Difference]: Start difference. First operand has 50 places, 52 transitions, 165 flow. Second operand 3 states and 391 transitions.
[2023-11-03 13:52:49,576 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 62 transitions, 267 flow
[2023-11-03 13:52:49,578 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 62 transitions, 261 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-03 13:52:49,578 INFO  L231             Difference]: Finished difference. Result has 52 places, 57 transitions, 215 flow
[2023-11-03 13:52:49,579 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=215, PETRI_PLACES=52, PETRI_TRANSITIONS=57}
[2023-11-03 13:52:49,579 INFO  L288   CegarLoopForPetriNet]: 45 programPoint places, 7 predicate places.
[2023-11-03 13:52:49,579 INFO  L495      AbstractCegarLoop]: Abstraction has has 52 places, 57 transitions, 215 flow
[2023-11-03 13:52:49,580 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:52:49,580 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:52:49,580 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:52:49,580 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-11-03 13:52:49,580 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 9 more)] ===
[2023-11-03 13:52:49,580 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:52:49,581 INFO  L85        PathProgramCache]: Analyzing trace with hash 969654521, now seen corresponding path program 1 times
[2023-11-03 13:52:49,581 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:52:49,581 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780028633]
[2023-11-03 13:52:49,581 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:52:49,581 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:52:49,595 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:52:49,622 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:52:49,623 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:52:49,623 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780028633]
[2023-11-03 13:52:49,623 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780028633] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:52:49,623 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:52:49,624 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-03 13:52:49,624 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233329193]
[2023-11-03 13:52:49,624 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:52:49,625 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 13:52:49,625 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:52:49,625 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 13:52:49,626 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 13:52:49,638 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 124 out of 232
[2023-11-03 13:52:49,638 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 57 transitions, 215 flow. Second operand  has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:52:49,638 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:52:49,638 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 232
[2023-11-03 13:52:49,639 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:52:49,730 INFO  L130       PetriNetUnfolder]: 117/389 cut-off events.
[2023-11-03 13:52:49,730 INFO  L131       PetriNetUnfolder]: For 191/207 co-relation queries the response was YES.
[2023-11-03 13:52:49,731 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 901 conditions, 389 events. 117/389 cut-off events. For 191/207 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2115 event pairs, 67 based on Foata normal form. 5/358 useless extension candidates. Maximal degree in co-relation 834. Up to 236 conditions per place. 
[2023-11-03 13:52:49,732 INFO  L137   encePairwiseOnDemand]: 228/232 looper letters, 36 selfloop transitions, 4 changer transitions 0/68 dead transitions.
[2023-11-03 13:52:49,732 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 68 transitions, 327 flow
[2023-11-03 13:52:49,733 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 13:52:49,733 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 13:52:49,734 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 404 transitions.
[2023-11-03 13:52:49,734 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5804597701149425
[2023-11-03 13:52:49,735 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 404 transitions.
[2023-11-03 13:52:49,735 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 404 transitions.
[2023-11-03 13:52:49,735 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:52:49,735 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 404 transitions.
[2023-11-03 13:52:49,736 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 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:52:49,737 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 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:52:49,738 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 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:52:49,738 INFO  L175             Difference]: Start difference. First operand has 52 places, 57 transitions, 215 flow. Second operand 3 states and 404 transitions.
[2023-11-03 13:52:49,738 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 68 transitions, 327 flow
[2023-11-03 13:52:49,740 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 68 transitions, 311 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-03 13:52:49,741 INFO  L231             Difference]: Finished difference. Result has 53 places, 59 transitions, 225 flow
[2023-11-03 13:52:49,741 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=225, PETRI_PLACES=53, PETRI_TRANSITIONS=59}
[2023-11-03 13:52:49,742 INFO  L288   CegarLoopForPetriNet]: 45 programPoint places, 8 predicate places.
[2023-11-03 13:52:49,742 INFO  L495      AbstractCegarLoop]: Abstraction has has 53 places, 59 transitions, 225 flow
[2023-11-03 13:52:49,742 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:52:49,742 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:52:49,742 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1]
[2023-11-03 13:52:49,742 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2023-11-03 13:52:49,743 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 9 more)] ===
[2023-11-03 13:52:49,743 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:52:49,743 INFO  L85        PathProgramCache]: Analyzing trace with hash 598293283, now seen corresponding path program 1 times
[2023-11-03 13:52:49,743 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:52:49,743 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6177937]
[2023-11-03 13:52:49,743 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:52:49,743 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:52:49,770 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-03 13:52:49,770 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-11-03 13:52:49,786 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-03 13:52:49,804 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-11-03 13:52:49,805 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-11-03 13:52:49,805 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 12 remaining)
[2023-11-03 13:52:49,807 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (10 of 12 remaining)
[2023-11-03 13:52:49,807 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (9 of 12 remaining)
[2023-11-03 13:52:49,807 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (8 of 12 remaining)
[2023-11-03 13:52:49,807 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (7 of 12 remaining)
[2023-11-03 13:52:49,808 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 12 remaining)
[2023-11-03 13:52:49,808 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 12 remaining)
[2023-11-03 13:52:49,808 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 12 remaining)
[2023-11-03 13:52:49,808 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (3 of 12 remaining)
[2023-11-03 13:52:49,808 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 12 remaining)
[2023-11-03 13:52:49,808 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 12 remaining)
[2023-11-03 13:52:49,809 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (0 of 12 remaining)
[2023-11-03 13:52:49,809 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2023-11-03 13:52:49,809 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1]
[2023-11-03 13:52:49,811 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-11-03 13:52:49,811 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2023-11-03 13:52:49,826 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2023-11-03 13:52:49,829 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 162 places, 161 transitions, 334 flow
[2023-11-03 13:52:49,847 INFO  L130       PetriNetUnfolder]: 10/259 cut-off events.
[2023-11-03 13:52:49,847 INFO  L131       PetriNetUnfolder]: For 2/2 co-relation queries the response was YES.
[2023-11-03 13:52:49,847 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 269 conditions, 259 events. 10/259 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 351 event pairs, 0 based on Foata normal form. 0/226 useless extension candidates. Maximal degree in co-relation 175. Up to 6 conditions per place. 
[2023-11-03 13:52:49,847 INFO  L82        GeneralOperation]: Start removeDead. Operand has 162 places, 161 transitions, 334 flow
[2023-11-03 13:52:49,849 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 162 places, 161 transitions, 334 flow
[2023-11-03 13:52:49,849 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-11-03 13:52:49,849 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 161 transitions, 334 flow
[2023-11-03 13:52:49,849 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 162 places, 161 transitions, 334 flow
[2023-11-03 13:52:49,849 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 162 places, 161 transitions, 334 flow
[2023-11-03 13:52:49,865 INFO  L130       PetriNetUnfolder]: 10/259 cut-off events.
[2023-11-03 13:52:49,866 INFO  L131       PetriNetUnfolder]: For 2/2 co-relation queries the response was YES.
[2023-11-03 13:52:49,866 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 269 conditions, 259 events. 10/259 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 351 event pairs, 0 based on Foata normal form. 0/226 useless extension candidates. Maximal degree in co-relation 175. Up to 6 conditions per place. 
[2023-11-03 13:52:49,870 INFO  L119        LiptonReduction]: Number of co-enabled transitions 7540
[2023-11-03 13:52:52,618 INFO  L134        LiptonReduction]: Checked pairs total: 34782
[2023-11-03 13:52:52,619 INFO  L136        LiptonReduction]: Total number of compositions: 108
[2023-11-03 13:52:52,621 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-03 13:52:52,623 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;@7b891cb7, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-11-03 13:52:52,623 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 15 error locations.
[2023-11-03 13:52:52,625 INFO  L130       PetriNetUnfolder]: 0/6 cut-off events.
[2023-11-03 13:52:52,625 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-11-03 13:52:52,626 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:52:52,626 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1]
[2023-11-03 13:52:52,626 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-11-03 13:52:52,626 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:52:52,626 INFO  L85        PathProgramCache]: Analyzing trace with hash 22736524, now seen corresponding path program 1 times
[2023-11-03 13:52:52,627 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:52:52,627 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787497209]
[2023-11-03 13:52:52,627 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:52:52,627 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:52:52,635 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:52:52,647 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:52:52,648 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:52:52,648 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787497209]
[2023-11-03 13:52:52,648 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787497209] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:52:52,648 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:52:52,648 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-03 13:52:52,648 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162493773]
[2023-11-03 13:52:52,648 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:52:52,649 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 13:52:52,649 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:52:52,649 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 13:52:52,649 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 13:52:52,673 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 141 out of 269
[2023-11-03 13:52:52,674 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 61 transitions, 134 flow. Second operand  has 3 states, 3 states have (on average 142.33333333333334) internal successors, (427), 3 states have internal predecessors, (427), 0 states have call successors, (0), 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:52:52,674 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:52:52,674 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 269
[2023-11-03 13:52:52,674 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:52:53,214 INFO  L130       PetriNetUnfolder]: 4106/7967 cut-off events.
[2023-11-03 13:52:53,214 INFO  L131       PetriNetUnfolder]: For 57/57 co-relation queries the response was YES.
[2023-11-03 13:52:53,224 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14665 conditions, 7967 events. 4106/7967 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 62182 event pairs, 1764 based on Foata normal form. 0/7275 useless extension candidates. Maximal degree in co-relation 5743. Up to 3425 conditions per place. 
[2023-11-03 13:52:53,308 INFO  L137   encePairwiseOnDemand]: 252/269 looper letters, 61 selfloop transitions, 11 changer transitions 0/92 dead transitions.
[2023-11-03 13:52:53,309 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 92 transitions, 345 flow
[2023-11-03 13:52:53,310 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 13:52:53,310 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 13:52:53,311 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 503 transitions.
[2023-11-03 13:52:53,311 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6232961586121437
[2023-11-03 13:52:53,312 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 503 transitions.
[2023-11-03 13:52:53,312 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 503 transitions.
[2023-11-03 13:52:53,312 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:52:53,312 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 503 transitions.
[2023-11-03 13:52:53,313 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 0 states have call successors, (0), 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:52:53,314 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 0 states have call successors, (0), 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:52:53,315 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 0 states have call successors, (0), 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:52:53,315 INFO  L175             Difference]: Start difference. First operand has 64 places, 61 transitions, 134 flow. Second operand 3 states and 503 transitions.
[2023-11-03 13:52:53,315 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 92 transitions, 345 flow
[2023-11-03 13:52:53,316 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 92 transitions, 343 flow, removed 1 selfloop flow, removed 0 redundant places.
[2023-11-03 13:52:53,317 INFO  L231             Difference]: Finished difference. Result has 67 places, 70 transitions, 224 flow
[2023-11-03 13:52:53,317 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=224, PETRI_PLACES=67, PETRI_TRANSITIONS=70}
[2023-11-03 13:52:53,318 INFO  L288   CegarLoopForPetriNet]: 64 programPoint places, 3 predicate places.
[2023-11-03 13:52:53,318 INFO  L495      AbstractCegarLoop]: Abstraction has has 67 places, 70 transitions, 224 flow
[2023-11-03 13:52:53,319 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 142.33333333333334) internal successors, (427), 3 states have internal predecessors, (427), 0 states have call successors, (0), 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:52:53,319 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:52:53,319 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:52:53,319 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2023-11-03 13:52:53,319 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-11-03 13:52:53,319 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:52:53,319 INFO  L85        PathProgramCache]: Analyzing trace with hash 1006456856, now seen corresponding path program 1 times
[2023-11-03 13:52:53,319 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:52:53,320 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166295311]
[2023-11-03 13:52:53,320 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:52:53,320 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:52:53,326 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:52:53,341 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:52:53,342 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:52:53,342 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166295311]
[2023-11-03 13:52:53,342 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166295311] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:52:53,342 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:52:53,342 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-03 13:52:53,342 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043756992]
[2023-11-03 13:52:53,342 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:52:53,342 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 13:52:53,343 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:52:53,343 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 13:52:53,343 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 13:52:53,358 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 151 out of 269
[2023-11-03 13:52:53,359 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 70 transitions, 224 flow. Second operand  has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:52:53,359 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:52:53,359 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 269
[2023-11-03 13:52:53,359 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:52:53,856 INFO  L130       PetriNetUnfolder]: 3685/7514 cut-off events.
[2023-11-03 13:52:53,856 INFO  L131       PetriNetUnfolder]: For 2646/3130 co-relation queries the response was YES.
[2023-11-03 13:52:53,898 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16029 conditions, 7514 events. 3685/7514 cut-off events. For 2646/3130 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 62308 event pairs, 2270 based on Foata normal form. 44/6885 useless extension candidates. Maximal degree in co-relation 5090. Up to 4360 conditions per place. 
[2023-11-03 13:52:53,924 INFO  L137   encePairwiseOnDemand]: 264/269 looper letters, 50 selfloop transitions, 4 changer transitions 0/90 dead transitions.
[2023-11-03 13:52:53,924 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 90 transitions, 384 flow
[2023-11-03 13:52:53,925 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 13:52:53,925 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 13:52:53,926 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 503 transitions.
[2023-11-03 13:52:53,926 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6232961586121437
[2023-11-03 13:52:53,926 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 503 transitions.
[2023-11-03 13:52:53,926 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 503 transitions.
[2023-11-03 13:52:53,927 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:52:53,927 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 503 transitions.
[2023-11-03 13:52:53,928 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 0 states have call successors, (0), 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:52:53,929 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 0 states have call successors, (0), 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:52:53,930 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 0 states have call successors, (0), 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:52:53,930 INFO  L175             Difference]: Start difference. First operand has 67 places, 70 transitions, 224 flow. Second operand 3 states and 503 transitions.
[2023-11-03 13:52:53,930 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 90 transitions, 384 flow
[2023-11-03 13:52:53,936 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 90 transitions, 358 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-03 13:52:53,937 INFO  L231             Difference]: Finished difference. Result has 69 places, 73 transitions, 232 flow
[2023-11-03 13:52:53,937 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=232, PETRI_PLACES=69, PETRI_TRANSITIONS=73}
[2023-11-03 13:52:53,938 INFO  L288   CegarLoopForPetriNet]: 64 programPoint places, 5 predicate places.
[2023-11-03 13:52:53,938 INFO  L495      AbstractCegarLoop]: Abstraction has has 69 places, 73 transitions, 232 flow
[2023-11-03 13:52:53,939 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:52:53,939 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:52:53,939 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:52:53,939 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2023-11-03 13:52:53,940 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-11-03 13:52:53,940 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:52:53,940 INFO  L85        PathProgramCache]: Analyzing trace with hash -420520761, now seen corresponding path program 1 times
[2023-11-03 13:52:53,940 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:52:53,940 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625296543]
[2023-11-03 13:52:53,940 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:52:53,941 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:52:53,948 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:52:53,964 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:52:53,964 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:52:53,964 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625296543]
[2023-11-03 13:52:53,964 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625296543] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:52:53,964 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:52:53,964 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-03 13:52:53,965 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290804766]
[2023-11-03 13:52:53,965 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:52:53,965 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 13:52:53,965 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:52:53,965 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 13:52:53,965 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 13:52:53,996 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 144 out of 269
[2023-11-03 13:52:53,997 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 73 transitions, 232 flow. Second operand  has 3 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 0 states have call successors, (0), 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:52:53,997 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:52:53,997 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 269
[2023-11-03 13:52:53,997 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:52:54,577 INFO  L130       PetriNetUnfolder]: 3968/7815 cut-off events.
[2023-11-03 13:52:54,577 INFO  L131       PetriNetUnfolder]: For 1629/1907 co-relation queries the response was YES.
[2023-11-03 13:52:54,585 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17024 conditions, 7815 events. 3968/7815 cut-off events. For 1629/1907 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 63275 event pairs, 2601 based on Foata normal form. 60/7073 useless extension candidates. Maximal degree in co-relation 13547. Up to 5524 conditions per place. 
[2023-11-03 13:52:54,605 INFO  L137   encePairwiseOnDemand]: 261/269 looper letters, 51 selfloop transitions, 12 changer transitions 0/96 dead transitions.
[2023-11-03 13:52:54,605 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 96 transitions, 422 flow
[2023-11-03 13:52:54,606 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 13:52:54,606 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 13:52:54,607 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 484 transitions.
[2023-11-03 13:52:54,607 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5997521685254027
[2023-11-03 13:52:54,607 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 484 transitions.
[2023-11-03 13:52:54,607 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 484 transitions.
[2023-11-03 13:52:54,608 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:52:54,608 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 484 transitions.
[2023-11-03 13:52:54,609 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 0 states have call successors, (0), 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:52:54,610 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 0 states have call successors, (0), 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:52:54,610 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 0 states have call successors, (0), 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:52:54,610 INFO  L175             Difference]: Start difference. First operand has 69 places, 73 transitions, 232 flow. Second operand 3 states and 484 transitions.
[2023-11-03 13:52:54,610 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 96 transitions, 422 flow
[2023-11-03 13:52:54,613 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 96 transitions, 414 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-03 13:52:54,614 INFO  L231             Difference]: Finished difference. Result has 71 places, 83 transitions, 330 flow
[2023-11-03 13:52:54,614 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=330, PETRI_PLACES=71, PETRI_TRANSITIONS=83}
[2023-11-03 13:52:54,615 INFO  L288   CegarLoopForPetriNet]: 64 programPoint places, 7 predicate places.
[2023-11-03 13:52:54,615 INFO  L495      AbstractCegarLoop]: Abstraction has has 71 places, 83 transitions, 330 flow
[2023-11-03 13:52:54,615 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 0 states have call successors, (0), 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:52:54,615 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:52:54,615 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:52:54,615 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2023-11-03 13:52:54,615 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-11-03 13:52:54,616 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:52:54,616 INFO  L85        PathProgramCache]: Analyzing trace with hash 777101591, now seen corresponding path program 1 times
[2023-11-03 13:52:54,616 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:52:54,616 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742602676]
[2023-11-03 13:52:54,616 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:52:54,616 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:52:54,625 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:52:54,643 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:52:54,644 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:52:54,644 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742602676]
[2023-11-03 13:52:54,644 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742602676] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:52:54,644 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:52:54,644 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-03 13:52:54,644 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063611728]
[2023-11-03 13:52:54,644 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:52:54,645 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 13:52:54,645 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:52:54,645 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 13:52:54,645 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 13:52:54,662 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 149 out of 269
[2023-11-03 13:52:54,663 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 83 transitions, 330 flow. Second operand  has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:52:54,663 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:52:54,663 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 269
[2023-11-03 13:52:54,663 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:52:55,244 INFO  L130       PetriNetUnfolder]: 4157/8465 cut-off events.
[2023-11-03 13:52:55,244 INFO  L131       PetriNetUnfolder]: For 5135/6762 co-relation queries the response was YES.
[2023-11-03 13:52:55,255 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20170 conditions, 8465 events. 4157/8465 cut-off events. For 5135/6762 co-relation queries the response was YES. Maximal size of possible extension queue 427. Compared 72159 event pairs, 2727 based on Foata normal form. 253/7737 useless extension candidates. Maximal degree in co-relation 12648. Up to 5667 conditions per place. 
[2023-11-03 13:52:55,285 INFO  L137   encePairwiseOnDemand]: 264/269 looper letters, 63 selfloop transitions, 6 changer transitions 0/111 dead transitions.
[2023-11-03 13:52:55,286 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 111 transitions, 571 flow
[2023-11-03 13:52:55,286 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 13:52:55,286 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 13:52:55,287 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 499 transitions.
[2023-11-03 13:52:55,287 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6183395291201983
[2023-11-03 13:52:55,288 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 499 transitions.
[2023-11-03 13:52:55,288 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 499 transitions.
[2023-11-03 13:52:55,288 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:52:55,288 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 499 transitions.
[2023-11-03 13:52:55,289 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 0 states have call successors, (0), 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:52:55,290 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 0 states have call successors, (0), 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:52:55,290 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 0 states have call successors, (0), 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:52:55,290 INFO  L175             Difference]: Start difference. First operand has 71 places, 83 transitions, 330 flow. Second operand 3 states and 499 transitions.
[2023-11-03 13:52:55,290 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 111 transitions, 571 flow
[2023-11-03 13:52:55,297 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 111 transitions, 539 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-03 13:52:55,298 INFO  L231             Difference]: Finished difference. Result has 72 places, 87 transitions, 348 flow
[2023-11-03 13:52:55,298 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=348, PETRI_PLACES=72, PETRI_TRANSITIONS=87}
[2023-11-03 13:52:55,299 INFO  L288   CegarLoopForPetriNet]: 64 programPoint places, 8 predicate places.
[2023-11-03 13:52:55,299 INFO  L495      AbstractCegarLoop]: Abstraction has has 72 places, 87 transitions, 348 flow
[2023-11-03 13:52:55,299 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:52:55,299 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:52:55,299 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:52:55,299 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2023-11-03 13:52:55,299 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-11-03 13:52:55,300 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:52:55,300 INFO  L85        PathProgramCache]: Analyzing trace with hash 1261976369, now seen corresponding path program 1 times
[2023-11-03 13:52:55,300 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:52:55,300 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929883160]
[2023-11-03 13:52:55,300 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:52:55,300 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:52:55,316 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:52:55,343 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:52:55,344 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:52:55,344 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929883160]
[2023-11-03 13:52:55,344 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929883160] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:52:55,344 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:52:55,344 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-03 13:52:55,344 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321513500]
[2023-11-03 13:52:55,344 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:52:55,345 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 13:52:55,345 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:52:55,345 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 13:52:55,346 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 13:52:55,375 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 145 out of 269
[2023-11-03 13:52:55,375 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 87 transitions, 348 flow. Second operand  has 3 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 0 states have call successors, (0), 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:52:55,375 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:52:55,376 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 269
[2023-11-03 13:52:55,376 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:52:56,181 INFO  L130       PetriNetUnfolder]: 6039/11385 cut-off events.
[2023-11-03 13:52:56,182 INFO  L131       PetriNetUnfolder]: For 6574/7585 co-relation queries the response was YES.
[2023-11-03 13:52:56,195 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28271 conditions, 11385 events. 6039/11385 cut-off events. For 6574/7585 co-relation queries the response was YES. Maximal size of possible extension queue 482. Compared 91649 event pairs, 3093 based on Foata normal form. 252/10449 useless extension candidates. Maximal degree in co-relation 15661. Up to 7558 conditions per place. 
[2023-11-03 13:52:56,221 INFO  L137   encePairwiseOnDemand]: 260/269 looper letters, 70 selfloop transitions, 19 changer transitions 0/122 dead transitions.
[2023-11-03 13:52:56,221 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 122 transitions, 661 flow
[2023-11-03 13:52:56,222 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 13:52:56,222 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 13:52:56,223 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 493 transitions.
[2023-11-03 13:52:56,223 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.61090458488228
[2023-11-03 13:52:56,224 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 493 transitions.
[2023-11-03 13:52:56,224 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 493 transitions.
[2023-11-03 13:52:56,224 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:52:56,224 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 493 transitions.
[2023-11-03 13:52:56,225 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 164.33333333333334) internal successors, (493), 3 states have internal predecessors, (493), 0 states have call successors, (0), 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:52:56,226 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 0 states have call successors, (0), 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:52:56,226 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 0 states have call successors, (0), 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:52:56,226 INFO  L175             Difference]: Start difference. First operand has 72 places, 87 transitions, 348 flow. Second operand 3 states and 493 transitions.
[2023-11-03 13:52:56,226 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 122 transitions, 661 flow
[2023-11-03 13:52:56,228 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 122 transitions, 655 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-11-03 13:52:56,230 INFO  L231             Difference]: Finished difference. Result has 75 places, 102 transitions, 524 flow
[2023-11-03 13:52:56,230 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=524, PETRI_PLACES=75, PETRI_TRANSITIONS=102}
[2023-11-03 13:52:56,230 INFO  L288   CegarLoopForPetriNet]: 64 programPoint places, 11 predicate places.
[2023-11-03 13:52:56,230 INFO  L495      AbstractCegarLoop]: Abstraction has has 75 places, 102 transitions, 524 flow
[2023-11-03 13:52:56,231 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 0 states have call successors, (0), 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:52:56,231 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:52:56,231 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:52:56,231 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2023-11-03 13:52:56,231 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-11-03 13:52:56,231 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:52:56,231 INFO  L85        PathProgramCache]: Analyzing trace with hash -1922484543, now seen corresponding path program 1 times
[2023-11-03 13:52:56,231 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:52:56,231 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68066221]
[2023-11-03 13:52:56,232 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:52:56,232 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:52:56,242 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:52:56,302 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:52:56,302 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:52:56,302 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68066221]
[2023-11-03 13:52:56,303 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68066221] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-03 13:52:56,303 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [48405070]
[2023-11-03 13:52:56,303 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:52:56,303 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 13:52:56,303 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 13:52:56,304 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:52:56,307 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:52:56,389 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:52:56,391 INFO  L263         TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 4 conjunts are in the unsatisfiable core
[2023-11-03 13:52:56,393 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 13:52:56,474 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:52:56,474 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-11-03 13:52:56,474 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [48405070] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:52:56,474 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2023-11-03 13:52:56,474 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6
[2023-11-03 13:52:56,475 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876316609]
[2023-11-03 13:52:56,475 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:52:56,475 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-11-03 13:52:56,475 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:52:56,475 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-11-03 13:52:56,476 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2023-11-03 13:52:56,496 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 147 out of 269
[2023-11-03 13:52:56,497 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 102 transitions, 524 flow. Second operand  has 5 states, 5 states have (on average 149.6) internal successors, (748), 5 states have internal predecessors, (748), 0 states have call successors, (0), 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:52:56,497 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:52:56,497 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 269
[2023-11-03 13:52:56,497 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:52:58,122 INFO  L130       PetriNetUnfolder]: 8285/15913 cut-off events.
[2023-11-03 13:52:58,123 INFO  L131       PetriNetUnfolder]: For 17760/19750 co-relation queries the response was YES.
[2023-11-03 13:52:58,147 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 45043 conditions, 15913 events. 8285/15913 cut-off events. For 17760/19750 co-relation queries the response was YES. Maximal size of possible extension queue 672. Compared 138602 event pairs, 2025 based on Foata normal form. 619/15242 useless extension candidates. Maximal degree in co-relation 25629. Up to 5856 conditions per place. 
[2023-11-03 13:52:58,189 INFO  L137   encePairwiseOnDemand]: 261/269 looper letters, 167 selfloop transitions, 16 changer transitions 3/236 dead transitions.
[2023-11-03 13:52:58,189 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 236 transitions, 1545 flow
[2023-11-03 13:52:58,190 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2023-11-03 13:52:58,190 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-11-03 13:52:58,193 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1151 transitions.
[2023-11-03 13:52:58,194 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6112586298459904
[2023-11-03 13:52:58,194 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 1151 transitions.
[2023-11-03 13:52:58,194 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 1151 transitions.
[2023-11-03 13:52:58,196 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:52:58,196 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1151 transitions.
[2023-11-03 13:52:58,198 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 164.42857142857142) internal successors, (1151), 7 states have internal predecessors, (1151), 0 states have call successors, (0), 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:52:58,200 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 269.0) internal successors, (2152), 8 states have internal predecessors, (2152), 0 states have call successors, (0), 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:52:58,200 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 269.0) internal successors, (2152), 8 states have internal predecessors, (2152), 0 states have call successors, (0), 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:52:58,200 INFO  L175             Difference]: Start difference. First operand has 75 places, 102 transitions, 524 flow. Second operand 7 states and 1151 transitions.
[2023-11-03 13:52:58,200 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 236 transitions, 1545 flow
[2023-11-03 13:52:58,278 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 236 transitions, 1445 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-03 13:52:58,280 INFO  L231             Difference]: Finished difference. Result has 82 places, 117 transitions, 584 flow
[2023-11-03 13:52:58,281 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=584, PETRI_PLACES=82, PETRI_TRANSITIONS=117}
[2023-11-03 13:52:58,282 INFO  L288   CegarLoopForPetriNet]: 64 programPoint places, 18 predicate places.
[2023-11-03 13:52:58,282 INFO  L495      AbstractCegarLoop]: Abstraction has has 82 places, 117 transitions, 584 flow
[2023-11-03 13:52:58,283 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 149.6) internal successors, (748), 5 states have internal predecessors, (748), 0 states have call successors, (0), 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:52:58,283 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:52:58,283 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:52:58,292 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2023-11-03 13:52:58,484 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,SelfDestructingSolverStorable10
[2023-11-03 13:52:58,485 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-11-03 13:52:58,485 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:52:58,486 INFO  L85        PathProgramCache]: Analyzing trace with hash 597665167, now seen corresponding path program 1 times
[2023-11-03 13:52:58,486 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:52:58,486 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624357619]
[2023-11-03 13:52:58,486 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:52:58,487 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:52:58,505 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:52:58,563 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:52:58,564 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:52:58,564 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624357619]
[2023-11-03 13:52:58,564 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624357619] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:52:58,564 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:52:58,564 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-03 13:52:58,564 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255884817]
[2023-11-03 13:52:58,564 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:52:58,565 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 13:52:58,565 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:52:58,565 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 13:52:58,566 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 13:52:58,597 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 143 out of 269
[2023-11-03 13:52:58,598 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 117 transitions, 584 flow. Second operand  has 3 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 0 states have call successors, (0), 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:52:58,598 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:52:58,598 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 269
[2023-11-03 13:52:58,598 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:52:59,497 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([656] L688-3-->L688-5: Formula: (= |v_threadThread1of2ForFork0_#t~nondet4_15| |v_#race~threads_alive~0_32|)  InVars {}  OutVars{threadThread1of2ForFork0_#t~nondet4=|v_threadThread1of2ForFork0_#t~nondet4_15|, #race~threads_alive~0=|v_#race~threads_alive~0_32|}  AuxVars[]  AssignedVars[threadThread1of2ForFork0_#t~nondet4, #race~threads_alive~0][54], [30#L701-2true, threadThread1of2ForFork0InUse, Black: 188#true, threadThread2of2ForFork0InUse, 47#L688-5true, Black: 167#(= |#race~threads_alive~0| 0), 95#L687true, Black: 265#(and (<= 0 |ULTIMATE.start_main_#t~post8#1|) (<= 0 ~threads_alive~0)), Black: 215#(<= 0 |ULTIMATE.start_main_#t~post8#1|), Black: 202#(<= 0 ~threads_alive~0), Black: 173#(= |#race~data~0| 0), 194#true, Black: 179#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 185#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 272#true])
[2023-11-03 13:52:59,497 INFO  L383   tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event
[2023-11-03 13:52:59,497 INFO  L386   tUnfolder$Statistics]:   existing Event has 46 ancestors and is cut-off event
[2023-11-03 13:52:59,497 INFO  L386   tUnfolder$Statistics]:   existing Event has 46 ancestors and is cut-off event
[2023-11-03 13:52:59,497 INFO  L386   tUnfolder$Statistics]:   existing Event has 46 ancestors and is cut-off event
[2023-11-03 13:52:59,558 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([656] L688-3-->L688-5: Formula: (= |v_threadThread1of2ForFork0_#t~nondet4_15| |v_#race~threads_alive~0_32|)  InVars {}  OutVars{threadThread1of2ForFork0_#t~nondet4=|v_threadThread1of2ForFork0_#t~nondet4_15|, #race~threads_alive~0=|v_#race~threads_alive~0_32|}  AuxVars[]  AssignedVars[threadThread1of2ForFork0_#t~nondet4, #race~threads_alive~0][37], [30#L701-2true, Black: 188#true, threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, 47#L688-5true, 274#(= (select (select |#pthreadsMutex| |~#threads_alive_mutex~0.base|) |~#threads_alive_mutex~0.offset|) 1), Black: 167#(= |#race~threads_alive~0| 0), Black: 265#(and (<= 0 |ULTIMATE.start_main_#t~post8#1|) (<= 0 ~threads_alive~0)), Black: 215#(<= 0 |ULTIMATE.start_main_#t~post8#1|), Black: 202#(<= 0 ~threads_alive~0), Black: 173#(= |#race~data~0| 0), 194#true, Black: 179#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 185#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 127#L688true])
[2023-11-03 13:52:59,558 INFO  L383   tUnfolder$Statistics]: this new event has 47 ancestors and is cut-off event
[2023-11-03 13:52:59,558 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is cut-off event
[2023-11-03 13:52:59,558 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is cut-off event
[2023-11-03 13:52:59,558 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is cut-off event
[2023-11-03 13:52:59,810 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([656] L688-3-->L688-5: Formula: (= |v_threadThread1of2ForFork0_#t~nondet4_15| |v_#race~threads_alive~0_32|)  InVars {}  OutVars{threadThread1of2ForFork0_#t~nondet4=|v_threadThread1of2ForFork0_#t~nondet4_15|, #race~threads_alive~0=|v_#race~threads_alive~0_32|}  AuxVars[]  AssignedVars[threadThread1of2ForFork0_#t~nondet4, #race~threads_alive~0][54], [Black: 188#true, threadThread1of2ForFork0InUse, 30#L701-2true, threadThread2of2ForFork0InUse, 63#L690true, 47#L688-5true, Black: 167#(= |#race~threads_alive~0| 0), Black: 265#(and (<= 0 |ULTIMATE.start_main_#t~post8#1|) (<= 0 ~threads_alive~0)), Black: 215#(<= 0 |ULTIMATE.start_main_#t~post8#1|), Black: 202#(<= 0 ~threads_alive~0), Black: 173#(= |#race~data~0| 0), 194#true, Black: 179#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 185#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 272#true])
[2023-11-03 13:52:59,811 INFO  L383   tUnfolder$Statistics]: this new event has 52 ancestors and is cut-off event
[2023-11-03 13:52:59,811 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2023-11-03 13:52:59,811 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2023-11-03 13:52:59,811 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2023-11-03 13:52:59,855 INFO  L130       PetriNetUnfolder]: 8494/17801 cut-off events.
[2023-11-03 13:52:59,855 INFO  L131       PetriNetUnfolder]: For 20941/23812 co-relation queries the response was YES.
[2023-11-03 13:52:59,894 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 50895 conditions, 17801 events. 8494/17801 cut-off events. For 20941/23812 co-relation queries the response was YES. Maximal size of possible extension queue 818. Compared 171881 event pairs, 1830 based on Foata normal form. 1341/17783 useless extension candidates. Maximal degree in co-relation 38987. Up to 6594 conditions per place. 
[2023-11-03 13:52:59,945 INFO  L137   encePairwiseOnDemand]: 257/269 looper letters, 84 selfloop transitions, 14 changer transitions 0/160 dead transitions.
[2023-11-03 13:52:59,945 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 160 transitions, 996 flow
[2023-11-03 13:52:59,946 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 13:52:59,946 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 13:52:59,947 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 487 transitions.
[2023-11-03 13:52:59,947 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6034696406443618
[2023-11-03 13:52:59,947 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 487 transitions.
[2023-11-03 13:52:59,947 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 487 transitions.
[2023-11-03 13:52:59,947 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:52:59,947 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 487 transitions.
[2023-11-03 13:52:59,948 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 0 states have call successors, (0), 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:52:59,949 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 0 states have call successors, (0), 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:52:59,950 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 0 states have call successors, (0), 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:52:59,950 INFO  L175             Difference]: Start difference. First operand has 82 places, 117 transitions, 584 flow. Second operand 3 states and 487 transitions.
[2023-11-03 13:52:59,950 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 160 transitions, 996 flow
[2023-11-03 13:52:59,961 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 160 transitions, 996 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 13:52:59,962 INFO  L231             Difference]: Finished difference. Result has 85 places, 126 transitions, 670 flow
[2023-11-03 13:52:59,962 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=584, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=670, PETRI_PLACES=85, PETRI_TRANSITIONS=126}
[2023-11-03 13:52:59,963 INFO  L288   CegarLoopForPetriNet]: 64 programPoint places, 21 predicate places.
[2023-11-03 13:52:59,963 INFO  L495      AbstractCegarLoop]: Abstraction has has 85 places, 126 transitions, 670 flow
[2023-11-03 13:52:59,963 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 0 states have call successors, (0), 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:52:59,963 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:52:59,963 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:52:59,964 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2023-11-03 13:52:59,964 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-11-03 13:52:59,964 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:52:59,964 INFO  L85        PathProgramCache]: Analyzing trace with hash -2119960399, now seen corresponding path program 2 times
[2023-11-03 13:52:59,964 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:52:59,964 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209336491]
[2023-11-03 13:52:59,964 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:52:59,964 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:52:59,977 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:53:00,078 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-11-03 13:53:00,079 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:53:00,079 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209336491]
[2023-11-03 13:53:00,079 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209336491] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:53:00,079 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:53:00,079 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-11-03 13:53:00,079 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771410847]
[2023-11-03 13:53:00,079 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:53:00,080 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-11-03 13:53:00,080 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:53:00,080 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-11-03 13:53:00,080 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2023-11-03 13:53:00,136 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 142 out of 269
[2023-11-03 13:53:00,136 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 126 transitions, 670 flow. Second operand  has 5 states, 5 states have (on average 145.0) internal successors, (725), 5 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:53:00,137 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:53:00,137 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 269
[2023-11-03 13:53:00,137 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:53:00,387 INFO  L130       PetriNetUnfolder]: 1010/2573 cut-off events.
[2023-11-03 13:53:00,387 INFO  L131       PetriNetUnfolder]: For 2202/2418 co-relation queries the response was YES.
[2023-11-03 13:53:00,392 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7517 conditions, 2573 events. 1010/2573 cut-off events. For 2202/2418 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 18646 event pairs, 329 based on Foata normal form. 222/2707 useless extension candidates. Maximal degree in co-relation 5322. Up to 1190 conditions per place. 
[2023-11-03 13:53:00,397 INFO  L137   encePairwiseOnDemand]: 258/269 looper letters, 40 selfloop transitions, 16 changer transitions 0/91 dead transitions.
[2023-11-03 13:53:00,397 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 91 transitions, 528 flow
[2023-11-03 13:53:00,398 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-11-03 13:53:00,398 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-11-03 13:53:00,399 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 615 transitions.
[2023-11-03 13:53:00,399 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5715613382899628
[2023-11-03 13:53:00,399 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 615 transitions.
[2023-11-03 13:53:00,399 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 615 transitions.
[2023-11-03 13:53:00,400 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:53:00,400 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 615 transitions.
[2023-11-03 13:53:00,401 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 153.75) internal successors, (615), 4 states have internal predecessors, (615), 0 states have call successors, (0), 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:53:00,402 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 269.0) internal successors, (1345), 5 states have internal predecessors, (1345), 0 states have call successors, (0), 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:53:00,402 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 269.0) internal successors, (1345), 5 states have internal predecessors, (1345), 0 states have call successors, (0), 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:53:00,402 INFO  L175             Difference]: Start difference. First operand has 85 places, 126 transitions, 670 flow. Second operand 4 states and 615 transitions.
[2023-11-03 13:53:00,403 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 91 transitions, 528 flow
[2023-11-03 13:53:00,414 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 91 transitions, 462 flow, removed 21 selfloop flow, removed 6 redundant places.
[2023-11-03 13:53:00,415 INFO  L231             Difference]: Finished difference. Result has 75 places, 77 transitions, 333 flow
[2023-11-03 13:53:00,415 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=333, PETRI_PLACES=75, PETRI_TRANSITIONS=77}
[2023-11-03 13:53:00,416 INFO  L288   CegarLoopForPetriNet]: 64 programPoint places, 11 predicate places.
[2023-11-03 13:53:00,416 INFO  L495      AbstractCegarLoop]: Abstraction has has 75 places, 77 transitions, 333 flow
[2023-11-03 13:53:00,416 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 145.0) internal successors, (725), 5 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:53:00,416 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:53:00,417 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:53:00,417 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2023-11-03 13:53:00,417 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-11-03 13:53:00,417 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:53:00,417 INFO  L85        PathProgramCache]: Analyzing trace with hash -674470246, now seen corresponding path program 1 times
[2023-11-03 13:53:00,417 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:53:00,417 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004562887]
[2023-11-03 13:53:00,417 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:53:00,418 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:53:00,429 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:53:00,447 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked.
[2023-11-03 13:53:00,447 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:53:00,447 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004562887]
[2023-11-03 13:53:00,447 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004562887] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:53:00,447 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:53:00,447 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-03 13:53:00,448 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131225354]
[2023-11-03 13:53:00,448 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:53:00,448 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 13:53:00,448 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:53:00,448 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 13:53:00,448 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 13:53:00,464 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 149 out of 269
[2023-11-03 13:53:00,465 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 77 transitions, 333 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:53:00,465 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:53:00,465 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 269
[2023-11-03 13:53:00,465 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:53:00,730 INFO  L130       PetriNetUnfolder]: 1161/2703 cut-off events.
[2023-11-03 13:53:00,731 INFO  L131       PetriNetUnfolder]: For 1713/1792 co-relation queries the response was YES.
[2023-11-03 13:53:00,735 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7394 conditions, 2703 events. 1161/2703 cut-off events. For 1713/1792 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 19190 event pairs, 663 based on Foata normal form. 3/2518 useless extension candidates. Maximal degree in co-relation 5369. Up to 1652 conditions per place. 
[2023-11-03 13:53:00,740 INFO  L137   encePairwiseOnDemand]: 263/269 looper letters, 56 selfloop transitions, 8 changer transitions 0/100 dead transitions.
[2023-11-03 13:53:00,740 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 100 transitions, 561 flow
[2023-11-03 13:53:00,741 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 13:53:00,741 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 13:53:00,742 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 497 transitions.
[2023-11-03 13:53:00,742 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6158612143742255
[2023-11-03 13:53:00,742 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 497 transitions.
[2023-11-03 13:53:00,742 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 497 transitions.
[2023-11-03 13:53:00,742 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:53:00,742 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 497 transitions.
[2023-11-03 13:53:00,743 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 165.66666666666666) internal successors, (497), 3 states have internal predecessors, (497), 0 states have call successors, (0), 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:53:00,744 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 0 states have call successors, (0), 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:53:00,745 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 0 states have call successors, (0), 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:53:00,745 INFO  L175             Difference]: Start difference. First operand has 75 places, 77 transitions, 333 flow. Second operand 3 states and 497 transitions.
[2023-11-03 13:53:00,745 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 100 transitions, 561 flow
[2023-11-03 13:53:00,748 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 100 transitions, 538 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-03 13:53:00,749 INFO  L231             Difference]: Finished difference. Result has 77 places, 82 transitions, 383 flow
[2023-11-03 13:53:00,749 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=383, PETRI_PLACES=77, PETRI_TRANSITIONS=82}
[2023-11-03 13:53:00,750 INFO  L288   CegarLoopForPetriNet]: 64 programPoint places, 13 predicate places.
[2023-11-03 13:53:00,750 INFO  L495      AbstractCegarLoop]: Abstraction has has 77 places, 82 transitions, 383 flow
[2023-11-03 13:53:00,750 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:53:00,750 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:53:00,750 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:53:00,751 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2023-11-03 13:53:00,751 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-11-03 13:53:00,751 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:53:00,751 INFO  L85        PathProgramCache]: Analyzing trace with hash 545280907, now seen corresponding path program 1 times
[2023-11-03 13:53:00,751 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:53:00,751 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990607974]
[2023-11-03 13:53:00,751 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:53:00,751 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:53:00,765 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:53:00,817 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2023-11-03 13:53:00,818 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:53:00,818 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990607974]
[2023-11-03 13:53:00,818 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990607974] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:53:00,818 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:53:00,818 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-03 13:53:00,818 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743215278]
[2023-11-03 13:53:00,818 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:53:00,819 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 13:53:00,819 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:53:00,819 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 13:53:00,819 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 13:53:00,854 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 146 out of 269
[2023-11-03 13:53:00,855 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 82 transitions, 383 flow. Second operand  has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 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:53:00,855 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:53:00,855 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 269
[2023-11-03 13:53:00,855 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:53:01,221 INFO  L130       PetriNetUnfolder]: 1581/3753 cut-off events.
[2023-11-03 13:53:01,221 INFO  L131       PetriNetUnfolder]: For 3378/3613 co-relation queries the response was YES.
[2023-11-03 13:53:01,228 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11007 conditions, 3753 events. 1581/3753 cut-off events. For 3378/3613 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 29364 event pairs, 288 based on Foata normal form. 143/3777 useless extension candidates. Maximal degree in co-relation 7716. Up to 1817 conditions per place. 
[2023-11-03 13:53:01,237 INFO  L137   encePairwiseOnDemand]: 260/269 looper letters, 67 selfloop transitions, 15 changer transitions 0/119 dead transitions.
[2023-11-03 13:53:01,237 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 119 transitions, 732 flow
[2023-11-03 13:53:01,238 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 13:53:01,238 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 13:53:01,239 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 496 transitions.
[2023-11-03 13:53:01,239 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6146220570012392
[2023-11-03 13:53:01,239 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 496 transitions.
[2023-11-03 13:53:01,239 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 496 transitions.
[2023-11-03 13:53:01,239 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:53:01,239 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 496 transitions.
[2023-11-03 13:53:01,240 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 165.33333333333334) internal successors, (496), 3 states have internal predecessors, (496), 0 states have call successors, (0), 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:53:01,241 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 0 states have call successors, (0), 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:53:01,242 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 0 states have call successors, (0), 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:53:01,242 INFO  L175             Difference]: Start difference. First operand has 77 places, 82 transitions, 383 flow. Second operand 3 states and 496 transitions.
[2023-11-03 13:53:01,242 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 119 transitions, 732 flow
[2023-11-03 13:53:01,248 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 119 transitions, 704 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-03 13:53:01,249 INFO  L231             Difference]: Finished difference. Result has 78 places, 95 transitions, 505 flow
[2023-11-03 13:53:01,250 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=505, PETRI_PLACES=78, PETRI_TRANSITIONS=95}
[2023-11-03 13:53:01,250 INFO  L288   CegarLoopForPetriNet]: 64 programPoint places, 14 predicate places.
[2023-11-03 13:53:01,250 INFO  L495      AbstractCegarLoop]: Abstraction has has 78 places, 95 transitions, 505 flow
[2023-11-03 13:53:01,250 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 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:53:01,250 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:53:01,251 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:53:01,251 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2023-11-03 13:53:01,251 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-11-03 13:53:01,251 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:53:01,251 INFO  L85        PathProgramCache]: Analyzing trace with hash 2143255471, now seen corresponding path program 2 times
[2023-11-03 13:53:01,251 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:53:01,251 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759809545]
[2023-11-03 13:53:01,251 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:53:01,252 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:53:01,267 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:53:01,355 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2023-11-03 13:53:01,355 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:53:01,355 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759809545]
[2023-11-03 13:53:01,355 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759809545] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-03 13:53:01,356 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1286192542]
[2023-11-03 13:53:01,356 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2023-11-03 13:53:01,356 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 13:53:01,356 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 13:53:01,357 INFO  L229       MonitoredProcess]: Starting monitored process 3 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:53:01,359 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2023-11-03 13:53:01,435 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2023-11-03 13:53:01,435 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-11-03 13:53:01,436 INFO  L263         TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 9 conjunts are in the unsatisfiable core
[2023-11-03 13:53:01,438 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 13:53:01,561 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-11-03 13:53:01,601 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 13:53:01,603 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16
[2023-11-03 13:53:01,624 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2023-11-03 13:53:01,624 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-03 13:53:01,684 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 13:53:01,684 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20
[2023-11-03 13:53:01,690 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25
[2023-11-03 13:53:01,724 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2023-11-03 13:53:01,724 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1286192542] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-03 13:53:01,724 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-03 13:53:01,725 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9
[2023-11-03 13:53:01,725 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778918365]
[2023-11-03 13:53:01,725 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-03 13:53:01,725 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2023-11-03 13:53:01,725 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:53:01,726 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2023-11-03 13:53:01,726 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90
[2023-11-03 13:53:01,902 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 145 out of 269
[2023-11-03 13:53:01,904 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 95 transitions, 505 flow. Second operand  has 10 states, 10 states have (on average 148.3) internal successors, (1483), 10 states have internal predecessors, (1483), 0 states have call successors, (0), 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:53:01,904 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:53:01,904 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 269
[2023-11-03 13:53:01,904 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:53:02,220 INFO  L130       PetriNetUnfolder]: 800/2211 cut-off events.
[2023-11-03 13:53:02,220 INFO  L131       PetriNetUnfolder]: For 2345/2426 co-relation queries the response was YES.
[2023-11-03 13:53:02,225 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6911 conditions, 2211 events. 800/2211 cut-off events. For 2345/2426 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 16413 event pairs, 251 based on Foata normal form. 88/2214 useless extension candidates. Maximal degree in co-relation 4732. Up to 1130 conditions per place. 
[2023-11-03 13:53:02,229 INFO  L137   encePairwiseOnDemand]: 264/269 looper letters, 61 selfloop transitions, 13 changer transitions 1/111 dead transitions.
[2023-11-03 13:53:02,230 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 111 transitions, 719 flow
[2023-11-03 13:53:02,230 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-11-03 13:53:02,230 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-11-03 13:53:02,231 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 631 transitions.
[2023-11-03 13:53:02,232 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5864312267657993
[2023-11-03 13:53:02,232 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 631 transitions.
[2023-11-03 13:53:02,232 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 631 transitions.
[2023-11-03 13:53:02,232 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:53:02,232 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 631 transitions.
[2023-11-03 13:53:02,233 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 157.75) internal successors, (631), 4 states have internal predecessors, (631), 0 states have call successors, (0), 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:53:02,235 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 269.0) internal successors, (1345), 5 states have internal predecessors, (1345), 0 states have call successors, (0), 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:53:02,235 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 269.0) internal successors, (1345), 5 states have internal predecessors, (1345), 0 states have call successors, (0), 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:53:02,235 INFO  L175             Difference]: Start difference. First operand has 78 places, 95 transitions, 505 flow. Second operand 4 states and 631 transitions.
[2023-11-03 13:53:02,235 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 111 transitions, 719 flow
[2023-11-03 13:53:02,240 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 111 transitions, 703 flow, removed 1 selfloop flow, removed 1 redundant places.
[2023-11-03 13:53:02,241 INFO  L231             Difference]: Finished difference. Result has 80 places, 90 transitions, 478 flow
[2023-11-03 13:53:02,241 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=478, PETRI_PLACES=80, PETRI_TRANSITIONS=90}
[2023-11-03 13:53:02,242 INFO  L288   CegarLoopForPetriNet]: 64 programPoint places, 16 predicate places.
[2023-11-03 13:53:02,242 INFO  L495      AbstractCegarLoop]: Abstraction has has 80 places, 90 transitions, 478 flow
[2023-11-03 13:53:02,243 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 148.3) internal successors, (1483), 10 states have internal predecessors, (1483), 0 states have call successors, (0), 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:53:02,243 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:53:02,243 INFO  L209   CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1]
[2023-11-03 13:53:02,248 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2023-11-03 13:53:02,443 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,3 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 13:53:02,444 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-11-03 13:53:02,445 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:53:02,445 INFO  L85        PathProgramCache]: Analyzing trace with hash -1802055890, now seen corresponding path program 1 times
[2023-11-03 13:53:02,446 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:53:02,446 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583193312]
[2023-11-03 13:53:02,446 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:53:02,446 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:53:02,470 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-03 13:53:02,471 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-11-03 13:53:02,482 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-03 13:53:02,489 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-11-03 13:53:02,489 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-11-03 13:53:02,490 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 15 remaining)
[2023-11-03 13:53:02,490 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining)
[2023-11-03 13:53:02,490 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining)
[2023-11-03 13:53:02,490 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining)
[2023-11-03 13:53:02,490 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining)
[2023-11-03 13:53:02,490 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining)
[2023-11-03 13:53:02,490 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (8 of 15 remaining)
[2023-11-03 13:53:02,491 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining)
[2023-11-03 13:53:02,491 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining)
[2023-11-03 13:53:02,491 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining)
[2023-11-03 13:53:02,491 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 15 remaining)
[2023-11-03 13:53:02,491 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (3 of 15 remaining)
[2023-11-03 13:53:02,491 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining)
[2023-11-03 13:53:02,491 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining)
[2023-11-03 13:53:02,491 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining)
[2023-11-03 13:53:02,492 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2023-11-03 13:53:02,492 INFO  L445         BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:53:02,492 WARN  L233   ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-11-03 13:53:02,492 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances.
[2023-11-03 13:53:02,510 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2023-11-03 13:53:02,512 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 191 places, 188 transitions, 397 flow
[2023-11-03 13:53:02,540 INFO  L130       PetriNetUnfolder]: 13/344 cut-off events.
[2023-11-03 13:53:02,541 INFO  L131       PetriNetUnfolder]: For 7/7 co-relation queries the response was YES.
[2023-11-03 13:53:02,541 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 360 conditions, 344 events. 13/344 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 491 event pairs, 0 based on Foata normal form. 0/299 useless extension candidates. Maximal degree in co-relation 263. Up to 8 conditions per place. 
[2023-11-03 13:53:02,542 INFO  L82        GeneralOperation]: Start removeDead. Operand has 191 places, 188 transitions, 397 flow
[2023-11-03 13:53:02,543 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 191 places, 188 transitions, 397 flow
[2023-11-03 13:53:02,543 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-11-03 13:53:02,543 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 191 places, 188 transitions, 397 flow
[2023-11-03 13:53:02,544 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 191 places, 188 transitions, 397 flow
[2023-11-03 13:53:02,544 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 191 places, 188 transitions, 397 flow
[2023-11-03 13:53:02,572 INFO  L130       PetriNetUnfolder]: 13/344 cut-off events.
[2023-11-03 13:53:02,572 INFO  L131       PetriNetUnfolder]: For 7/7 co-relation queries the response was YES.
[2023-11-03 13:53:02,573 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 360 conditions, 344 events. 13/344 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 491 event pairs, 0 based on Foata normal form. 0/299 useless extension candidates. Maximal degree in co-relation 263. Up to 8 conditions per place. 
[2023-11-03 13:53:02,581 INFO  L119        LiptonReduction]: Number of co-enabled transitions 13416
[2023-11-03 13:53:05,903 INFO  L134        LiptonReduction]: Checked pairs total: 63011
[2023-11-03 13:53:05,904 INFO  L136        LiptonReduction]: Total number of compositions: 119
[2023-11-03 13:53:05,905 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-03 13:53:05,905 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;@7b891cb7, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-11-03 13:53:05,905 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 18 error locations.
[2023-11-03 13:53:05,906 INFO  L130       PetriNetUnfolder]: 0/6 cut-off events.
[2023-11-03 13:53:05,907 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-11-03 13:53:05,907 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:53:05,907 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1]
[2023-11-03 13:53:05,907 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2023-11-03 13:53:05,907 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:53:05,907 INFO  L85        PathProgramCache]: Analyzing trace with hash 33015180, now seen corresponding path program 1 times
[2023-11-03 13:53:05,907 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:53:05,907 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235075512]
[2023-11-03 13:53:05,907 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:53:05,908 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:53:05,912 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:53:05,922 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:53:05,922 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:53:05,922 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235075512]
[2023-11-03 13:53:05,922 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235075512] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:53:05,922 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:53:05,923 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-03 13:53:05,923 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017430234]
[2023-11-03 13:53:05,923 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:53:05,923 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 13:53:05,923 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:53:05,923 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 13:53:05,923 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 13:53:05,952 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 163 out of 307
[2023-11-03 13:53:05,952 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 77 transitions, 175 flow. Second operand  has 3 states, 3 states have (on average 164.33333333333334) internal successors, (493), 3 states have internal predecessors, (493), 0 states have call successors, (0), 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:53:05,952 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:53:05,952 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 307
[2023-11-03 13:53:05,952 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:53:12,814 INFO  L130       PetriNetUnfolder]: 72169/116333 cut-off events.
[2023-11-03 13:53:12,815 INFO  L131       PetriNetUnfolder]: For 1881/1881 co-relation queries the response was YES.
[2023-11-03 13:53:12,953 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 219426 conditions, 116333 events. 72169/116333 cut-off events. For 1881/1881 co-relation queries the response was YES. Maximal size of possible extension queue 3388. Compared 1041871 event pairs, 31556 based on Foata normal form. 0/105895 useless extension candidates. Maximal degree in co-relation 36488. Up to 53205 conditions per place. 
[2023-11-03 13:53:13,352 INFO  L137   encePairwiseOnDemand]: 286/307 looper letters, 77 selfloop transitions, 14 changer transitions 0/117 dead transitions.
[2023-11-03 13:53:13,353 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 117 transitions, 449 flow
[2023-11-03 13:53:13,354 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 13:53:13,355 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 13:53:13,355 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 589 transitions.
[2023-11-03 13:53:13,356 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6395222584147665
[2023-11-03 13:53:13,356 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 589 transitions.
[2023-11-03 13:53:13,356 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 589 transitions.
[2023-11-03 13:53:13,356 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:53:13,356 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 589 transitions.
[2023-11-03 13:53:13,357 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 196.33333333333334) internal successors, (589), 3 states have internal predecessors, (589), 0 states have call successors, (0), 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:53:13,358 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 307.0) internal successors, (1228), 4 states have internal predecessors, (1228), 0 states have call successors, (0), 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:53:13,359 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 307.0) internal successors, (1228), 4 states have internal predecessors, (1228), 0 states have call successors, (0), 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:53:13,359 INFO  L175             Difference]: Start difference. First operand has 82 places, 77 transitions, 175 flow. Second operand 3 states and 589 transitions.
[2023-11-03 13:53:13,359 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 117 transitions, 449 flow
[2023-11-03 13:53:13,361 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 117 transitions, 441 flow, removed 4 selfloop flow, removed 0 redundant places.
[2023-11-03 13:53:13,362 INFO  L231             Difference]: Finished difference. Result has 85 places, 89 transitions, 287 flow
[2023-11-03 13:53:13,362 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=287, PETRI_PLACES=85, PETRI_TRANSITIONS=89}
[2023-11-03 13:53:13,363 INFO  L288   CegarLoopForPetriNet]: 82 programPoint places, 3 predicate places.
[2023-11-03 13:53:13,363 INFO  L495      AbstractCegarLoop]: Abstraction has has 85 places, 89 transitions, 287 flow
[2023-11-03 13:53:13,363 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 164.33333333333334) internal successors, (493), 3 states have internal predecessors, (493), 0 states have call successors, (0), 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:53:13,363 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:53:13,363 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:53:13,363 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2023-11-03 13:53:13,363 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2023-11-03 13:53:13,364 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:53:13,364 INFO  L85        PathProgramCache]: Analyzing trace with hash 265562788, now seen corresponding path program 1 times
[2023-11-03 13:53:13,364 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:53:13,364 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305979958]
[2023-11-03 13:53:13,364 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:53:13,364 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:53:13,369 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:53:13,377 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:53:13,377 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:53:13,378 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305979958]
[2023-11-03 13:53:13,378 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305979958] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:53:13,378 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:53:13,378 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-03 13:53:13,378 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285831776]
[2023-11-03 13:53:13,378 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:53:13,378 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 13:53:13,379 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:53:13,379 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 13:53:13,379 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 13:53:13,434 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 168 out of 307
[2023-11-03 13:53:13,435 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 89 transitions, 287 flow. Second operand  has 3 states, 3 states have (on average 170.0) internal successors, (510), 3 states have internal predecessors, (510), 0 states have call successors, (0), 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:53:13,435 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:53:13,435 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 307
[2023-11-03 13:53:13,435 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:53:17,470 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([984] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_50| |v_threadThread2of3ForFork0_#t~nondet4_17|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_17|, #race~threads_alive~0=|v_#race~threads_alive~0_50|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet4, #race~threads_alive~0][74], [threadThread3of3ForFork0InUse, 72#L688-2true, 9#L688-5true, 194#true, 200#true, Black: 196#(= |#race~threads_alive~0| 0), 149#L685-2true, threadThread1of3ForFork0InUse, 68#L705-4true, threadThread2of3ForFork0InUse])
[2023-11-03 13:53:17,470 INFO  L383   tUnfolder$Statistics]: this new event has 60 ancestors and is cut-off event
[2023-11-03 13:53:17,470 INFO  L386   tUnfolder$Statistics]:   existing Event has 55 ancestors and is cut-off event
[2023-11-03 13:53:17,471 INFO  L386   tUnfolder$Statistics]:   existing Event has 55 ancestors and is cut-off event
[2023-11-03 13:53:17,471 INFO  L386   tUnfolder$Statistics]:   existing Event has 55 ancestors and is cut-off event
[2023-11-03 13:53:17,471 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([758] L705-4-->L705-1: Formula: (= 0 |v_#race~threads_alive~0_7|)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|}  AuxVars[]  AssignedVars[#race~threads_alive~0][19], [threadThread3of3ForFork0InUse, 72#L688-2true, 200#true, 156#L688-2true, Black: 194#true, 80#L705-1true, 149#L685-2true, threadThread1of3ForFork0InUse, 196#(= |#race~threads_alive~0| 0), threadThread2of3ForFork0InUse])
[2023-11-03 13:53:17,471 INFO  L383   tUnfolder$Statistics]: this new event has 59 ancestors and is cut-off event
[2023-11-03 13:53:17,471 INFO  L386   tUnfolder$Statistics]:   existing Event has 54 ancestors and is cut-off event
[2023-11-03 13:53:17,471 INFO  L386   tUnfolder$Statistics]:   existing Event has 54 ancestors and is cut-off event
[2023-11-03 13:53:17,471 INFO  L386   tUnfolder$Statistics]:   existing Event has 54 ancestors and is cut-off event
[2023-11-03 13:53:17,471 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([941] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_44| |v_threadThread1of3ForFork0_#t~nondet4_13|)  InVars {}  OutVars{threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_13|, #race~threads_alive~0=|v_#race~threads_alive~0_44|}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet4, #race~threads_alive~0][37], [threadThread3of3ForFork0InUse, 200#true, 194#true, 156#L688-2true, Black: 196#(= |#race~threads_alive~0| 0), 149#L685-2true, threadThread1of3ForFork0InUse, 68#L705-4true, threadThread2of3ForFork0InUse, 119#L688-5true])
[2023-11-03 13:53:17,471 INFO  L383   tUnfolder$Statistics]: this new event has 60 ancestors and is cut-off event
[2023-11-03 13:53:17,471 INFO  L386   tUnfolder$Statistics]:   existing Event has 55 ancestors and is cut-off event
[2023-11-03 13:53:17,471 INFO  L386   tUnfolder$Statistics]:   existing Event has 55 ancestors and is cut-off event
[2023-11-03 13:53:17,472 INFO  L386   tUnfolder$Statistics]:   existing Event has 55 ancestors and is cut-off event
[2023-11-03 13:53:17,767 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([984] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_50| |v_threadThread2of3ForFork0_#t~nondet4_17|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_17|, #race~threads_alive~0=|v_#race~threads_alive~0_50|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet4, #race~threads_alive~0][74], [threadThread3of3ForFork0InUse, 116#L685-4true, 72#L688-2true, 9#L688-5true, 194#true, 200#true, Black: 196#(= |#race~threads_alive~0| 0), threadThread1of3ForFork0InUse, 68#L705-4true, threadThread2of3ForFork0InUse])
[2023-11-03 13:53:17,768 INFO  L383   tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event
[2023-11-03 13:53:17,768 INFO  L386   tUnfolder$Statistics]:   existing Event has 56 ancestors and is cut-off event
[2023-11-03 13:53:17,768 INFO  L386   tUnfolder$Statistics]:   existing Event has 56 ancestors and is cut-off event
[2023-11-03 13:53:17,768 INFO  L386   tUnfolder$Statistics]:   existing Event has 56 ancestors and is cut-off event
[2023-11-03 13:53:17,768 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([758] L705-4-->L705-1: Formula: (= 0 |v_#race~threads_alive~0_7|)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|}  AuxVars[]  AssignedVars[#race~threads_alive~0][19], [threadThread3of3ForFork0InUse, 116#L685-4true, 72#L688-2true, 200#true, 156#L688-2true, Black: 194#true, 80#L705-1true, threadThread1of3ForFork0InUse, 196#(= |#race~threads_alive~0| 0), threadThread2of3ForFork0InUse])
[2023-11-03 13:53:17,768 INFO  L383   tUnfolder$Statistics]: this new event has 60 ancestors and is cut-off event
[2023-11-03 13:53:17,768 INFO  L386   tUnfolder$Statistics]:   existing Event has 55 ancestors and is cut-off event
[2023-11-03 13:53:17,768 INFO  L386   tUnfolder$Statistics]:   existing Event has 55 ancestors and is cut-off event
[2023-11-03 13:53:17,768 INFO  L386   tUnfolder$Statistics]:   existing Event has 55 ancestors and is cut-off event
[2023-11-03 13:53:17,768 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([941] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_44| |v_threadThread1of3ForFork0_#t~nondet4_13|)  InVars {}  OutVars{threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_13|, #race~threads_alive~0=|v_#race~threads_alive~0_44|}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet4, #race~threads_alive~0][37], [threadThread3of3ForFork0InUse, 116#L685-4true, 200#true, 194#true, 156#L688-2true, Black: 196#(= |#race~threads_alive~0| 0), threadThread1of3ForFork0InUse, 68#L705-4true, threadThread2of3ForFork0InUse, 119#L688-5true])
[2023-11-03 13:53:17,768 INFO  L383   tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event
[2023-11-03 13:53:17,768 INFO  L386   tUnfolder$Statistics]:   existing Event has 56 ancestors and is cut-off event
[2023-11-03 13:53:17,768 INFO  L386   tUnfolder$Statistics]:   existing Event has 56 ancestors and is cut-off event
[2023-11-03 13:53:17,768 INFO  L386   tUnfolder$Statistics]:   existing Event has 56 ancestors and is cut-off event
[2023-11-03 13:53:18,068 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([984] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_50| |v_threadThread2of3ForFork0_#t~nondet4_17|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_17|, #race~threads_alive~0=|v_#race~threads_alive~0_50|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet4, #race~threads_alive~0][74], [threadThread3of3ForFork0InUse, 72#L688-2true, 9#L688-5true, 194#true, 200#true, Black: 196#(= |#race~threads_alive~0| 0), 70#L686true, threadThread1of3ForFork0InUse, 68#L705-4true, threadThread2of3ForFork0InUse])
[2023-11-03 13:53:18,069 INFO  L383   tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event
[2023-11-03 13:53:18,069 INFO  L386   tUnfolder$Statistics]:   existing Event has 57 ancestors and is cut-off event
[2023-11-03 13:53:18,069 INFO  L386   tUnfolder$Statistics]:   existing Event has 57 ancestors and is cut-off event
[2023-11-03 13:53:18,069 INFO  L386   tUnfolder$Statistics]:   existing Event has 57 ancestors and is cut-off event
[2023-11-03 13:53:18,069 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([758] L705-4-->L705-1: Formula: (= 0 |v_#race~threads_alive~0_7|)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|}  AuxVars[]  AssignedVars[#race~threads_alive~0][19], [threadThread3of3ForFork0InUse, 72#L688-2true, 156#L688-2true, 200#true, Black: 194#true, 80#L705-1true, 70#L686true, threadThread1of3ForFork0InUse, 196#(= |#race~threads_alive~0| 0), threadThread2of3ForFork0InUse])
[2023-11-03 13:53:18,069 INFO  L383   tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event
[2023-11-03 13:53:18,069 INFO  L386   tUnfolder$Statistics]:   existing Event has 56 ancestors and is cut-off event
[2023-11-03 13:53:18,069 INFO  L386   tUnfolder$Statistics]:   existing Event has 56 ancestors and is cut-off event
[2023-11-03 13:53:18,069 INFO  L386   tUnfolder$Statistics]:   existing Event has 56 ancestors and is cut-off event
[2023-11-03 13:53:18,069 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([941] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_44| |v_threadThread1of3ForFork0_#t~nondet4_13|)  InVars {}  OutVars{threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_13|, #race~threads_alive~0=|v_#race~threads_alive~0_44|}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet4, #race~threads_alive~0][37], [threadThread3of3ForFork0InUse, 200#true, 194#true, 156#L688-2true, Black: 196#(= |#race~threads_alive~0| 0), 70#L686true, threadThread1of3ForFork0InUse, 68#L705-4true, threadThread2of3ForFork0InUse, 119#L688-5true])
[2023-11-03 13:53:18,069 INFO  L383   tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event
[2023-11-03 13:53:18,069 INFO  L386   tUnfolder$Statistics]:   existing Event has 57 ancestors and is cut-off event
[2023-11-03 13:53:18,069 INFO  L386   tUnfolder$Statistics]:   existing Event has 57 ancestors and is cut-off event
[2023-11-03 13:53:18,070 INFO  L386   tUnfolder$Statistics]:   existing Event has 57 ancestors and is cut-off event
[2023-11-03 13:53:18,755 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([984] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_50| |v_threadThread2of3ForFork0_#t~nondet4_17|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_17|, #race~threads_alive~0=|v_#race~threads_alive~0_50|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet4, #race~threads_alive~0][74], [threadThread3of3ForFork0InUse, 72#L688-2true, 9#L688-5true, 194#true, 200#true, Black: 196#(= |#race~threads_alive~0| 0), 6#L688true, threadThread1of3ForFork0InUse, 68#L705-4true, threadThread2of3ForFork0InUse])
[2023-11-03 13:53:18,755 INFO  L383   tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event
[2023-11-03 13:53:18,755 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-11-03 13:53:18,755 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-11-03 13:53:18,755 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-11-03 13:53:18,755 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([758] L705-4-->L705-1: Formula: (= 0 |v_#race~threads_alive~0_7|)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|}  AuxVars[]  AssignedVars[#race~threads_alive~0][19], [threadThread3of3ForFork0InUse, 72#L688-2true, 200#true, 156#L688-2true, Black: 194#true, 80#L705-1true, 6#L688true, threadThread1of3ForFork0InUse, 196#(= |#race~threads_alive~0| 0), threadThread2of3ForFork0InUse])
[2023-11-03 13:53:18,755 INFO  L383   tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event
[2023-11-03 13:53:18,755 INFO  L386   tUnfolder$Statistics]:   existing Event has 58 ancestors and is cut-off event
[2023-11-03 13:53:18,756 INFO  L386   tUnfolder$Statistics]:   existing Event has 58 ancestors and is cut-off event
[2023-11-03 13:53:18,756 INFO  L386   tUnfolder$Statistics]:   existing Event has 58 ancestors and is cut-off event
[2023-11-03 13:53:18,756 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([941] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_44| |v_threadThread1of3ForFork0_#t~nondet4_13|)  InVars {}  OutVars{threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_13|, #race~threads_alive~0=|v_#race~threads_alive~0_44|}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet4, #race~threads_alive~0][37], [threadThread3of3ForFork0InUse, 194#true, 200#true, 156#L688-2true, Black: 196#(= |#race~threads_alive~0| 0), 6#L688true, threadThread1of3ForFork0InUse, 68#L705-4true, threadThread2of3ForFork0InUse, 119#L688-5true])
[2023-11-03 13:53:18,756 INFO  L383   tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event
[2023-11-03 13:53:18,756 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-11-03 13:53:18,756 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-11-03 13:53:18,756 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-11-03 13:53:18,756 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([859] L688-->L688-1: Formula: (= |v_#race~threads_alive~0_10| 0)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_10|}  AuxVars[]  AssignedVars[#race~threads_alive~0][105], [threadThread3of3ForFork0InUse, 72#L688-2true, 200#true, 156#L688-2true, Black: 194#true, 64#L688-1true, threadThread1of3ForFork0InUse, 196#(= |#race~threads_alive~0| 0), 68#L705-4true, threadThread2of3ForFork0InUse])
[2023-11-03 13:53:18,756 INFO  L383   tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event
[2023-11-03 13:53:18,756 INFO  L386   tUnfolder$Statistics]:   existing Event has 58 ancestors and is cut-off event
[2023-11-03 13:53:18,756 INFO  L386   tUnfolder$Statistics]:   existing Event has 58 ancestors and is cut-off event
[2023-11-03 13:53:18,756 INFO  L386   tUnfolder$Statistics]:   existing Event has 58 ancestors and is cut-off event
[2023-11-03 13:53:20,225 INFO  L130       PetriNetUnfolder]: 61911/103015 cut-off events.
[2023-11-03 13:53:20,225 INFO  L131       PetriNetUnfolder]: For 48263/52767 co-relation queries the response was YES.
[2023-11-03 13:53:20,409 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 239892 conditions, 103015 events. 61911/103015 cut-off events. For 48263/52767 co-relation queries the response was YES. Maximal size of possible extension queue 3459. Compared 973491 event pairs, 40172 based on Foata normal form. 626/93124 useless extension candidates. Maximal degree in co-relation 98726. Up to 73895 conditions per place. 
[2023-11-03 13:53:20,854 INFO  L137   encePairwiseOnDemand]: 297/307 looper letters, 65 selfloop transitions, 16 changer transitions 0/121 dead transitions.
[2023-11-03 13:53:20,854 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 121 transitions, 549 flow
[2023-11-03 13:53:20,854 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 13:53:20,854 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 13:53:20,855 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 571 transitions.
[2023-11-03 13:53:20,855 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6199782844733985
[2023-11-03 13:53:20,855 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 571 transitions.
[2023-11-03 13:53:20,855 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 571 transitions.
[2023-11-03 13:53:20,856 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:53:20,856 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 571 transitions.
[2023-11-03 13:53:20,857 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 190.33333333333334) internal successors, (571), 3 states have internal predecessors, (571), 0 states have call successors, (0), 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:53:20,858 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 307.0) internal successors, (1228), 4 states have internal predecessors, (1228), 0 states have call successors, (0), 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:53:20,858 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 307.0) internal successors, (1228), 4 states have internal predecessors, (1228), 0 states have call successors, (0), 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:53:20,858 INFO  L175             Difference]: Start difference. First operand has 85 places, 89 transitions, 287 flow. Second operand 3 states and 571 transitions.
[2023-11-03 13:53:20,858 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 121 transitions, 549 flow
[2023-11-03 13:53:20,918 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 121 transitions, 509 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-03 13:53:20,919 INFO  L231             Difference]: Finished difference. Result has 87 places, 103 transitions, 405 flow
[2023-11-03 13:53:20,919 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=405, PETRI_PLACES=87, PETRI_TRANSITIONS=103}
[2023-11-03 13:53:20,920 INFO  L288   CegarLoopForPetriNet]: 82 programPoint places, 5 predicate places.
[2023-11-03 13:53:20,920 INFO  L495      AbstractCegarLoop]: Abstraction has has 87 places, 103 transitions, 405 flow
[2023-11-03 13:53:20,920 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 170.0) internal successors, (510), 3 states have internal predecessors, (510), 0 states have call successors, (0), 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:53:20,920 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:53:20,920 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:53:20,920 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2023-11-03 13:53:20,920 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2023-11-03 13:53:20,921 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:53:20,921 INFO  L85        PathProgramCache]: Analyzing trace with hash -1657692777, now seen corresponding path program 1 times
[2023-11-03 13:53:20,921 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:53:20,921 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550840159]
[2023-11-03 13:53:20,921 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:53:20,921 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:53:20,926 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:53:20,936 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:53:20,937 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:53:20,937 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550840159]
[2023-11-03 13:53:20,937 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550840159] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:53:20,937 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:53:20,937 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-03 13:53:20,937 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796338758]
[2023-11-03 13:53:20,937 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:53:20,937 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 13:53:20,938 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:53:20,938 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 13:53:20,938 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 13:53:20,956 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 176 out of 307
[2023-11-03 13:53:20,957 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 103 transitions, 405 flow. Second operand  has 3 states, 3 states have (on average 177.33333333333334) internal successors, (532), 3 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:53:20,957 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:53:20,957 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 307
[2023-11-03 13:53:20,957 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:53:25,662 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([941] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_44| |v_threadThread1of3ForFork0_#t~nondet4_13|)  InVars {}  OutVars{threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_13|, #race~threads_alive~0=|v_#race~threads_alive~0_44|}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet4, #race~threads_alive~0][37], [threadThread3of3ForFork0InUse, 200#true, 156#L688-2true, Black: 196#(= |#race~threads_alive~0| 0), 206#true, 149#L685-2true, threadThread1of3ForFork0InUse, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, threadThread2of3ForFork0InUse, 119#L688-5true])
[2023-11-03 13:53:25,662 INFO  L383   tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event
[2023-11-03 13:53:25,662 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-11-03 13:53:25,663 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-11-03 13:53:25,663 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-11-03 13:53:25,670 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([984] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_50| |v_threadThread2of3ForFork0_#t~nondet4_17|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_17|, #race~threads_alive~0=|v_#race~threads_alive~0_50|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet4, #race~threads_alive~0][79], [threadThread3of3ForFork0InUse, 72#L688-2true, 9#L688-5true, 200#true, Black: 196#(= |#race~threads_alive~0| 0), 206#true, 149#L685-2true, threadThread1of3ForFork0InUse, 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), threadThread2of3ForFork0InUse])
[2023-11-03 13:53:25,670 INFO  L383   tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event
[2023-11-03 13:53:25,670 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-11-03 13:53:25,670 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-11-03 13:53:25,670 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-11-03 13:53:26,027 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([941] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_44| |v_threadThread1of3ForFork0_#t~nondet4_13|)  InVars {}  OutVars{threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_13|, #race~threads_alive~0=|v_#race~threads_alive~0_44|}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet4, #race~threads_alive~0][37], [threadThread3of3ForFork0InUse, 116#L685-4true, 200#true, 156#L688-2true, Black: 196#(= |#race~threads_alive~0| 0), 206#true, threadThread1of3ForFork0InUse, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, threadThread2of3ForFork0InUse, 119#L688-5true])
[2023-11-03 13:53:26,028 INFO  L383   tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event
[2023-11-03 13:53:26,028 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2023-11-03 13:53:26,028 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2023-11-03 13:53:26,028 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2023-11-03 13:53:26,033 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([984] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_50| |v_threadThread2of3ForFork0_#t~nondet4_17|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_17|, #race~threads_alive~0=|v_#race~threads_alive~0_50|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet4, #race~threads_alive~0][79], [threadThread3of3ForFork0InUse, 72#L688-2true, 116#L685-4true, 9#L688-5true, 200#true, Black: 196#(= |#race~threads_alive~0| 0), 206#true, threadThread1of3ForFork0InUse, 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), threadThread2of3ForFork0InUse])
[2023-11-03 13:53:26,033 INFO  L383   tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event
[2023-11-03 13:53:26,033 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2023-11-03 13:53:26,033 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2023-11-03 13:53:26,033 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2023-11-03 13:53:26,385 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([941] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_44| |v_threadThread1of3ForFork0_#t~nondet4_13|)  InVars {}  OutVars{threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_13|, #race~threads_alive~0=|v_#race~threads_alive~0_44|}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet4, #race~threads_alive~0][37], [threadThread3of3ForFork0InUse, 200#true, 156#L688-2true, Black: 196#(= |#race~threads_alive~0| 0), 70#L686true, 206#true, threadThread1of3ForFork0InUse, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, threadThread2of3ForFork0InUse, 119#L688-5true])
[2023-11-03 13:53:26,385 INFO  L383   tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event
[2023-11-03 13:53:26,385 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-11-03 13:53:26,386 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-11-03 13:53:26,386 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-11-03 13:53:26,390 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([984] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_50| |v_threadThread2of3ForFork0_#t~nondet4_17|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_17|, #race~threads_alive~0=|v_#race~threads_alive~0_50|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet4, #race~threads_alive~0][79], [threadThread3of3ForFork0InUse, 72#L688-2true, 9#L688-5true, 200#true, Black: 196#(= |#race~threads_alive~0| 0), 70#L686true, 206#true, threadThread1of3ForFork0InUse, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, threadThread2of3ForFork0InUse])
[2023-11-03 13:53:26,390 INFO  L383   tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event
[2023-11-03 13:53:26,390 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-11-03 13:53:26,390 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-11-03 13:53:26,390 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-11-03 13:53:26,724 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([859] L688-->L688-1: Formula: (= |v_#race~threads_alive~0_10| 0)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_10|}  AuxVars[]  AssignedVars[#race~threads_alive~0][107], [threadThread3of3ForFork0InUse, 72#L688-2true, 200#true, 156#L688-2true, Black: 194#true, 64#L688-1true, 206#true, threadThread1of3ForFork0InUse, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, threadThread2of3ForFork0InUse])
[2023-11-03 13:53:26,724 INFO  L383   tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event
[2023-11-03 13:53:26,724 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-11-03 13:53:26,724 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-11-03 13:53:26,724 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-11-03 13:53:27,118 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([941] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_44| |v_threadThread1of3ForFork0_#t~nondet4_13|)  InVars {}  OutVars{threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_13|, #race~threads_alive~0=|v_#race~threads_alive~0_44|}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet4, #race~threads_alive~0][37], [threadThread3of3ForFork0InUse, 200#true, 156#L688-2true, Black: 196#(= |#race~threads_alive~0| 0), 6#L688true, 206#true, threadThread1of3ForFork0InUse, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, threadThread2of3ForFork0InUse, 119#L688-5true])
[2023-11-03 13:53:27,118 INFO  L383   tUnfolder$Statistics]: this new event has 65 ancestors and is cut-off event
[2023-11-03 13:53:27,118 INFO  L386   tUnfolder$Statistics]:   existing Event has 65 ancestors and is cut-off event
[2023-11-03 13:53:27,118 INFO  L386   tUnfolder$Statistics]:   existing Event has 65 ancestors and is cut-off event
[2023-11-03 13:53:27,118 INFO  L386   tUnfolder$Statistics]:   existing Event has 65 ancestors and is cut-off event
[2023-11-03 13:53:27,121 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([984] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_50| |v_threadThread2of3ForFork0_#t~nondet4_17|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_17|, #race~threads_alive~0=|v_#race~threads_alive~0_50|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet4, #race~threads_alive~0][79], [threadThread3of3ForFork0InUse, 72#L688-2true, 9#L688-5true, 200#true, Black: 196#(= |#race~threads_alive~0| 0), 6#L688true, 206#true, threadThread1of3ForFork0InUse, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, threadThread2of3ForFork0InUse])
[2023-11-03 13:53:27,121 INFO  L383   tUnfolder$Statistics]: this new event has 65 ancestors and is cut-off event
[2023-11-03 13:53:27,121 INFO  L386   tUnfolder$Statistics]:   existing Event has 65 ancestors and is cut-off event
[2023-11-03 13:53:27,122 INFO  L386   tUnfolder$Statistics]:   existing Event has 65 ancestors and is cut-off event
[2023-11-03 13:53:27,122 INFO  L386   tUnfolder$Statistics]:   existing Event has 65 ancestors and is cut-off event
[2023-11-03 13:53:28,607 INFO  L130       PetriNetUnfolder]: 70720/120727 cut-off events.
[2023-11-03 13:53:28,608 INFO  L131       PetriNetUnfolder]: For 84139/95985 co-relation queries the response was YES.
[2023-11-03 13:53:28,846 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 288992 conditions, 120727 events. 70720/120727 cut-off events. For 84139/95985 co-relation queries the response was YES. Maximal size of possible extension queue 4315. Compared 1202860 event pairs, 40332 based on Foata normal form. 2269/110394 useless extension candidates. Maximal degree in co-relation 124221. Up to 73684 conditions per place. 
[2023-11-03 13:53:29,298 INFO  L137   encePairwiseOnDemand]: 301/307 looper letters, 76 selfloop transitions, 5 changer transitions 0/131 dead transitions.
[2023-11-03 13:53:29,298 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 131 transitions, 655 flow
[2023-11-03 13:53:29,299 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 13:53:29,299 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 13:53:29,300 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 591 transitions.
[2023-11-03 13:53:29,300 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6416938110749185
[2023-11-03 13:53:29,300 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 591 transitions.
[2023-11-03 13:53:29,300 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 591 transitions.
[2023-11-03 13:53:29,300 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:53:29,300 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 591 transitions.
[2023-11-03 13:53:29,302 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 197.0) internal successors, (591), 3 states have internal predecessors, (591), 0 states have call successors, (0), 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:53:29,303 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 307.0) internal successors, (1228), 4 states have internal predecessors, (1228), 0 states have call successors, (0), 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:53:29,303 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 307.0) internal successors, (1228), 4 states have internal predecessors, (1228), 0 states have call successors, (0), 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:53:29,303 INFO  L175             Difference]: Start difference. First operand has 87 places, 103 transitions, 405 flow. Second operand 3 states and 591 transitions.
[2023-11-03 13:53:29,303 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 131 transitions, 655 flow
[2023-11-03 13:53:29,393 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 131 transitions, 623 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-03 13:53:29,394 INFO  L231             Difference]: Finished difference. Result has 89 places, 107 transitions, 411 flow
[2023-11-03 13:53:29,394 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=373, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=411, PETRI_PLACES=89, PETRI_TRANSITIONS=107}
[2023-11-03 13:53:29,394 INFO  L288   CegarLoopForPetriNet]: 82 programPoint places, 7 predicate places.
[2023-11-03 13:53:29,395 INFO  L495      AbstractCegarLoop]: Abstraction has has 89 places, 107 transitions, 411 flow
[2023-11-03 13:53:29,395 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 177.33333333333334) internal successors, (532), 3 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:53:29,395 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:53:29,395 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:53:29,395 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2023-11-03 13:53:29,395 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2023-11-03 13:53:29,396 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:53:29,396 INFO  L85        PathProgramCache]: Analyzing trace with hash -2092777545, now seen corresponding path program 1 times
[2023-11-03 13:53:29,396 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:53:29,396 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688934811]
[2023-11-03 13:53:29,396 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:53:29,396 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:53:29,403 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:53:29,416 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:53:29,416 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:53:29,417 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688934811]
[2023-11-03 13:53:29,417 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688934811] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:53:29,417 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:53:29,417 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-03 13:53:29,417 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812805567]
[2023-11-03 13:53:29,417 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:53:29,417 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 13:53:29,417 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:53:29,418 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 13:53:29,418 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 13:53:29,438 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 174 out of 307
[2023-11-03 13:53:29,439 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 107 transitions, 411 flow. Second operand  has 3 states, 3 states have (on average 177.66666666666666) internal successors, (533), 3 states have internal predecessors, (533), 0 states have call successors, (0), 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:53:29,439 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:53:29,439 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 307
[2023-11-03 13:53:29,439 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:53:35,293 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([941] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_44| |v_threadThread1of3ForFork0_#t~nondet4_13|)  InVars {}  OutVars{threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_13|, #race~threads_alive~0=|v_#race~threads_alive~0_44|}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet4, #race~threads_alive~0][41], [threadThread3of3ForFork0InUse, Black: 208#(= |#race~data~0| 0), 156#L688-2true, Black: 196#(= |#race~threads_alive~0| 0), 206#true, 149#L685-2true, threadThread1of3ForFork0InUse, 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), threadThread2of3ForFork0InUse, 212#true, 119#L688-5true])
[2023-11-03 13:53:35,294 INFO  L383   tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event
[2023-11-03 13:53:35,294 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-11-03 13:53:35,294 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-11-03 13:53:35,294 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-11-03 13:53:35,302 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([984] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_50| |v_threadThread2of3ForFork0_#t~nondet4_17|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_17|, #race~threads_alive~0=|v_#race~threads_alive~0_50|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet4, #race~threads_alive~0][86], [threadThread3of3ForFork0InUse, 72#L688-2true, Black: 208#(= |#race~data~0| 0), 9#L688-5true, Black: 196#(= |#race~threads_alive~0| 0), 206#true, 149#L685-2true, threadThread1of3ForFork0InUse, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, threadThread2of3ForFork0InUse, 212#true])
[2023-11-03 13:53:35,302 INFO  L383   tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event
[2023-11-03 13:53:35,302 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-11-03 13:53:35,302 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-11-03 13:53:35,302 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-11-03 13:53:35,740 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([941] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_44| |v_threadThread1of3ForFork0_#t~nondet4_13|)  InVars {}  OutVars{threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_13|, #race~threads_alive~0=|v_#race~threads_alive~0_44|}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet4, #race~threads_alive~0][41], [threadThread3of3ForFork0InUse, 116#L685-4true, Black: 208#(= |#race~data~0| 0), 156#L688-2true, Black: 196#(= |#race~threads_alive~0| 0), 206#true, threadThread1of3ForFork0InUse, 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), threadThread2of3ForFork0InUse, 119#L688-5true, 212#true])
[2023-11-03 13:53:35,740 INFO  L383   tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event
[2023-11-03 13:53:35,740 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2023-11-03 13:53:35,740 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2023-11-03 13:53:35,740 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2023-11-03 13:53:35,745 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([984] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_50| |v_threadThread2of3ForFork0_#t~nondet4_17|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_17|, #race~threads_alive~0=|v_#race~threads_alive~0_50|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet4, #race~threads_alive~0][86], [threadThread3of3ForFork0InUse, 72#L688-2true, 116#L685-4true, 9#L688-5true, Black: 208#(= |#race~data~0| 0), Black: 196#(= |#race~threads_alive~0| 0), 206#true, threadThread1of3ForFork0InUse, 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), threadThread2of3ForFork0InUse, 212#true])
[2023-11-03 13:53:35,745 INFO  L383   tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event
[2023-11-03 13:53:35,745 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2023-11-03 13:53:35,745 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2023-11-03 13:53:35,745 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2023-11-03 13:53:36,194 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([941] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_44| |v_threadThread1of3ForFork0_#t~nondet4_13|)  InVars {}  OutVars{threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_13|, #race~threads_alive~0=|v_#race~threads_alive~0_44|}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet4, #race~threads_alive~0][41], [threadThread3of3ForFork0InUse, Black: 208#(= |#race~data~0| 0), 156#L688-2true, Black: 196#(= |#race~threads_alive~0| 0), 70#L686true, 206#true, threadThread1of3ForFork0InUse, 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), threadThread2of3ForFork0InUse, 119#L688-5true, 212#true])
[2023-11-03 13:53:36,195 INFO  L383   tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event
[2023-11-03 13:53:36,195 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-11-03 13:53:36,195 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-11-03 13:53:36,195 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-11-03 13:53:36,200 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([984] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_50| |v_threadThread2of3ForFork0_#t~nondet4_17|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_17|, #race~threads_alive~0=|v_#race~threads_alive~0_50|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet4, #race~threads_alive~0][86], [threadThread3of3ForFork0InUse, 72#L688-2true, 9#L688-5true, Black: 208#(= |#race~data~0| 0), Black: 196#(= |#race~threads_alive~0| 0), 70#L686true, 206#true, threadThread1of3ForFork0InUse, 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), threadThread2of3ForFork0InUse, 212#true])
[2023-11-03 13:53:36,200 INFO  L383   tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event
[2023-11-03 13:53:36,200 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-11-03 13:53:36,201 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-11-03 13:53:36,201 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-11-03 13:53:36,705 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([859] L688-->L688-1: Formula: (= |v_#race~threads_alive~0_10| 0)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_10|}  AuxVars[]  AssignedVars[#race~threads_alive~0][125], [threadThread3of3ForFork0InUse, 72#L688-2true, Black: 208#(= |#race~data~0| 0), 156#L688-2true, Black: 194#true, 206#true, 64#L688-1true, threadThread1of3ForFork0InUse, 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), threadThread2of3ForFork0InUse, 212#true])
[2023-11-03 13:53:36,705 INFO  L383   tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event
[2023-11-03 13:53:36,705 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-11-03 13:53:36,705 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-11-03 13:53:36,705 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-11-03 13:53:37,056 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([941] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_44| |v_threadThread1of3ForFork0_#t~nondet4_13|)  InVars {}  OutVars{threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_13|, #race~threads_alive~0=|v_#race~threads_alive~0_44|}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet4, #race~threads_alive~0][41], [threadThread3of3ForFork0InUse, Black: 208#(= |#race~data~0| 0), 156#L688-2true, Black: 196#(= |#race~threads_alive~0| 0), 6#L688true, 206#true, threadThread1of3ForFork0InUse, 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), threadThread2of3ForFork0InUse, 212#true, 119#L688-5true])
[2023-11-03 13:53:37,056 INFO  L383   tUnfolder$Statistics]: this new event has 65 ancestors and is cut-off event
[2023-11-03 13:53:37,057 INFO  L386   tUnfolder$Statistics]:   existing Event has 65 ancestors and is cut-off event
[2023-11-03 13:53:37,057 INFO  L386   tUnfolder$Statistics]:   existing Event has 65 ancestors and is cut-off event
[2023-11-03 13:53:37,057 INFO  L386   tUnfolder$Statistics]:   existing Event has 65 ancestors and is cut-off event
[2023-11-03 13:53:37,060 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([984] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_50| |v_threadThread2of3ForFork0_#t~nondet4_17|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_17|, #race~threads_alive~0=|v_#race~threads_alive~0_50|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet4, #race~threads_alive~0][86], [threadThread3of3ForFork0InUse, 72#L688-2true, 9#L688-5true, Black: 208#(= |#race~data~0| 0), Black: 196#(= |#race~threads_alive~0| 0), 6#L688true, 206#true, threadThread1of3ForFork0InUse, 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), threadThread2of3ForFork0InUse, 212#true])
[2023-11-03 13:53:37,060 INFO  L383   tUnfolder$Statistics]: this new event has 65 ancestors and is cut-off event
[2023-11-03 13:53:37,060 INFO  L386   tUnfolder$Statistics]:   existing Event has 65 ancestors and is cut-off event
[2023-11-03 13:53:37,060 INFO  L386   tUnfolder$Statistics]:   existing Event has 65 ancestors and is cut-off event
[2023-11-03 13:53:37,060 INFO  L386   tUnfolder$Statistics]:   existing Event has 65 ancestors and is cut-off event
[2023-11-03 13:53:38,611 INFO  L130       PetriNetUnfolder]: 80048/137390 cut-off events.
[2023-11-03 13:53:38,611 INFO  L131       PetriNetUnfolder]: For 90837/104282 co-relation queries the response was YES.
[2023-11-03 13:53:38,917 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 333514 conditions, 137390 events. 80048/137390 cut-off events. For 90837/104282 co-relation queries the response was YES. Maximal size of possible extension queue 5073. Compared 1412577 event pairs, 45808 based on Foata normal form. 2771/124165 useless extension candidates. Maximal degree in co-relation 239260. Up to 86226 conditions per place. 
[2023-11-03 13:53:39,442 INFO  L137   encePairwiseOnDemand]: 300/307 looper letters, 85 selfloop transitions, 9 changer transitions 0/146 dead transitions.
[2023-11-03 13:53:39,443 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 146 transitions, 747 flow
[2023-11-03 13:53:39,443 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 13:53:39,444 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 13:53:39,445 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 588 transitions.
[2023-11-03 13:53:39,445 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6384364820846905
[2023-11-03 13:53:39,445 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 588 transitions.
[2023-11-03 13:53:39,445 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 588 transitions.
[2023-11-03 13:53:39,445 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:53:39,446 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 588 transitions.
[2023-11-03 13:53:39,447 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 196.0) internal successors, (588), 3 states have internal predecessors, (588), 0 states have call successors, (0), 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:53:39,448 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 307.0) internal successors, (1228), 4 states have internal predecessors, (1228), 0 states have call successors, (0), 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:53:39,448 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 307.0) internal successors, (1228), 4 states have internal predecessors, (1228), 0 states have call successors, (0), 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:53:39,448 INFO  L175             Difference]: Start difference. First operand has 89 places, 107 transitions, 411 flow. Second operand 3 states and 588 transitions.
[2023-11-03 13:53:39,448 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 146 transitions, 747 flow
[2023-11-03 13:53:40,625 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 146 transitions, 731 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-03 13:53:40,627 INFO  L231             Difference]: Finished difference. Result has 91 places, 114 transitions, 477 flow
[2023-11-03 13:53:40,627 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=401, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=477, PETRI_PLACES=91, PETRI_TRANSITIONS=114}
[2023-11-03 13:53:40,628 INFO  L288   CegarLoopForPetriNet]: 82 programPoint places, 9 predicate places.
[2023-11-03 13:53:40,628 INFO  L495      AbstractCegarLoop]: Abstraction has has 91 places, 114 transitions, 477 flow
[2023-11-03 13:53:40,628 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 177.66666666666666) internal successors, (533), 3 states have internal predecessors, (533), 0 states have call successors, (0), 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:53:40,628 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:53:40,628 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:53:40,628 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2023-11-03 13:53:40,629 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2023-11-03 13:53:40,629 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:53:40,629 INFO  L85        PathProgramCache]: Analyzing trace with hash -694365201, now seen corresponding path program 1 times
[2023-11-03 13:53:40,630 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:53:40,630 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389318878]
[2023-11-03 13:53:40,630 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:53:40,630 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:53:40,638 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:53:40,651 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:53:40,652 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:53:40,652 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389318878]
[2023-11-03 13:53:40,652 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389318878] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:53:40,652 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:53:40,652 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-03 13:53:40,652 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661365888]
[2023-11-03 13:53:40,652 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:53:40,652 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 13:53:40,652 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:53:40,653 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 13:53:40,653 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 13:53:40,689 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 169 out of 307
[2023-11-03 13:53:40,690 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 114 transitions, 477 flow. Second operand  has 3 states, 3 states have (on average 174.33333333333334) internal successors, (523), 3 states have internal predecessors, (523), 0 states have call successors, (0), 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:53:40,690 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:53:40,690 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 307
[2023-11-03 13:53:40,690 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:53:46,415 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1031] L708-2-->ULTIMATE.startEXIT: Formula: (and (= |v_ULTIMATE.start_main_#res#1_50| v_~data~0_52) (= |v_ULTIMATE.start_main_#res#1_50| |v_ULTIMATE.start_#t~ret16#1_18|))  InVars {~data~0=v_~data~0_52}  OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_50|, ULTIMATE.start_#t~ret16#1=|v_ULTIMATE.start_#t~ret16#1_18|, ~data~0=v_~data~0_52}  AuxVars[]  AssignedVars[ULTIMATE.start_main_#res#1, ULTIMATE.start_#t~ret16#1][20], [threadThread3of3ForFork0InUse, 2#ULTIMATE.startEXITtrue, Black: 194#true, 14#L685true, 122#L688-1true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 206#true, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 96#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 212#true])
[2023-11-03 13:53:46,415 INFO  L383   tUnfolder$Statistics]: this new event has 58 ancestors and is cut-off event
[2023-11-03 13:53:46,415 INFO  L386   tUnfolder$Statistics]:   existing Event has 58 ancestors and is cut-off event
[2023-11-03 13:53:46,415 INFO  L386   tUnfolder$Statistics]:   existing Event has 58 ancestors and is cut-off event
[2023-11-03 13:53:46,415 INFO  L386   tUnfolder$Statistics]:   existing Event has 58 ancestors and is cut-off event
[2023-11-03 13:53:47,159 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1031] L708-2-->ULTIMATE.startEXIT: Formula: (and (= |v_ULTIMATE.start_main_#res#1_50| v_~data~0_52) (= |v_ULTIMATE.start_main_#res#1_50| |v_ULTIMATE.start_#t~ret16#1_18|))  InVars {~data~0=v_~data~0_52}  OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_50|, ULTIMATE.start_#t~ret16#1=|v_ULTIMATE.start_#t~ret16#1_18|, ~data~0=v_~data~0_52}  AuxVars[]  AssignedVars[ULTIMATE.start_main_#res#1, ULTIMATE.start_#t~ret16#1][20], [threadThread3of3ForFork0InUse, 2#ULTIMATE.startEXITtrue, Black: 194#true, 122#L688-1true, 149#L685-2true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 206#true, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 96#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 212#true])
[2023-11-03 13:53:47,159 INFO  L383   tUnfolder$Statistics]: this new event has 59 ancestors and is cut-off event
[2023-11-03 13:53:47,159 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-11-03 13:53:47,160 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-11-03 13:53:47,160 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-11-03 13:53:47,510 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([941] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_44| |v_threadThread1of3ForFork0_#t~nondet4_13|)  InVars {}  OutVars{threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_13|, #race~threads_alive~0=|v_#race~threads_alive~0_44|}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet4, #race~threads_alive~0][35], [threadThread3of3ForFork0InUse, 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), Black: 196#(= |#race~threads_alive~0| 0), 149#L685-2true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 119#L688-5true, Black: 208#(= |#race~data~0| 0), 156#L688-2true, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), threadThread1of3ForFork0InUse, 68#L705-4true, threadThread2of3ForFork0InUse, 212#true])
[2023-11-03 13:53:47,511 INFO  L383   tUnfolder$Statistics]: this new event has 60 ancestors and is cut-off event
[2023-11-03 13:53:47,511 INFO  L386   tUnfolder$Statistics]:   existing Event has 55 ancestors and is cut-off event
[2023-11-03 13:53:47,511 INFO  L386   tUnfolder$Statistics]:   existing Event has 55 ancestors and is cut-off event
[2023-11-03 13:53:47,511 INFO  L386   tUnfolder$Statistics]:   existing Event has 55 ancestors and is cut-off event
[2023-11-03 13:53:47,511 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([758] L705-4-->L705-1: Formula: (= 0 |v_#race~threads_alive~0_7|)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|}  AuxVars[]  AssignedVars[#race~threads_alive~0][18], [threadThread3of3ForFork0InUse, 72#L688-2true, Black: 194#true, 80#L705-1true, 149#L685-2true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), 156#L688-2true, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 212#true])
[2023-11-03 13:53:47,511 INFO  L383   tUnfolder$Statistics]: this new event has 59 ancestors and is cut-off event
[2023-11-03 13:53:47,511 INFO  L386   tUnfolder$Statistics]:   existing Event has 54 ancestors and is cut-off event
[2023-11-03 13:53:47,511 INFO  L386   tUnfolder$Statistics]:   existing Event has 54 ancestors and is cut-off event
[2023-11-03 13:53:47,511 INFO  L386   tUnfolder$Statistics]:   existing Event has 54 ancestors and is cut-off event
[2023-11-03 13:53:47,511 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([984] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_50| |v_threadThread2of3ForFork0_#t~nondet4_17|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_17|, #race~threads_alive~0=|v_#race~threads_alive~0_50|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet4, #race~threads_alive~0][91], [threadThread3of3ForFork0InUse, 72#L688-2true, 9#L688-5true, Black: 196#(= |#race~threads_alive~0| 0), 149#L685-2true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), threadThread1of3ForFork0InUse, 68#L705-4true, threadThread2of3ForFork0InUse, 212#true])
[2023-11-03 13:53:47,511 INFO  L383   tUnfolder$Statistics]: this new event has 60 ancestors and is cut-off event
[2023-11-03 13:53:47,511 INFO  L386   tUnfolder$Statistics]:   existing Event has 55 ancestors and is cut-off event
[2023-11-03 13:53:47,511 INFO  L386   tUnfolder$Statistics]:   existing Event has 55 ancestors and is cut-off event
[2023-11-03 13:53:47,512 INFO  L386   tUnfolder$Statistics]:   existing Event has 55 ancestors and is cut-off event
[2023-11-03 13:53:48,307 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([985] L685-2-->L685-4: Formula: (= |v_#race~data~0_21| |v_threadThread3of3ForFork0_#t~nondet2_15|)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_21|, threadThread3of3ForFork0_#t~nondet2=|v_threadThread3of3ForFork0_#t~nondet2_15|}  AuxVars[]  AssignedVars[#race~data~0, threadThread3of3ForFork0_#t~nondet2][120], [threadThread3of3ForFork0InUse, Black: 194#true, 122#L688-1true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 116#L685-4true, Black: 208#(= |#race~data~0| 0), 96#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 168#L708-2true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 212#true])
[2023-11-03 13:53:48,307 INFO  L383   tUnfolder$Statistics]: this new event has 59 ancestors and is not cut-off event
[2023-11-03 13:53:48,307 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is not cut-off event
[2023-11-03 13:53:48,307 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is not cut-off event
[2023-11-03 13:53:48,307 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is not cut-off event
[2023-11-03 13:53:48,419 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([941] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_44| |v_threadThread1of3ForFork0_#t~nondet4_13|)  InVars {}  OutVars{threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_13|, #race~threads_alive~0=|v_#race~threads_alive~0_44|}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet4, #race~threads_alive~0][35], [threadThread3of3ForFork0InUse, 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), Black: 196#(= |#race~threads_alive~0| 0), Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 119#L688-5true, 116#L685-4true, Black: 208#(= |#race~data~0| 0), 156#L688-2true, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), threadThread1of3ForFork0InUse, 68#L705-4true, threadThread2of3ForFork0InUse, 212#true])
[2023-11-03 13:53:48,420 INFO  L383   tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event
[2023-11-03 13:53:48,420 INFO  L386   tUnfolder$Statistics]:   existing Event has 56 ancestors and is cut-off event
[2023-11-03 13:53:48,420 INFO  L386   tUnfolder$Statistics]:   existing Event has 56 ancestors and is cut-off event
[2023-11-03 13:53:48,420 INFO  L386   tUnfolder$Statistics]:   existing Event has 56 ancestors and is cut-off event
[2023-11-03 13:53:48,420 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([758] L705-4-->L705-1: Formula: (= 0 |v_#race~threads_alive~0_7|)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|}  AuxVars[]  AssignedVars[#race~threads_alive~0][18], [threadThread3of3ForFork0InUse, 72#L688-2true, Black: 194#true, 80#L705-1true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 116#L685-4true, Black: 208#(= |#race~data~0| 0), 156#L688-2true, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 212#true])
[2023-11-03 13:53:48,420 INFO  L383   tUnfolder$Statistics]: this new event has 60 ancestors and is cut-off event
[2023-11-03 13:53:48,420 INFO  L386   tUnfolder$Statistics]:   existing Event has 55 ancestors and is cut-off event
[2023-11-03 13:53:48,420 INFO  L386   tUnfolder$Statistics]:   existing Event has 55 ancestors and is cut-off event
[2023-11-03 13:53:48,420 INFO  L386   tUnfolder$Statistics]:   existing Event has 55 ancestors and is cut-off event
[2023-11-03 13:53:48,420 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([984] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_50| |v_threadThread2of3ForFork0_#t~nondet4_17|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_17|, #race~threads_alive~0=|v_#race~threads_alive~0_50|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet4, #race~threads_alive~0][91], [threadThread3of3ForFork0InUse, 72#L688-2true, 9#L688-5true, Black: 196#(= |#race~threads_alive~0| 0), 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 116#L685-4true, Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), threadThread1of3ForFork0InUse, 68#L705-4true, threadThread2of3ForFork0InUse, 212#true])
[2023-11-03 13:53:48,420 INFO  L383   tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event
[2023-11-03 13:53:48,420 INFO  L386   tUnfolder$Statistics]:   existing Event has 56 ancestors and is cut-off event
[2023-11-03 13:53:48,420 INFO  L386   tUnfolder$Statistics]:   existing Event has 56 ancestors and is cut-off event
[2023-11-03 13:53:48,420 INFO  L386   tUnfolder$Statistics]:   existing Event has 56 ancestors and is cut-off event
[2023-11-03 13:53:49,067 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([941] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_44| |v_threadThread1of3ForFork0_#t~nondet4_13|)  InVars {}  OutVars{threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_13|, #race~threads_alive~0=|v_#race~threads_alive~0_44|}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet4, #race~threads_alive~0][35], [threadThread3of3ForFork0InUse, 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), Black: 196#(= |#race~threads_alive~0| 0), 70#L686true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 119#L688-5true, Black: 208#(= |#race~data~0| 0), 156#L688-2true, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), threadThread1of3ForFork0InUse, 68#L705-4true, threadThread2of3ForFork0InUse, 212#true])
[2023-11-03 13:53:49,067 INFO  L383   tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event
[2023-11-03 13:53:49,067 INFO  L386   tUnfolder$Statistics]:   existing Event has 57 ancestors and is cut-off event
[2023-11-03 13:53:49,067 INFO  L386   tUnfolder$Statistics]:   existing Event has 57 ancestors and is cut-off event
[2023-11-03 13:53:49,067 INFO  L386   tUnfolder$Statistics]:   existing Event has 57 ancestors and is cut-off event
[2023-11-03 13:53:49,067 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([758] L705-4-->L705-1: Formula: (= 0 |v_#race~threads_alive~0_7|)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|}  AuxVars[]  AssignedVars[#race~threads_alive~0][18], [threadThread3of3ForFork0InUse, 72#L688-2true, Black: 194#true, 70#L686true, 80#L705-1true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), 156#L688-2true, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 212#true])
[2023-11-03 13:53:49,067 INFO  L383   tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event
[2023-11-03 13:53:49,067 INFO  L386   tUnfolder$Statistics]:   existing Event has 56 ancestors and is cut-off event
[2023-11-03 13:53:49,067 INFO  L386   tUnfolder$Statistics]:   existing Event has 56 ancestors and is cut-off event
[2023-11-03 13:53:49,067 INFO  L386   tUnfolder$Statistics]:   existing Event has 56 ancestors and is cut-off event
[2023-11-03 13:53:49,068 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([984] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_50| |v_threadThread2of3ForFork0_#t~nondet4_17|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_17|, #race~threads_alive~0=|v_#race~threads_alive~0_50|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet4, #race~threads_alive~0][91], [threadThread3of3ForFork0InUse, 72#L688-2true, 9#L688-5true, Black: 196#(= |#race~threads_alive~0| 0), 70#L686true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), threadThread1of3ForFork0InUse, 68#L705-4true, threadThread2of3ForFork0InUse, 212#true])
[2023-11-03 13:53:49,068 INFO  L383   tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event
[2023-11-03 13:53:49,068 INFO  L386   tUnfolder$Statistics]:   existing Event has 57 ancestors and is cut-off event
[2023-11-03 13:53:49,068 INFO  L386   tUnfolder$Statistics]:   existing Event has 57 ancestors and is cut-off event
[2023-11-03 13:53:49,068 INFO  L386   tUnfolder$Statistics]:   existing Event has 57 ancestors and is cut-off event
[2023-11-03 13:53:50,424 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([941] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_44| |v_threadThread1of3ForFork0_#t~nondet4_13|)  InVars {}  OutVars{threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_13|, #race~threads_alive~0=|v_#race~threads_alive~0_44|}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet4, #race~threads_alive~0][35], [threadThread3of3ForFork0InUse, 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), Black: 196#(= |#race~threads_alive~0| 0), 6#L688true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 119#L688-5true, Black: 208#(= |#race~data~0| 0), 156#L688-2true, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), threadThread1of3ForFork0InUse, 68#L705-4true, threadThread2of3ForFork0InUse, 212#true])
[2023-11-03 13:53:50,425 INFO  L383   tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event
[2023-11-03 13:53:50,425 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-11-03 13:53:50,425 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-11-03 13:53:50,425 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-11-03 13:53:50,425 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([758] L705-4-->L705-1: Formula: (= 0 |v_#race~threads_alive~0_7|)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|}  AuxVars[]  AssignedVars[#race~threads_alive~0][18], [threadThread3of3ForFork0InUse, 72#L688-2true, Black: 194#true, 80#L705-1true, 6#L688true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), 156#L688-2true, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 212#true])
[2023-11-03 13:53:50,426 INFO  L383   tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event
[2023-11-03 13:53:50,426 INFO  L386   tUnfolder$Statistics]:   existing Event has 58 ancestors and is cut-off event
[2023-11-03 13:53:50,426 INFO  L386   tUnfolder$Statistics]:   existing Event has 58 ancestors and is cut-off event
[2023-11-03 13:53:50,426 INFO  L386   tUnfolder$Statistics]:   existing Event has 58 ancestors and is cut-off event
[2023-11-03 13:53:50,426 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([984] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_50| |v_threadThread2of3ForFork0_#t~nondet4_17|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_17|, #race~threads_alive~0=|v_#race~threads_alive~0_50|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet4, #race~threads_alive~0][91], [threadThread3of3ForFork0InUse, 72#L688-2true, 9#L688-5true, Black: 196#(= |#race~threads_alive~0| 0), 6#L688true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), threadThread1of3ForFork0InUse, 68#L705-4true, threadThread2of3ForFork0InUse, 212#true])
[2023-11-03 13:53:50,426 INFO  L383   tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event
[2023-11-03 13:53:50,426 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-11-03 13:53:50,426 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-11-03 13:53:50,426 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-11-03 13:53:50,426 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([859] L688-->L688-1: Formula: (= |v_#race~threads_alive~0_10| 0)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_10|}  AuxVars[]  AssignedVars[#race~threads_alive~0][129], [threadThread3of3ForFork0InUse, 72#L688-2true, Black: 194#true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), 156#L688-2true, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 64#L688-1true, threadThread1of3ForFork0InUse, 68#L705-4true, threadThread2of3ForFork0InUse, 212#true])
[2023-11-03 13:53:50,426 INFO  L383   tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event
[2023-11-03 13:53:50,426 INFO  L386   tUnfolder$Statistics]:   existing Event has 58 ancestors and is cut-off event
[2023-11-03 13:53:50,426 INFO  L386   tUnfolder$Statistics]:   existing Event has 58 ancestors and is cut-off event
[2023-11-03 13:53:50,426 INFO  L386   tUnfolder$Statistics]:   existing Event has 58 ancestors and is cut-off event
[2023-11-03 13:53:54,052 INFO  L130       PetriNetUnfolder]: 117057/193039 cut-off events.
[2023-11-03 13:53:54,052 INFO  L131       PetriNetUnfolder]: For 158026/169600 co-relation queries the response was YES.
[2023-11-03 13:53:54,509 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 504642 conditions, 193039 events. 117057/193039 cut-off events. For 158026/169600 co-relation queries the response was YES. Maximal size of possible extension queue 6334. Compared 1920667 event pairs, 63393 based on Foata normal form. 1083/172268 useless extension candidates. Maximal degree in co-relation 281947. Up to 136766 conditions per place. 
[2023-11-03 13:53:55,268 INFO  L137   encePairwiseOnDemand]: 296/307 looper letters, 95 selfloop transitions, 28 changer transitions 0/164 dead transitions.
[2023-11-03 13:53:55,268 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 164 transitions, 937 flow
[2023-11-03 13:53:55,268 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 13:53:55,269 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 13:53:55,269 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 580 transitions.
[2023-11-03 13:53:55,270 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6297502714440825
[2023-11-03 13:53:55,270 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 580 transitions.
[2023-11-03 13:53:55,270 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 580 transitions.
[2023-11-03 13:53:55,270 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:53:55,270 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 580 transitions.
[2023-11-03 13:53:55,271 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 193.33333333333334) internal successors, (580), 3 states have internal predecessors, (580), 0 states have call successors, (0), 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:53:55,272 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 307.0) internal successors, (1228), 4 states have internal predecessors, (1228), 0 states have call successors, (0), 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:53:55,273 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 307.0) internal successors, (1228), 4 states have internal predecessors, (1228), 0 states have call successors, (0), 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:53:55,273 INFO  L175             Difference]: Start difference. First operand has 91 places, 114 transitions, 477 flow. Second operand 3 states and 580 transitions.
[2023-11-03 13:53:55,273 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 164 transitions, 937 flow
[2023-11-03 13:53:55,735 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 164 transitions, 919 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-03 13:53:55,736 INFO  L231             Difference]: Finished difference. Result has 93 places, 138 transitions, 749 flow
[2023-11-03 13:53:55,737 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=459, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=749, PETRI_PLACES=93, PETRI_TRANSITIONS=138}
[2023-11-03 13:53:55,737 INFO  L288   CegarLoopForPetriNet]: 82 programPoint places, 11 predicate places.
[2023-11-03 13:53:55,737 INFO  L495      AbstractCegarLoop]: Abstraction has has 93 places, 138 transitions, 749 flow
[2023-11-03 13:53:55,737 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 174.33333333333334) internal successors, (523), 3 states have internal predecessors, (523), 0 states have call successors, (0), 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:53:55,737 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:53:55,738 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:53:55,738 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2023-11-03 13:53:55,738 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2023-11-03 13:53:55,738 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:53:55,738 INFO  L85        PathProgramCache]: Analyzing trace with hash -1017840435, now seen corresponding path program 1 times
[2023-11-03 13:53:55,738 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:53:55,738 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755429531]
[2023-11-03 13:53:55,738 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:53:55,739 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:53:55,748 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:53:55,781 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:53:55,781 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:53:55,781 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755429531]
[2023-11-03 13:53:55,781 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755429531] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-03 13:53:55,781 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956720455]
[2023-11-03 13:53:55,781 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:53:55,781 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 13:53:55,782 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 13:53:55,783 INFO  L229       MonitoredProcess]: Starting monitored process 4 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:53:55,786 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2023-11-03 13:53:55,879 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:53:55,880 INFO  L263         TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 4 conjunts are in the unsatisfiable core
[2023-11-03 13:53:55,881 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 13:53:55,926 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:53:55,926 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-11-03 13:53:55,927 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [956720455] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:53:55,927 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2023-11-03 13:53:55,927 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6
[2023-11-03 13:53:55,927 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998831768]
[2023-11-03 13:53:55,927 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:53:55,928 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-11-03 13:53:55,928 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:53:55,928 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-11-03 13:53:55,928 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2023-11-03 13:53:55,951 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 172 out of 307
[2023-11-03 13:53:55,952 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 138 transitions, 749 flow. Second operand  has 5 states, 5 states have (on average 174.8) internal successors, (874), 5 states have internal predecessors, (874), 0 states have call successors, (0), 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:53:55,952 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:53:55,952 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 307
[2023-11-03 13:53:55,952 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:54:04,216 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([828] L705-2-->L706: Formula: (not (= v_~threads_alive~0_5 0))  InVars {~threads_alive~0=v_~threads_alive~0_5}  OutVars{~threads_alive~0=v_~threads_alive~0_5}  AuxVars[]  AssignedVars[][22], [threadThread3of3ForFork0InUse, 170#L688-1true, Black: 194#true, 14#L685true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 146#L706true, Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 103#threadEXITtrue, threadThread1of3ForFork0InUse, 228#(<= 1 ~threads_alive~0), Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), threadThread2of3ForFork0InUse])
[2023-11-03 13:54:04,216 INFO  L383   tUnfolder$Statistics]: this new event has 58 ancestors and is cut-off event
[2023-11-03 13:54:04,216 INFO  L386   tUnfolder$Statistics]:   existing Event has 58 ancestors and is cut-off event
[2023-11-03 13:54:04,216 INFO  L386   tUnfolder$Statistics]:   existing Event has 58 ancestors and is cut-off event
[2023-11-03 13:54:04,216 INFO  L386   tUnfolder$Statistics]:   existing Event has 58 ancestors and is cut-off event
[2023-11-03 13:54:05,244 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([828] L705-2-->L706: Formula: (not (= v_~threads_alive~0_5 0))  InVars {~threads_alive~0=v_~threads_alive~0_5}  OutVars{~threads_alive~0=v_~threads_alive~0_5}  AuxVars[]  AssignedVars[][22], [threadThread3of3ForFork0InUse, Black: 194#true, 14#L685true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 146#L706true, Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 96#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 103#threadEXITtrue, threadThread1of3ForFork0InUse, 228#(<= 1 ~threads_alive~0), threadThread2of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|)])
[2023-11-03 13:54:05,245 INFO  L383   tUnfolder$Statistics]: this new event has 59 ancestors and is cut-off event
[2023-11-03 13:54:05,245 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-11-03 13:54:05,245 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-11-03 13:54:05,245 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-11-03 13:54:05,459 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([888] L688-2-->L688-3: Formula: (= v_~threads_alive~0_7 (+ v_~threads_alive~0_6 2))  InVars {~threads_alive~0=v_~threads_alive~0_7}  OutVars{~threads_alive~0=v_~threads_alive~0_6}  AuxVars[]  AssignedVars[~threads_alive~0][119], [threadThread3of3ForFork0InUse, Black: 194#true, 224#true, 14#L685true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), 143#L688-3true, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 103#threadEXITtrue, threadThread1of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), threadThread2of3ForFork0InUse, 163#L705-2true])
[2023-11-03 13:54:05,459 INFO  L383   tUnfolder$Statistics]: this new event has 59 ancestors and is cut-off event
[2023-11-03 13:54:05,459 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-11-03 13:54:05,459 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-11-03 13:54:05,460 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-11-03 13:54:05,460 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([828] L705-2-->L706: Formula: (not (= v_~threads_alive~0_5 0))  InVars {~threads_alive~0=v_~threads_alive~0_5}  OutVars{~threads_alive~0=v_~threads_alive~0_5}  AuxVars[]  AssignedVars[][22], [threadThread3of3ForFork0InUse, 170#L688-1true, Black: 194#true, 149#L685-2true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 146#L706true, Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 103#threadEXITtrue, threadThread1of3ForFork0InUse, 228#(<= 1 ~threads_alive~0), Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), threadThread2of3ForFork0InUse])
[2023-11-03 13:54:05,460 INFO  L383   tUnfolder$Statistics]: this new event has 59 ancestors and is cut-off event
[2023-11-03 13:54:05,460 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-11-03 13:54:05,460 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-11-03 13:54:05,460 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-11-03 13:54:05,461 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([888] L688-2-->L688-3: Formula: (= v_~threads_alive~0_7 (+ v_~threads_alive~0_6 2))  InVars {~threads_alive~0=v_~threads_alive~0_7}  OutVars{~threads_alive~0=v_~threads_alive~0_6}  AuxVars[]  AssignedVars[~threads_alive~0][119], [threadThread3of3ForFork0InUse, Black: 194#true, 224#true, 149#L685-2true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), 143#L688-3true, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 103#threadEXITtrue, threadThread1of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), threadThread2of3ForFork0InUse, 163#L705-2true])
[2023-11-03 13:54:05,461 INFO  L383   tUnfolder$Statistics]: this new event has 60 ancestors and is cut-off event
[2023-11-03 13:54:05,461 INFO  L386   tUnfolder$Statistics]:   existing Event has 60 ancestors and is cut-off event
[2023-11-03 13:54:05,462 INFO  L386   tUnfolder$Statistics]:   existing Event has 60 ancestors and is cut-off event
[2023-11-03 13:54:05,462 INFO  L386   tUnfolder$Statistics]:   existing Event has 60 ancestors and is cut-off event
[2023-11-03 13:54:06,533 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([828] L705-2-->L706: Formula: (not (= v_~threads_alive~0_5 0))  InVars {~threads_alive~0=v_~threads_alive~0_5}  OutVars{~threads_alive~0=v_~threads_alive~0_5}  AuxVars[]  AssignedVars[][22], [threadThread3of3ForFork0InUse, Black: 194#true, 149#L685-2true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 146#L706true, Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 96#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 103#threadEXITtrue, threadThread1of3ForFork0InUse, 228#(<= 1 ~threads_alive~0), threadThread2of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|)])
[2023-11-03 13:54:06,533 INFO  L383   tUnfolder$Statistics]: this new event has 60 ancestors and is cut-off event
[2023-11-03 13:54:06,533 INFO  L386   tUnfolder$Statistics]:   existing Event has 60 ancestors and is cut-off event
[2023-11-03 13:54:06,533 INFO  L386   tUnfolder$Statistics]:   existing Event has 60 ancestors and is cut-off event
[2023-11-03 13:54:06,533 INFO  L386   tUnfolder$Statistics]:   existing Event has 60 ancestors and is cut-off event
[2023-11-03 13:54:06,616 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([828] L705-2-->L706: Formula: (not (= v_~threads_alive~0_5 0))  InVars {~threads_alive~0=v_~threads_alive~0_5}  OutVars{~threads_alive~0=v_~threads_alive~0_5}  AuxVars[]  AssignedVars[][22], [threadThread3of3ForFork0InUse, 170#L688-1true, Black: 194#true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 146#L706true, 116#L685-4true, Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 103#threadEXITtrue, threadThread1of3ForFork0InUse, 228#(<= 1 ~threads_alive~0), Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), threadThread2of3ForFork0InUse])
[2023-11-03 13:54:06,616 INFO  L383   tUnfolder$Statistics]: this new event has 60 ancestors and is cut-off event
[2023-11-03 13:54:06,616 INFO  L386   tUnfolder$Statistics]:   existing Event has 60 ancestors and is cut-off event
[2023-11-03 13:54:06,616 INFO  L386   tUnfolder$Statistics]:   existing Event has 60 ancestors and is cut-off event
[2023-11-03 13:54:06,616 INFO  L386   tUnfolder$Statistics]:   existing Event has 60 ancestors and is cut-off event
[2023-11-03 13:54:06,617 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([888] L688-2-->L688-3: Formula: (= v_~threads_alive~0_7 (+ v_~threads_alive~0_6 2))  InVars {~threads_alive~0=v_~threads_alive~0_7}  OutVars{~threads_alive~0=v_~threads_alive~0_6}  AuxVars[]  AssignedVars[~threads_alive~0][119], [threadThread3of3ForFork0InUse, Black: 194#true, 224#true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 116#L685-4true, Black: 208#(= |#race~data~0| 0), 143#L688-3true, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 103#threadEXITtrue, threadThread1of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), threadThread2of3ForFork0InUse, 163#L705-2true])
[2023-11-03 13:54:06,617 INFO  L383   tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event
[2023-11-03 13:54:06,617 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-11-03 13:54:06,617 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-11-03 13:54:06,618 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-11-03 13:54:07,436 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([859] L688-->L688-1: Formula: (= |v_#race~threads_alive~0_10| 0)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_10|}  AuxVars[]  AssignedVars[#race~threads_alive~0][328], [threadThread3of3ForFork0InUse, Black: 194#true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), 96#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 76#L688-6true, 64#L688-1true, threadThread1of3ForFork0InUse, 228#(<= 1 ~threads_alive~0), 163#L705-2true, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), threadThread2of3ForFork0InUse])
[2023-11-03 13:54:07,437 INFO  L383   tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event
[2023-11-03 13:54:07,437 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-11-03 13:54:07,437 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-11-03 13:54:07,437 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-11-03 13:54:07,865 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([828] L705-2-->L706: Formula: (not (= v_~threads_alive~0_5 0))  InVars {~threads_alive~0=v_~threads_alive~0_5}  OutVars{~threads_alive~0=v_~threads_alive~0_5}  AuxVars[]  AssignedVars[][22], [threadThread3of3ForFork0InUse, Black: 194#true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 146#L706true, 116#L685-4true, Black: 208#(= |#race~data~0| 0), 96#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 103#threadEXITtrue, threadThread1of3ForFork0InUse, 228#(<= 1 ~threads_alive~0), threadThread2of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|)])
[2023-11-03 13:54:07,866 INFO  L383   tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event
[2023-11-03 13:54:07,866 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-11-03 13:54:07,866 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-11-03 13:54:07,866 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-11-03 13:54:07,947 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([828] L705-2-->L706: Formula: (not (= v_~threads_alive~0_5 0))  InVars {~threads_alive~0=v_~threads_alive~0_5}  OutVars{~threads_alive~0=v_~threads_alive~0_5}  AuxVars[]  AssignedVars[][22], [threadThread3of3ForFork0InUse, 170#L688-1true, Black: 194#true, 70#L686true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 146#L706true, Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 103#threadEXITtrue, threadThread1of3ForFork0InUse, 228#(<= 1 ~threads_alive~0), Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), threadThread2of3ForFork0InUse])
[2023-11-03 13:54:07,948 INFO  L383   tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event
[2023-11-03 13:54:07,948 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-11-03 13:54:07,948 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-11-03 13:54:07,948 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-11-03 13:54:07,949 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([888] L688-2-->L688-3: Formula: (= v_~threads_alive~0_7 (+ v_~threads_alive~0_6 2))  InVars {~threads_alive~0=v_~threads_alive~0_7}  OutVars{~threads_alive~0=v_~threads_alive~0_6}  AuxVars[]  AssignedVars[~threads_alive~0][119], [threadThread3of3ForFork0InUse, Black: 194#true, 224#true, 70#L686true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), 143#L688-3true, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 103#threadEXITtrue, threadThread1of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), threadThread2of3ForFork0InUse, 163#L705-2true])
[2023-11-03 13:54:07,949 INFO  L383   tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event
[2023-11-03 13:54:07,949 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2023-11-03 13:54:07,949 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2023-11-03 13:54:07,949 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2023-11-03 13:54:08,044 INFO  L381   tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([859] L688-->L688-1: Formula: (= |v_#race~threads_alive~0_10| 0)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_10|}  AuxVars[]  AssignedVars[#race~threads_alive~0][328], [threadThread3of3ForFork0InUse, Black: 194#true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 96#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 76#L688-6true, 64#L688-1true, threadThread1of3ForFork0InUse, 228#(<= 1 ~threads_alive~0), Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), threadThread2of3ForFork0InUse, 163#L705-2true])
[2023-11-03 13:54:08,044 INFO  L383   tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event
[2023-11-03 13:54:08,044 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-11-03 13:54:08,044 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-11-03 13:54:08,044 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-11-03 13:54:08,044 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-11-03 13:54:08,699 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([859] L688-->L688-1: Formula: (= |v_#race~threads_alive~0_10| 0)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_10|}  AuxVars[]  AssignedVars[#race~threads_alive~0][328], [threadThread3of3ForFork0InUse, Black: 194#true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), 156#L688-2true, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 160#L698-2true, 76#L688-6true, 64#L688-1true, threadThread1of3ForFork0InUse, 228#(<= 1 ~threads_alive~0), Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), threadThread2of3ForFork0InUse])
[2023-11-03 13:54:08,699 INFO  L383   tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event
[2023-11-03 13:54:08,699 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-11-03 13:54:08,699 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-11-03 13:54:08,699 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-11-03 13:54:09,067 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([828] L705-2-->L706: Formula: (not (= v_~threads_alive~0_5 0))  InVars {~threads_alive~0=v_~threads_alive~0_5}  OutVars{~threads_alive~0=v_~threads_alive~0_5}  AuxVars[]  AssignedVars[][22], [threadThread3of3ForFork0InUse, Black: 194#true, 70#L686true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 146#L706true, Black: 208#(= |#race~data~0| 0), 96#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 103#threadEXITtrue, threadThread1of3ForFork0InUse, 228#(<= 1 ~threads_alive~0), threadThread2of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|)])
[2023-11-03 13:54:09,067 INFO  L383   tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event
[2023-11-03 13:54:09,067 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2023-11-03 13:54:09,067 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2023-11-03 13:54:09,067 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2023-11-03 13:54:09,982 INFO  L381   tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([859] L688-->L688-1: Formula: (= |v_#race~threads_alive~0_10| 0)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_10|}  AuxVars[]  AssignedVars[#race~threads_alive~0][328], [threadThread3of3ForFork0InUse, Black: 194#true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), 156#L688-2true, 160#L698-2true, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 76#L688-6true, 64#L688-1true, threadThread1of3ForFork0InUse, 228#(<= 1 ~threads_alive~0), threadThread2of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|)])
[2023-11-03 13:54:09,982 INFO  L383   tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event
[2023-11-03 13:54:09,982 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-11-03 13:54:09,982 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-11-03 13:54:09,982 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-11-03 13:54:09,982 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-11-03 13:54:10,570 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([828] L705-2-->L706: Formula: (not (= v_~threads_alive~0_5 0))  InVars {~threads_alive~0=v_~threads_alive~0_5}  OutVars{~threads_alive~0=v_~threads_alive~0_5}  AuxVars[]  AssignedVars[][22], [threadThread3of3ForFork0InUse, 170#L688-1true, Black: 194#true, 6#L688true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 146#L706true, Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 103#threadEXITtrue, threadThread1of3ForFork0InUse, 228#(<= 1 ~threads_alive~0), Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), threadThread2of3ForFork0InUse])
[2023-11-03 13:54:10,570 INFO  L383   tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event
[2023-11-03 13:54:10,571 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-11-03 13:54:10,571 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-11-03 13:54:10,571 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-11-03 13:54:10,572 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([888] L688-2-->L688-3: Formula: (= v_~threads_alive~0_7 (+ v_~threads_alive~0_6 2))  InVars {~threads_alive~0=v_~threads_alive~0_7}  OutVars{~threads_alive~0=v_~threads_alive~0_6}  AuxVars[]  AssignedVars[~threads_alive~0][119], [threadThread3of3ForFork0InUse, Black: 194#true, 224#true, 6#L688true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), 143#L688-3true, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 103#threadEXITtrue, threadThread1of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), threadThread2of3ForFork0InUse, 163#L705-2true])
[2023-11-03 13:54:10,572 INFO  L383   tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event
[2023-11-03 13:54:10,572 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-11-03 13:54:10,572 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-11-03 13:54:10,572 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-11-03 13:54:10,654 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([859] L688-->L688-1: Formula: (= |v_#race~threads_alive~0_10| 0)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_10|}  AuxVars[]  AssignedVars[#race~threads_alive~0][230], [threadThread3of3ForFork0InUse, 170#L688-1true, Black: 194#true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 64#L688-1true, 103#threadEXITtrue, threadThread1of3ForFork0InUse, 228#(<= 1 ~threads_alive~0), Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), 163#L705-2true, threadThread2of3ForFork0InUse])
[2023-11-03 13:54:10,654 INFO  L383   tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event
[2023-11-03 13:54:10,654 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-11-03 13:54:10,655 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-11-03 13:54:10,655 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-11-03 13:54:11,205 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([859] L688-->L688-1: Formula: (= |v_#race~threads_alive~0_10| 0)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_10|}  AuxVars[]  AssignedVars[#race~threads_alive~0][230], [75#threadErr2ASSERT_VIOLATIONDATA_RACEtrue, threadThread3of3ForFork0InUse, Black: 194#true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), 156#L688-2true, 160#L698-2true, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 64#L688-1true, threadThread1of3ForFork0InUse, 228#(<= 1 ~threads_alive~0), Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), threadThread2of3ForFork0InUse])
[2023-11-03 13:54:11,205 INFO  L383   tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event
[2023-11-03 13:54:11,205 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-11-03 13:54:11,205 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-11-03 13:54:11,206 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-11-03 13:54:11,272 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L688-2-->L688-4: Formula: (= (+ 2 v_~threads_alive~0_36) v_~threads_alive~0_37)  InVars {~threads_alive~0=v_~threads_alive~0_37}  OutVars{~threads_alive~0=v_~threads_alive~0_36, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_15|}  AuxVars[]  AssignedVars[~threads_alive~0, threadThread3of3ForFork0_#t~nondet4][275], [threadThread3of3ForFork0InUse, 139#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 194#true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 57#L688-4true, 34#L698-3true, 112#threadEXITtrue, Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 245#(<= 0 |ULTIMATE.start_main_#t~post8#1|), threadThread1of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), threadThread2of3ForFork0InUse])
[2023-11-03 13:54:11,272 INFO  L383   tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event
[2023-11-03 13:54:11,272 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-11-03 13:54:11,272 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-11-03 13:54:11,272 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-11-03 13:54:11,673 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([828] L705-2-->L706: Formula: (not (= v_~threads_alive~0_5 0))  InVars {~threads_alive~0=v_~threads_alive~0_5}  OutVars{~threads_alive~0=v_~threads_alive~0_5}  AuxVars[]  AssignedVars[][22], [threadThread3of3ForFork0InUse, Black: 194#true, 6#L688true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 146#L706true, Black: 208#(= |#race~data~0| 0), 96#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 103#threadEXITtrue, threadThread1of3ForFork0InUse, 228#(<= 1 ~threads_alive~0), threadThread2of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|)])
[2023-11-03 13:54:11,674 INFO  L383   tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event
[2023-11-03 13:54:11,674 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-11-03 13:54:11,674 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-11-03 13:54:11,674 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-11-03 13:54:11,739 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([859] L688-->L688-1: Formula: (= |v_#race~threads_alive~0_10| 0)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_10|}  AuxVars[]  AssignedVars[#race~threads_alive~0][230], [threadThread3of3ForFork0InUse, Black: 194#true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), 156#L688-2true, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 103#threadEXITtrue, 64#L688-1true, threadThread1of3ForFork0InUse, 228#(<= 1 ~threads_alive~0), Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), 163#L705-2true, threadThread2of3ForFork0InUse])
[2023-11-03 13:54:11,739 INFO  L383   tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event
[2023-11-03 13:54:11,739 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-11-03 13:54:11,739 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-11-03 13:54:11,739 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-11-03 13:54:11,814 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([859] L688-->L688-1: Formula: (= |v_#race~threads_alive~0_10| 0)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_10|}  AuxVars[]  AssignedVars[#race~threads_alive~0][230], [threadThread3of3ForFork0InUse, Black: 194#true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 96#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 103#threadEXITtrue, 64#L688-1true, threadThread1of3ForFork0InUse, 228#(<= 1 ~threads_alive~0), Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), 163#L705-2true, threadThread2of3ForFork0InUse])
[2023-11-03 13:54:11,814 INFO  L383   tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event
[2023-11-03 13:54:11,814 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-11-03 13:54:11,814 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-11-03 13:54:11,814 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-11-03 13:54:12,518 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([859] L688-->L688-1: Formula: (= |v_#race~threads_alive~0_10| 0)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_10|}  AuxVars[]  AssignedVars[#race~threads_alive~0][230], [threadThread3of3ForFork0InUse, Black: 194#true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), 156#L688-2true, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 160#L698-2true, 103#threadEXITtrue, 64#L688-1true, threadThread1of3ForFork0InUse, 228#(<= 1 ~threads_alive~0), Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), threadThread2of3ForFork0InUse])
[2023-11-03 13:54:12,519 INFO  L383   tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event
[2023-11-03 13:54:12,519 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-11-03 13:54:12,519 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-11-03 13:54:12,519 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-11-03 13:54:13,573 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([829] L698-5-->L698-6: Formula: (= |v_ULTIMATE.start_main_#t~nondet9#1_3| |v_#race~threads_alive~0_4|)  InVars {ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|}  OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|, #race~threads_alive~0=|v_#race~threads_alive~0_4|}  AuxVars[]  AssignedVars[#race~threads_alive~0][105], [threadThread3of3ForFork0InUse, 161#L698-6true, 224#true, Black: 196#(= |#race~threads_alive~0| 0), 62#L688-2true, Black: 200#true, 218#true, Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 96#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 76#L688-6true, threadThread1of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), threadThread2of3ForFork0InUse])
[2023-11-03 13:54:13,574 INFO  L383   tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event
[2023-11-03 13:54:13,574 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2023-11-03 13:54:13,574 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2023-11-03 13:54:13,574 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2023-11-03 13:54:13,976 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([859] L688-->L688-1: Formula: (= |v_#race~threads_alive~0_10| 0)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_10|}  AuxVars[]  AssignedVars[#race~threads_alive~0][230], [threadThread3of3ForFork0InUse, 75#threadErr2ASSERT_VIOLATIONDATA_RACEtrue, Black: 194#true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), 156#L688-2true, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 64#L688-1true, threadThread1of3ForFork0InUse, 228#(<= 1 ~threads_alive~0), 68#L705-4true, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), threadThread2of3ForFork0InUse])
[2023-11-03 13:54:13,976 INFO  L383   tUnfolder$Statistics]: this new event has 66 ancestors and is cut-off event
[2023-11-03 13:54:13,976 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-11-03 13:54:13,976 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-11-03 13:54:13,976 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-11-03 13:54:13,976 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([859] L688-->L688-1: Formula: (= |v_#race~threads_alive~0_10| 0)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_10|}  AuxVars[]  AssignedVars[#race~threads_alive~0][230], [threadThread3of3ForFork0InUse, 75#threadErr2ASSERT_VIOLATIONDATA_RACEtrue, Black: 194#true, 80#L705-1true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), 156#L688-2true, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 64#L688-1true, threadThread1of3ForFork0InUse, 228#(<= 1 ~threads_alive~0), Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), threadThread2of3ForFork0InUse])
[2023-11-03 13:54:13,976 INFO  L383   tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event
[2023-11-03 13:54:13,976 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2023-11-03 13:54:13,977 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2023-11-03 13:54:13,977 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2023-11-03 13:54:13,977 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([859] L688-->L688-1: Formula: (= |v_#race~threads_alive~0_10| 0)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_10|}  AuxVars[]  AssignedVars[#race~threads_alive~0][230], [threadThread3of3ForFork0InUse, 75#threadErr2ASSERT_VIOLATIONDATA_RACEtrue, Black: 194#true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), 156#L688-2true, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 64#L688-1true, threadThread1of3ForFork0InUse, 228#(<= 1 ~threads_alive~0), Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), 163#L705-2true, threadThread2of3ForFork0InUse])
[2023-11-03 13:54:13,977 INFO  L383   tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event
[2023-11-03 13:54:13,977 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-11-03 13:54:13,977 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-11-03 13:54:13,977 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-11-03 13:54:14,650 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([829] L698-5-->L698-6: Formula: (= |v_ULTIMATE.start_main_#t~nondet9#1_3| |v_#race~threads_alive~0_4|)  InVars {ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|}  OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|, #race~threads_alive~0=|v_#race~threads_alive~0_4|}  AuxVars[]  AssignedVars[#race~threads_alive~0][105], [threadThread3of3ForFork0InUse, 161#L698-6true, Black: 196#(= |#race~threads_alive~0| 0), 62#L688-2true, Black: 200#true, 218#true, Black: 208#(= |#race~data~0| 0), 297#(and (<= 0 |ULTIMATE.start_main_#t~post8#1|) (<= 1 ~threads_alive~0)), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 96#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 76#L688-6true, threadThread1of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), threadThread2of3ForFork0InUse])
[2023-11-03 13:54:14,651 INFO  L383   tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event
[2023-11-03 13:54:14,651 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2023-11-03 13:54:14,651 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2023-11-03 13:54:14,651 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2023-11-03 13:54:15,117 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([941] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_44| |v_threadThread1of3ForFork0_#t~nondet4_13|)  InVars {}  OutVars{threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_13|, #race~threads_alive~0=|v_#race~threads_alive~0_44|}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet4, #race~threads_alive~0][45], [threadThread3of3ForFork0InUse, 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), 224#true, Black: 196#(= |#race~threads_alive~0| 0), 62#L688-2true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 119#L688-5true, 112#threadEXITtrue, Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), threadThread1of3ForFork0InUse, 163#L705-2true, threadThread2of3ForFork0InUse, Black: 218#true])
[2023-11-03 13:54:15,117 INFO  L383   tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event
[2023-11-03 13:54:15,117 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2023-11-03 13:54:15,118 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2023-11-03 13:54:15,118 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2023-11-03 13:54:15,118 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L688-2-->L688-4: Formula: (= (+ 2 v_~threads_alive~0_36) v_~threads_alive~0_37)  InVars {~threads_alive~0=v_~threads_alive~0_37}  OutVars{~threads_alive~0=v_~threads_alive~0_36, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_15|}  AuxVars[]  AssignedVars[~threads_alive~0, threadThread3of3ForFork0_#t~nondet4][304], [threadThread3of3ForFork0InUse, Black: 194#true, 224#true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 57#L688-4true, Black: 208#(= |#race~data~0| 0), 112#threadEXITtrue, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), threadThread1of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), 163#L705-2true, threadThread2of3ForFork0InUse, 23#L688-3true])
[2023-11-03 13:54:15,118 INFO  L383   tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event
[2023-11-03 13:54:15,118 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2023-11-03 13:54:15,118 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2023-11-03 13:54:15,118 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2023-11-03 13:54:15,503 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L688-2-->L688-4: Formula: (= (+ 2 v_~threads_alive~0_36) v_~threads_alive~0_37)  InVars {~threads_alive~0=v_~threads_alive~0_37}  OutVars{~threads_alive~0=v_~threads_alive~0_36, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_15|}  AuxVars[]  AssignedVars[~threads_alive~0, threadThread3of3ForFork0_#t~nondet4][275], [threadThread3of3ForFork0InUse, Black: 194#true, 164#L698-5true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 57#L688-4true, Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 96#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 103#threadEXITtrue, 245#(<= 0 |ULTIMATE.start_main_#t~post8#1|), threadThread1of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), threadThread2of3ForFork0InUse])
[2023-11-03 13:54:15,504 INFO  L383   tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event
[2023-11-03 13:54:15,504 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2023-11-03 13:54:15,504 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2023-11-03 13:54:15,504 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2023-11-03 13:54:15,546 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L688-2-->L688-4: Formula: (= (+ 2 v_~threads_alive~0_36) v_~threads_alive~0_37)  InVars {~threads_alive~0=v_~threads_alive~0_37}  OutVars{~threads_alive~0=v_~threads_alive~0_36, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_15|}  AuxVars[]  AssignedVars[~threads_alive~0, threadThread3of3ForFork0_#t~nondet4][304], [threadThread3of3ForFork0InUse, 224#true, Black: 194#true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 57#L688-4true, 34#L698-3true, Black: 208#(= |#race~data~0| 0), 96#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 103#threadEXITtrue, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|)])
[2023-11-03 13:54:15,546 INFO  L383   tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event
[2023-11-03 13:54:15,546 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2023-11-03 13:54:15,546 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2023-11-03 13:54:15,546 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2023-11-03 13:54:15,547 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([829] L698-5-->L698-6: Formula: (= |v_ULTIMATE.start_main_#t~nondet9#1_3| |v_#race~threads_alive~0_4|)  InVars {ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|}  OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|, #race~threads_alive~0=|v_#race~threads_alive~0_4|}  AuxVars[]  AssignedVars[#race~threads_alive~0][13], [threadThread3of3ForFork0InUse, 161#L698-6true, 224#true, Black: 196#(= |#race~threads_alive~0| 0), 62#L688-2true, 218#true, Black: 200#true, Black: 208#(= |#race~data~0| 0), 96#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 103#threadEXITtrue, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|)])
[2023-11-03 13:54:15,547 INFO  L383   tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event
[2023-11-03 13:54:15,547 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2023-11-03 13:54:15,548 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2023-11-03 13:54:15,548 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2023-11-03 13:54:15,548 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L688-2-->L688-4: Formula: (= (+ 2 v_~threads_alive~0_36) v_~threads_alive~0_37)  InVars {~threads_alive~0=v_~threads_alive~0_37}  OutVars{~threads_alive~0=v_~threads_alive~0_36, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_15|}  AuxVars[]  AssignedVars[~threads_alive~0, threadThread3of3ForFork0_#t~nondet4][304], [threadThread3of3ForFork0InUse, 224#true, Black: 194#true, 164#L698-5true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 57#L688-4true, Black: 208#(= |#race~data~0| 0), 96#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 103#threadEXITtrue, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|)])
[2023-11-03 13:54:15,548 INFO  L383   tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event
[2023-11-03 13:54:15,548 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2023-11-03 13:54:15,548 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2023-11-03 13:54:15,548 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2023-11-03 13:54:15,554 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([829] L698-5-->L698-6: Formula: (= |v_ULTIMATE.start_main_#t~nondet9#1_3| |v_#race~threads_alive~0_4|)  InVars {ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|}  OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|, #race~threads_alive~0=|v_#race~threads_alive~0_4|}  AuxVars[]  AssignedVars[#race~threads_alive~0][13], [threadThread3of3ForFork0InUse, 75#threadErr2ASSERT_VIOLATIONDATA_RACEtrue, 161#L698-6true, 224#true, Black: 196#(= |#race~threads_alive~0| 0), 62#L688-2true, Black: 200#true, 218#true, Black: 208#(= |#race~data~0| 0), 156#L688-2true, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|)])
[2023-11-03 13:54:15,554 INFO  L383   tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event
[2023-11-03 13:54:15,554 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2023-11-03 13:54:15,554 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2023-11-03 13:54:15,554 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2023-11-03 13:54:15,586 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([941] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_44| |v_threadThread1of3ForFork0_#t~nondet4_13|)  InVars {}  OutVars{threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_13|, #race~threads_alive~0=|v_#race~threads_alive~0_44|}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet4, #race~threads_alive~0][45], [threadThread3of3ForFork0InUse, 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), 224#true, Black: 196#(= |#race~threads_alive~0| 0), 62#L688-2true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 119#L688-5true, 112#threadEXITtrue, Black: 208#(= |#race~data~0| 0), 160#L698-2true, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 218#true])
[2023-11-03 13:54:15,587 INFO  L383   tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event
[2023-11-03 13:54:15,587 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2023-11-03 13:54:15,587 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2023-11-03 13:54:15,587 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2023-11-03 13:54:15,846 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([984] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_50| |v_threadThread2of3ForFork0_#t~nondet4_17|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_17|, #race~threads_alive~0=|v_#race~threads_alive~0_50|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet4, #race~threads_alive~0][128], [threadThread3of3ForFork0InUse, 75#threadErr2ASSERT_VIOLATIONDATA_RACEtrue, 9#L688-5true, 224#true, Black: 196#(= |#race~threads_alive~0| 0), 62#L688-2true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), threadThread1of3ForFork0InUse, 68#L705-4true, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), threadThread2of3ForFork0InUse])
[2023-11-03 13:54:15,846 INFO  L383   tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event
[2023-11-03 13:54:15,846 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-11-03 13:54:15,846 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-11-03 13:54:15,846 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-11-03 13:54:15,846 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([984] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_50| |v_threadThread2of3ForFork0_#t~nondet4_17|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_17|, #race~threads_alive~0=|v_#race~threads_alive~0_50|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet4, #race~threads_alive~0][128], [threadThread3of3ForFork0InUse, 75#threadErr2ASSERT_VIOLATIONDATA_RACEtrue, 9#L688-5true, 224#true, Black: 196#(= |#race~threads_alive~0| 0), 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 64#L688-1true, threadThread1of3ForFork0InUse, 68#L705-4true, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), threadThread2of3ForFork0InUse])
[2023-11-03 13:54:15,846 INFO  L383   tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event
[2023-11-03 13:54:15,847 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-11-03 13:54:15,847 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-11-03 13:54:15,847 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-11-03 13:54:16,129 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([829] L698-5-->L698-6: Formula: (= |v_ULTIMATE.start_main_#t~nondet9#1_3| |v_#race~threads_alive~0_4|)  InVars {ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|}  OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|, #race~threads_alive~0=|v_#race~threads_alive~0_4|}  AuxVars[]  AssignedVars[#race~threads_alive~0][13], [threadThread3of3ForFork0InUse, 161#L698-6true, Black: 196#(= |#race~threads_alive~0| 0), 62#L688-2true, 218#true, Black: 200#true, Black: 208#(= |#race~data~0| 0), 297#(and (<= 0 |ULTIMATE.start_main_#t~post8#1|) (<= 1 ~threads_alive~0)), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 96#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 103#threadEXITtrue, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|)])
[2023-11-03 13:54:16,129 INFO  L383   tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event
[2023-11-03 13:54:16,129 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2023-11-03 13:54:16,129 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2023-11-03 13:54:16,129 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2023-11-03 13:54:16,175 INFO  L381   tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([829] L698-5-->L698-6: Formula: (= |v_ULTIMATE.start_main_#t~nondet9#1_3| |v_#race~threads_alive~0_4|)  InVars {ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|}  OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|, #race~threads_alive~0=|v_#race~threads_alive~0_4|}  AuxVars[]  AssignedVars[#race~threads_alive~0][13], [threadThread3of3ForFork0InUse, 161#L698-6true, 224#true, Black: 196#(= |#race~threads_alive~0| 0), 62#L688-2true, Black: 200#true, 218#true, Black: 208#(= |#race~data~0| 0), 96#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 103#threadEXITtrue, threadThread1of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), threadThread2of3ForFork0InUse])
[2023-11-03 13:54:16,175 INFO  L383   tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event
[2023-11-03 13:54:16,175 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2023-11-03 13:54:16,176 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2023-11-03 13:54:16,176 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2023-11-03 13:54:16,176 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2023-11-03 13:54:16,295 INFO  L381   tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([958] L688-2-->L688-4: Formula: (= (+ 2 v_~threads_alive~0_36) v_~threads_alive~0_37)  InVars {~threads_alive~0=v_~threads_alive~0_37}  OutVars{~threads_alive~0=v_~threads_alive~0_36, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_15|}  AuxVars[]  AssignedVars[~threads_alive~0, threadThread3of3ForFork0_#t~nondet4][304], [threadThread3of3ForFork0InUse, 224#true, Black: 194#true, 164#L698-5true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 57#L688-4true, Black: 208#(= |#race~data~0| 0), 96#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 103#threadEXITtrue, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|)])
[2023-11-03 13:54:16,295 INFO  L383   tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event
[2023-11-03 13:54:16,295 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2023-11-03 13:54:16,296 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2023-11-03 13:54:16,296 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2023-11-03 13:54:16,296 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2023-11-03 13:54:16,307 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([984] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_50| |v_threadThread2of3ForFork0_#t~nondet4_17|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_17|, #race~threads_alive~0=|v_#race~threads_alive~0_50|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet4, #race~threads_alive~0][128], [threadThread3of3ForFork0InUse, 75#threadErr2ASSERT_VIOLATIONDATA_RACEtrue, 9#L688-5true, 224#true, Black: 196#(= |#race~threads_alive~0| 0), 164#L698-5true, 62#L688-2true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|)])
[2023-11-03 13:54:16,308 INFO  L383   tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event
[2023-11-03 13:54:16,308 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2023-11-03 13:54:16,308 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2023-11-03 13:54:16,308 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2023-11-03 13:54:16,347 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1014] L688-6-->threadEXIT: Formula: (and (= (store |v_#pthreadsMutex_214| |v_~#threads_alive_mutex~0.base_143| (store (select |v_#pthreadsMutex_214| |v_~#threads_alive_mutex~0.base_143|) |v_~#threads_alive_mutex~0.offset_143| 0)) |v_#pthreadsMutex_213|) (= |v_threadThread1of3ForFork0_#res.base_7| 0) (= 0 |v_threadThread1of3ForFork0_#res.offset_7|))  InVars {#pthreadsMutex=|v_#pthreadsMutex_214|, ~#threads_alive_mutex~0.base=|v_~#threads_alive_mutex~0.base_143|, ~#threads_alive_mutex~0.offset=|v_~#threads_alive_mutex~0.offset_143|}  OutVars{#pthreadsMutex=|v_#pthreadsMutex_213|, threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_17|, threadThread1of3ForFork0_#res.base=|v_threadThread1of3ForFork0_#res.base_7|, threadThread1of3ForFork0_#res.offset=|v_threadThread1of3ForFork0_#res.offset_7|, ~#threads_alive_mutex~0.base=|v_~#threads_alive_mutex~0.base_143|, ~#threads_alive_mutex~0.offset=|v_~#threads_alive_mutex~0.offset_143|}  AuxVars[]  AssignedVars[#pthreadsMutex, threadThread1of3ForFork0_#t~nondet4, threadThread1of3ForFork0_#res.base, threadThread1of3ForFork0_#res.offset][104], [threadThread3of3ForFork0InUse, Black: 194#true, 164#L698-5true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), 297#(and (<= 0 |ULTIMATE.start_main_#t~post8#1|) (<= 1 ~threads_alive~0)), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 103#threadEXITtrue, 64#L688-1true, 129#L690true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|)])
[2023-11-03 13:54:16,348 INFO  L383   tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event
[2023-11-03 13:54:16,348 INFO  L386   tUnfolder$Statistics]:   existing Event has 69 ancestors and is cut-off event
[2023-11-03 13:54:16,348 INFO  L386   tUnfolder$Statistics]:   existing Event has 69 ancestors and is cut-off event
[2023-11-03 13:54:16,349 INFO  L386   tUnfolder$Statistics]:   existing Event has 69 ancestors and is cut-off event
[2023-11-03 13:54:16,976 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([984] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_50| |v_threadThread2of3ForFork0_#t~nondet4_17|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_17|, #race~threads_alive~0=|v_#race~threads_alive~0_50|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet4, #race~threads_alive~0][222], [threadThread3of3ForFork0InUse, 9#L688-5true, 224#true, Black: 196#(= |#race~threads_alive~0| 0), 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 76#L688-6true, 64#L688-1true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|)])
[2023-11-03 13:54:16,976 INFO  L383   tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event
[2023-11-03 13:54:16,976 INFO  L386   tUnfolder$Statistics]:   existing Event has 69 ancestors and is cut-off event
[2023-11-03 13:54:16,976 INFO  L386   tUnfolder$Statistics]:   existing Event has 69 ancestors and is cut-off event
[2023-11-03 13:54:16,977 INFO  L386   tUnfolder$Statistics]:   existing Event has 69 ancestors and is cut-off event
[2023-11-03 13:54:16,979 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([984] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_50| |v_threadThread2of3ForFork0_#t~nondet4_17|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_17|, #race~threads_alive~0=|v_#race~threads_alive~0_50|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet4, #race~threads_alive~0][222], [threadThread3of3ForFork0InUse, 9#L688-5true, 224#true, Black: 196#(= |#race~threads_alive~0| 0), 62#L688-2true, 218#true, 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 76#L688-6true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|)])
[2023-11-03 13:54:16,979 INFO  L383   tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event
[2023-11-03 13:54:16,980 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-11-03 13:54:16,980 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-11-03 13:54:16,980 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-11-03 13:54:16,980 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([864] L688-4-->L688-5: Formula: (= |v_threadThread3of3ForFork0_#t~nondet4_3| |v_#race~threads_alive~0_13|)  InVars {threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|}  OutVars{threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, #race~threads_alive~0=|v_#race~threads_alive~0_13|}  AuxVars[]  AssignedVars[#race~threads_alive~0][330], [threadThread3of3ForFork0InUse, 111#L688-5true, 224#true, Black: 196#(= |#race~threads_alive~0| 0), 218#true, 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), 156#L688-2true, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 76#L688-6true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|)])
[2023-11-03 13:54:16,980 INFO  L383   tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event
[2023-11-03 13:54:16,981 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-11-03 13:54:16,981 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-11-03 13:54:16,981 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-11-03 13:54:17,004 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([984] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_50| |v_threadThread2of3ForFork0_#t~nondet4_17|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_17|, #race~threads_alive~0=|v_#race~threads_alive~0_50|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet4, #race~threads_alive~0][128], [75#threadErr2ASSERT_VIOLATIONDATA_RACEtrue, threadThread3of3ForFork0InUse, 9#L688-5true, 18#L698-8true, 224#true, Black: 196#(= |#race~threads_alive~0| 0), 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 64#L688-1true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|)])
[2023-11-03 13:54:17,005 INFO  L383   tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event
[2023-11-03 13:54:17,005 INFO  L386   tUnfolder$Statistics]:   existing Event has 69 ancestors and is cut-off event
[2023-11-03 13:54:17,005 INFO  L386   tUnfolder$Statistics]:   existing Event has 69 ancestors and is cut-off event
[2023-11-03 13:54:17,005 INFO  L386   tUnfolder$Statistics]:   existing Event has 69 ancestors and is cut-off event
[2023-11-03 13:54:17,108 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1014] L688-6-->threadEXIT: Formula: (and (= (store |v_#pthreadsMutex_214| |v_~#threads_alive_mutex~0.base_143| (store (select |v_#pthreadsMutex_214| |v_~#threads_alive_mutex~0.base_143|) |v_~#threads_alive_mutex~0.offset_143| 0)) |v_#pthreadsMutex_213|) (= |v_threadThread1of3ForFork0_#res.base_7| 0) (= 0 |v_threadThread1of3ForFork0_#res.offset_7|))  InVars {#pthreadsMutex=|v_#pthreadsMutex_214|, ~#threads_alive_mutex~0.base=|v_~#threads_alive_mutex~0.base_143|, ~#threads_alive_mutex~0.offset=|v_~#threads_alive_mutex~0.offset_143|}  OutVars{#pthreadsMutex=|v_#pthreadsMutex_213|, threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_17|, threadThread1of3ForFork0_#res.base=|v_threadThread1of3ForFork0_#res.base_7|, threadThread1of3ForFork0_#res.offset=|v_threadThread1of3ForFork0_#res.offset_7|, ~#threads_alive_mutex~0.base=|v_~#threads_alive_mutex~0.base_143|, ~#threads_alive_mutex~0.offset=|v_~#threads_alive_mutex~0.offset_143|}  AuxVars[]  AssignedVars[#pthreadsMutex, threadThread1of3ForFork0_#t~nondet4, threadThread1of3ForFork0_#res.base, threadThread1of3ForFork0_#res.offset][104], [threadThread3of3ForFork0InUse, Black: 194#true, 164#L698-5true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 112#threadEXITtrue, Black: 208#(= |#race~data~0| 0), 297#(and (<= 0 |ULTIMATE.start_main_#t~post8#1|) (<= 1 ~threads_alive~0)), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 64#L688-1true, 103#threadEXITtrue, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|)])
[2023-11-03 13:54:17,108 INFO  L383   tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event
[2023-11-03 13:54:17,108 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-11-03 13:54:17,108 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-11-03 13:54:17,109 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-11-03 13:54:17,371 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([984] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_50| |v_threadThread2of3ForFork0_#t~nondet4_17|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_17|, #race~threads_alive~0=|v_#race~threads_alive~0_50|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet4, #race~threads_alive~0][128], [threadThread3of3ForFork0InUse, 75#threadErr2ASSERT_VIOLATIONDATA_RACEtrue, 9#L688-5true, 224#true, Black: 196#(= |#race~threads_alive~0| 0), 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 35#L701-2true, 64#L688-1true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|)])
[2023-11-03 13:54:17,371 INFO  L383   tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event
[2023-11-03 13:54:17,371 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-11-03 13:54:17,371 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-11-03 13:54:17,371 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-11-03 13:54:17,452 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([941] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_44| |v_threadThread1of3ForFork0_#t~nondet4_13|)  InVars {}  OutVars{threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_13|, #race~threads_alive~0=|v_#race~threads_alive~0_44|}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet4, #race~threads_alive~0][81], [threadThread3of3ForFork0InUse, 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), Black: 196#(= |#race~threads_alive~0| 0), 62#L688-2true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, 119#L688-5true, Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 129#L690true, 245#(<= 0 |ULTIMATE.start_main_#t~post8#1|), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 218#true])
[2023-11-03 13:54:17,452 INFO  L383   tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event
[2023-11-03 13:54:17,453 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-11-03 13:54:17,453 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-11-03 13:54:17,453 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-11-03 13:54:17,454 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([941] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_44| |v_threadThread1of3ForFork0_#t~nondet4_13|)  InVars {}  OutVars{threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_13|, #race~threads_alive~0=|v_#race~threads_alive~0_44|}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet4, #race~threads_alive~0][81], [threadThread3of3ForFork0InUse, 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), Black: 196#(= |#race~threads_alive~0| 0), 62#L688-2true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, 119#L688-5true, 112#threadEXITtrue, Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 245#(<= 0 |ULTIMATE.start_main_#t~post8#1|), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 218#true])
[2023-11-03 13:54:17,454 INFO  L383   tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event
[2023-11-03 13:54:17,454 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-11-03 13:54:17,454 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-11-03 13:54:17,454 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-11-03 13:54:17,473 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([864] L688-4-->L688-5: Formula: (= |v_threadThread3of3ForFork0_#t~nondet4_3| |v_#race~threads_alive~0_13|)  InVars {threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|}  OutVars{threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, #race~threads_alive~0=|v_#race~threads_alive~0_13|}  AuxVars[]  AssignedVars[#race~threads_alive~0][311], [threadThread3of3ForFork0InUse, 75#threadErr2ASSERT_VIOLATIONDATA_RACEtrue, 111#L688-5true, 18#L698-8true, 224#true, Black: 196#(= |#race~threads_alive~0| 0), 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), 156#L688-2true, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), threadThread1of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), threadThread2of3ForFork0InUse])
[2023-11-03 13:54:17,473 INFO  L383   tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event
[2023-11-03 13:54:17,473 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-11-03 13:54:17,473 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-11-03 13:54:17,473 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-11-03 13:54:17,479 INFO  L381   tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([941] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_44| |v_threadThread1of3ForFork0_#t~nondet4_13|)  InVars {}  OutVars{threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_13|, #race~threads_alive~0=|v_#race~threads_alive~0_44|}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet4, #race~threads_alive~0][81], [threadThread3of3ForFork0InUse, 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), Black: 196#(= |#race~threads_alive~0| 0), 62#L688-2true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, 119#L688-5true, 112#threadEXITtrue, Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 245#(<= 0 |ULTIMATE.start_main_#t~post8#1|), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 218#true])
[2023-11-03 13:54:17,479 INFO  L383   tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event
[2023-11-03 13:54:17,480 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-11-03 13:54:17,480 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-11-03 13:54:17,480 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-11-03 13:54:17,480 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-11-03 13:54:17,512 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([984] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_50| |v_threadThread2of3ForFork0_#t~nondet4_17|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_17|, #race~threads_alive~0=|v_#race~threads_alive~0_50|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet4, #race~threads_alive~0][222], [threadThread3of3ForFork0InUse, 9#L688-5true, 224#true, Black: 196#(= |#race~threads_alive~0| 0), 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, 57#L688-4true, Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 76#L688-6true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|)])
[2023-11-03 13:54:17,512 INFO  L383   tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event
[2023-11-03 13:54:17,512 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-11-03 13:54:17,513 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-11-03 13:54:17,513 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-11-03 13:54:17,559 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([829] L698-5-->L698-6: Formula: (= |v_ULTIMATE.start_main_#t~nondet9#1_3| |v_#race~threads_alive~0_4|)  InVars {ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|}  OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|, #race~threads_alive~0=|v_#race~threads_alive~0_4|}  AuxVars[]  AssignedVars[#race~threads_alive~0][13], [threadThread3of3ForFork0InUse, 75#threadErr2ASSERT_VIOLATIONDATA_RACEtrue, 161#L698-6true, Black: 196#(= |#race~threads_alive~0| 0), 62#L688-2true, 218#true, Black: 200#true, Black: 208#(= |#race~data~0| 0), 297#(and (<= 0 |ULTIMATE.start_main_#t~post8#1|) (<= 1 ~threads_alive~0)), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 129#L690true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|)])
[2023-11-03 13:54:17,559 INFO  L383   tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event
[2023-11-03 13:54:17,559 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-11-03 13:54:17,559 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-11-03 13:54:17,559 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-11-03 13:54:17,560 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L688-2-->L688-4: Formula: (= (+ 2 v_~threads_alive~0_36) v_~threads_alive~0_37)  InVars {~threads_alive~0=v_~threads_alive~0_37}  OutVars{~threads_alive~0=v_~threads_alive~0_36, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_15|}  AuxVars[]  AssignedVars[~threads_alive~0, threadThread3of3ForFork0_#t~nondet4][275], [threadThread3of3ForFork0InUse, 75#threadErr2ASSERT_VIOLATIONDATA_RACEtrue, Black: 194#true, 164#L698-5true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 57#L688-4true, Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 129#L690true, 245#(<= 0 |ULTIMATE.start_main_#t~post8#1|), threadThread1of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), threadThread2of3ForFork0InUse])
[2023-11-03 13:54:17,560 INFO  L383   tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event
[2023-11-03 13:54:17,560 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-11-03 13:54:17,560 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-11-03 13:54:17,560 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-11-03 13:54:17,758 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([984] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_50| |v_threadThread2of3ForFork0_#t~nondet4_17|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_17|, #race~threads_alive~0=|v_#race~threads_alive~0_50|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet4, #race~threads_alive~0][128], [threadThread3of3ForFork0InUse, 75#threadErr2ASSERT_VIOLATIONDATA_RACEtrue, 9#L688-5true, 224#true, Black: 196#(= |#race~threads_alive~0| 0), 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 7#threadEXITtrue, threadThread1of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), threadThread2of3ForFork0InUse, 163#L705-2true])
[2023-11-03 13:54:17,758 INFO  L383   tUnfolder$Statistics]: this new event has 70 ancestors and is not cut-off event
[2023-11-03 13:54:17,759 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is not cut-off event
[2023-11-03 13:54:17,759 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is not cut-off event
[2023-11-03 13:54:17,759 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is not cut-off event
[2023-11-03 13:54:17,857 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([864] L688-4-->L688-5: Formula: (= |v_threadThread3of3ForFork0_#t~nondet4_3| |v_#race~threads_alive~0_13|)  InVars {threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|}  OutVars{threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, #race~threads_alive~0=|v_#race~threads_alive~0_13|}  AuxVars[]  AssignedVars[#race~threads_alive~0][231], [threadThread3of3ForFork0InUse, 111#L688-5true, Black: 196#(= |#race~threads_alive~0| 0), 218#true, 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), 156#L688-2true, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 103#threadEXITtrue, 245#(<= 0 |ULTIMATE.start_main_#t~post8#1|), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|)])
[2023-11-03 13:54:17,858 INFO  L383   tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event
[2023-11-03 13:54:17,858 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-11-03 13:54:17,858 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-11-03 13:54:17,858 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-11-03 13:54:17,871 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([864] L688-4-->L688-5: Formula: (= |v_threadThread3of3ForFork0_#t~nondet4_3| |v_#race~threads_alive~0_13|)  InVars {threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|}  OutVars{threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, #race~threads_alive~0=|v_#race~threads_alive~0_13|}  AuxVars[]  AssignedVars[#race~threads_alive~0][231], [threadThread3of3ForFork0InUse, 75#threadErr2ASSERT_VIOLATIONDATA_RACEtrue, 111#L688-5true, Black: 196#(= |#race~threads_alive~0| 0), 218#true, 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), 156#L688-2true, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 245#(<= 0 |ULTIMATE.start_main_#t~post8#1|), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|)])
[2023-11-03 13:54:17,871 INFO  L383   tUnfolder$Statistics]: this new event has 70 ancestors and is not cut-off event
[2023-11-03 13:54:17,872 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is not cut-off event
[2023-11-03 13:54:17,872 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is not cut-off event
[2023-11-03 13:54:17,872 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is not cut-off event
[2023-11-03 13:54:17,877 INFO  L381   tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([941] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_44| |v_threadThread1of3ForFork0_#t~nondet4_13|)  InVars {}  OutVars{threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_13|, #race~threads_alive~0=|v_#race~threads_alive~0_44|}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet4, #race~threads_alive~0][81], [threadThread3of3ForFork0InUse, 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), Black: 196#(= |#race~threads_alive~0| 0), 62#L688-2true, 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 119#L688-5true, Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 129#L690true, 245#(<= 0 |ULTIMATE.start_main_#t~post8#1|), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 218#true])
[2023-11-03 13:54:17,877 INFO  L383   tUnfolder$Statistics]: this new event has 70 ancestors and is not cut-off event
[2023-11-03 13:54:17,877 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is not cut-off event
[2023-11-03 13:54:17,877 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is not cut-off event
[2023-11-03 13:54:17,877 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is not cut-off event
[2023-11-03 13:54:17,877 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is not cut-off event
[2023-11-03 13:54:17,877 INFO  L381   tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([941] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_44| |v_threadThread1of3ForFork0_#t~nondet4_13|)  InVars {}  OutVars{threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_13|, #race~threads_alive~0=|v_#race~threads_alive~0_44|}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet4, #race~threads_alive~0][81], [threadThread3of3ForFork0InUse, 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), Black: 196#(= |#race~threads_alive~0| 0), 62#L688-2true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, 119#L688-5true, 112#threadEXITtrue, Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 245#(<= 0 |ULTIMATE.start_main_#t~post8#1|), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 218#true])
[2023-11-03 13:54:17,877 INFO  L383   tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event
[2023-11-03 13:54:17,878 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-11-03 13:54:17,878 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-11-03 13:54:17,878 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-11-03 13:54:17,878 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-11-03 13:54:17,878 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-11-03 13:54:17,893 INFO  L381   tUnfolder$Statistics]: inserting event number 7 for the transition-marking pair ([941] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_44| |v_threadThread1of3ForFork0_#t~nondet4_13|)  InVars {}  OutVars{threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_13|, #race~threads_alive~0=|v_#race~threads_alive~0_44|}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet4, #race~threads_alive~0][81], [threadThread3of3ForFork0InUse, 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), Black: 196#(= |#race~threads_alive~0| 0), 62#L688-2true, 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 119#L688-5true, 112#threadEXITtrue, Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 245#(<= 0 |ULTIMATE.start_main_#t~post8#1|), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 218#true])
[2023-11-03 13:54:17,893 INFO  L383   tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event
[2023-11-03 13:54:17,893 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-11-03 13:54:17,893 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-11-03 13:54:17,893 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-11-03 13:54:17,893 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-11-03 13:54:17,893 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-11-03 13:54:17,893 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-11-03 13:54:17,894 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L688-2-->L688-4: Formula: (= (+ 2 v_~threads_alive~0_36) v_~threads_alive~0_37)  InVars {~threads_alive~0=v_~threads_alive~0_37}  OutVars{~threads_alive~0=v_~threads_alive~0_36, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_15|}  AuxVars[]  AssignedVars[~threads_alive~0, threadThread3of3ForFork0_#t~nondet4][336], [threadThread3of3ForFork0InUse, Black: 194#true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, 57#L688-4true, Black: 208#(= |#race~data~0| 0), 112#threadEXITtrue, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 245#(<= 0 |ULTIMATE.start_main_#t~post8#1|), threadThread1of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), threadThread2of3ForFork0InUse, 23#L688-3true])
[2023-11-03 13:54:17,894 INFO  L383   tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event
[2023-11-03 13:54:17,894 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-11-03 13:54:17,894 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-11-03 13:54:17,894 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-11-03 13:54:17,928 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([864] L688-4-->L688-5: Formula: (= |v_threadThread3of3ForFork0_#t~nondet4_3| |v_#race~threads_alive~0_13|)  InVars {threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|}  OutVars{threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, #race~threads_alive~0=|v_#race~threads_alive~0_13|}  AuxVars[]  AssignedVars[#race~threads_alive~0][231], [threadThread3of3ForFork0InUse, 111#L688-5true, 224#true, Black: 196#(= |#race~threads_alive~0| 0), 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 208#(= |#race~data~0| 0), 156#L688-2true, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 103#threadEXITtrue, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|)])
[2023-11-03 13:54:17,929 INFO  L383   tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event
[2023-11-03 13:54:17,929 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-11-03 13:54:17,929 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-11-03 13:54:17,929 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-11-03 13:54:17,931 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([984] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_50| |v_threadThread2of3ForFork0_#t~nondet4_17|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_17|, #race~threads_alive~0=|v_#race~threads_alive~0_50|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet4, #race~threads_alive~0][128], [threadThread3of3ForFork0InUse, 9#L688-5true, 224#true, Black: 196#(= |#race~threads_alive~0| 0), 62#L688-2true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 103#threadEXITtrue, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|)])
[2023-11-03 13:54:17,931 INFO  L383   tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event
[2023-11-03 13:54:17,931 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-11-03 13:54:17,931 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-11-03 13:54:17,931 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-11-03 13:54:17,942 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([941] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_44| |v_threadThread1of3ForFork0_#t~nondet4_13|)  InVars {}  OutVars{threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_13|, #race~threads_alive~0=|v_#race~threads_alive~0_44|}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet4, #race~threads_alive~0][45], [threadThread3of3ForFork0InUse, 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), 224#true, Black: 196#(= |#race~threads_alive~0| 0), 62#L688-2true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, 119#L688-5true, Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 129#L690true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 218#true])
[2023-11-03 13:54:17,942 INFO  L383   tUnfolder$Statistics]: this new event has 70 ancestors and is not cut-off event
[2023-11-03 13:54:17,943 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is not cut-off event
[2023-11-03 13:54:17,943 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is not cut-off event
[2023-11-03 13:54:17,943 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is not cut-off event
[2023-11-03 13:54:17,955 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([941] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_44| |v_threadThread1of3ForFork0_#t~nondet4_13|)  InVars {}  OutVars{threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_13|, #race~threads_alive~0=|v_#race~threads_alive~0_44|}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet4, #race~threads_alive~0][45], [threadThread3of3ForFork0InUse, 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), 224#true, Black: 196#(= |#race~threads_alive~0| 0), 62#L688-2true, 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 119#L688-5true, 112#threadEXITtrue, Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 218#true])
[2023-11-03 13:54:17,955 INFO  L383   tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event
[2023-11-03 13:54:17,956 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-11-03 13:54:17,956 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-11-03 13:54:17,956 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-11-03 13:54:17,983 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L688-2-->L688-4: Formula: (= (+ 2 v_~threads_alive~0_36) v_~threads_alive~0_37)  InVars {~threads_alive~0=v_~threads_alive~0_37}  OutVars{~threads_alive~0=v_~threads_alive~0_36, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_15|}  AuxVars[]  AssignedVars[~threads_alive~0, threadThread3of3ForFork0_#t~nondet4][275], [threadThread3of3ForFork0InUse, 75#threadErr2ASSERT_VIOLATIONDATA_RACEtrue, Black: 194#true, 164#L698-5true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 57#L688-4true, Black: 208#(= |#race~data~0| 0), 112#threadEXITtrue, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 245#(<= 0 |ULTIMATE.start_main_#t~post8#1|), threadThread1of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), threadThread2of3ForFork0InUse])
[2023-11-03 13:54:17,983 INFO  L383   tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event
[2023-11-03 13:54:17,983 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-11-03 13:54:17,983 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-11-03 13:54:17,983 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-11-03 13:54:18,468 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([984] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_50| |v_threadThread2of3ForFork0_#t~nondet4_17|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_17|, #race~threads_alive~0=|v_#race~threads_alive~0_50|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet4, #race~threads_alive~0][222], [threadThread3of3ForFork0InUse, 9#L688-5true, 224#true, Black: 196#(= |#race~threads_alive~0| 0), 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 76#L688-6true, 7#threadEXITtrue, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|)])
[2023-11-03 13:54:18,468 INFO  L383   tUnfolder$Statistics]: this new event has 74 ancestors and is cut-off event
[2023-11-03 13:54:18,468 INFO  L386   tUnfolder$Statistics]:   existing Event has 74 ancestors and is cut-off event
[2023-11-03 13:54:18,468 INFO  L386   tUnfolder$Statistics]:   existing Event has 74 ancestors and is cut-off event
[2023-11-03 13:54:18,468 INFO  L386   tUnfolder$Statistics]:   existing Event has 74 ancestors and is cut-off event
[2023-11-03 13:54:18,707 INFO  L130       PetriNetUnfolder]: 190525/317152 cut-off events.
[2023-11-03 13:54:18,707 INFO  L131       PetriNetUnfolder]: For 400239/430783 co-relation queries the response was YES.
[2023-11-03 13:54:19,560 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 899879 conditions, 317152 events. 190525/317152 cut-off events. For 400239/430783 co-relation queries the response was YES. Maximal size of possible extension queue 10515. Compared 3375792 event pairs, 46301 based on Foata normal form. 6530/291400 useless extension candidates. Maximal degree in co-relation 585968. Up to 118861 conditions per place. 
[2023-11-03 13:54:21,007 INFO  L137   encePairwiseOnDemand]: 298/307 looper letters, 268 selfloop transitions, 19 changer transitions 3/353 dead transitions.
[2023-11-03 13:54:21,008 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 353 transitions, 2513 flow
[2023-11-03 13:54:21,008 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2023-11-03 13:54:21,009 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-11-03 13:54:21,010 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1363 transitions.
[2023-11-03 13:54:21,011 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6342484876686831
[2023-11-03 13:54:21,011 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 1363 transitions.
[2023-11-03 13:54:21,011 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 1363 transitions.
[2023-11-03 13:54:21,012 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:54:21,012 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1363 transitions.
[2023-11-03 13:54:21,013 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 194.71428571428572) internal successors, (1363), 7 states have internal predecessors, (1363), 0 states have call successors, (0), 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:54:21,015 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 307.0) internal successors, (2456), 8 states have internal predecessors, (2456), 0 states have call successors, (0), 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:54:21,016 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 307.0) internal successors, (2456), 8 states have internal predecessors, (2456), 0 states have call successors, (0), 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:54:21,016 INFO  L175             Difference]: Start difference. First operand has 93 places, 138 transitions, 749 flow. Second operand 7 states and 1363 transitions.
[2023-11-03 13:54:21,016 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 353 transitions, 2513 flow
[2023-11-03 13:54:50,926 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 353 transitions, 2361 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-03 13:54:50,929 INFO  L231             Difference]: Finished difference. Result has 100 places, 158 transitions, 817 flow
[2023-11-03 13:54:50,929 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=693, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=817, PETRI_PLACES=100, PETRI_TRANSITIONS=158}
[2023-11-03 13:54:50,930 INFO  L288   CegarLoopForPetriNet]: 82 programPoint places, 18 predicate places.
[2023-11-03 13:54:50,930 INFO  L495      AbstractCegarLoop]: Abstraction has has 100 places, 158 transitions, 817 flow
[2023-11-03 13:54:50,930 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 174.8) internal successors, (874), 5 states have internal predecessors, (874), 0 states have call successors, (0), 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:54:50,930 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:54:50,930 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:54:50,935 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2023-11-03 13:54:51,131 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22
[2023-11-03 13:54:51,131 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2023-11-03 13:54:51,132 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:54:51,132 INFO  L85        PathProgramCache]: Analyzing trace with hash -1277540627, now seen corresponding path program 1 times
[2023-11-03 13:54:51,133 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:54:51,134 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783471309]
[2023-11-03 13:54:51,134 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:54:51,134 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:54:51,147 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:54:51,208 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-11-03 13:54:51,209 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:54:51,209 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783471309]
[2023-11-03 13:54:51,209 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783471309] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:54:51,210 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:54:51,210 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-11-03 13:54:51,210 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257121391]
[2023-11-03 13:54:51,211 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:54:51,211 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-11-03 13:54:51,212 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:54:51,212 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-11-03 13:54:51,212 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2023-11-03 13:54:51,305 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 165 out of 307
[2023-11-03 13:54:51,305 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 158 transitions, 817 flow. Second operand  has 5 states, 5 states have (on average 168.4) internal successors, (842), 5 states have internal predecessors, (842), 0 states have call successors, (0), 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:54:51,305 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:54:51,306 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 307
[2023-11-03 13:54:51,306 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:54:53,736 INFO  L130       PetriNetUnfolder]: 15706/31175 cut-off events.
[2023-11-03 13:54:53,737 INFO  L131       PetriNetUnfolder]: For 23101/23856 co-relation queries the response was YES.
[2023-11-03 13:54:53,836 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 80768 conditions, 31175 events. 15706/31175 cut-off events. For 23101/23856 co-relation queries the response was YES. Maximal size of possible extension queue 750. Compared 287583 event pairs, 4035 based on Foata normal form. 2989/33084 useless extension candidates. Maximal degree in co-relation 52185. Up to 15852 conditions per place. 
[2023-11-03 13:54:53,954 INFO  L137   encePairwiseOnDemand]: 294/307 looper letters, 68 selfloop transitions, 13 changer transitions 0/118 dead transitions.
[2023-11-03 13:54:53,955 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 118 transitions, 663 flow
[2023-11-03 13:54:53,955 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-11-03 13:54:53,955 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-11-03 13:54:53,957 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 725 transitions.
[2023-11-03 13:54:53,957 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5903908794788274
[2023-11-03 13:54:53,957 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 725 transitions.
[2023-11-03 13:54:53,957 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 725 transitions.
[2023-11-03 13:54:53,958 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:54:53,958 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 725 transitions.
[2023-11-03 13:54:53,959 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 181.25) internal successors, (725), 4 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:54:53,960 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 307.0) internal successors, (1535), 5 states have internal predecessors, (1535), 0 states have call successors, (0), 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:54:53,961 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 307.0) internal successors, (1535), 5 states have internal predecessors, (1535), 0 states have call successors, (0), 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:54:53,961 INFO  L175             Difference]: Start difference. First operand has 100 places, 158 transitions, 817 flow. Second operand 4 states and 725 transitions.
[2023-11-03 13:54:53,961 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 118 transitions, 663 flow
[2023-11-03 13:54:54,158 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 118 transitions, 599 flow, removed 28 selfloop flow, removed 5 redundant places.
[2023-11-03 13:54:54,159 INFO  L231             Difference]: Finished difference. Result has 90 places, 93 transitions, 363 flow
[2023-11-03 13:54:54,159 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=337, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=363, PETRI_PLACES=90, PETRI_TRANSITIONS=93}
[2023-11-03 13:54:54,160 INFO  L288   CegarLoopForPetriNet]: 82 programPoint places, 8 predicate places.
[2023-11-03 13:54:54,160 INFO  L495      AbstractCegarLoop]: Abstraction has has 90 places, 93 transitions, 363 flow
[2023-11-03 13:54:54,160 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 168.4) internal successors, (842), 5 states have internal predecessors, (842), 0 states have call successors, (0), 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:54:54,160 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:54:54,161 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:54:54,161 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2023-11-03 13:54:54,161 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2023-11-03 13:54:54,161 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:54:54,161 INFO  L85        PathProgramCache]: Analyzing trace with hash 928932594, now seen corresponding path program 1 times
[2023-11-03 13:54:54,162 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:54:54,162 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066030156]
[2023-11-03 13:54:54,162 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:54:54,162 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:54:54,175 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:54:54,198 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked.
[2023-11-03 13:54:54,199 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:54:54,199 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066030156]
[2023-11-03 13:54:54,199 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066030156] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:54:54,199 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:54:54,199 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-03 13:54:54,200 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578355449]
[2023-11-03 13:54:54,200 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:54:54,200 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 13:54:54,200 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:54:54,201 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 13:54:54,201 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 13:54:54,218 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 174 out of 307
[2023-11-03 13:54:54,219 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 93 transitions, 363 flow. Second operand  has 3 states, 3 states have (on average 178.0) internal successors, (534), 3 states have internal predecessors, (534), 0 states have call successors, (0), 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:54:54,219 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:54:54,219 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 307
[2023-11-03 13:54:54,219 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:54:55,876 INFO  L130       PetriNetUnfolder]: 12340/24716 cut-off events.
[2023-11-03 13:54:55,877 INFO  L131       PetriNetUnfolder]: For 11913/12428 co-relation queries the response was YES.
[2023-11-03 13:54:55,934 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 60037 conditions, 24716 events. 12340/24716 cut-off events. For 11913/12428 co-relation queries the response was YES. Maximal size of possible extension queue 734. Compared 226377 event pairs, 8112 based on Foata normal form. 8/22709 useless extension candidates. Maximal degree in co-relation 39253. Up to 16781 conditions per place. 
[2023-11-03 13:54:56,009 INFO  L137   encePairwiseOnDemand]: 301/307 looper letters, 77 selfloop transitions, 12 changer transitions 0/129 dead transitions.
[2023-11-03 13:54:56,009 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 129 transitions, 687 flow
[2023-11-03 13:54:56,010 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 13:54:56,010 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 13:54:56,011 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 587 transitions.
[2023-11-03 13:54:56,011 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6373507057546145
[2023-11-03 13:54:56,011 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 587 transitions.
[2023-11-03 13:54:56,012 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 587 transitions.
[2023-11-03 13:54:56,012 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:54:56,012 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 587 transitions.
[2023-11-03 13:54:56,013 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 195.66666666666666) internal successors, (587), 3 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:54:56,014 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 307.0) internal successors, (1228), 4 states have internal predecessors, (1228), 0 states have call successors, (0), 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:54:56,014 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 307.0) internal successors, (1228), 4 states have internal predecessors, (1228), 0 states have call successors, (0), 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:54:56,014 INFO  L175             Difference]: Start difference. First operand has 90 places, 93 transitions, 363 flow. Second operand 3 states and 587 transitions.
[2023-11-03 13:54:56,014 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 129 transitions, 687 flow
[2023-11-03 13:54:56,025 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 129 transitions, 667 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-03 13:54:56,026 INFO  L231             Difference]: Finished difference. Result has 91 places, 101 transitions, 448 flow
[2023-11-03 13:54:56,026 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=448, PETRI_PLACES=91, PETRI_TRANSITIONS=101}
[2023-11-03 13:54:56,027 INFO  L288   CegarLoopForPetriNet]: 82 programPoint places, 9 predicate places.
[2023-11-03 13:54:56,027 INFO  L495      AbstractCegarLoop]: Abstraction has has 91 places, 101 transitions, 448 flow
[2023-11-03 13:54:56,027 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 178.0) internal successors, (534), 3 states have internal predecessors, (534), 0 states have call successors, (0), 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:54:56,027 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:54:56,027 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:54:56,027 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2023-11-03 13:54:56,028 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2023-11-03 13:54:56,028 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:54:56,028 INFO  L85        PathProgramCache]: Analyzing trace with hash -683014751, now seen corresponding path program 1 times
[2023-11-03 13:54:56,028 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:54:56,028 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917641888]
[2023-11-03 13:54:56,028 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:54:56,029 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:54:56,038 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:54:56,072 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2023-11-03 13:54:56,073 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:54:56,073 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917641888]
[2023-11-03 13:54:56,073 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917641888] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:54:56,073 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:54:56,074 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-03 13:54:56,074 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096115687]
[2023-11-03 13:54:56,074 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:54:56,074 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 13:54:56,074 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:54:56,075 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 13:54:56,075 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 13:54:56,109 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 169 out of 307
[2023-11-03 13:54:56,110 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 101 transitions, 448 flow. Second operand  has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 0 states have call successors, (0), 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:54:56,110 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:54:56,110 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 307
[2023-11-03 13:54:56,110 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:54:59,424 INFO  L130       PetriNetUnfolder]: 25377/49342 cut-off events.
[2023-11-03 13:54:59,424 INFO  L131       PetriNetUnfolder]: For 44120/46312 co-relation queries the response was YES.
[2023-11-03 13:54:59,601 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 128665 conditions, 49342 events. 25377/49342 cut-off events. For 44120/46312 co-relation queries the response was YES. Maximal size of possible extension queue 1426. Compared 488374 event pairs, 4916 based on Foata normal form. 1580/48575 useless extension candidates. Maximal degree in co-relation 92369. Up to 23483 conditions per place. 
[2023-11-03 13:54:59,858 INFO  L137   encePairwiseOnDemand]: 295/307 looper letters, 101 selfloop transitions, 13 changer transitions 0/155 dead transitions.
[2023-11-03 13:54:59,858 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 155 transitions, 941 flow
[2023-11-03 13:54:59,859 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 13:54:59,859 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 13:54:59,860 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 583 transitions.
[2023-11-03 13:54:59,860 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6330076004343105
[2023-11-03 13:54:59,860 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 583 transitions.
[2023-11-03 13:54:59,860 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 583 transitions.
[2023-11-03 13:54:59,861 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:54:59,861 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 583 transitions.
[2023-11-03 13:54:59,862 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 194.33333333333334) internal successors, (583), 3 states have internal predecessors, (583), 0 states have call successors, (0), 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:54:59,863 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 307.0) internal successors, (1228), 4 states have internal predecessors, (1228), 0 states have call successors, (0), 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:54:59,863 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 307.0) internal successors, (1228), 4 states have internal predecessors, (1228), 0 states have call successors, (0), 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:54:59,863 INFO  L175             Difference]: Start difference. First operand has 91 places, 101 transitions, 448 flow. Second operand 3 states and 583 transitions.
[2023-11-03 13:54:59,863 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 155 transitions, 941 flow
[2023-11-03 13:54:59,985 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 155 transitions, 919 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-11-03 13:54:59,987 INFO  L231             Difference]: Finished difference. Result has 93 places, 111 transitions, 525 flow
[2023-11-03 13:54:59,987 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=525, PETRI_PLACES=93, PETRI_TRANSITIONS=111}
[2023-11-03 13:54:59,988 INFO  L288   CegarLoopForPetriNet]: 82 programPoint places, 11 predicate places.
[2023-11-03 13:54:59,988 INFO  L495      AbstractCegarLoop]: Abstraction has has 93 places, 111 transitions, 525 flow
[2023-11-03 13:54:59,988 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 0 states have call successors, (0), 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:54:59,988 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:54:59,988 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:54:59,988 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2023-11-03 13:54:59,989 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2023-11-03 13:54:59,989 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:54:59,989 INFO  L85        PathProgramCache]: Analyzing trace with hash 74336075, now seen corresponding path program 2 times
[2023-11-03 13:54:59,989 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:54:59,989 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727428829]
[2023-11-03 13:54:59,989 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:54:59,990 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:55:00,001 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:55:00,063 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2023-11-03 13:55:00,064 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:55:00,064 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727428829]
[2023-11-03 13:55:00,064 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727428829] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-03 13:55:00,064 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [223666725]
[2023-11-03 13:55:00,064 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2023-11-03 13:55:00,064 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 13:55:00,065 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 13:55:00,066 INFO  L229       MonitoredProcess]: Starting monitored process 5 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:55:00,067 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2023-11-03 13:55:00,158 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2023-11-03 13:55:00,158 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-11-03 13:55:00,159 INFO  L263         TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 9 conjunts are in the unsatisfiable core
[2023-11-03 13:55:00,162 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 13:55:00,260 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-11-03 13:55:00,288 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 13:55:00,289 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16
[2023-11-03 13:55:00,309 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2023-11-03 13:55:00,309 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-03 13:55:00,363 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 13:55:00,363 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20
[2023-11-03 13:55:00,367 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25
[2023-11-03 13:55:00,400 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2023-11-03 13:55:00,400 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [223666725] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-03 13:55:00,400 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-03 13:55:00,401 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9
[2023-11-03 13:55:00,401 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015584253]
[2023-11-03 13:55:00,401 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-03 13:55:00,401 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2023-11-03 13:55:00,401 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:55:00,402 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2023-11-03 13:55:00,402 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=55, Unknown=1, NotChecked=0, Total=90
[2023-11-03 13:55:00,608 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 168 out of 307
[2023-11-03 13:55:00,609 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 111 transitions, 525 flow. Second operand  has 10 states, 10 states have (on average 171.5) internal successors, (1715), 10 states have internal predecessors, (1715), 0 states have call successors, (0), 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:55:00,609 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:55:00,609 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 307
[2023-11-03 13:55:00,610 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:55:02,002 INFO  L130       PetriNetUnfolder]: 6946/16038 cut-off events.
[2023-11-03 13:55:02,002 INFO  L131       PetriNetUnfolder]: For 15357/16081 co-relation queries the response was YES.
[2023-11-03 13:55:02,043 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 45751 conditions, 16038 events. 6946/16038 cut-off events. For 15357/16081 co-relation queries the response was YES. Maximal size of possible extension queue 549. Compared 155470 event pairs, 2433 based on Foata normal form. 935/16109 useless extension candidates. Maximal degree in co-relation 23210. Up to 9699 conditions per place. 
[2023-11-03 13:55:02,087 INFO  L137   encePairwiseOnDemand]: 300/307 looper letters, 77 selfloop transitions, 12 changer transitions 0/129 dead transitions.
[2023-11-03 13:55:02,088 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 129 transitions, 740 flow
[2023-11-03 13:55:02,088 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-11-03 13:55:02,088 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-11-03 13:55:02,089 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 737 transitions.
[2023-11-03 13:55:02,090 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6001628664495114
[2023-11-03 13:55:02,090 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 737 transitions.
[2023-11-03 13:55:02,090 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 737 transitions.
[2023-11-03 13:55:02,090 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:55:02,091 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 737 transitions.
[2023-11-03 13:55:02,091 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 184.25) internal successors, (737), 4 states have internal predecessors, (737), 0 states have call successors, (0), 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:55:02,093 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 307.0) internal successors, (1535), 5 states have internal predecessors, (1535), 0 states have call successors, (0), 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:55:02,093 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 307.0) internal successors, (1535), 5 states have internal predecessors, (1535), 0 states have call successors, (0), 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:55:02,093 INFO  L175             Difference]: Start difference. First operand has 93 places, 111 transitions, 525 flow. Second operand 4 states and 737 transitions.
[2023-11-03 13:55:02,093 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 129 transitions, 740 flow
[2023-11-03 13:55:02,109 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 129 transitions, 723 flow, removed 2 selfloop flow, removed 1 redundant places.
[2023-11-03 13:55:02,110 INFO  L231             Difference]: Finished difference. Result has 95 places, 101 transitions, 454 flow
[2023-11-03 13:55:02,110 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=430, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=454, PETRI_PLACES=95, PETRI_TRANSITIONS=101}
[2023-11-03 13:55:02,111 INFO  L288   CegarLoopForPetriNet]: 82 programPoint places, 13 predicate places.
[2023-11-03 13:55:02,111 INFO  L495      AbstractCegarLoop]: Abstraction has has 95 places, 101 transitions, 454 flow
[2023-11-03 13:55:02,111 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 171.5) internal successors, (1715), 10 states have internal predecessors, (1715), 0 states have call successors, (0), 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:55:02,111 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:55:02,112 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:55:02,119 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2023-11-03 13:55:02,312 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,5 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 13:55:02,313 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2023-11-03 13:55:02,314 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:55:02,314 INFO  L85        PathProgramCache]: Analyzing trace with hash 1830676315, now seen corresponding path program 1 times
[2023-11-03 13:55:02,314 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:55:02,314 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473823580]
[2023-11-03 13:55:02,315 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:55:02,315 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:55:02,329 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:55:02,343 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked.
[2023-11-03 13:55:02,343 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:55:02,344 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473823580]
[2023-11-03 13:55:02,344 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473823580] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:55:02,344 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:55:02,344 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-03 13:55:02,344 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357754268]
[2023-11-03 13:55:02,344 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:55:02,345 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 13:55:02,345 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:55:02,345 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 13:55:02,345 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 13:55:02,378 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 169 out of 307
[2023-11-03 13:55:02,378 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 101 transitions, 454 flow. Second operand  has 3 states, 3 states have (on average 174.33333333333334) internal successors, (523), 3 states have internal predecessors, (523), 0 states have call successors, (0), 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:55:02,379 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:55:02,379 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 307
[2023-11-03 13:55:02,379 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:55:03,768 INFO  L130       PetriNetUnfolder]: 7661/17723 cut-off events.
[2023-11-03 13:55:03,768 INFO  L131       PetriNetUnfolder]: For 18667/19190 co-relation queries the response was YES.
[2023-11-03 13:55:03,819 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 50483 conditions, 17723 events. 7661/17723 cut-off events. For 18667/19190 co-relation queries the response was YES. Maximal size of possible extension queue 562. Compared 171596 event pairs, 5125 based on Foata normal form. 1/16720 useless extension candidates. Maximal degree in co-relation 26943. Up to 12759 conditions per place. 
[2023-11-03 13:55:03,869 INFO  L137   encePairwiseOnDemand]: 304/307 looper letters, 72 selfloop transitions, 2 changer transitions 3/118 dead transitions.
[2023-11-03 13:55:03,869 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 118 transitions, 707 flow
[2023-11-03 13:55:03,870 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 13:55:03,870 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 13:55:03,871 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 559 transitions.
[2023-11-03 13:55:03,871 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6069489685124865
[2023-11-03 13:55:03,872 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 559 transitions.
[2023-11-03 13:55:03,872 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 559 transitions.
[2023-11-03 13:55:03,872 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:55:03,872 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 559 transitions.
[2023-11-03 13:55:03,873 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 186.33333333333334) internal successors, (559), 3 states have internal predecessors, (559), 0 states have call successors, (0), 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:55:03,874 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 307.0) internal successors, (1228), 4 states have internal predecessors, (1228), 0 states have call successors, (0), 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:55:03,874 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 307.0) internal successors, (1228), 4 states have internal predecessors, (1228), 0 states have call successors, (0), 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:55:03,874 INFO  L175             Difference]: Start difference. First operand has 95 places, 101 transitions, 454 flow. Second operand 3 states and 559 transitions.
[2023-11-03 13:55:03,874 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 118 transitions, 707 flow
[2023-11-03 13:55:03,893 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 118 transitions, 689 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-03 13:55:03,894 INFO  L231             Difference]: Finished difference. Result has 94 places, 100 transitions, 444 flow
[2023-11-03 13:55:03,895 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=444, PETRI_PLACES=94, PETRI_TRANSITIONS=100}
[2023-11-03 13:55:03,895 INFO  L288   CegarLoopForPetriNet]: 82 programPoint places, 12 predicate places.
[2023-11-03 13:55:03,895 INFO  L495      AbstractCegarLoop]: Abstraction has has 94 places, 100 transitions, 444 flow
[2023-11-03 13:55:03,895 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 174.33333333333334) internal successors, (523), 3 states have internal predecessors, (523), 0 states have call successors, (0), 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:55:03,895 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:55:03,896 INFO  L209   CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:55:03,896 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2023-11-03 13:55:03,896 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2023-11-03 13:55:03,896 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:55:03,896 INFO  L85        PathProgramCache]: Analyzing trace with hash 1793748985, now seen corresponding path program 1 times
[2023-11-03 13:55:03,896 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:55:03,897 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422868173]
[2023-11-03 13:55:03,897 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:55:03,897 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:55:03,908 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:55:03,926 INFO  L134       CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked.
[2023-11-03 13:55:03,926 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:55:03,926 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422868173]
[2023-11-03 13:55:03,926 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422868173] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:55:03,927 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:55:03,927 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-03 13:55:03,927 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104791050]
[2023-11-03 13:55:03,927 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:55:03,928 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 13:55:03,928 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:55:03,928 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 13:55:03,929 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 13:55:03,949 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 174 out of 307
[2023-11-03 13:55:03,950 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 100 transitions, 444 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:55:03,950 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:55:03,950 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 307
[2023-11-03 13:55:03,950 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:55:05,273 INFO  L130       PetriNetUnfolder]: 6863/16556 cut-off events.
[2023-11-03 13:55:05,273 INFO  L131       PetriNetUnfolder]: For 15647/15802 co-relation queries the response was YES.
[2023-11-03 13:55:05,322 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 46618 conditions, 16556 events. 6863/16556 cut-off events. For 15647/15802 co-relation queries the response was YES. Maximal size of possible extension queue 557. Compared 164400 event pairs, 4421 based on Foata normal form. 4/15578 useless extension candidates. Maximal degree in co-relation 26713. Up to 11071 conditions per place. 
[2023-11-03 13:55:05,367 INFO  L137   encePairwiseOnDemand]: 303/307 looper letters, 77 selfloop transitions, 4 changer transitions 0/124 dead transitions.
[2023-11-03 13:55:05,368 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 124 transitions, 705 flow
[2023-11-03 13:55:05,368 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 13:55:05,369 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 13:55:05,369 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 578 transitions.
[2023-11-03 13:55:05,370 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6275787187839305
[2023-11-03 13:55:05,370 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 578 transitions.
[2023-11-03 13:55:05,370 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 578 transitions.
[2023-11-03 13:55:05,370 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:55:05,370 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 578 transitions.
[2023-11-03 13:55:05,371 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 192.66666666666666) internal successors, (578), 3 states have internal predecessors, (578), 0 states have call successors, (0), 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:55:05,372 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 307.0) internal successors, (1228), 4 states have internal predecessors, (1228), 0 states have call successors, (0), 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:55:05,372 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 307.0) internal successors, (1228), 4 states have internal predecessors, (1228), 0 states have call successors, (0), 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:55:05,373 INFO  L175             Difference]: Start difference. First operand has 94 places, 100 transitions, 444 flow. Second operand 3 states and 578 transitions.
[2023-11-03 13:55:05,373 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 124 transitions, 705 flow
[2023-11-03 13:55:05,391 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 124 transitions, 697 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-03 13:55:05,392 INFO  L231             Difference]: Finished difference. Result has 95 places, 102 transitions, 468 flow
[2023-11-03 13:55:05,392 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=468, PETRI_PLACES=95, PETRI_TRANSITIONS=102}
[2023-11-03 13:55:05,393 INFO  L288   CegarLoopForPetriNet]: 82 programPoint places, 13 predicate places.
[2023-11-03 13:55:05,393 INFO  L495      AbstractCegarLoop]: Abstraction has has 95 places, 102 transitions, 468 flow
[2023-11-03 13:55:05,393 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:55:05,393 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:55:05,394 INFO  L209   CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1]
[2023-11-03 13:55:05,394 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2023-11-03 13:55:05,394 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2023-11-03 13:55:05,394 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:55:05,394 INFO  L85        PathProgramCache]: Analyzing trace with hash 2137542505, now seen corresponding path program 1 times
[2023-11-03 13:55:05,394 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:55:05,395 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780447803]
[2023-11-03 13:55:05,395 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:55:05,395 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:55:05,414 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-03 13:55:05,414 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-11-03 13:55:05,425 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-03 13:55:05,433 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-11-03 13:55:05,433 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-11-03 13:55:05,433 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 18 remaining)
[2023-11-03 13:55:05,434 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (16 of 18 remaining)
[2023-11-03 13:55:05,434 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (15 of 18 remaining)
[2023-11-03 13:55:05,434 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (14 of 18 remaining)
[2023-11-03 13:55:05,434 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (13 of 18 remaining)
[2023-11-03 13:55:05,435 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (12 of 18 remaining)
[2023-11-03 13:55:05,435 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (11 of 18 remaining)
[2023-11-03 13:55:05,435 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (10 of 18 remaining)
[2023-11-03 13:55:05,435 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (9 of 18 remaining)
[2023-11-03 13:55:05,435 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (8 of 18 remaining)
[2023-11-03 13:55:05,435 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (7 of 18 remaining)
[2023-11-03 13:55:05,435 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (6 of 18 remaining)
[2023-11-03 13:55:05,436 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 18 remaining)
[2023-11-03 13:55:05,436 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 18 remaining)
[2023-11-03 13:55:05,436 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (3 of 18 remaining)
[2023-11-03 13:55:05,436 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 18 remaining)
[2023-11-03 13:55:05,436 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 18 remaining)
[2023-11-03 13:55:05,436 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (0 of 18 remaining)
[2023-11-03 13:55:05,436 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2023-11-03 13:55:05,437 INFO  L445         BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:55:05,437 WARN  L233   ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-11-03 13:55:05,437 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances.
[2023-11-03 13:55:05,454 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2023-11-03 13:55:05,456 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 220 places, 215 transitions, 462 flow
[2023-11-03 13:55:05,490 INFO  L130       PetriNetUnfolder]: 16/429 cut-off events.
[2023-11-03 13:55:05,491 INFO  L131       PetriNetUnfolder]: For 16/16 co-relation queries the response was YES.
[2023-11-03 13:55:05,492 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 452 conditions, 429 events. 16/429 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 640 event pairs, 0 based on Foata normal form. 0/372 useless extension candidates. Maximal degree in co-relation 352. Up to 10 conditions per place. 
[2023-11-03 13:55:05,492 INFO  L82        GeneralOperation]: Start removeDead. Operand has 220 places, 215 transitions, 462 flow
[2023-11-03 13:55:05,494 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 220 places, 215 transitions, 462 flow
[2023-11-03 13:55:05,494 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-11-03 13:55:05,494 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 220 places, 215 transitions, 462 flow
[2023-11-03 13:55:05,494 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 220 places, 215 transitions, 462 flow
[2023-11-03 13:55:05,494 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 220 places, 215 transitions, 462 flow
[2023-11-03 13:55:05,525 INFO  L130       PetriNetUnfolder]: 16/429 cut-off events.
[2023-11-03 13:55:05,526 INFO  L131       PetriNetUnfolder]: For 16/16 co-relation queries the response was YES.
[2023-11-03 13:55:05,527 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 452 conditions, 429 events. 16/429 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 640 event pairs, 0 based on Foata normal form. 0/372 useless extension candidates. Maximal degree in co-relation 352. Up to 10 conditions per place. 
[2023-11-03 13:55:05,538 INFO  L119        LiptonReduction]: Number of co-enabled transitions 20696
[2023-11-03 13:55:08,478 INFO  L134        LiptonReduction]: Checked pairs total: 99608
[2023-11-03 13:55:08,479 INFO  L136        LiptonReduction]: Total number of compositions: 130
[2023-11-03 13:55:08,480 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-03 13:55:08,480 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;@7b891cb7, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-11-03 13:55:08,480 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 21 error locations.
[2023-11-03 13:55:08,481 INFO  L130       PetriNetUnfolder]: 0/6 cut-off events.
[2023-11-03 13:55:08,482 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-11-03 13:55:08,482 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:55:08,482 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1]
[2023-11-03 13:55:08,482 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 18 more)] ===
[2023-11-03 13:55:08,482 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:55:08,483 INFO  L85        PathProgramCache]: Analyzing trace with hash 44451972, now seen corresponding path program 1 times
[2023-11-03 13:55:08,483 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:55:08,483 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153907150]
[2023-11-03 13:55:08,483 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:55:08,483 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:55:08,487 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:55:08,495 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:55:08,495 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:55:08,495 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153907150]
[2023-11-03 13:55:08,495 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153907150] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:55:08,496 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:55:08,496 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-03 13:55:08,496 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887394442]
[2023-11-03 13:55:08,496 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:55:08,496 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 13:55:08,496 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:55:08,497 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 13:55:08,497 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 13:55:08,527 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 185 out of 345
[2023-11-03 13:55:08,528 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 93 transitions, 218 flow. Second operand  has 3 states, 3 states have (on average 186.33333333333334) internal successors, (559), 3 states have internal predecessors, (559), 0 states have call successors, (0), 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:55:08,528 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:55:08,528 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 345
[2023-11-03 13:55:08,528 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
