./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-binomial.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-binomial.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 4bbb78f8955cd82d00c43fdb08bb6ddab69fac7abe567c3e643d91c046caf2bf
--- Real Ultimate output ---
This is Ultimate 0.2.2-dev-2329fc7
[2024-03-11 23:08:12,043 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2024-03-11 23:08:12,044 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2024-03-11 23:08:12,064 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2024-03-11 23:08:12,064 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2024-03-11 23:08:12,065 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2024-03-11 23:08:12,066 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2024-03-11 23:08:12,067 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2024-03-11 23:08:12,068 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2024-03-11 23:08:12,069 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2024-03-11 23:08:12,070 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2024-03-11 23:08:12,070 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2024-03-11 23:08:12,071 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2024-03-11 23:08:12,072 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2024-03-11 23:08:12,072 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2024-03-11 23:08:12,073 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2024-03-11 23:08:12,074 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2024-03-11 23:08:12,074 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2024-03-11 23:08:12,075 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2024-03-11 23:08:12,077 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2024-03-11 23:08:12,078 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2024-03-11 23:08:12,079 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2024-03-11 23:08:12,079 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2024-03-11 23:08:12,080 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2024-03-11 23:08:12,082 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2024-03-11 23:08:12,083 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2024-03-11 23:08:12,083 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2024-03-11 23:08:12,083 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2024-03-11 23:08:12,084 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2024-03-11 23:08:12,084 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2024-03-11 23:08:12,085 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2024-03-11 23:08:12,085 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2024-03-11 23:08:12,086 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2024-03-11 23:08:12,086 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2024-03-11 23:08:12,087 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2024-03-11 23:08:12,088 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2024-03-11 23:08:12,088 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2024-03-11 23:08:12,088 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2024-03-11 23:08:12,089 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2024-03-11 23:08:12,089 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2024-03-11 23:08:12,090 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2024-03-11 23:08:12,091 INFO  L101        SettingsManager]: Beginning loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2024-03-11 23:08:12,111 INFO  L113        SettingsManager]: Loading preferences was successful
[2024-03-11 23:08:12,111 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2024-03-11 23:08:12,116 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-03-11 23:08:12,116 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-03-11 23:08:12,116 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-03-11 23:08:12,116 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-03-11 23:08:12,117 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-03-11 23:08:12,117 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2024-03-11 23:08:12,117 INFO  L138        SettingsManager]:  * Use SBE=true
[2024-03-11 23:08:12,117 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-03-11 23:08:12,118 INFO  L138        SettingsManager]:  * sizeof long=4
[2024-03-11 23:08:12,118 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2024-03-11 23:08:12,118 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-03-11 23:08:12,118 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2024-03-11 23:08:12,118 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2024-03-11 23:08:12,119 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-03-11 23:08:12,119 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-03-11 23:08:12,119 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-03-11 23:08:12,119 INFO  L138        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2024-03-11 23:08:12,119 INFO  L138        SettingsManager]:  * sizeof long double=12
[2024-03-11 23:08:12,120 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2024-03-11 23:08:12,120 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2024-03-11 23:08:12,120 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-03-11 23:08:12,120 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-03-11 23:08:12,120 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-03-11 23:08:12,120 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-03-11 23:08:12,121 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-03-11 23:08:12,121 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-03-11 23:08:12,121 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-03-11 23:08:12,121 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2024-03-11 23:08:12,121 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-03-11 23:08:12,122 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-03-11 23:08:12,122 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-03-11 23:08:12,122 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-03-11 23:08:12,122 INFO  L138        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-03-11 23:08:12,122 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-03-11 23:08:12,122 INFO  L138        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2024-03-11 23:08:12,123 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 -> 4bbb78f8955cd82d00c43fdb08bb6ddab69fac7abe567c3e643d91c046caf2bf
[2024-03-11 23:08:12,285 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-03-11 23:08:12,306 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-03-11 23:08:12,308 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-03-11 23:08:12,309 INFO  L271        PluginConnector]: Initializing CDTParser...
[2024-03-11 23:08:12,310 INFO  L275        PluginConnector]: CDTParser initialized
[2024-03-11 23:08:12,310 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/thread-join-binomial.i
[2024-03-11 23:08:13,309 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2024-03-11 23:08:13,560 INFO  L351              CDTParser]: Found 1 translation units.
[2024-03-11 23:08:13,560 INFO  L172              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/thread-join-binomial.i
[2024-03-11 23:08:13,571 INFO  L394              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/c051e5e02/4c7e110162514becaa5677fdc743cc60/FLAGfd3aabcbf
[2024-03-11 23:08:13,919 INFO  L402              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/c051e5e02/4c7e110162514becaa5677fdc743cc60
[2024-03-11 23:08:13,922 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-03-11 23:08:13,923 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-03-11 23:08:13,925 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-03-11 23:08:13,925 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-03-11 23:08:13,928 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-03-11 23:08:13,929 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 11:08:13" (1/1) ...
[2024-03-11 23:08:13,930 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5698a6e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:08:13, skipping insertion in model container
[2024-03-11 23:08:13,930 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 11:08:13" (1/1) ...
[2024-03-11 23:08:13,935 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2024-03-11 23:08:13,977 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2024-03-11 23:08:14,110 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2024-03-11 23:08:14,237 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-03-11 23:08:14,246 INFO  L203         MainTranslator]: Completed pre-run
[2024-03-11 23:08:14,255 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2024-03-11 23:08:14,282 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-03-11 23:08:14,345 INFO  L208         MainTranslator]: Completed translation
[2024-03-11 23:08:14,345 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:08:14 WrapperNode
[2024-03-11 23:08:14,345 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-03-11 23:08:14,346 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-03-11 23:08:14,346 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-03-11 23:08:14,346 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2024-03-11 23:08:14,351 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:08:14" (1/1) ...
[2024-03-11 23:08:14,366 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:08:14" (1/1) ...
[2024-03-11 23:08:14,385 INFO  L138                Inliner]: procedures = 268, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 92
[2024-03-11 23:08:14,386 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-03-11 23:08:14,386 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-03-11 23:08:14,386 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2024-03-11 23:08:14,386 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2024-03-11 23:08:14,393 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:08:14" (1/1) ...
[2024-03-11 23:08:14,393 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:08:14" (1/1) ...
[2024-03-11 23:08:14,397 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:08:14" (1/1) ...
[2024-03-11 23:08:14,397 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:08:14" (1/1) ...
[2024-03-11 23:08:14,405 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:08:14" (1/1) ...
[2024-03-11 23:08:14,408 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:08:14" (1/1) ...
[2024-03-11 23:08:14,409 INFO  L185        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:08:14" (1/1) ...
[2024-03-11 23:08:14,411 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:08:14" (1/1) ...
[2024-03-11 23:08:14,413 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-03-11 23:08:14,414 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-03-11 23:08:14,414 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2024-03-11 23:08:14,414 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2024-03-11 23:08:14,414 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:08:14" (1/1) ...
[2024-03-11 23:08:14,419 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-03-11 23:08:14,429 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 23:08:14,446 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)
[2024-03-11 23:08:14,450 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
[2024-03-11 23:08:14,479 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2024-03-11 23:08:14,479 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-03-11 23:08:14,479 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2024-03-11 23:08:14,480 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2024-03-11 23:08:14,480 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2024-03-11 23:08:14,480 INFO  L130     BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock
[2024-03-11 23:08:14,480 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2024-03-11 23:08:14,480 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-03-11 23:08:14,480 INFO  L130     BoogieDeclarations]: Found specification of procedure write~$Pointer$
[2024-03-11 23:08:14,480 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2024-03-11 23:08:14,480 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2024-03-11 23:08:14,480 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2024-03-11 23:08:14,480 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-03-11 23:08:14,481 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-03-11 23:08:14,482 WARN  L209             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2024-03-11 23:08:14,606 INFO  L235             CfgBuilder]: Building ICFG
[2024-03-11 23:08:14,608 INFO  L261             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-03-11 23:08:14,871 INFO  L276             CfgBuilder]: Performing block encoding
[2024-03-11 23:08:14,878 INFO  L295             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-03-11 23:08:14,878 INFO  L300             CfgBuilder]: Removed 2 assume(true) statements.
[2024-03-11 23:08:14,879 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 11:08:14 BoogieIcfgContainer
[2024-03-11 23:08:14,879 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-03-11 23:08:14,881 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-03-11 23:08:14,881 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2024-03-11 23:08:14,883 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2024-03-11 23:08:14,883 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.03 11:08:13" (1/3) ...
[2024-03-11 23:08:14,884 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38375010 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 11:08:14, skipping insertion in model container
[2024-03-11 23:08:14,884 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:08:14" (2/3) ...
[2024-03-11 23:08:14,884 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38375010 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 11:08:14, skipping insertion in model container
[2024-03-11 23:08:14,884 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 11:08:14" (3/3) ...
[2024-03-11 23:08:14,885 INFO  L112   eAbstractionObserver]: Analyzing ICFG thread-join-binomial.i
[2024-03-11 23:08:14,891 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2024-03-11 23:08:14,898 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-03-11 23:08:14,898 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations.
[2024-03-11 23:08:14,898 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-03-11 23:08:14,958 INFO  L144    ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions.
[2024-03-11 23:08:14,986 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 185 places, 191 transitions, 396 flow
[2024-03-11 23:08:15,042 INFO  L130       PetriNetUnfolder]: 6/179 cut-off events.
[2024-03-11 23:08:15,042 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2024-03-11 23:08:15,047 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 185 conditions, 179 events. 6/179 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 191 event pairs, 0 based on Foata normal form. 0/153 useless extension candidates. Maximal degree in co-relation 84. Up to 4 conditions per place. 
[2024-03-11 23:08:15,047 INFO  L82        GeneralOperation]: Start removeDead. Operand has 185 places, 191 transitions, 396 flow
[2024-03-11 23:08:15,051 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 145 places, 147 transitions, 302 flow
[2024-03-11 23:08:15,053 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2024-03-11 23:08:15,062 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 147 transitions, 302 flow
[2024-03-11 23:08:15,064 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 145 places, 147 transitions, 302 flow
[2024-03-11 23:08:15,064 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 145 places, 147 transitions, 302 flow
[2024-03-11 23:08:15,090 INFO  L130       PetriNetUnfolder]: 6/174 cut-off events.
[2024-03-11 23:08:15,090 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2024-03-11 23:08:15,091 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 180 conditions, 174 events. 6/174 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 190 event pairs, 0 based on Foata normal form. 0/149 useless extension candidates. Maximal degree in co-relation 84. Up to 4 conditions per place. 
[2024-03-11 23:08:15,093 INFO  L119        LiptonReduction]: Number of co-enabled transitions 2788
[2024-03-11 23:08:21,838 INFO  L134        LiptonReduction]: Checked pairs total: 13471
[2024-03-11 23:08:21,839 INFO  L136        LiptonReduction]: Total number of compositions: 136
[2024-03-11 23:08:21,852 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-11 23:08:21,857 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;@21a18a5e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2024-03-11 23:08:21,857 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 19 error locations.
[2024-03-11 23:08:21,858 INFO  L130       PetriNetUnfolder]: 0/0 cut-off events.
[2024-03-11 23:08:21,859 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2024-03-11 23:08:21,859 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 23:08:21,859 INFO  L209   CegarLoopForPetriNet]: trace histogram [1]
[2024-03-11 23:08:21,860 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 16 more)] ===
[2024-03-11 23:08:21,863 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 23:08:21,863 INFO  L85        PathProgramCache]: Analyzing trace with hash 556, now seen corresponding path program 1 times
[2024-03-11 23:08:21,870 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 23:08:21,870 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220376984]
[2024-03-11 23:08:21,871 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:08:21,871 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 23:08:21,946 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 23:08:21,966 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 23:08:21,967 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 23:08:21,967 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220376984]
[2024-03-11 23:08:21,968 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220376984] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 23:08:21,968 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 23:08:21,968 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0
[2024-03-11 23:08:21,969 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420768653]
[2024-03-11 23:08:21,970 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 23:08:21,976 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-03-11 23:08:21,976 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 23:08:21,991 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-03-11 23:08:21,993 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-03-11 23:08:21,995 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 181 out of 327
[2024-03-11 23:08:21,996 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 48 transitions, 104 flow. Second operand  has 2 states, 2 states have (on average 181.5) internal successors, (363), 2 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:08:21,997 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 23:08:21,997 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 327
[2024-03-11 23:08:21,997 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 23:08:22,054 INFO  L130       PetriNetUnfolder]: 8/108 cut-off events.
[2024-03-11 23:08:22,054 INFO  L131       PetriNetUnfolder]: For 4/4 co-relation queries the response was YES.
[2024-03-11 23:08:22,054 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 145 conditions, 108 events. 8/108 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 432 event pairs, 8 based on Foata normal form. 1/86 useless extension candidates. Maximal degree in co-relation 105. Up to 29 conditions per place. 
[2024-03-11 23:08:22,056 INFO  L137   encePairwiseOnDemand]: 318/327 looper letters, 8 selfloop transitions, 0 changer transitions 1/39 dead transitions.
[2024-03-11 23:08:22,056 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 39 transitions, 104 flow
[2024-03-11 23:08:22,057 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-03-11 23:08:22,059 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2024-03-11 23:08:22,065 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 380 transitions.
[2024-03-11 23:08:22,067 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.581039755351682
[2024-03-11 23:08:22,068 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 380 transitions.
[2024-03-11 23:08:22,068 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 380 transitions.
[2024-03-11 23:08:22,070 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 23:08:22,071 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 380 transitions.
[2024-03-11 23:08:22,074 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 190.0) internal successors, (380), 2 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:08:22,079 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 327.0) internal successors, (981), 3 states have internal predecessors, (981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:08:22,080 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 327.0) internal successors, (981), 3 states have internal predecessors, (981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:08:22,081 INFO  L175             Difference]: Start difference. First operand has 51 places, 48 transitions, 104 flow. Second operand 2 states and 380 transitions.
[2024-03-11 23:08:22,082 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 39 transitions, 104 flow
[2024-03-11 23:08:22,084 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 39 transitions, 104 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-11 23:08:22,085 INFO  L231             Difference]: Finished difference. Result has 43 places, 38 transitions, 81 flow
[2024-03-11 23:08:22,087 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=327, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=81, PETRI_PLACES=43, PETRI_TRANSITIONS=38}
[2024-03-11 23:08:22,090 INFO  L288   CegarLoopForPetriNet]: 51 programPoint places, -8 predicate places.
[2024-03-11 23:08:22,090 INFO  L495      AbstractCegarLoop]: Abstraction has has 43 places, 38 transitions, 81 flow
[2024-03-11 23:08:22,090 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 181.5) internal successors, (363), 2 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:08:22,090 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 23:08:22,090 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-03-11 23:08:22,091 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-03-11 23:08:22,091 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 16 more)] ===
[2024-03-11 23:08:22,091 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 23:08:22,091 INFO  L85        PathProgramCache]: Analyzing trace with hash -669883898, now seen corresponding path program 1 times
[2024-03-11 23:08:22,092 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 23:08:22,092 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467071580]
[2024-03-11 23:08:22,092 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:08:22,092 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 23:08:22,128 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 23:08:22,406 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 23:08:22,406 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 23:08:22,407 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467071580]
[2024-03-11 23:08:22,407 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467071580] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 23:08:22,407 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 23:08:22,407 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-11 23:08:22,407 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488523215]
[2024-03-11 23:08:22,407 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 23:08:22,408 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-11 23:08:22,408 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 23:08:22,409 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-11 23:08:22,409 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-11 23:08:22,769 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 145 out of 327
[2024-03-11 23:08:22,770 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 38 transitions, 81 flow. Second operand  has 6 states, 6 states have (on average 146.0) internal successors, (876), 6 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:08:22,770 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 23:08:22,771 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 327
[2024-03-11 23:08:22,771 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 23:08:22,913 INFO  L130       PetriNetUnfolder]: 84/346 cut-off events.
[2024-03-11 23:08:22,914 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2024-03-11 23:08:22,915 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 559 conditions, 346 events. 84/346 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1863 event pairs, 84 based on Foata normal form. 0/303 useless extension candidates. Maximal degree in co-relation 555. Up to 193 conditions per place. 
[2024-03-11 23:08:22,916 INFO  L137   encePairwiseOnDemand]: 316/327 looper letters, 21 selfloop transitions, 8 changer transitions 0/43 dead transitions.
[2024-03-11 23:08:22,916 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 43 transitions, 149 flow
[2024-03-11 23:08:22,916 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-11 23:08:22,917 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-11 23:08:22,919 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 902 transitions.
[2024-03-11 23:08:22,921 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.4597349643221203
[2024-03-11 23:08:22,921 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 902 transitions.
[2024-03-11 23:08:22,921 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 902 transitions.
[2024-03-11 23:08:22,922 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 23:08:22,922 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 902 transitions.
[2024-03-11 23:08:22,924 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 150.33333333333334) internal successors, (902), 6 states have internal predecessors, (902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:08:22,928 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 327.0) internal successors, (2289), 7 states have internal predecessors, (2289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:08:22,929 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 327.0) internal successors, (2289), 7 states have internal predecessors, (2289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:08:22,929 INFO  L175             Difference]: Start difference. First operand has 43 places, 38 transitions, 81 flow. Second operand 6 states and 902 transitions.
[2024-03-11 23:08:22,929 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 43 transitions, 149 flow
[2024-03-11 23:08:22,930 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 43 transitions, 149 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-11 23:08:22,931 INFO  L231             Difference]: Finished difference. Result has 48 places, 43 transitions, 137 flow
[2024-03-11 23:08:22,931 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=327, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=137, PETRI_PLACES=48, PETRI_TRANSITIONS=43}
[2024-03-11 23:08:22,932 INFO  L288   CegarLoopForPetriNet]: 51 programPoint places, -3 predicate places.
[2024-03-11 23:08:22,932 INFO  L495      AbstractCegarLoop]: Abstraction has has 48 places, 43 transitions, 137 flow
[2024-03-11 23:08:22,932 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 146.0) internal successors, (876), 6 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:08:22,932 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 23:08:22,932 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 23:08:22,932 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-03-11 23:08:22,933 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 16 more)] ===
[2024-03-11 23:08:22,933 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 23:08:22,933 INFO  L85        PathProgramCache]: Analyzing trace with hash -1042792253, now seen corresponding path program 1 times
[2024-03-11 23:08:22,933 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 23:08:22,933 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215981115]
[2024-03-11 23:08:22,934 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:08:22,934 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 23:08:22,948 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 23:08:23,134 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 23:08:23,134 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 23:08:23,135 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215981115]
[2024-03-11 23:08:23,135 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215981115] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 23:08:23,135 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 23:08:23,135 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-11 23:08:23,135 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964474580]
[2024-03-11 23:08:23,135 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 23:08:23,135 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-11 23:08:23,136 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 23:08:23,136 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-11 23:08:23,136 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-11 23:08:23,513 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 168 out of 327
[2024-03-11 23:08:23,514 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 43 transitions, 137 flow. Second operand  has 6 states, 6 states have (on average 169.16666666666666) internal successors, (1015), 6 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:08:23,514 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 23:08:23,514 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 327
[2024-03-11 23:08:23,514 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 23:08:23,676 INFO  L130       PetriNetUnfolder]: 16/102 cut-off events.
[2024-03-11 23:08:23,677 INFO  L131       PetriNetUnfolder]: For 2/2 co-relation queries the response was YES.
[2024-03-11 23:08:23,677 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 206 conditions, 102 events. 16/102 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 337 event pairs, 6 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 198. Up to 22 conditions per place. 
[2024-03-11 23:08:23,678 INFO  L137   encePairwiseOnDemand]: 322/327 looper letters, 13 selfloop transitions, 4 changer transitions 8/50 dead transitions.
[2024-03-11 23:08:23,678 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 50 transitions, 195 flow
[2024-03-11 23:08:23,680 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-11 23:08:23,680 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-11 23:08:23,683 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1029 transitions.
[2024-03-11 23:08:23,684 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5244648318042814
[2024-03-11 23:08:23,684 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 1029 transitions.
[2024-03-11 23:08:23,684 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 1029 transitions.
[2024-03-11 23:08:23,685 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 23:08:23,685 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1029 transitions.
[2024-03-11 23:08:23,688 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 171.5) internal successors, (1029), 6 states have internal predecessors, (1029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:08:23,693 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 327.0) internal successors, (2289), 7 states have internal predecessors, (2289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:08:23,695 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 327.0) internal successors, (2289), 7 states have internal predecessors, (2289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:08:23,695 INFO  L175             Difference]: Start difference. First operand has 48 places, 43 transitions, 137 flow. Second operand 6 states and 1029 transitions.
[2024-03-11 23:08:23,695 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 50 transitions, 195 flow
[2024-03-11 23:08:23,696 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 50 transitions, 195 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-11 23:08:23,697 INFO  L231             Difference]: Finished difference. Result has 52 places, 38 transitions, 120 flow
[2024-03-11 23:08:23,697 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=327, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=120, PETRI_PLACES=52, PETRI_TRANSITIONS=38}
[2024-03-11 23:08:23,698 INFO  L288   CegarLoopForPetriNet]: 51 programPoint places, 1 predicate places.
[2024-03-11 23:08:23,698 INFO  L495      AbstractCegarLoop]: Abstraction has has 52 places, 38 transitions, 120 flow
[2024-03-11 23:08:23,699 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 169.16666666666666) internal successors, (1015), 6 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:08:23,699 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 23:08:23,699 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1]
[2024-03-11 23:08:23,699 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-03-11 23:08:23,699 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 16 more)] ===
[2024-03-11 23:08:23,700 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 23:08:23,700 INFO  L85        PathProgramCache]: Analyzing trace with hash 1292015536, now seen corresponding path program 1 times
[2024-03-11 23:08:23,700 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 23:08:23,700 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341423969]
[2024-03-11 23:08:23,700 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:08:23,700 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 23:08:23,736 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-11 23:08:23,737 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-03-11 23:08:23,749 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-11 23:08:23,767 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-03-11 23:08:23,768 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-03-11 23:08:23,768 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 19 remaining)
[2024-03-11 23:08:23,770 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (17 of 19 remaining)
[2024-03-11 23:08:23,770 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (16 of 19 remaining)
[2024-03-11 23:08:23,770 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (15 of 19 remaining)
[2024-03-11 23:08:23,770 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (14 of 19 remaining)
[2024-03-11 23:08:23,770 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (13 of 19 remaining)
[2024-03-11 23:08:23,771 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (12 of 19 remaining)
[2024-03-11 23:08:23,771 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (11 of 19 remaining)
[2024-03-11 23:08:23,771 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (10 of 19 remaining)
[2024-03-11 23:08:23,771 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (9 of 19 remaining)
[2024-03-11 23:08:23,771 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (8 of 19 remaining)
[2024-03-11 23:08:23,771 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (7 of 19 remaining)
[2024-03-11 23:08:23,771 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (6 of 19 remaining)
[2024-03-11 23:08:23,772 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (5 of 19 remaining)
[2024-03-11 23:08:23,772 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (4 of 19 remaining)
[2024-03-11 23:08:23,772 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 19 remaining)
[2024-03-11 23:08:23,772 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 19 remaining)
[2024-03-11 23:08:23,772 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (1 of 19 remaining)
[2024-03-11 23:08:23,772 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (0 of 19 remaining)
[2024-03-11 23:08:23,772 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-03-11 23:08:23,773 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1]
[2024-03-11 23:08:23,775 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-03-11 23:08:23,775 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2024-03-11 23:08:23,807 INFO  L144    ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions.
[2024-03-11 23:08:23,810 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 231 places, 243 transitions, 522 flow
[2024-03-11 23:08:23,885 INFO  L130       PetriNetUnfolder]: 34/593 cut-off events.
[2024-03-11 23:08:23,885 INFO  L131       PetriNetUnfolder]: For 20/22 co-relation queries the response was YES.
[2024-03-11 23:08:23,887 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 627 conditions, 593 events. 34/593 cut-off events. For 20/22 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2084 event pairs, 0 based on Foata normal form. 2/499 useless extension candidates. Maximal degree in co-relation 268. Up to 16 conditions per place. 
[2024-03-11 23:08:23,887 INFO  L82        GeneralOperation]: Start removeDead. Operand has 231 places, 243 transitions, 522 flow
[2024-03-11 23:08:23,889 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 201 places, 207 transitions, 438 flow
[2024-03-11 23:08:23,889 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2024-03-11 23:08:23,889 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 201 places, 207 transitions, 438 flow
[2024-03-11 23:08:23,890 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 201 places, 207 transitions, 438 flow
[2024-03-11 23:08:23,890 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 201 places, 207 transitions, 438 flow
[2024-03-11 23:08:23,944 INFO  L130       PetriNetUnfolder]: 34/593 cut-off events.
[2024-03-11 23:08:23,944 INFO  L131       PetriNetUnfolder]: For 20/20 co-relation queries the response was YES.
[2024-03-11 23:08:23,946 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 627 conditions, 593 events. 34/593 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2085 event pairs, 0 based on Foata normal form. 0/497 useless extension candidates. Maximal degree in co-relation 268. Up to 16 conditions per place. 
[2024-03-11 23:08:23,957 INFO  L119        LiptonReduction]: Number of co-enabled transitions 14222
[2024-03-11 23:08:27,386 INFO  L134        LiptonReduction]: Checked pairs total: 81302
[2024-03-11 23:08:27,386 INFO  L136        LiptonReduction]: Total number of compositions: 144
[2024-03-11 23:08:27,390 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-11 23:08:27,391 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;@21a18a5e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2024-03-11 23:08:27,391 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 23 error locations.
[2024-03-11 23:08:27,392 INFO  L130       PetriNetUnfolder]: 0/0 cut-off events.
[2024-03-11 23:08:27,392 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2024-03-11 23:08:27,392 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 23:08:27,393 INFO  L209   CegarLoopForPetriNet]: trace histogram [1]
[2024-03-11 23:08:27,393 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 20 more)] ===
[2024-03-11 23:08:27,393 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 23:08:27,393 INFO  L85        PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times
[2024-03-11 23:08:27,393 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 23:08:27,394 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193262858]
[2024-03-11 23:08:27,394 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:08:27,394 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 23:08:27,399 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 23:08:27,400 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 23:08:27,400 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 23:08:27,400 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193262858]
[2024-03-11 23:08:27,401 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193262858] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 23:08:27,401 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 23:08:27,401 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0
[2024-03-11 23:08:27,401 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840406850]
[2024-03-11 23:08:27,401 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 23:08:27,401 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-03-11 23:08:27,401 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 23:08:27,402 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-03-11 23:08:27,402 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-03-11 23:08:27,402 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 225 out of 387
[2024-03-11 23:08:27,403 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 97 transitions, 218 flow. Second operand  has 2 states, 2 states have (on average 225.5) internal successors, (451), 2 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:08:27,403 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 23:08:27,403 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 387
[2024-03-11 23:08:27,403 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 23:08:27,722 INFO  L130       PetriNetUnfolder]: 966/3070 cut-off events.
[2024-03-11 23:08:27,723 INFO  L131       PetriNetUnfolder]: For 148/191 co-relation queries the response was YES.
[2024-03-11 23:08:27,726 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4735 conditions, 3070 events. 966/3070 cut-off events. For 148/191 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 23295 event pairs, 748 based on Foata normal form. 0/2560 useless extension candidates. Maximal degree in co-relation 3700. Up to 1581 conditions per place. 
[2024-03-11 23:08:27,735 INFO  L137   encePairwiseOnDemand]: 382/387 looper letters, 33 selfloop transitions, 0 changer transitions 0/92 dead transitions.
[2024-03-11 23:08:27,735 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 92 transitions, 274 flow
[2024-03-11 23:08:27,740 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-03-11 23:08:27,740 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2024-03-11 23:08:27,741 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 488 transitions.
[2024-03-11 23:08:27,741 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6304909560723514
[2024-03-11 23:08:27,742 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 488 transitions.
[2024-03-11 23:08:27,742 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 488 transitions.
[2024-03-11 23:08:27,742 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 23:08:27,742 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 488 transitions.
[2024-03-11 23:08:27,743 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 244.0) internal successors, (488), 2 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:08:27,744 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 387.0) internal successors, (1161), 3 states have internal predecessors, (1161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:08:27,745 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 387.0) internal successors, (1161), 3 states have internal predecessors, (1161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:08:27,745 INFO  L175             Difference]: Start difference. First operand has 97 places, 97 transitions, 218 flow. Second operand 2 states and 488 transitions.
[2024-03-11 23:08:27,745 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 92 transitions, 274 flow
[2024-03-11 23:08:27,747 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 92 transitions, 274 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-11 23:08:27,749 INFO  L231             Difference]: Finished difference. Result has 93 places, 92 transitions, 208 flow
[2024-03-11 23:08:27,749 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=387, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=208, PETRI_PLACES=93, PETRI_TRANSITIONS=92}
[2024-03-11 23:08:27,750 INFO  L288   CegarLoopForPetriNet]: 97 programPoint places, -4 predicate places.
[2024-03-11 23:08:27,750 INFO  L495      AbstractCegarLoop]: Abstraction has has 93 places, 92 transitions, 208 flow
[2024-03-11 23:08:27,751 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 225.5) internal successors, (451), 2 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:08:27,751 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 23:08:27,751 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-03-11 23:08:27,751 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-03-11 23:08:27,751 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 20 more)] ===
[2024-03-11 23:08:27,752 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 23:08:27,752 INFO  L85        PathProgramCache]: Analyzing trace with hash -1489223633, now seen corresponding path program 1 times
[2024-03-11 23:08:27,752 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 23:08:27,752 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479450455]
[2024-03-11 23:08:27,752 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:08:27,752 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 23:08:27,769 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 23:08:27,927 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 23:08:27,927 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 23:08:27,927 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479450455]
[2024-03-11 23:08:27,927 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479450455] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 23:08:27,927 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 23:08:27,927 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-11 23:08:27,927 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006322444]
[2024-03-11 23:08:27,928 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 23:08:27,928 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-11 23:08:27,928 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 23:08:27,928 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-11 23:08:27,928 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-11 23:08:28,245 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 183 out of 387
[2024-03-11 23:08:28,246 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 92 transitions, 208 flow. Second operand  has 6 states, 6 states have (on average 184.0) internal successors, (1104), 6 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:08:28,246 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 23:08:28,246 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 387
[2024-03-11 23:08:28,246 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 23:08:29,148 INFO  L130       PetriNetUnfolder]: 5783/12186 cut-off events.
[2024-03-11 23:08:29,148 INFO  L131       PetriNetUnfolder]: For 300/384 co-relation queries the response was YES.
[2024-03-11 23:08:29,159 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21422 conditions, 12186 events. 5783/12186 cut-off events. For 300/384 co-relation queries the response was YES. Maximal size of possible extension queue 284. Compared 93067 event pairs, 4976 based on Foata normal form. 0/10926 useless extension candidates. Maximal degree in co-relation 21417. Up to 9060 conditions per place. 
[2024-03-11 23:08:29,214 INFO  L137   encePairwiseOnDemand]: 374/387 looper letters, 54 selfloop transitions, 8 changer transitions 0/95 dead transitions.
[2024-03-11 23:08:29,214 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 95 transitions, 338 flow
[2024-03-11 23:08:29,215 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-11 23:08:29,215 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-11 23:08:29,217 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1165 transitions.
[2024-03-11 23:08:29,217 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5017226528854436
[2024-03-11 23:08:29,217 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 1165 transitions.
[2024-03-11 23:08:29,217 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 1165 transitions.
[2024-03-11 23:08:29,218 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 23:08:29,218 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1165 transitions.
[2024-03-11 23:08:29,220 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 194.16666666666666) internal successors, (1165), 6 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:08:29,223 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 387.0) internal successors, (2709), 7 states have internal predecessors, (2709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:08:29,224 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 387.0) internal successors, (2709), 7 states have internal predecessors, (2709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:08:29,224 INFO  L175             Difference]: Start difference. First operand has 93 places, 92 transitions, 208 flow. Second operand 6 states and 1165 transitions.
[2024-03-11 23:08:29,224 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 95 transitions, 338 flow
[2024-03-11 23:08:29,226 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 95 transitions, 338 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-11 23:08:29,227 INFO  L231             Difference]: Finished difference. Result has 97 places, 95 transitions, 260 flow
[2024-03-11 23:08:29,227 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=387, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=260, PETRI_PLACES=97, PETRI_TRANSITIONS=95}
[2024-03-11 23:08:29,228 INFO  L288   CegarLoopForPetriNet]: 97 programPoint places, 0 predicate places.
[2024-03-11 23:08:29,228 INFO  L495      AbstractCegarLoop]: Abstraction has has 97 places, 95 transitions, 260 flow
[2024-03-11 23:08:29,228 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 184.0) internal successors, (1104), 6 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:08:29,228 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 23:08:29,228 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 23:08:29,228 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-03-11 23:08:29,229 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 20 more)] ===
[2024-03-11 23:08:29,229 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 23:08:29,229 INFO  L85        PathProgramCache]: Analyzing trace with hash -1119616268, now seen corresponding path program 1 times
[2024-03-11 23:08:29,229 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 23:08:29,229 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978965182]
[2024-03-11 23:08:29,229 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:08:29,229 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 23:08:29,239 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 23:08:29,372 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 23:08:29,373 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 23:08:29,373 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978965182]
[2024-03-11 23:08:29,373 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978965182] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 23:08:29,373 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 23:08:29,373 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-11 23:08:29,373 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263009846]
[2024-03-11 23:08:29,373 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 23:08:29,374 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-11 23:08:29,374 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 23:08:29,374 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-11 23:08:29,374 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-11 23:08:29,933 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 212 out of 387
[2024-03-11 23:08:29,934 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 95 transitions, 260 flow. Second operand  has 6 states, 6 states have (on average 213.16666666666666) internal successors, (1279), 6 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:08:29,934 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 23:08:29,934 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 387
[2024-03-11 23:08:29,934 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 23:08:30,693 INFO  L130       PetriNetUnfolder]: 1765/3993 cut-off events.
[2024-03-11 23:08:30,693 INFO  L131       PetriNetUnfolder]: For 276/333 co-relation queries the response was YES.
[2024-03-11 23:08:30,697 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7224 conditions, 3993 events. 1765/3993 cut-off events. For 276/333 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 26629 event pairs, 592 based on Foata normal form. 3/3459 useless extension candidates. Maximal degree in co-relation 7215. Up to 1280 conditions per place. 
[2024-03-11 23:08:30,707 INFO  L137   encePairwiseOnDemand]: 381/387 looper letters, 118 selfloop transitions, 5 changer transitions 4/178 dead transitions.
[2024-03-11 23:08:30,707 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 178 transitions, 698 flow
[2024-03-11 23:08:30,714 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-11 23:08:30,714 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-11 23:08:30,717 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1395 transitions.
[2024-03-11 23:08:30,717 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6007751937984496
[2024-03-11 23:08:30,717 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 1395 transitions.
[2024-03-11 23:08:30,717 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 1395 transitions.
[2024-03-11 23:08:30,718 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 23:08:30,718 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1395 transitions.
[2024-03-11 23:08:30,721 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 232.5) internal successors, (1395), 6 states have internal predecessors, (1395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:08:30,725 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 387.0) internal successors, (2709), 7 states have internal predecessors, (2709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:08:30,726 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 387.0) internal successors, (2709), 7 states have internal predecessors, (2709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:08:30,726 INFO  L175             Difference]: Start difference. First operand has 97 places, 95 transitions, 260 flow. Second operand 6 states and 1395 transitions.
[2024-03-11 23:08:30,726 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 178 transitions, 698 flow
[2024-03-11 23:08:30,728 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 178 transitions, 698 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-11 23:08:30,730 INFO  L231             Difference]: Finished difference. Result has 101 places, 90 transitions, 245 flow
[2024-03-11 23:08:30,730 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=387, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=245, PETRI_PLACES=101, PETRI_TRANSITIONS=90}
[2024-03-11 23:08:30,731 INFO  L288   CegarLoopForPetriNet]: 97 programPoint places, 4 predicate places.
[2024-03-11 23:08:30,731 INFO  L495      AbstractCegarLoop]: Abstraction has has 101 places, 90 transitions, 245 flow
[2024-03-11 23:08:30,731 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 213.16666666666666) internal successors, (1279), 6 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:08:30,731 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 23:08:30,731 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 23:08:30,732 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-03-11 23:08:30,732 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 20 more)] ===
[2024-03-11 23:08:30,732 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 23:08:30,732 INFO  L85        PathProgramCache]: Analyzing trace with hash 747844305, now seen corresponding path program 1 times
[2024-03-11 23:08:30,732 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 23:08:30,732 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183689445]
[2024-03-11 23:08:30,732 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:08:30,732 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 23:08:30,742 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 23:08:30,754 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 23:08:30,754 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 23:08:30,754 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183689445]
[2024-03-11 23:08:30,754 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183689445] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 23:08:30,754 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 23:08:30,754 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-11 23:08:30,754 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232991662]
[2024-03-11 23:08:30,754 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 23:08:30,755 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-11 23:08:30,755 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 23:08:30,755 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-11 23:08:30,755 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-11 23:08:30,770 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 218 out of 387
[2024-03-11 23:08:30,770 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 90 transitions, 245 flow. Second operand  has 3 states, 3 states have (on average 220.33333333333334) internal successors, (661), 3 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:08:30,770 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 23:08:30,770 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 387
[2024-03-11 23:08:30,770 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 23:08:31,099 INFO  L130       PetriNetUnfolder]: 1198/3411 cut-off events.
[2024-03-11 23:08:31,099 INFO  L131       PetriNetUnfolder]: For 421/489 co-relation queries the response was YES.
[2024-03-11 23:08:31,104 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5989 conditions, 3411 events. 1198/3411 cut-off events. For 421/489 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 25389 event pairs, 835 based on Foata normal form. 0/2883 useless extension candidates. Maximal degree in co-relation 5979. Up to 1802 conditions per place. 
[2024-03-11 23:08:31,111 INFO  L137   encePairwiseOnDemand]: 382/387 looper letters, 54 selfloop transitions, 4 changer transitions 0/111 dead transitions.
[2024-03-11 23:08:31,111 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 111 transitions, 417 flow
[2024-03-11 23:08:31,112 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-11 23:08:31,112 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-11 23:08:31,113 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 712 transitions.
[2024-03-11 23:08:31,113 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6132644272179156
[2024-03-11 23:08:31,113 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 712 transitions.
[2024-03-11 23:08:31,113 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 712 transitions.
[2024-03-11 23:08:31,114 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 23:08:31,114 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 712 transitions.
[2024-03-11 23:08:31,115 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 237.33333333333334) internal successors, (712), 3 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:08:31,116 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 387.0) internal successors, (1548), 4 states have internal predecessors, (1548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:08:31,116 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 387.0) internal successors, (1548), 4 states have internal predecessors, (1548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:08:31,117 INFO  L175             Difference]: Start difference. First operand has 101 places, 90 transitions, 245 flow. Second operand 3 states and 712 transitions.
[2024-03-11 23:08:31,117 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 111 transitions, 417 flow
[2024-03-11 23:08:31,119 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 111 transitions, 399 flow, removed 3 selfloop flow, removed 5 redundant places.
[2024-03-11 23:08:31,120 INFO  L231             Difference]: Finished difference. Result has 99 places, 93 transitions, 255 flow
[2024-03-11 23:08:31,120 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=387, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=255, PETRI_PLACES=99, PETRI_TRANSITIONS=93}
[2024-03-11 23:08:31,120 INFO  L288   CegarLoopForPetriNet]: 97 programPoint places, 2 predicate places.
[2024-03-11 23:08:31,121 INFO  L495      AbstractCegarLoop]: Abstraction has has 99 places, 93 transitions, 255 flow
[2024-03-11 23:08:31,121 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 220.33333333333334) internal successors, (661), 3 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:08:31,121 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 23:08:31,121 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 23:08:31,121 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-03-11 23:08:31,121 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 20 more)] ===
[2024-03-11 23:08:31,121 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 23:08:31,121 INFO  L85        PathProgramCache]: Analyzing trace with hash 1040542115, now seen corresponding path program 1 times
[2024-03-11 23:08:31,122 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 23:08:31,122 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464149671]
[2024-03-11 23:08:31,122 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:08:31,122 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 23:08:31,132 ERROR L245   FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2024-03-11 23:08:31,133 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1738729980]
[2024-03-11 23:08:31,133 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:08:31,133 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 23:08:31,133 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 23:08:31,149 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)
[2024-03-11 23:08:31,152 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
[2024-03-11 23:08:31,303 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 23:08:31,305 INFO  L263         TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 3 conjunts are in the unsatisfiable core
[2024-03-11 23:08:31,306 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 23:08:31,316 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 23:08:31,317 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-03-11 23:08:31,317 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 23:08:31,317 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464149671]
[2024-03-11 23:08:31,317 WARN  L310   FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2024-03-11 23:08:31,317 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738729980]
[2024-03-11 23:08:31,317 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1738729980] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 23:08:31,318 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 23:08:31,318 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-11 23:08:31,318 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914112254]
[2024-03-11 23:08:31,318 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 23:08:31,318 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-11 23:08:31,318 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 23:08:31,319 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-11 23:08:31,319 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-11 23:08:31,340 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 206 out of 387
[2024-03-11 23:08:31,341 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 93 transitions, 255 flow. Second operand  has 3 states, 3 states have (on average 209.33333333333334) internal successors, (628), 3 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:08:31,341 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 23:08:31,341 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 387
[2024-03-11 23:08:31,341 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 23:08:31,605 INFO  L130       PetriNetUnfolder]: 1130/3352 cut-off events.
[2024-03-11 23:08:31,605 INFO  L131       PetriNetUnfolder]: For 535/623 co-relation queries the response was YES.
[2024-03-11 23:08:31,610 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5881 conditions, 3352 events. 1130/3352 cut-off events. For 535/623 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 25245 event pairs, 860 based on Foata normal form. 0/2829 useless extension candidates. Maximal degree in co-relation 5870. Up to 1829 conditions per place. 
[2024-03-11 23:08:31,617 INFO  L137   encePairwiseOnDemand]: 384/387 looper letters, 35 selfloop transitions, 1 changer transitions 0/91 dead transitions.
[2024-03-11 23:08:31,617 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 91 transitions, 323 flow
[2024-03-11 23:08:31,618 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-11 23:08:31,618 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-11 23:08:31,619 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 654 transitions.
[2024-03-11 23:08:31,619 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5633074935400517
[2024-03-11 23:08:31,619 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 654 transitions.
[2024-03-11 23:08:31,619 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 654 transitions.
[2024-03-11 23:08:31,619 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 23:08:31,620 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 654 transitions.
[2024-03-11 23:08:31,621 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 218.0) internal successors, (654), 3 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:08:31,622 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 387.0) internal successors, (1548), 4 states have internal predecessors, (1548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:08:31,622 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 387.0) internal successors, (1548), 4 states have internal predecessors, (1548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:08:31,622 INFO  L175             Difference]: Start difference. First operand has 99 places, 93 transitions, 255 flow. Second operand 3 states and 654 transitions.
[2024-03-11 23:08:31,622 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 91 transitions, 323 flow
[2024-03-11 23:08:31,624 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 91 transitions, 319 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-11 23:08:31,625 INFO  L231             Difference]: Finished difference. Result has 98 places, 91 transitions, 249 flow
[2024-03-11 23:08:31,625 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=387, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=249, PETRI_PLACES=98, PETRI_TRANSITIONS=91}
[2024-03-11 23:08:31,626 INFO  L288   CegarLoopForPetriNet]: 97 programPoint places, 1 predicate places.
[2024-03-11 23:08:31,626 INFO  L495      AbstractCegarLoop]: Abstraction has has 98 places, 91 transitions, 249 flow
[2024-03-11 23:08:31,626 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 209.33333333333334) internal successors, (628), 3 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:08:31,626 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 23:08:31,626 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 23:08:31,634 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2024-03-11 23:08:31,827 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 23:08:31,830 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 20 more)] ===
[2024-03-11 23:08:31,830 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 23:08:31,830 INFO  L85        PathProgramCache]: Analyzing trace with hash -72560286, now seen corresponding path program 1 times
[2024-03-11 23:08:31,831 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 23:08:31,831 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827149953]
[2024-03-11 23:08:31,831 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:08:31,831 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 23:08:31,859 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 23:08:31,876 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2024-03-11 23:08:31,876 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 23:08:31,876 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827149953]
[2024-03-11 23:08:31,876 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827149953] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 23:08:31,877 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 23:08:31,877 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-11 23:08:31,877 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512339459]
[2024-03-11 23:08:31,877 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 23:08:31,878 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-11 23:08:31,878 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 23:08:31,879 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-11 23:08:31,879 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-11 23:08:31,894 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 218 out of 387
[2024-03-11 23:08:31,894 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 91 transitions, 249 flow. Second operand  has 3 states, 3 states have (on average 221.0) internal successors, (663), 3 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:08:31,894 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 23:08:31,894 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 387
[2024-03-11 23:08:31,895 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 23:08:32,294 INFO  L130       PetriNetUnfolder]: 1249/3443 cut-off events.
[2024-03-11 23:08:32,294 INFO  L131       PetriNetUnfolder]: For 435/528 co-relation queries the response was YES.
[2024-03-11 23:08:32,298 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6143 conditions, 3443 events. 1249/3443 cut-off events. For 435/528 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 25287 event pairs, 854 based on Foata normal form. 6/2930 useless extension candidates. Maximal degree in co-relation 6132. Up to 1893 conditions per place. 
[2024-03-11 23:08:32,304 INFO  L137   encePairwiseOnDemand]: 382/387 looper letters, 55 selfloop transitions, 5 changer transitions 0/111 dead transitions.
[2024-03-11 23:08:32,305 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 111 transitions, 422 flow
[2024-03-11 23:08:32,306 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-11 23:08:32,306 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-11 23:08:32,307 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 711 transitions.
[2024-03-11 23:08:32,307 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6124031007751938
[2024-03-11 23:08:32,308 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 711 transitions.
[2024-03-11 23:08:32,308 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 711 transitions.
[2024-03-11 23:08:32,308 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 23:08:32,309 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 711 transitions.
[2024-03-11 23:08:32,310 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 237.0) internal successors, (711), 3 states have internal predecessors, (711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:08:32,311 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 387.0) internal successors, (1548), 4 states have internal predecessors, (1548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:08:32,312 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 387.0) internal successors, (1548), 4 states have internal predecessors, (1548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:08:32,312 INFO  L175             Difference]: Start difference. First operand has 98 places, 91 transitions, 249 flow. Second operand 3 states and 711 transitions.
[2024-03-11 23:08:32,312 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 111 transitions, 422 flow
[2024-03-11 23:08:32,313 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 111 transitions, 421 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-11 23:08:32,315 INFO  L231             Difference]: Finished difference. Result has 100 places, 94 transitions, 281 flow
[2024-03-11 23:08:32,315 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=387, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=281, PETRI_PLACES=100, PETRI_TRANSITIONS=94}
[2024-03-11 23:08:32,316 INFO  L288   CegarLoopForPetriNet]: 97 programPoint places, 3 predicate places.
[2024-03-11 23:08:32,316 INFO  L495      AbstractCegarLoop]: Abstraction has has 100 places, 94 transitions, 281 flow
[2024-03-11 23:08:32,316 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 221.0) internal successors, (663), 3 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:08:32,317 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 23:08:32,317 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 23:08:32,317 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-03-11 23:08:32,317 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 20 more)] ===
[2024-03-11 23:08:32,317 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 23:08:32,317 INFO  L85        PathProgramCache]: Analyzing trace with hash -2077417150, now seen corresponding path program 1 times
[2024-03-11 23:08:32,318 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 23:08:32,318 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517684836]
[2024-03-11 23:08:32,318 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:08:32,318 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 23:08:32,333 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 23:08:32,390 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 23:08:32,390 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 23:08:32,390 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517684836]
[2024-03-11 23:08:32,390 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517684836] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 23:08:32,391 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 23:08:32,391 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-03-11 23:08:32,391 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818372736]
[2024-03-11 23:08:32,391 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 23:08:32,391 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-11 23:08:32,392 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 23:08:32,392 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-11 23:08:32,392 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-11 23:08:32,413 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 220 out of 387
[2024-03-11 23:08:32,414 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 94 transitions, 281 flow. Second operand  has 3 states, 3 states have (on average 223.66666666666666) internal successors, (671), 3 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:08:32,414 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 23:08:32,414 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 220 of 387
[2024-03-11 23:08:32,414 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 23:08:32,737 INFO  L130       PetriNetUnfolder]: 829/2639 cut-off events.
[2024-03-11 23:08:32,737 INFO  L131       PetriNetUnfolder]: For 480/683 co-relation queries the response was YES.
[2024-03-11 23:08:32,742 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4729 conditions, 2639 events. 829/2639 cut-off events. For 480/683 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 18673 event pairs, 302 based on Foata normal form. 36/2252 useless extension candidates. Maximal degree in co-relation 4717. Up to 727 conditions per place. 
[2024-03-11 23:08:32,747 INFO  L137   encePairwiseOnDemand]: 383/387 looper letters, 52 selfloop transitions, 4 changer transitions 0/112 dead transitions.
[2024-03-11 23:08:32,747 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 434 flow
[2024-03-11 23:08:32,748 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-11 23:08:32,748 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-11 23:08:32,749 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 715 transitions.
[2024-03-11 23:08:32,749 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.615848406546081
[2024-03-11 23:08:32,749 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 715 transitions.
[2024-03-11 23:08:32,749 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 715 transitions.
[2024-03-11 23:08:32,750 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 23:08:32,750 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 715 transitions.
[2024-03-11 23:08:32,751 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 238.33333333333334) internal successors, (715), 3 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:08:32,752 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 387.0) internal successors, (1548), 4 states have internal predecessors, (1548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:08:32,753 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 387.0) internal successors, (1548), 4 states have internal predecessors, (1548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:08:32,753 INFO  L175             Difference]: Start difference. First operand has 100 places, 94 transitions, 281 flow. Second operand 3 states and 715 transitions.
[2024-03-11 23:08:32,753 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 434 flow
[2024-03-11 23:08:32,755 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 112 transitions, 429 flow, removed 1 selfloop flow, removed 1 redundant places.
[2024-03-11 23:08:32,756 INFO  L231             Difference]: Finished difference. Result has 101 places, 92 transitions, 270 flow
[2024-03-11 23:08:32,756 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=387, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=270, PETRI_PLACES=101, PETRI_TRANSITIONS=92}
[2024-03-11 23:08:32,756 INFO  L288   CegarLoopForPetriNet]: 97 programPoint places, 4 predicate places.
[2024-03-11 23:08:32,757 INFO  L495      AbstractCegarLoop]: Abstraction has has 101 places, 92 transitions, 270 flow
[2024-03-11 23:08:32,757 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 223.66666666666666) internal successors, (671), 3 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:08:32,757 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 23:08:32,757 INFO  L209   CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1]
[2024-03-11 23:08:32,757 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-03-11 23:08:32,757 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 20 more)] ===
[2024-03-11 23:08:32,757 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 23:08:32,757 INFO  L85        PathProgramCache]: Analyzing trace with hash -1413669245, now seen corresponding path program 1 times
[2024-03-11 23:08:32,757 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 23:08:32,758 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909083759]
[2024-03-11 23:08:32,758 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:08:32,758 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 23:08:32,781 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-11 23:08:32,781 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-03-11 23:08:32,796 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-11 23:08:32,802 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-03-11 23:08:32,802 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-03-11 23:08:32,802 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 23 remaining)
[2024-03-11 23:08:32,802 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (21 of 23 remaining)
[2024-03-11 23:08:32,802 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (20 of 23 remaining)
[2024-03-11 23:08:32,803 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (19 of 23 remaining)
[2024-03-11 23:08:32,803 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (18 of 23 remaining)
[2024-03-11 23:08:32,803 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (17 of 23 remaining)
[2024-03-11 23:08:32,803 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (16 of 23 remaining)
[2024-03-11 23:08:32,803 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (15 of 23 remaining)
[2024-03-11 23:08:32,803 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (14 of 23 remaining)
[2024-03-11 23:08:32,803 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (13 of 23 remaining)
[2024-03-11 23:08:32,803 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (12 of 23 remaining)
[2024-03-11 23:08:32,803 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (11 of 23 remaining)
[2024-03-11 23:08:32,803 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (10 of 23 remaining)
[2024-03-11 23:08:32,803 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (9 of 23 remaining)
[2024-03-11 23:08:32,803 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (8 of 23 remaining)
[2024-03-11 23:08:32,803 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (7 of 23 remaining)
[2024-03-11 23:08:32,804 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (6 of 23 remaining)
[2024-03-11 23:08:32,804 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (5 of 23 remaining)
[2024-03-11 23:08:32,804 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (4 of 23 remaining)
[2024-03-11 23:08:32,804 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 23 remaining)
[2024-03-11 23:08:32,804 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 23 remaining)
[2024-03-11 23:08:32,804 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (1 of 23 remaining)
[2024-03-11 23:08:32,804 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (0 of 23 remaining)
[2024-03-11 23:08:32,804 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-03-11 23:08:32,804 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 23:08:32,805 WARN  L233   ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-03-11 23:08:32,805 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances.
[2024-03-11 23:08:32,838 INFO  L144    ThreadInstanceAdder]: Constructed 15 joinOtherThreadTransitions.
[2024-03-11 23:08:32,841 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 277 places, 297 transitions, 660 flow
[2024-03-11 23:08:33,001 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1254] threadEXIT-->L1027-13: Formula: (= (let ((.cse0 (mod |v_threadThread1of3ForFork0_#t~mem8_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread3of3ForFork0_thidvar0_12)  InVars {threadThread3of3ForFork0_thidvar0=v_threadThread3of3ForFork0_thidvar0_12, threadThread1of3ForFork0_#t~mem8=|v_threadThread1of3ForFork0_#t~mem8_12|}  OutVars{threadThread3of3ForFork0_thidvar0=v_threadThread3of3ForFork0_thidvar0_12, threadThread1of3ForFork0_#t~mem8=|v_threadThread1of3ForFork0_#t~mem8_12|}  AuxVars[]  AssignedVars[][5], [threadThread1of3ForFork0InUse, threadThread2of3ForFork0NotInUse, 114#L1036-10true, threadThread3of3ForFork0NotInUse, 192#L1027-13true])
[2024-03-11 23:08:33,001 INFO  L383   tUnfolder$Statistics]: this new event has 240 ancestors and is cut-off event
[2024-03-11 23:08:33,001 INFO  L386   tUnfolder$Statistics]:   existing Event has 183 ancestors and is cut-off event
[2024-03-11 23:08:33,001 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2024-03-11 23:08:33,001 INFO  L386   tUnfolder$Statistics]:   existing Event has 183 ancestors and is cut-off event
[2024-03-11 23:08:33,019 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1246] threadEXIT-->L1027-13: Formula: (= (let ((.cse0 (mod |v_threadThread3of3ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread1of3ForFork0_thidvar0_8)  InVars {threadThread1of3ForFork0_thidvar0=v_threadThread1of3ForFork0_thidvar0_8, threadThread3of3ForFork0_#t~mem8=|v_threadThread3of3ForFork0_#t~mem8_8|}  OutVars{threadThread1of3ForFork0_thidvar0=v_threadThread1of3ForFork0_thidvar0_8, threadThread3of3ForFork0_#t~mem8=|v_threadThread3of3ForFork0_#t~mem8_8|}  AuxVars[]  AssignedVars[][79], [threadThread1of3ForFork0NotInUse, 114#L1036-10true, threadThread2of3ForFork0InUse, 181#L1027-13true, threadThread3of3ForFork0InUse, 31#$Ultimate##0true])
[2024-03-11 23:08:33,019 INFO  L383   tUnfolder$Statistics]: this new event has 257 ancestors and is cut-off event
[2024-03-11 23:08:33,019 INFO  L386   tUnfolder$Statistics]:   existing Event has 200 ancestors and is cut-off event
[2024-03-11 23:08:33,019 INFO  L386   tUnfolder$Statistics]:   existing Event has 200 ancestors and is cut-off event
[2024-03-11 23:08:33,019 INFO  L386   tUnfolder$Statistics]:   existing Event has 143 ancestors and is cut-off event
[2024-03-11 23:08:33,020 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1246] threadEXIT-->L1027-13: Formula: (= (let ((.cse0 (mod |v_threadThread3of3ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread1of3ForFork0_thidvar0_8)  InVars {threadThread1of3ForFork0_thidvar0=v_threadThread1of3ForFork0_thidvar0_8, threadThread3of3ForFork0_#t~mem8=|v_threadThread3of3ForFork0_#t~mem8_8|}  OutVars{threadThread1of3ForFork0_thidvar0=v_threadThread1of3ForFork0_thidvar0_8, threadThread3of3ForFork0_#t~mem8=|v_threadThread3of3ForFork0_#t~mem8_8|}  AuxVars[]  AssignedVars[][79], [threadThread1of3ForFork0NotInUse, threadThread2of3ForFork0NotInUse, 114#L1036-10true, 181#L1027-13true, threadThread3of3ForFork0InUse])
[2024-03-11 23:08:33,020 INFO  L383   tUnfolder$Statistics]: this new event has 240 ancestors and is cut-off event
[2024-03-11 23:08:33,020 INFO  L386   tUnfolder$Statistics]:   existing Event has 183 ancestors and is cut-off event
[2024-03-11 23:08:33,020 INFO  L386   tUnfolder$Statistics]:   existing Event has 183 ancestors and is cut-off event
[2024-03-11 23:08:33,020 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2024-03-11 23:08:33,047 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1254] threadEXIT-->L1027-13: Formula: (= (let ((.cse0 (mod |v_threadThread1of3ForFork0_#t~mem8_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread3of3ForFork0_thidvar0_12)  InVars {threadThread3of3ForFork0_thidvar0=v_threadThread3of3ForFork0_thidvar0_12, threadThread1of3ForFork0_#t~mem8=|v_threadThread1of3ForFork0_#t~mem8_12|}  OutVars{threadThread3of3ForFork0_thidvar0=v_threadThread3of3ForFork0_thidvar0_12, threadThread1of3ForFork0_#t~mem8=|v_threadThread1of3ForFork0_#t~mem8_12|}  AuxVars[]  AssignedVars[][5], [threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, threadThread3of3ForFork0NotInUse, 192#L1027-13true, 31#$Ultimate##0true, 187#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue])
[2024-03-11 23:08:33,048 INFO  L383   tUnfolder$Statistics]: this new event has 274 ancestors and is cut-off event
[2024-03-11 23:08:33,048 INFO  L386   tUnfolder$Statistics]:   existing Event has 217 ancestors and is cut-off event
[2024-03-11 23:08:33,048 INFO  L386   tUnfolder$Statistics]:   existing Event has 217 ancestors and is cut-off event
[2024-03-11 23:08:33,048 INFO  L386   tUnfolder$Statistics]:   existing Event has 160 ancestors and is cut-off event
[2024-03-11 23:08:33,048 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1246] threadEXIT-->L1027-13: Formula: (= (let ((.cse0 (mod |v_threadThread3of3ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread1of3ForFork0_thidvar0_8)  InVars {threadThread1of3ForFork0_thidvar0=v_threadThread1of3ForFork0_thidvar0_8, threadThread3of3ForFork0_#t~mem8=|v_threadThread3of3ForFork0_#t~mem8_8|}  OutVars{threadThread1of3ForFork0_thidvar0=v_threadThread1of3ForFork0_thidvar0_8, threadThread3of3ForFork0_#t~mem8=|v_threadThread3of3ForFork0_#t~mem8_8|}  AuxVars[]  AssignedVars[][79], [threadThread1of3ForFork0NotInUse, threadThread2of3ForFork0InUse, 181#L1027-13true, threadThread3of3ForFork0InUse, 31#$Ultimate##0true, 187#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue])
[2024-03-11 23:08:33,048 INFO  L383   tUnfolder$Statistics]: this new event has 274 ancestors and is cut-off event
[2024-03-11 23:08:33,048 INFO  L386   tUnfolder$Statistics]:   existing Event has 217 ancestors and is cut-off event
[2024-03-11 23:08:33,048 INFO  L386   tUnfolder$Statistics]:   existing Event has 217 ancestors and is cut-off event
[2024-03-11 23:08:33,048 INFO  L386   tUnfolder$Statistics]:   existing Event has 160 ancestors and is cut-off event
[2024-03-11 23:08:33,072 INFO  L130       PetriNetUnfolder]: 189/1929 cut-off events.
[2024-03-11 23:08:33,072 INFO  L131       PetriNetUnfolder]: For 158/175 co-relation queries the response was YES.
[2024-03-11 23:08:33,085 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2117 conditions, 1929 events. 189/1929 cut-off events. For 158/175 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 11886 event pairs, 4 based on Foata normal form. 15/1610 useless extension candidates. Maximal degree in co-relation 599. Up to 56 conditions per place. 
[2024-03-11 23:08:33,085 INFO  L82        GeneralOperation]: Start removeDead. Operand has 277 places, 297 transitions, 660 flow
[2024-03-11 23:08:33,094 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 247 places, 259 transitions, 566 flow
[2024-03-11 23:08:33,094 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2024-03-11 23:08:33,094 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 247 places, 259 transitions, 566 flow
[2024-03-11 23:08:33,094 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 247 places, 259 transitions, 566 flow
[2024-03-11 23:08:33,094 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 247 places, 259 transitions, 566 flow
[2024-03-11 23:08:33,261 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1254] threadEXIT-->L1027-13: Formula: (= (let ((.cse0 (mod |v_threadThread1of3ForFork0_#t~mem8_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread3of3ForFork0_thidvar0_12)  InVars {threadThread3of3ForFork0_thidvar0=v_threadThread3of3ForFork0_thidvar0_12, threadThread1of3ForFork0_#t~mem8=|v_threadThread1of3ForFork0_#t~mem8_12|}  OutVars{threadThread3of3ForFork0_thidvar0=v_threadThread3of3ForFork0_thidvar0_12, threadThread1of3ForFork0_#t~mem8=|v_threadThread1of3ForFork0_#t~mem8_12|}  AuxVars[]  AssignedVars[][3], [threadThread1of3ForFork0InUse, threadThread2of3ForFork0NotInUse, 114#L1036-10true, threadThread3of3ForFork0NotInUse, 192#L1027-13true])
[2024-03-11 23:08:33,261 INFO  L383   tUnfolder$Statistics]: this new event has 240 ancestors and is cut-off event
[2024-03-11 23:08:33,261 INFO  L386   tUnfolder$Statistics]:   existing Event has 183 ancestors and is cut-off event
[2024-03-11 23:08:33,261 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2024-03-11 23:08:33,261 INFO  L386   tUnfolder$Statistics]:   existing Event has 183 ancestors and is cut-off event
[2024-03-11 23:08:33,276 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1246] threadEXIT-->L1027-13: Formula: (= (let ((.cse0 (mod |v_threadThread3of3ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread1of3ForFork0_thidvar0_8)  InVars {threadThread1of3ForFork0_thidvar0=v_threadThread1of3ForFork0_thidvar0_8, threadThread3of3ForFork0_#t~mem8=|v_threadThread3of3ForFork0_#t~mem8_8|}  OutVars{threadThread1of3ForFork0_thidvar0=v_threadThread1of3ForFork0_thidvar0_8, threadThread3of3ForFork0_#t~mem8=|v_threadThread3of3ForFork0_#t~mem8_8|}  AuxVars[]  AssignedVars[][67], [threadThread1of3ForFork0NotInUse, 114#L1036-10true, threadThread2of3ForFork0InUse, 181#L1027-13true, threadThread3of3ForFork0InUse, 31#$Ultimate##0true])
[2024-03-11 23:08:33,276 INFO  L383   tUnfolder$Statistics]: this new event has 257 ancestors and is cut-off event
[2024-03-11 23:08:33,276 INFO  L386   tUnfolder$Statistics]:   existing Event has 200 ancestors and is cut-off event
[2024-03-11 23:08:33,276 INFO  L386   tUnfolder$Statistics]:   existing Event has 200 ancestors and is cut-off event
[2024-03-11 23:08:33,276 INFO  L386   tUnfolder$Statistics]:   existing Event has 143 ancestors and is cut-off event
[2024-03-11 23:08:33,276 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1246] threadEXIT-->L1027-13: Formula: (= (let ((.cse0 (mod |v_threadThread3of3ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread1of3ForFork0_thidvar0_8)  InVars {threadThread1of3ForFork0_thidvar0=v_threadThread1of3ForFork0_thidvar0_8, threadThread3of3ForFork0_#t~mem8=|v_threadThread3of3ForFork0_#t~mem8_8|}  OutVars{threadThread1of3ForFork0_thidvar0=v_threadThread1of3ForFork0_thidvar0_8, threadThread3of3ForFork0_#t~mem8=|v_threadThread3of3ForFork0_#t~mem8_8|}  AuxVars[]  AssignedVars[][67], [threadThread1of3ForFork0NotInUse, threadThread2of3ForFork0NotInUse, 114#L1036-10true, 181#L1027-13true, threadThread3of3ForFork0InUse])
[2024-03-11 23:08:33,277 INFO  L383   tUnfolder$Statistics]: this new event has 240 ancestors and is cut-off event
[2024-03-11 23:08:33,277 INFO  L386   tUnfolder$Statistics]:   existing Event has 183 ancestors and is cut-off event
[2024-03-11 23:08:33,277 INFO  L386   tUnfolder$Statistics]:   existing Event has 183 ancestors and is cut-off event
[2024-03-11 23:08:33,277 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2024-03-11 23:08:33,299 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1254] threadEXIT-->L1027-13: Formula: (= (let ((.cse0 (mod |v_threadThread1of3ForFork0_#t~mem8_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread3of3ForFork0_thidvar0_12)  InVars {threadThread3of3ForFork0_thidvar0=v_threadThread3of3ForFork0_thidvar0_12, threadThread1of3ForFork0_#t~mem8=|v_threadThread1of3ForFork0_#t~mem8_12|}  OutVars{threadThread3of3ForFork0_thidvar0=v_threadThread3of3ForFork0_thidvar0_12, threadThread1of3ForFork0_#t~mem8=|v_threadThread1of3ForFork0_#t~mem8_12|}  AuxVars[]  AssignedVars[][3], [threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, threadThread3of3ForFork0NotInUse, 192#L1027-13true, 31#$Ultimate##0true, 187#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue])
[2024-03-11 23:08:33,300 INFO  L383   tUnfolder$Statistics]: this new event has 274 ancestors and is cut-off event
[2024-03-11 23:08:33,300 INFO  L386   tUnfolder$Statistics]:   existing Event has 217 ancestors and is cut-off event
[2024-03-11 23:08:33,300 INFO  L386   tUnfolder$Statistics]:   existing Event has 217 ancestors and is cut-off event
[2024-03-11 23:08:33,300 INFO  L386   tUnfolder$Statistics]:   existing Event has 160 ancestors and is cut-off event
[2024-03-11 23:08:33,300 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1246] threadEXIT-->L1027-13: Formula: (= (let ((.cse0 (mod |v_threadThread3of3ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread1of3ForFork0_thidvar0_8)  InVars {threadThread1of3ForFork0_thidvar0=v_threadThread1of3ForFork0_thidvar0_8, threadThread3of3ForFork0_#t~mem8=|v_threadThread3of3ForFork0_#t~mem8_8|}  OutVars{threadThread1of3ForFork0_thidvar0=v_threadThread1of3ForFork0_thidvar0_8, threadThread3of3ForFork0_#t~mem8=|v_threadThread3of3ForFork0_#t~mem8_8|}  AuxVars[]  AssignedVars[][67], [threadThread1of3ForFork0NotInUse, threadThread2of3ForFork0InUse, 181#L1027-13true, threadThread3of3ForFork0InUse, 31#$Ultimate##0true, 187#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue])
[2024-03-11 23:08:33,300 INFO  L383   tUnfolder$Statistics]: this new event has 274 ancestors and is cut-off event
[2024-03-11 23:08:33,300 INFO  L386   tUnfolder$Statistics]:   existing Event has 217 ancestors and is cut-off event
[2024-03-11 23:08:33,300 INFO  L386   tUnfolder$Statistics]:   existing Event has 217 ancestors and is cut-off event
[2024-03-11 23:08:33,300 INFO  L386   tUnfolder$Statistics]:   existing Event has 160 ancestors and is cut-off event
[2024-03-11 23:08:33,322 INFO  L130       PetriNetUnfolder]: 189/1929 cut-off events.
[2024-03-11 23:08:33,322 INFO  L131       PetriNetUnfolder]: For 158/160 co-relation queries the response was YES.
[2024-03-11 23:08:33,331 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2117 conditions, 1929 events. 189/1929 cut-off events. For 158/160 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 11856 event pairs, 4 based on Foata normal form. 0/1595 useless extension candidates. Maximal degree in co-relation 599. Up to 56 conditions per place. 
[2024-03-11 23:08:33,369 INFO  L119        LiptonReduction]: Number of co-enabled transitions 29334
[2024-03-11 23:08:38,531 INFO  L134        LiptonReduction]: Checked pairs total: 180112
[2024-03-11 23:08:38,531 INFO  L136        LiptonReduction]: Total number of compositions: 172
[2024-03-11 23:08:38,532 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-11 23:08:38,533 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;@21a18a5e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2024-03-11 23:08:38,533 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 27 error locations.
[2024-03-11 23:08:38,533 INFO  L130       PetriNetUnfolder]: 0/0 cut-off events.
[2024-03-11 23:08:38,533 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2024-03-11 23:08:38,533 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 23:08:38,533 INFO  L209   CegarLoopForPetriNet]: trace histogram [1]
[2024-03-11 23:08:38,533 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] ===
[2024-03-11 23:08:38,534 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 23:08:38,534 INFO  L85        PathProgramCache]: Analyzing trace with hash 1453, now seen corresponding path program 1 times
[2024-03-11 23:08:38,534 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 23:08:38,534 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733603842]
[2024-03-11 23:08:38,534 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:08:38,534 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 23:08:38,536 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 23:08:38,537 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 23:08:38,537 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 23:08:38,537 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733603842]
[2024-03-11 23:08:38,537 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733603842] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 23:08:38,537 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 23:08:38,537 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0
[2024-03-11 23:08:38,538 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890130211]
[2024-03-11 23:08:38,538 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 23:08:38,538 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-03-11 23:08:38,538 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 23:08:38,538 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-03-11 23:08:38,538 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-03-11 23:08:38,539 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 269 out of 469
[2024-03-11 23:08:38,539 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 132 transitions, 312 flow. Second operand  has 2 states, 2 states have (on average 269.5) internal successors, (539), 2 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:08:38,539 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 23:08:38,539 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 269 of 469
[2024-03-11 23:08:38,539 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 23:08:41,505 INFO  L130       PetriNetUnfolder]: 16503/39374 cut-off events.
[2024-03-11 23:08:41,505 INFO  L131       PetriNetUnfolder]: For 2960/5110 co-relation queries the response was YES.
[2024-03-11 23:08:41,555 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 64036 conditions, 39374 events. 16503/39374 cut-off events. For 2960/5110 co-relation queries the response was YES. Maximal size of possible extension queue 858. Compared 412216 event pairs, 12571 based on Foata normal form. 0/33265 useless extension candidates. Maximal degree in co-relation 53420. Up to 23153 conditions per place. 
[2024-03-11 23:08:41,662 INFO  L137   encePairwiseOnDemand]: 464/469 looper letters, 48 selfloop transitions, 0 changer transitions 0/127 dead transitions.
[2024-03-11 23:08:41,663 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 127 transitions, 398 flow
[2024-03-11 23:08:41,664 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-03-11 23:08:41,664 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2024-03-11 23:08:41,665 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 591 transitions.
[2024-03-11 23:08:41,665 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6300639658848614
[2024-03-11 23:08:41,665 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 591 transitions.
[2024-03-11 23:08:41,665 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 591 transitions.
[2024-03-11 23:08:41,665 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 23:08:41,666 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 591 transitions.
[2024-03-11 23:08:41,667 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 295.5) internal successors, (591), 2 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)
[2024-03-11 23:08:41,668 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 469.0) internal successors, (1407), 3 states have internal predecessors, (1407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:08:41,668 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 469.0) internal successors, (1407), 3 states have internal predecessors, (1407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:08:41,668 INFO  L175             Difference]: Start difference. First operand has 128 places, 132 transitions, 312 flow. Second operand 2 states and 591 transitions.
[2024-03-11 23:08:41,668 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 127 transitions, 398 flow
[2024-03-11 23:08:41,670 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 127 transitions, 398 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-11 23:08:41,671 INFO  L231             Difference]: Finished difference. Result has 124 places, 127 transitions, 302 flow
[2024-03-11 23:08:41,672 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=469, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=302, PETRI_PLACES=124, PETRI_TRANSITIONS=127}
[2024-03-11 23:08:41,672 INFO  L288   CegarLoopForPetriNet]: 128 programPoint places, -4 predicate places.
[2024-03-11 23:08:41,672 INFO  L495      AbstractCegarLoop]: Abstraction has has 124 places, 127 transitions, 302 flow
[2024-03-11 23:08:41,673 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 269.5) internal successors, (539), 2 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:08:41,673 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 23:08:41,673 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-03-11 23:08:41,673 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-03-11 23:08:41,673 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] ===
[2024-03-11 23:08:41,673 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 23:08:41,673 INFO  L85        PathProgramCache]: Analyzing trace with hash 41384239, now seen corresponding path program 1 times
[2024-03-11 23:08:41,674 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 23:08:41,674 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990929228]
[2024-03-11 23:08:41,674 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:08:41,674 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 23:08:41,682 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 23:08:41,832 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 23:08:41,832 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 23:08:41,832 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990929228]
[2024-03-11 23:08:41,832 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990929228] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 23:08:41,832 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 23:08:41,832 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-11 23:08:41,833 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917210463]
[2024-03-11 23:08:41,833 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 23:08:41,833 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-11 23:08:41,833 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 23:08:41,833 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-11 23:08:41,834 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-11 23:08:42,449 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 221 out of 469
[2024-03-11 23:08:42,450 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 127 transitions, 302 flow. Second operand  has 6 states, 6 states have (on average 222.0) internal successors, (1332), 6 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:08:42,450 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 23:08:42,450 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 469
[2024-03-11 23:08:42,450 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 23:08:58,539 INFO  L130       PetriNetUnfolder]: 138065/239334 cut-off events.
[2024-03-11 23:08:58,539 INFO  L131       PetriNetUnfolder]: For 7855/9674 co-relation queries the response was YES.
[2024-03-11 23:08:58,890 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 433004 conditions, 239334 events. 138065/239334 cut-off events. For 7855/9674 co-relation queries the response was YES. Maximal size of possible extension queue 3735. Compared 2304100 event pairs, 117780 based on Foata normal form. 0/215843 useless extension candidates. Maximal degree in co-relation 432998. Up to 189469 conditions per place. 
[2024-03-11 23:08:59,760 INFO  L137   encePairwiseOnDemand]: 455/469 looper letters, 74 selfloop transitions, 8 changer transitions 0/129 dead transitions.
[2024-03-11 23:08:59,760 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 129 transitions, 470 flow
[2024-03-11 23:08:59,761 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-11 23:08:59,761 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-11 23:08:59,763 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1414 transitions.
[2024-03-11 23:08:59,764 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5024875621890548
[2024-03-11 23:08:59,764 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 1414 transitions.
[2024-03-11 23:08:59,764 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 1414 transitions.
[2024-03-11 23:08:59,765 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 23:08:59,765 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1414 transitions.
[2024-03-11 23:08:59,767 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 235.66666666666666) internal successors, (1414), 6 states have internal predecessors, (1414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:08:59,770 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 469.0) internal successors, (3283), 7 states have internal predecessors, (3283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:08:59,771 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 469.0) internal successors, (3283), 7 states have internal predecessors, (3283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:08:59,771 INFO  L175             Difference]: Start difference. First operand has 124 places, 127 transitions, 302 flow. Second operand 6 states and 1414 transitions.
[2024-03-11 23:08:59,771 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 129 transitions, 470 flow
[2024-03-11 23:08:59,777 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 129 transitions, 470 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-11 23:08:59,778 INFO  L231             Difference]: Finished difference. Result has 127 places, 129 transitions, 352 flow
[2024-03-11 23:08:59,779 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=469, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=352, PETRI_PLACES=127, PETRI_TRANSITIONS=129}
[2024-03-11 23:08:59,782 INFO  L288   CegarLoopForPetriNet]: 128 programPoint places, -1 predicate places.
[2024-03-11 23:08:59,782 INFO  L495      AbstractCegarLoop]: Abstraction has has 127 places, 129 transitions, 352 flow
[2024-03-11 23:08:59,783 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 222.0) internal successors, (1332), 6 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:08:59,783 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 23:08:59,783 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 23:08:59,783 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-03-11 23:08:59,783 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] ===
[2024-03-11 23:08:59,783 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 23:08:59,784 INFO  L85        PathProgramCache]: Analyzing trace with hash 66235208, now seen corresponding path program 1 times
[2024-03-11 23:08:59,784 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 23:08:59,784 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231574750]
[2024-03-11 23:08:59,784 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:08:59,784 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 23:08:59,802 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 23:08:59,926 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 23:08:59,926 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 23:08:59,926 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231574750]
[2024-03-11 23:08:59,926 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231574750] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 23:08:59,926 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 23:08:59,927 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-11 23:08:59,927 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999872062]
[2024-03-11 23:08:59,927 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 23:08:59,927 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-11 23:08:59,927 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 23:08:59,928 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-11 23:08:59,928 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-11 23:09:00,432 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 256 out of 469
[2024-03-11 23:09:00,433 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 129 transitions, 352 flow. Second operand  has 6 states, 6 states have (on average 257.1666666666667) internal successors, (1543), 6 states have internal predecessors, (1543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:09:00,433 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 23:09:00,433 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 469
[2024-03-11 23:09:00,434 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 23:09:05,372 INFO  L130       PetriNetUnfolder]: 28891/53009 cut-off events.
[2024-03-11 23:09:05,372 INFO  L131       PetriNetUnfolder]: For 4562/7037 co-relation queries the response was YES.
[2024-03-11 23:09:05,482 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 97438 conditions, 53009 events. 28891/53009 cut-off events. For 4562/7037 co-relation queries the response was YES. Maximal size of possible extension queue 988. Compared 463251 event pairs, 10253 based on Foata normal form. 45/46641 useless extension candidates. Maximal degree in co-relation 97428. Up to 19111 conditions per place. 
[2024-03-11 23:09:05,651 INFO  L137   encePairwiseOnDemand]: 463/469 looper letters, 185 selfloop transitions, 5 changer transitions 4/264 dead transitions.
[2024-03-11 23:09:05,651 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 264 transitions, 1076 flow
[2024-03-11 23:09:05,652 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-11 23:09:05,652 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-11 23:09:05,654 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1726 transitions.
[2024-03-11 23:09:05,655 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6133617626154939
[2024-03-11 23:09:05,655 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 1726 transitions.
[2024-03-11 23:09:05,655 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 1726 transitions.
[2024-03-11 23:09:05,656 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 23:09:05,656 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1726 transitions.
[2024-03-11 23:09:05,659 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 287.6666666666667) internal successors, (1726), 6 states have internal predecessors, (1726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:09:05,662 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 469.0) internal successors, (3283), 7 states have internal predecessors, (3283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:09:05,662 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 469.0) internal successors, (3283), 7 states have internal predecessors, (3283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:09:05,662 INFO  L175             Difference]: Start difference. First operand has 127 places, 129 transitions, 352 flow. Second operand 6 states and 1726 transitions.
[2024-03-11 23:09:05,663 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 264 transitions, 1076 flow
[2024-03-11 23:09:05,671 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 264 transitions, 1076 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-11 23:09:05,673 INFO  L231             Difference]: Finished difference. Result has 131 places, 124 transitions, 337 flow
[2024-03-11 23:09:05,673 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=469, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=337, PETRI_PLACES=131, PETRI_TRANSITIONS=124}
[2024-03-11 23:09:05,674 INFO  L288   CegarLoopForPetriNet]: 128 programPoint places, 3 predicate places.
[2024-03-11 23:09:05,674 INFO  L495      AbstractCegarLoop]: Abstraction has has 131 places, 124 transitions, 337 flow
[2024-03-11 23:09:05,674 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 257.1666666666667) internal successors, (1543), 6 states have internal predecessors, (1543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:09:05,675 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 23:09:05,675 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 23:09:05,675 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-03-11 23:09:05,675 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] ===
[2024-03-11 23:09:05,676 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 23:09:05,676 INFO  L85        PathProgramCache]: Analyzing trace with hash 1929327068, now seen corresponding path program 1 times
[2024-03-11 23:09:05,676 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 23:09:05,676 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298576169]
[2024-03-11 23:09:05,677 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:09:05,677 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 23:09:05,690 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 23:09:05,703 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 23:09:05,703 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 23:09:05,703 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298576169]
[2024-03-11 23:09:05,703 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298576169] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 23:09:05,703 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 23:09:05,704 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-11 23:09:05,704 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866770041]
[2024-03-11 23:09:05,704 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 23:09:05,704 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-11 23:09:05,704 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 23:09:05,705 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-11 23:09:05,705 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-11 23:09:05,727 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 261 out of 469
[2024-03-11 23:09:05,728 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 124 transitions, 337 flow. Second operand  has 3 states, 3 states have (on average 263.3333333333333) internal successors, (790), 3 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:09:05,729 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 23:09:05,729 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 469
[2024-03-11 23:09:05,729 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 23:09:09,637 INFO  L130       PetriNetUnfolder]: 23636/49601 cut-off events.
[2024-03-11 23:09:09,638 INFO  L131       PetriNetUnfolder]: For 6746/9785 co-relation queries the response was YES.
[2024-03-11 23:09:09,738 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 89801 conditions, 49601 events. 23636/49601 cut-off events. For 6746/9785 co-relation queries the response was YES. Maximal size of possible extension queue 1132. Compared 488393 event pairs, 16450 based on Foata normal form. 16/42415 useless extension candidates. Maximal degree in co-relation 89790. Up to 30787 conditions per place. 
[2024-03-11 23:09:09,878 INFO  L137   encePairwiseOnDemand]: 463/469 looper letters, 83 selfloop transitions, 5 changer transitions 0/159 dead transitions.
[2024-03-11 23:09:09,879 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 159 transitions, 613 flow
[2024-03-11 23:09:09,880 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-11 23:09:09,880 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-11 23:09:09,881 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 871 transitions.
[2024-03-11 23:09:09,881 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6190476190476191
[2024-03-11 23:09:09,881 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 871 transitions.
[2024-03-11 23:09:09,881 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 871 transitions.
[2024-03-11 23:09:09,882 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 23:09:09,882 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 871 transitions.
[2024-03-11 23:09:09,883 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 290.3333333333333) internal successors, (871), 3 states have internal predecessors, (871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:09:09,885 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:09:09,885 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:09:09,885 INFO  L175             Difference]: Start difference. First operand has 131 places, 124 transitions, 337 flow. Second operand 3 states and 871 transitions.
[2024-03-11 23:09:09,885 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 159 transitions, 613 flow
[2024-03-11 23:09:09,908 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 159 transitions, 595 flow, removed 3 selfloop flow, removed 5 redundant places.
[2024-03-11 23:09:09,909 INFO  L231             Difference]: Finished difference. Result has 129 places, 128 transitions, 354 flow
[2024-03-11 23:09:09,909 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=469, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=354, PETRI_PLACES=129, PETRI_TRANSITIONS=128}
[2024-03-11 23:09:09,910 INFO  L288   CegarLoopForPetriNet]: 128 programPoint places, 1 predicate places.
[2024-03-11 23:09:09,910 INFO  L495      AbstractCegarLoop]: Abstraction has has 129 places, 128 transitions, 354 flow
[2024-03-11 23:09:09,910 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 263.3333333333333) internal successors, (790), 3 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:09:09,910 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 23:09:09,910 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 23:09:09,911 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-03-11 23:09:09,911 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] ===
[2024-03-11 23:09:09,911 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 23:09:09,911 INFO  L85        PathProgramCache]: Analyzing trace with hash 1335781115, now seen corresponding path program 1 times
[2024-03-11 23:09:09,911 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 23:09:09,911 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111310069]
[2024-03-11 23:09:09,911 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:09:09,912 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 23:09:09,929 ERROR L245   FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2024-03-11 23:09:09,929 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [931429540]
[2024-03-11 23:09:09,929 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:09:09,929 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 23:09:09,930 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 23:09:09,931 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)
[2024-03-11 23:09:09,958 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
[2024-03-11 23:09:10,151 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 23:09:10,152 INFO  L263         TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 3 conjunts are in the unsatisfiable core
[2024-03-11 23:09:10,153 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 23:09:10,158 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 23:09:10,159 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-03-11 23:09:10,159 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 23:09:10,159 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111310069]
[2024-03-11 23:09:10,159 WARN  L310   FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2024-03-11 23:09:10,159 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [931429540]
[2024-03-11 23:09:10,159 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [931429540] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 23:09:10,159 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 23:09:10,160 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-11 23:09:10,160 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877244226]
[2024-03-11 23:09:10,160 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 23:09:10,161 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-11 23:09:10,161 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 23:09:10,161 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-11 23:09:10,162 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-11 23:09:10,192 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 247 out of 469
[2024-03-11 23:09:10,192 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 128 transitions, 354 flow. Second operand  has 3 states, 3 states have (on average 250.0) internal successors, (750), 3 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:09:10,192 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 23:09:10,193 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 247 of 469
[2024-03-11 23:09:10,193 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 23:09:14,273 INFO  L130       PetriNetUnfolder]: 25391/54582 cut-off events.
[2024-03-11 23:09:14,273 INFO  L131       PetriNetUnfolder]: For 7915/12221 co-relation queries the response was YES.
[2024-03-11 23:09:14,415 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 100316 conditions, 54582 events. 25391/54582 cut-off events. For 7915/12221 co-relation queries the response was YES. Maximal size of possible extension queue 1173. Compared 554171 event pairs, 19248 based on Foata normal form. 670/46348 useless extension candidates. Maximal degree in co-relation 100304. Up to 35227 conditions per place. 
[2024-03-11 23:09:14,584 INFO  L137   encePairwiseOnDemand]: 465/469 looper letters, 53 selfloop transitions, 1 changer transitions 0/125 dead transitions.
[2024-03-11 23:09:14,584 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 125 transitions, 456 flow
[2024-03-11 23:09:14,585 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-11 23:09:14,585 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-11 23:09:14,586 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 795 transitions.
[2024-03-11 23:09:14,587 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5650319829424307
[2024-03-11 23:09:14,587 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 795 transitions.
[2024-03-11 23:09:14,587 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 795 transitions.
[2024-03-11 23:09:14,587 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 23:09:14,587 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 795 transitions.
[2024-03-11 23:09:14,588 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 265.0) internal successors, (795), 3 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:09:14,590 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:09:14,590 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:09:14,590 INFO  L175             Difference]: Start difference. First operand has 129 places, 128 transitions, 354 flow. Second operand 3 states and 795 transitions.
[2024-03-11 23:09:14,590 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 125 transitions, 456 flow
[2024-03-11 23:09:14,603 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 125 transitions, 451 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-11 23:09:14,604 INFO  L231             Difference]: Finished difference. Result has 127 places, 125 transitions, 345 flow
[2024-03-11 23:09:14,604 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=469, PETRI_DIFFERENCE_MINUEND_FLOW=343, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=345, PETRI_PLACES=127, PETRI_TRANSITIONS=125}
[2024-03-11 23:09:14,605 INFO  L288   CegarLoopForPetriNet]: 128 programPoint places, -1 predicate places.
[2024-03-11 23:09:14,605 INFO  L495      AbstractCegarLoop]: Abstraction has has 127 places, 125 transitions, 345 flow
[2024-03-11 23:09:14,605 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 250.0) internal successors, (750), 3 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:09:14,605 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 23:09:14,605 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 23:09:14,611 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2024-03-11 23:09:14,806 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,3 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 23:09:14,807 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] ===
[2024-03-11 23:09:14,808 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 23:09:14,808 INFO  L85        PathProgramCache]: Analyzing trace with hash -1096061905, now seen corresponding path program 1 times
[2024-03-11 23:09:14,808 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 23:09:14,808 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450141008]
[2024-03-11 23:09:14,809 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:09:14,809 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 23:09:14,825 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 23:09:14,841 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2024-03-11 23:09:14,841 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 23:09:14,842 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450141008]
[2024-03-11 23:09:14,842 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450141008] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 23:09:14,842 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 23:09:14,842 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-11 23:09:14,842 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890671584]
[2024-03-11 23:09:14,842 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 23:09:14,842 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-11 23:09:14,843 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 23:09:14,843 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-11 23:09:14,843 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-11 23:09:14,861 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 261 out of 469
[2024-03-11 23:09:14,862 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 125 transitions, 345 flow. Second operand  has 3 states, 3 states have (on average 264.0) internal successors, (792), 3 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:09:14,862 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 23:09:14,862 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 469
[2024-03-11 23:09:14,862 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 23:09:19,180 INFO  L130       PetriNetUnfolder]: 26035/54799 cut-off events.
[2024-03-11 23:09:19,180 INFO  L131       PetriNetUnfolder]: For 8046/10294 co-relation queries the response was YES.
[2024-03-11 23:09:19,330 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 101502 conditions, 54799 events. 26035/54799 cut-off events. For 8046/10294 co-relation queries the response was YES. Maximal size of possible extension queue 1239. Compared 550830 event pairs, 16936 based on Foata normal form. 8/47522 useless extension candidates. Maximal degree in co-relation 101490. Up to 34138 conditions per place. 
[2024-03-11 23:09:19,682 INFO  L137   encePairwiseOnDemand]: 463/469 looper letters, 86 selfloop transitions, 6 changer transitions 0/160 dead transitions.
[2024-03-11 23:09:19,683 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 160 transitions, 633 flow
[2024-03-11 23:09:19,684 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-11 23:09:19,684 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-11 23:09:19,685 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 871 transitions.
[2024-03-11 23:09:19,685 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6190476190476191
[2024-03-11 23:09:19,685 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 871 transitions.
[2024-03-11 23:09:19,685 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 871 transitions.
[2024-03-11 23:09:19,686 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 23:09:19,686 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 871 transitions.
[2024-03-11 23:09:19,687 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 290.3333333333333) internal successors, (871), 3 states have internal predecessors, (871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:09:19,688 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:09:19,689 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:09:19,689 INFO  L175             Difference]: Start difference. First operand has 127 places, 125 transitions, 345 flow. Second operand 3 states and 871 transitions.
[2024-03-11 23:09:19,689 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 160 transitions, 633 flow
[2024-03-11 23:09:19,693 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 160 transitions, 632 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-11 23:09:19,695 INFO  L231             Difference]: Finished difference. Result has 129 places, 129 transitions, 386 flow
[2024-03-11 23:09:19,695 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=469, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=386, PETRI_PLACES=129, PETRI_TRANSITIONS=129}
[2024-03-11 23:09:19,695 INFO  L288   CegarLoopForPetriNet]: 128 programPoint places, 1 predicate places.
[2024-03-11 23:09:19,696 INFO  L495      AbstractCegarLoop]: Abstraction has has 129 places, 129 transitions, 386 flow
[2024-03-11 23:09:19,696 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 264.0) internal successors, (792), 3 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:09:19,696 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 23:09:19,696 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 23:09:19,696 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-03-11 23:09:19,696 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] ===
[2024-03-11 23:09:19,697 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 23:09:19,697 INFO  L85        PathProgramCache]: Analyzing trace with hash -1256878384, now seen corresponding path program 1 times
[2024-03-11 23:09:19,697 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 23:09:19,697 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871266607]
[2024-03-11 23:09:19,697 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:09:19,697 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 23:09:19,716 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 23:09:19,757 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 23:09:19,757 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 23:09:19,757 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871266607]
[2024-03-11 23:09:19,757 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871266607] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 23:09:19,758 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 23:09:19,758 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-03-11 23:09:19,758 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815280256]
[2024-03-11 23:09:19,758 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 23:09:19,758 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-11 23:09:19,758 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 23:09:19,759 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-11 23:09:19,759 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-11 23:09:19,777 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 262 out of 469
[2024-03-11 23:09:19,778 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 129 transitions, 386 flow. Second operand  has 3 states, 3 states have (on average 265.6666666666667) internal successors, (797), 3 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:09:19,778 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 23:09:19,778 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 469
[2024-03-11 23:09:19,778 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 23:09:22,354 INFO  L130       PetriNetUnfolder]: 12274/29977 cut-off events.
[2024-03-11 23:09:22,355 INFO  L131       PetriNetUnfolder]: For 5501/6326 co-relation queries the response was YES.
[2024-03-11 23:09:22,412 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 53869 conditions, 29977 events. 12274/29977 cut-off events. For 5501/6326 co-relation queries the response was YES. Maximal size of possible extension queue 677. Compared 308079 event pairs, 3459 based on Foata normal form. 832/26744 useless extension candidates. Maximal degree in co-relation 53856. Up to 9776 conditions per place. 
[2024-03-11 23:09:22,485 INFO  L137   encePairwiseOnDemand]: 463/469 looper letters, 79 selfloop transitions, 6 changer transitions 0/159 dead transitions.
[2024-03-11 23:09:22,486 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 159 transitions, 645 flow
[2024-03-11 23:09:22,486 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-11 23:09:22,487 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-11 23:09:22,488 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 871 transitions.
[2024-03-11 23:09:22,488 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6190476190476191
[2024-03-11 23:09:22,488 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 871 transitions.
[2024-03-11 23:09:22,488 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 871 transitions.
[2024-03-11 23:09:22,489 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 23:09:22,489 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 871 transitions.
[2024-03-11 23:09:22,490 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 290.3333333333333) internal successors, (871), 3 states have internal predecessors, (871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:09:22,491 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:09:22,492 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:09:22,492 INFO  L175             Difference]: Start difference. First operand has 129 places, 129 transitions, 386 flow. Second operand 3 states and 871 transitions.
[2024-03-11 23:09:22,492 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 159 transitions, 645 flow
[2024-03-11 23:09:22,502 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 159 transitions, 640 flow, removed 1 selfloop flow, removed 1 redundant places.
[2024-03-11 23:09:22,503 INFO  L231             Difference]: Finished difference. Result has 130 places, 125 transitions, 368 flow
[2024-03-11 23:09:22,503 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=469, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=368, PETRI_PLACES=130, PETRI_TRANSITIONS=125}
[2024-03-11 23:09:22,504 INFO  L288   CegarLoopForPetriNet]: 128 programPoint places, 2 predicate places.
[2024-03-11 23:09:22,504 INFO  L495      AbstractCegarLoop]: Abstraction has has 130 places, 125 transitions, 368 flow
[2024-03-11 23:09:22,504 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 265.6666666666667) internal successors, (797), 3 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:09:22,504 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 23:09:22,504 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, 1, 1]
[2024-03-11 23:09:22,504 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-03-11 23:09:22,505 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting threadErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] ===
[2024-03-11 23:09:22,505 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 23:09:22,505 INFO  L85        PathProgramCache]: Analyzing trace with hash -1658470565, now seen corresponding path program 1 times
[2024-03-11 23:09:22,505 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 23:09:22,505 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744573978]
[2024-03-11 23:09:22,505 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:09:22,505 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 23:09:22,520 ERROR L245   FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2024-03-11 23:09:22,520 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [499663376]
[2024-03-11 23:09:22,520 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:09:22,520 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 23:09:22,520 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 23:09:22,521 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)
[2024-03-11 23:09:22,547 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
[2024-03-11 23:09:22,743 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 23:09:22,744 INFO  L263         TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 17 conjunts are in the unsatisfiable core
[2024-03-11 23:09:22,748 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 23:09:22,792 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 50 treesize of output 45
[2024-03-11 23:09:22,801 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 15 treesize of output 14
[2024-03-11 23:09:22,810 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 13
[2024-03-11 23:09:22,865 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 92 treesize of output 83
[2024-03-11 23:09:22,872 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 23:09:22,873 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 156
[2024-03-11 23:09:22,947 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 60 treesize of output 3
[2024-03-11 23:09:23,014 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 120 treesize of output 107
[2024-03-11 23:09:23,024 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 23:09:23,025 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 106 treesize of output 210
[2024-03-11 23:09:23,116 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 21
[2024-03-11 23:09:23,173 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 148 treesize of output 131
[2024-03-11 23:09:23,184 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 23:09:23,185 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 130 treesize of output 264
[2024-03-11 23:09:23,226 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 263 treesize of output 143
[2024-03-11 23:09:23,361 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 23:09:23,362 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-03-11 23:09:23,362 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 23:09:23,362 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744573978]
[2024-03-11 23:09:23,362 WARN  L310   FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2024-03-11 23:09:23,362 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [499663376]
[2024-03-11 23:09:23,362 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [499663376] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 23:09:23,362 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 23:09:23,363 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-11 23:09:23,363 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381206604]
[2024-03-11 23:09:23,363 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 23:09:23,363 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-11 23:09:23,363 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 23:09:23,364 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-11 23:09:23,364 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-11 23:09:24,382 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 256 out of 469
[2024-03-11 23:09:24,384 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 125 transitions, 368 flow. Second operand  has 6 states, 6 states have (on average 258.3333333333333) internal successors, (1550), 6 states have internal predecessors, (1550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:09:24,384 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 23:09:24,384 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 469
[2024-03-11 23:09:24,384 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 23:09:28,885 INFO  L130       PetriNetUnfolder]: 21051/42739 cut-off events.
[2024-03-11 23:09:28,885 INFO  L131       PetriNetUnfolder]: For 9574/10747 co-relation queries the response was YES.
[2024-03-11 23:09:29,022 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 83822 conditions, 42739 events. 21051/42739 cut-off events. For 9574/10747 co-relation queries the response was YES. Maximal size of possible extension queue 945. Compared 407298 event pairs, 8925 based on Foata normal form. 270/37776 useless extension candidates. Maximal degree in co-relation 83809. Up to 18077 conditions per place. 
[2024-03-11 23:09:29,150 INFO  L137   encePairwiseOnDemand]: 463/469 looper letters, 184 selfloop transitions, 5 changer transitions 0/256 dead transitions.
[2024-03-11 23:09:29,150 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 256 transitions, 1184 flow
[2024-03-11 23:09:29,151 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-11 23:09:29,151 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-11 23:09:29,153 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1719 transitions.
[2024-03-11 23:09:29,154 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6108742004264393
[2024-03-11 23:09:29,154 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 1719 transitions.
[2024-03-11 23:09:29,154 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 1719 transitions.
[2024-03-11 23:09:29,155 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 23:09:29,155 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1719 transitions.
[2024-03-11 23:09:29,157 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 286.5) internal successors, (1719), 6 states have internal predecessors, (1719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:09:29,159 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 469.0) internal successors, (3283), 7 states have internal predecessors, (3283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:09:29,159 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 469.0) internal successors, (3283), 7 states have internal predecessors, (3283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:09:29,159 INFO  L175             Difference]: Start difference. First operand has 130 places, 125 transitions, 368 flow. Second operand 6 states and 1719 transitions.
[2024-03-11 23:09:29,159 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 256 transitions, 1184 flow
[2024-03-11 23:09:29,168 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 256 transitions, 1162 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-11 23:09:29,170 INFO  L231             Difference]: Finished difference. Result has 133 places, 124 transitions, 370 flow
[2024-03-11 23:09:29,170 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=469, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=370, PETRI_PLACES=133, PETRI_TRANSITIONS=124}
[2024-03-11 23:09:29,171 INFO  L288   CegarLoopForPetriNet]: 128 programPoint places, 5 predicate places.
[2024-03-11 23:09:29,171 INFO  L495      AbstractCegarLoop]: Abstraction has has 133 places, 124 transitions, 370 flow
[2024-03-11 23:09:29,171 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 258.3333333333333) internal successors, (1550), 6 states have internal predecessors, (1550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:09:29,171 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 23:09:29,171 INFO  L209   CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 23:09:29,179 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2024-03-11 23:09:29,372 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 23:09:29,373 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] ===
[2024-03-11 23:09:29,373 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 23:09:29,374 INFO  L85        PathProgramCache]: Analyzing trace with hash 1273924890, now seen corresponding path program 1 times
[2024-03-11 23:09:29,374 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 23:09:29,374 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500208964]
[2024-03-11 23:09:29,374 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:09:29,375 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 23:09:29,393 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 23:09:29,410 INFO  L134       CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked.
[2024-03-11 23:09:29,410 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 23:09:29,410 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500208964]
[2024-03-11 23:09:29,410 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500208964] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 23:09:29,410 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 23:09:29,411 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-11 23:09:29,411 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223761716]
[2024-03-11 23:09:29,411 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 23:09:29,411 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-11 23:09:29,411 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 23:09:29,411 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-11 23:09:29,412 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-11 23:09:29,427 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 261 out of 469
[2024-03-11 23:09:29,428 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 124 transitions, 370 flow. Second operand  has 3 states, 3 states have (on average 264.3333333333333) internal successors, (793), 3 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:09:29,428 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 23:09:29,428 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 469
[2024-03-11 23:09:29,428 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 23:09:32,230 INFO  L130       PetriNetUnfolder]: 14104/32679 cut-off events.
[2024-03-11 23:09:32,230 INFO  L131       PetriNetUnfolder]: For 7422/9917 co-relation queries the response was YES.
[2024-03-11 23:09:32,353 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 61013 conditions, 32679 events. 14104/32679 cut-off events. For 7422/9917 co-relation queries the response was YES. Maximal size of possible extension queue 730. Compared 326545 event pairs, 9433 based on Foata normal form. 55/28497 useless extension candidates. Maximal degree in co-relation 60999. Up to 19397 conditions per place. 
[2024-03-11 23:09:32,465 INFO  L137   encePairwiseOnDemand]: 465/469 looper letters, 79 selfloop transitions, 3 changer transitions 0/149 dead transitions.
[2024-03-11 23:09:32,465 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 149 transitions, 612 flow
[2024-03-11 23:09:32,466 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-11 23:09:32,466 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-11 23:09:32,468 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 861 transitions.
[2024-03-11 23:09:32,468 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6119402985074627
[2024-03-11 23:09:32,468 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 861 transitions.
[2024-03-11 23:09:32,468 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 861 transitions.
[2024-03-11 23:09:32,469 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 23:09:32,469 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 861 transitions.
[2024-03-11 23:09:32,470 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 287.0) internal successors, (861), 3 states have internal predecessors, (861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:09:32,472 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:09:32,472 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:09:32,472 INFO  L175             Difference]: Start difference. First operand has 133 places, 124 transitions, 370 flow. Second operand 3 states and 861 transitions.
[2024-03-11 23:09:32,472 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 149 transitions, 612 flow
[2024-03-11 23:09:32,481 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 149 transitions, 602 flow, removed 0 selfloop flow, removed 5 redundant places.
[2024-03-11 23:09:32,482 INFO  L231             Difference]: Finished difference. Result has 131 places, 126 transitions, 383 flow
[2024-03-11 23:09:32,482 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=469, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=383, PETRI_PLACES=131, PETRI_TRANSITIONS=126}
[2024-03-11 23:09:32,483 INFO  L288   CegarLoopForPetriNet]: 128 programPoint places, 3 predicate places.
[2024-03-11 23:09:32,483 INFO  L495      AbstractCegarLoop]: Abstraction has has 131 places, 126 transitions, 383 flow
[2024-03-11 23:09:32,483 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 264.3333333333333) internal successors, (793), 3 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:09:32,483 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 23:09:32,483 INFO  L209   CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1]
[2024-03-11 23:09:32,484 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2024-03-11 23:09:32,484 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] ===
[2024-03-11 23:09:32,484 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 23:09:32,484 INFO  L85        PathProgramCache]: Analyzing trace with hash 1875646898, now seen corresponding path program 1 times
[2024-03-11 23:09:32,484 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 23:09:32,484 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840798063]
[2024-03-11 23:09:32,485 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:09:32,485 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 23:09:32,512 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-11 23:09:32,512 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-03-11 23:09:32,527 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-11 23:09:32,535 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-03-11 23:09:32,535 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-03-11 23:09:32,535 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (26 of 27 remaining)
[2024-03-11 23:09:32,536 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (25 of 27 remaining)
[2024-03-11 23:09:32,536 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (24 of 27 remaining)
[2024-03-11 23:09:32,536 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (23 of 27 remaining)
[2024-03-11 23:09:32,536 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (22 of 27 remaining)
[2024-03-11 23:09:32,536 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (21 of 27 remaining)
[2024-03-11 23:09:32,536 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (20 of 27 remaining)
[2024-03-11 23:09:32,537 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (19 of 27 remaining)
[2024-03-11 23:09:32,537 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (18 of 27 remaining)
[2024-03-11 23:09:32,537 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (17 of 27 remaining)
[2024-03-11 23:09:32,537 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (16 of 27 remaining)
[2024-03-11 23:09:32,537 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (15 of 27 remaining)
[2024-03-11 23:09:32,537 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (14 of 27 remaining)
[2024-03-11 23:09:32,537 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (13 of 27 remaining)
[2024-03-11 23:09:32,538 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (12 of 27 remaining)
[2024-03-11 23:09:32,538 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (11 of 27 remaining)
[2024-03-11 23:09:32,538 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (10 of 27 remaining)
[2024-03-11 23:09:32,538 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (9 of 27 remaining)
[2024-03-11 23:09:32,538 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (8 of 27 remaining)
[2024-03-11 23:09:32,538 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (7 of 27 remaining)
[2024-03-11 23:09:32,538 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (6 of 27 remaining)
[2024-03-11 23:09:32,539 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (5 of 27 remaining)
[2024-03-11 23:09:32,539 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (4 of 27 remaining)
[2024-03-11 23:09:32,539 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 27 remaining)
[2024-03-11 23:09:32,539 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 27 remaining)
[2024-03-11 23:09:32,539 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (1 of 27 remaining)
[2024-03-11 23:09:32,540 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (0 of 27 remaining)
[2024-03-11 23:09:32,540 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2024-03-11 23:09:32,540 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 23:09:32,540 WARN  L233   ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-03-11 23:09:32,541 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances.
[2024-03-11 23:09:32,602 INFO  L144    ThreadInstanceAdder]: Constructed 24 joinOtherThreadTransitions.
[2024-03-11 23:09:32,605 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 323 places, 353 transitions, 810 flow
[2024-03-11 23:09:32,810 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1790] threadEXIT-->L1027-13: Formula: (= (let ((.cse0 (mod |v_threadThread1of4ForFork0_#t~mem8_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread2of4ForFork0_thidvar0_10)  InVars {threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  OutVars{threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  AuxVars[]  AssignedVars[][107], [threadThread3of4ForFork0NotInUse, threadThread4of4ForFork0NotInUse, 135#L1036-10true, threadThread1of4ForFork0InUse, 10#L1027-13true, threadThread2of4ForFork0NotInUse])
[2024-03-11 23:09:32,810 INFO  L383   tUnfolder$Statistics]: this new event has 240 ancestors and is cut-off event
[2024-03-11 23:09:32,810 INFO  L386   tUnfolder$Statistics]:   existing Event has 126 ancestors and is cut-off event
[2024-03-11 23:09:32,811 INFO  L386   tUnfolder$Statistics]:   existing Event has 183 ancestors and is cut-off event
[2024-03-11 23:09:32,811 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2024-03-11 23:09:32,812 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1793] threadEXIT-->L1027-13: Formula: (= v_threadThread1of4ForFork0_thidvar0_12 (let ((.cse0 (mod |v_threadThread2of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))  InVars {threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  OutVars{threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  AuxVars[]  AssignedVars[][287], [278#L1027-13true, threadThread2of4ForFork0InUse, threadThread3of4ForFork0NotInUse, threadThread4of4ForFork0NotInUse, 135#L1036-10true, threadThread1of4ForFork0NotInUse])
[2024-03-11 23:09:32,812 INFO  L383   tUnfolder$Statistics]: this new event has 240 ancestors and is cut-off event
[2024-03-11 23:09:32,812 INFO  L386   tUnfolder$Statistics]:   existing Event has 183 ancestors and is cut-off event
[2024-03-11 23:09:32,812 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2024-03-11 23:09:32,812 INFO  L386   tUnfolder$Statistics]:   existing Event has 126 ancestors and is cut-off event
[2024-03-11 23:09:33,065 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1797] threadEXIT-->L1027-13: Formula: (= (let ((.cse0 (mod |v_threadThread4of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread1of4ForFork0_thidvar0_14)  InVars {threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_14}  OutVars{threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_14}  AuxVars[]  AssignedVars[][288], [threadThread3of4ForFork0NotInUse, 124#L1027-13true, threadThread4of4ForFork0InUse, 135#L1036-10true, threadThread1of4ForFork0NotInUse, threadThread2of4ForFork0NotInUse])
[2024-03-11 23:09:33,065 INFO  L383   tUnfolder$Statistics]: this new event has 240 ancestors and is cut-off event
[2024-03-11 23:09:33,065 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2024-03-11 23:09:33,066 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2024-03-11 23:09:33,066 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2024-03-11 23:09:33,066 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1798] threadEXIT-->L1027-13: Formula: (= v_threadThread2of4ForFork0_thidvar0_14 (let ((.cse0 (mod |v_threadThread4of4ForFork0_#t~mem8_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))))  InVars {threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_10|, threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_14}  OutVars{threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_10|, threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_14}  AuxVars[]  AssignedVars[][109], [threadThread3of4ForFork0NotInUse, 124#L1027-13true, threadThread4of4ForFork0InUse, 135#L1036-10true, threadThread1of4ForFork0NotInUse, threadThread2of4ForFork0NotInUse])
[2024-03-11 23:09:33,066 INFO  L383   tUnfolder$Statistics]: this new event has 240 ancestors and is cut-off event
[2024-03-11 23:09:33,066 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2024-03-11 23:09:33,066 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2024-03-11 23:09:33,067 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2024-03-11 23:09:33,070 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1788] threadEXIT-->L1027-13: Formula: (= (let ((.cse0 (mod |v_threadThread3of4ForFork0_#t~mem8_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread4of4ForFork0_thidvar0_8)  InVars {threadThread3of4ForFork0_#t~mem8=|v_threadThread3of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_8}  OutVars{threadThread3of4ForFork0_#t~mem8=|v_threadThread3of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_8}  AuxVars[]  AssignedVars[][165], [threadThread3of4ForFork0InUse, threadThread4of4ForFork0NotInUse, 233#L1027-13true, 135#L1036-10true, threadThread1of4ForFork0NotInUse, threadThread2of4ForFork0NotInUse])
[2024-03-11 23:09:33,070 INFO  L383   tUnfolder$Statistics]: this new event has 240 ancestors and is cut-off event
[2024-03-11 23:09:33,070 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2024-03-11 23:09:33,070 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2024-03-11 23:09:33,070 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2024-03-11 23:09:33,072 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1792] threadEXIT-->L1027-13: Formula: (= v_threadThread4of4ForFork0_thidvar0_10 (let ((.cse0 (mod |v_threadThread1of4ForFork0_#t~mem8_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))  InVars {threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_10}  OutVars{threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_10}  AuxVars[]  AssignedVars[][166], [threadThread3of4ForFork0NotInUse, threadThread4of4ForFork0NotInUse, 135#L1036-10true, threadThread1of4ForFork0InUse, threadThread2of4ForFork0NotInUse, 10#L1027-13true])
[2024-03-11 23:09:33,072 INFO  L383   tUnfolder$Statistics]: this new event has 240 ancestors and is cut-off event
[2024-03-11 23:09:33,072 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2024-03-11 23:09:33,072 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2024-03-11 23:09:33,072 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2024-03-11 23:09:33,073 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1796] threadEXIT-->L1027-13: Formula: (= (let ((.cse0 (mod |v_threadThread2of4ForFork0_#t~mem8_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_threadThread4of4ForFork0_thidvar0_12)  InVars {threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_12}  OutVars{threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_12}  AuxVars[]  AssignedVars[][167], [threadThread2of4ForFork0InUse, 278#L1027-13true, threadThread3of4ForFork0NotInUse, threadThread4of4ForFork0NotInUse, 135#L1036-10true, threadThread1of4ForFork0NotInUse])
[2024-03-11 23:09:33,073 INFO  L383   tUnfolder$Statistics]: this new event has 240 ancestors and is cut-off event
[2024-03-11 23:09:33,073 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2024-03-11 23:09:33,073 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2024-03-11 23:09:33,073 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2024-03-11 23:09:33,130 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1790] threadEXIT-->L1027-13: Formula: (= (let ((.cse0 (mod |v_threadThread1of4ForFork0_#t~mem8_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread2of4ForFork0_thidvar0_10)  InVars {threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  OutVars{threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  AuxVars[]  AssignedVars[][107], [5#$Ultimate##0true, threadThread3of4ForFork0InUse, threadThread4of4ForFork0NotInUse, 135#L1036-10true, threadThread1of4ForFork0InUse, 10#L1027-13true, threadThread2of4ForFork0NotInUse])
[2024-03-11 23:09:33,130 INFO  L383   tUnfolder$Statistics]: this new event has 257 ancestors and is cut-off event
[2024-03-11 23:09:33,130 INFO  L386   tUnfolder$Statistics]:   existing Event has 143 ancestors and is cut-off event
[2024-03-11 23:09:33,130 INFO  L386   tUnfolder$Statistics]:   existing Event has 200 ancestors and is cut-off event
[2024-03-11 23:09:33,130 INFO  L386   tUnfolder$Statistics]:   existing Event has 200 ancestors and is cut-off event
[2024-03-11 23:09:33,163 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1786] threadEXIT-->L1027-13: Formula: (= v_threadThread2of4ForFork0_thidvar0_8 (let ((.cse0 (mod |v_threadThread3of4ForFork0_#t~mem8_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))  InVars {threadThread3of4ForFork0_#t~mem8=|v_threadThread3of4ForFork0_#t~mem8_10|, threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_8}  OutVars{threadThread3of4ForFork0_#t~mem8=|v_threadThread3of4ForFork0_#t~mem8_10|, threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_8}  AuxVars[]  AssignedVars[][106], [214#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread3of4ForFork0InUse, threadThread4of4ForFork0NotInUse, 233#L1027-13true, threadThread1of4ForFork0NotInUse, threadThread2of4ForFork0NotInUse])
[2024-03-11 23:09:33,164 INFO  L383   tUnfolder$Statistics]: this new event has 257 ancestors and is cut-off event
[2024-03-11 23:09:33,164 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:33,164 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:33,164 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:33,164 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1799] threadEXIT-->L1027-13: Formula: (= (let ((.cse0 (mod |v_threadThread4of4ForFork0_#t~mem8_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_threadThread3of4ForFork0_thidvar0_14)  InVars {threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_12|, threadThread3of4ForFork0_thidvar0=v_threadThread3of4ForFork0_thidvar0_14}  OutVars{threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_12|, threadThread3of4ForFork0_thidvar0=v_threadThread3of4ForFork0_thidvar0_14}  AuxVars[]  AssignedVars[][162], [threadThread3of4ForFork0NotInUse, 124#L1027-13true, threadThread4of4ForFork0InUse, 135#L1036-10true, threadThread1of4ForFork0NotInUse, threadThread2of4ForFork0NotInUse])
[2024-03-11 23:09:33,164 INFO  L383   tUnfolder$Statistics]: this new event has 240 ancestors and is not cut-off event
[2024-03-11 23:09:33,165 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is not cut-off event
[2024-03-11 23:09:33,165 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is not cut-off event
[2024-03-11 23:09:33,165 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is not cut-off event
[2024-03-11 23:09:33,165 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1790] threadEXIT-->L1027-13: Formula: (= (let ((.cse0 (mod |v_threadThread1of4ForFork0_#t~mem8_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread2of4ForFork0_thidvar0_10)  InVars {threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  OutVars{threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  AuxVars[]  AssignedVars[][107], [214#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread3of4ForFork0NotInUse, threadThread4of4ForFork0NotInUse, threadThread1of4ForFork0InUse, 10#L1027-13true, threadThread2of4ForFork0NotInUse])
[2024-03-11 23:09:33,165 INFO  L383   tUnfolder$Statistics]: this new event has 257 ancestors and is cut-off event
[2024-03-11 23:09:33,165 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:33,165 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:33,166 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:33,166 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1793] threadEXIT-->L1027-13: Formula: (= v_threadThread1of4ForFork0_thidvar0_12 (let ((.cse0 (mod |v_threadThread2of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))  InVars {threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  OutVars{threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  AuxVars[]  AssignedVars[][287], [threadThread2of4ForFork0InUse, 214#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, 278#L1027-13true, threadThread3of4ForFork0NotInUse, threadThread4of4ForFork0NotInUse, threadThread1of4ForFork0NotInUse])
[2024-03-11 23:09:33,166 INFO  L383   tUnfolder$Statistics]: this new event has 257 ancestors and is cut-off event
[2024-03-11 23:09:33,166 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:33,166 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:33,166 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:33,167 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1797] threadEXIT-->L1027-13: Formula: (= (let ((.cse0 (mod |v_threadThread4of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread1of4ForFork0_thidvar0_14)  InVars {threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_14}  OutVars{threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_14}  AuxVars[]  AssignedVars[][288], [214#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread3of4ForFork0NotInUse, 124#L1027-13true, threadThread4of4ForFork0InUse, threadThread1of4ForFork0NotInUse, threadThread2of4ForFork0NotInUse])
[2024-03-11 23:09:33,167 INFO  L383   tUnfolder$Statistics]: this new event has 257 ancestors and is cut-off event
[2024-03-11 23:09:33,167 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:33,167 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:33,167 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:33,168 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1798] threadEXIT-->L1027-13: Formula: (= v_threadThread2of4ForFork0_thidvar0_14 (let ((.cse0 (mod |v_threadThread4of4ForFork0_#t~mem8_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))))  InVars {threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_10|, threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_14}  OutVars{threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_10|, threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_14}  AuxVars[]  AssignedVars[][109], [214#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread3of4ForFork0NotInUse, 124#L1027-13true, threadThread4of4ForFork0InUse, threadThread1of4ForFork0NotInUse, threadThread2of4ForFork0NotInUse])
[2024-03-11 23:09:33,168 INFO  L383   tUnfolder$Statistics]: this new event has 257 ancestors and is cut-off event
[2024-03-11 23:09:33,168 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:33,168 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:33,168 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:33,170 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1788] threadEXIT-->L1027-13: Formula: (= (let ((.cse0 (mod |v_threadThread3of4ForFork0_#t~mem8_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread4of4ForFork0_thidvar0_8)  InVars {threadThread3of4ForFork0_#t~mem8=|v_threadThread3of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_8}  OutVars{threadThread3of4ForFork0_#t~mem8=|v_threadThread3of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_8}  AuxVars[]  AssignedVars[][165], [214#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread3of4ForFork0InUse, threadThread4of4ForFork0NotInUse, 233#L1027-13true, threadThread1of4ForFork0NotInUse, threadThread2of4ForFork0NotInUse])
[2024-03-11 23:09:33,170 INFO  L383   tUnfolder$Statistics]: this new event has 257 ancestors and is cut-off event
[2024-03-11 23:09:33,170 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:33,170 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:33,170 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:33,170 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1792] threadEXIT-->L1027-13: Formula: (= v_threadThread4of4ForFork0_thidvar0_10 (let ((.cse0 (mod |v_threadThread1of4ForFork0_#t~mem8_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))  InVars {threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_10}  OutVars{threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_10}  AuxVars[]  AssignedVars[][166], [214#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread3of4ForFork0NotInUse, threadThread4of4ForFork0NotInUse, threadThread1of4ForFork0InUse, threadThread2of4ForFork0NotInUse, 10#L1027-13true])
[2024-03-11 23:09:33,171 INFO  L383   tUnfolder$Statistics]: this new event has 257 ancestors and is cut-off event
[2024-03-11 23:09:33,171 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:33,171 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:33,171 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:33,171 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1796] threadEXIT-->L1027-13: Formula: (= (let ((.cse0 (mod |v_threadThread2of4ForFork0_#t~mem8_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_threadThread4of4ForFork0_thidvar0_12)  InVars {threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_12}  OutVars{threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_12}  AuxVars[]  AssignedVars[][167], [threadThread2of4ForFork0InUse, 214#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, 278#L1027-13true, threadThread3of4ForFork0NotInUse, threadThread4of4ForFork0NotInUse, threadThread1of4ForFork0NotInUse])
[2024-03-11 23:09:33,171 INFO  L383   tUnfolder$Statistics]: this new event has 257 ancestors and is cut-off event
[2024-03-11 23:09:33,172 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:33,172 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:33,172 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:33,179 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1790] threadEXIT-->L1027-13: Formula: (= (let ((.cse0 (mod |v_threadThread1of4ForFork0_#t~mem8_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread2of4ForFork0_thidvar0_10)  InVars {threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  OutVars{threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  AuxVars[]  AssignedVars[][107], [5#$Ultimate##0true, threadThread3of4ForFork0InUse, threadThread4of4ForFork0InUse, 141#$Ultimate##0true, 135#L1036-10true, threadThread1of4ForFork0InUse, 10#L1027-13true, threadThread2of4ForFork0NotInUse])
[2024-03-11 23:09:33,180 INFO  L383   tUnfolder$Statistics]: this new event has 274 ancestors and is cut-off event
[2024-03-11 23:09:33,180 INFO  L386   tUnfolder$Statistics]:   existing Event has 160 ancestors and is cut-off event
[2024-03-11 23:09:33,180 INFO  L386   tUnfolder$Statistics]:   existing Event has 217 ancestors and is cut-off event
[2024-03-11 23:09:33,180 INFO  L386   tUnfolder$Statistics]:   existing Event has 217 ancestors and is cut-off event
[2024-03-11 23:09:33,221 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1798] threadEXIT-->L1027-13: Formula: (= v_threadThread2of4ForFork0_thidvar0_14 (let ((.cse0 (mod |v_threadThread4of4ForFork0_#t~mem8_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))))  InVars {threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_10|, threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_14}  OutVars{threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_10|, threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_14}  AuxVars[]  AssignedVars[][109], [5#$Ultimate##0true, threadThread3of4ForFork0InUse, 124#L1027-13true, 37#$Ultimate##0true, threadThread4of4ForFork0InUse, 135#L1036-10true, threadThread1of4ForFork0InUse, threadThread2of4ForFork0NotInUse])
[2024-03-11 23:09:33,222 INFO  L383   tUnfolder$Statistics]: this new event has 274 ancestors and is cut-off event
[2024-03-11 23:09:33,222 INFO  L386   tUnfolder$Statistics]:   existing Event has 217 ancestors and is cut-off event
[2024-03-11 23:09:33,222 INFO  L386   tUnfolder$Statistics]:   existing Event has 160 ancestors and is cut-off event
[2024-03-11 23:09:33,222 INFO  L386   tUnfolder$Statistics]:   existing Event has 217 ancestors and is cut-off event
[2024-03-11 23:09:33,223 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1797] threadEXIT-->L1027-13: Formula: (= (let ((.cse0 (mod |v_threadThread4of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread1of4ForFork0_thidvar0_14)  InVars {threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_14}  OutVars{threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_14}  AuxVars[]  AssignedVars[][288], [5#$Ultimate##0true, threadThread2of4ForFork0InUse, threadThread3of4ForFork0InUse, 124#L1027-13true, threadThread4of4ForFork0InUse, 135#L1036-10true, 127#$Ultimate##0true, threadThread1of4ForFork0NotInUse])
[2024-03-11 23:09:33,223 INFO  L383   tUnfolder$Statistics]: this new event has 274 ancestors and is cut-off event
[2024-03-11 23:09:33,223 INFO  L386   tUnfolder$Statistics]:   existing Event has 217 ancestors and is cut-off event
[2024-03-11 23:09:33,223 INFO  L386   tUnfolder$Statistics]:   existing Event has 217 ancestors and is cut-off event
[2024-03-11 23:09:33,224 INFO  L386   tUnfolder$Statistics]:   existing Event has 160 ancestors and is cut-off event
[2024-03-11 23:09:33,224 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1793] threadEXIT-->L1027-13: Formula: (= v_threadThread1of4ForFork0_thidvar0_12 (let ((.cse0 (mod |v_threadThread2of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))  InVars {threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  OutVars{threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  AuxVars[]  AssignedVars[][287], [threadThread2of4ForFork0InUse, 278#L1027-13true, 5#$Ultimate##0true, threadThread3of4ForFork0InUse, threadThread4of4ForFork0NotInUse, 135#L1036-10true, threadThread1of4ForFork0NotInUse])
[2024-03-11 23:09:33,224 INFO  L383   tUnfolder$Statistics]: this new event has 257 ancestors and is cut-off event
[2024-03-11 23:09:33,224 INFO  L386   tUnfolder$Statistics]:   existing Event has 200 ancestors and is cut-off event
[2024-03-11 23:09:33,225 INFO  L386   tUnfolder$Statistics]:   existing Event has 200 ancestors and is cut-off event
[2024-03-11 23:09:33,225 INFO  L386   tUnfolder$Statistics]:   existing Event has 143 ancestors and is cut-off event
[2024-03-11 23:09:33,225 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1793] threadEXIT-->L1027-13: Formula: (= v_threadThread1of4ForFork0_thidvar0_12 (let ((.cse0 (mod |v_threadThread2of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))  InVars {threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  OutVars{threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  AuxVars[]  AssignedVars[][287], [278#L1027-13true, threadThread2of4ForFork0InUse, 5#$Ultimate##0true, threadThread3of4ForFork0InUse, threadThread4of4ForFork0InUse, 141#$Ultimate##0true, 135#L1036-10true, threadThread1of4ForFork0NotInUse])
[2024-03-11 23:09:33,225 INFO  L383   tUnfolder$Statistics]: this new event has 274 ancestors and is cut-off event
[2024-03-11 23:09:33,225 INFO  L386   tUnfolder$Statistics]:   existing Event has 217 ancestors and is cut-off event
[2024-03-11 23:09:33,225 INFO  L386   tUnfolder$Statistics]:   existing Event has 217 ancestors and is cut-off event
[2024-03-11 23:09:33,225 INFO  L386   tUnfolder$Statistics]:   existing Event has 160 ancestors and is cut-off event
[2024-03-11 23:09:33,288 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1785] threadEXIT-->L1027-13: Formula: (= (let ((.cse0 (mod |v_threadThread3of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread1of4ForFork0_thidvar0_8)  InVars {threadThread3of4ForFork0_#t~mem8=|v_threadThread3of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_8}  OutVars{threadThread3of4ForFork0_#t~mem8=|v_threadThread3of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_8}  AuxVars[]  AssignedVars[][285], [214#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread3of4ForFork0InUse, threadThread4of4ForFork0NotInUse, 233#L1027-13true, threadThread1of4ForFork0NotInUse, threadThread2of4ForFork0NotInUse])
[2024-03-11 23:09:33,288 INFO  L383   tUnfolder$Statistics]: this new event has 257 ancestors and is not cut-off event
[2024-03-11 23:09:33,288 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is not cut-off event
[2024-03-11 23:09:33,288 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is not cut-off event
[2024-03-11 23:09:33,288 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is not cut-off event
[2024-03-11 23:09:33,288 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1795] threadEXIT-->L1027-13: Formula: (= v_threadThread3of4ForFork0_thidvar0_12 (let ((.cse0 (mod |v_threadThread2of4ForFork0_#t~mem8_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))  InVars {threadThread3of4ForFork0_thidvar0=v_threadThread3of4ForFork0_thidvar0_12, threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_12|}  OutVars{threadThread3of4ForFork0_thidvar0=v_threadThread3of4ForFork0_thidvar0_12, threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_12|}  AuxVars[]  AssignedVars[][161], [threadThread2of4ForFork0InUse, 214#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, 278#L1027-13true, threadThread3of4ForFork0NotInUse, threadThread4of4ForFork0NotInUse, threadThread1of4ForFork0NotInUse])
[2024-03-11 23:09:33,289 INFO  L383   tUnfolder$Statistics]: this new event has 257 ancestors and is not cut-off event
[2024-03-11 23:09:33,289 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is not cut-off event
[2024-03-11 23:09:33,289 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is not cut-off event
[2024-03-11 23:09:33,289 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is not cut-off event
[2024-03-11 23:09:33,289 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1791] threadEXIT-->L1027-13: Formula: (= (let ((.cse0 (mod |v_threadThread1of4ForFork0_#t~mem8_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread3of4ForFork0_thidvar0_10)  InVars {threadThread3of4ForFork0_thidvar0=v_threadThread3of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_12|}  OutVars{threadThread3of4ForFork0_thidvar0=v_threadThread3of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_12|}  AuxVars[]  AssignedVars[][160], [214#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread3of4ForFork0NotInUse, threadThread4of4ForFork0NotInUse, threadThread1of4ForFork0InUse, threadThread2of4ForFork0NotInUse, 10#L1027-13true])
[2024-03-11 23:09:33,289 INFO  L383   tUnfolder$Statistics]: this new event has 257 ancestors and is not cut-off event
[2024-03-11 23:09:33,289 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is not cut-off event
[2024-03-11 23:09:33,290 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is not cut-off event
[2024-03-11 23:09:33,290 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is not cut-off event
[2024-03-11 23:09:33,290 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1799] threadEXIT-->L1027-13: Formula: (= (let ((.cse0 (mod |v_threadThread4of4ForFork0_#t~mem8_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_threadThread3of4ForFork0_thidvar0_14)  InVars {threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_12|, threadThread3of4ForFork0_thidvar0=v_threadThread3of4ForFork0_thidvar0_14}  OutVars{threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_12|, threadThread3of4ForFork0_thidvar0=v_threadThread3of4ForFork0_thidvar0_14}  AuxVars[]  AssignedVars[][162], [214#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread3of4ForFork0NotInUse, 124#L1027-13true, threadThread4of4ForFork0InUse, threadThread1of4ForFork0NotInUse, threadThread2of4ForFork0NotInUse])
[2024-03-11 23:09:33,290 INFO  L383   tUnfolder$Statistics]: this new event has 257 ancestors and is not cut-off event
[2024-03-11 23:09:33,290 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is not cut-off event
[2024-03-11 23:09:33,290 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is not cut-off event
[2024-03-11 23:09:33,290 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is not cut-off event
[2024-03-11 23:09:33,307 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1798] threadEXIT-->L1027-13: Formula: (= v_threadThread2of4ForFork0_thidvar0_14 (let ((.cse0 (mod |v_threadThread4of4ForFork0_#t~mem8_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))))  InVars {threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_10|, threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_14}  OutVars{threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_10|, threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_14}  AuxVars[]  AssignedVars[][109], [214#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, 5#$Ultimate##0true, threadThread3of4ForFork0InUse, 124#L1027-13true, threadThread4of4ForFork0InUse, 37#$Ultimate##0true, threadThread1of4ForFork0InUse, threadThread2of4ForFork0NotInUse])
[2024-03-11 23:09:33,307 INFO  L383   tUnfolder$Statistics]: this new event has 291 ancestors and is cut-off event
[2024-03-11 23:09:33,307 INFO  L386   tUnfolder$Statistics]:   existing Event has 177 ancestors and is cut-off event
[2024-03-11 23:09:33,308 INFO  L386   tUnfolder$Statistics]:   existing Event has 234 ancestors and is cut-off event
[2024-03-11 23:09:33,308 INFO  L386   tUnfolder$Statistics]:   existing Event has 234 ancestors and is cut-off event
[2024-03-11 23:09:33,308 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1796] threadEXIT-->L1027-13: Formula: (= (let ((.cse0 (mod |v_threadThread2of4ForFork0_#t~mem8_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_threadThread4of4ForFork0_thidvar0_12)  InVars {threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_12}  OutVars{threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_12}  AuxVars[]  AssignedVars[][167], [threadThread2of4ForFork0InUse, 214#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, 278#L1027-13true, 5#$Ultimate##0true, threadThread3of4ForFork0InUse, threadThread4of4ForFork0NotInUse, 37#$Ultimate##0true, threadThread1of4ForFork0InUse])
[2024-03-11 23:09:33,308 INFO  L383   tUnfolder$Statistics]: this new event has 291 ancestors and is cut-off event
[2024-03-11 23:09:33,308 INFO  L386   tUnfolder$Statistics]:   existing Event has 234 ancestors and is cut-off event
[2024-03-11 23:09:33,308 INFO  L386   tUnfolder$Statistics]:   existing Event has 177 ancestors and is cut-off event
[2024-03-11 23:09:33,308 INFO  L386   tUnfolder$Statistics]:   existing Event has 234 ancestors and is cut-off event
[2024-03-11 23:09:33,309 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1792] threadEXIT-->L1027-13: Formula: (= v_threadThread4of4ForFork0_thidvar0_10 (let ((.cse0 (mod |v_threadThread1of4ForFork0_#t~mem8_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))  InVars {threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_10}  OutVars{threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_10}  AuxVars[]  AssignedVars[][166], [5#$Ultimate##0true, threadThread2of4ForFork0InUse, 214#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread3of4ForFork0InUse, threadThread4of4ForFork0NotInUse, 127#$Ultimate##0true, threadThread1of4ForFork0InUse, 10#L1027-13true])
[2024-03-11 23:09:33,310 INFO  L383   tUnfolder$Statistics]: this new event has 291 ancestors and is cut-off event
[2024-03-11 23:09:33,310 INFO  L386   tUnfolder$Statistics]:   existing Event has 177 ancestors and is cut-off event
[2024-03-11 23:09:33,310 INFO  L386   tUnfolder$Statistics]:   existing Event has 234 ancestors and is cut-off event
[2024-03-11 23:09:33,310 INFO  L386   tUnfolder$Statistics]:   existing Event has 234 ancestors and is cut-off event
[2024-03-11 23:09:33,310 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1797] threadEXIT-->L1027-13: Formula: (= (let ((.cse0 (mod |v_threadThread4of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread1of4ForFork0_thidvar0_14)  InVars {threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_14}  OutVars{threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_14}  AuxVars[]  AssignedVars[][288], [5#$Ultimate##0true, threadThread2of4ForFork0InUse, 214#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread3of4ForFork0InUse, 124#L1027-13true, threadThread4of4ForFork0InUse, 127#$Ultimate##0true, threadThread1of4ForFork0NotInUse])
[2024-03-11 23:09:33,311 INFO  L383   tUnfolder$Statistics]: this new event has 291 ancestors and is cut-off event
[2024-03-11 23:09:33,311 INFO  L386   tUnfolder$Statistics]:   existing Event has 234 ancestors and is cut-off event
[2024-03-11 23:09:33,311 INFO  L386   tUnfolder$Statistics]:   existing Event has 234 ancestors and is cut-off event
[2024-03-11 23:09:33,311 INFO  L386   tUnfolder$Statistics]:   existing Event has 177 ancestors and is cut-off event
[2024-03-11 23:09:33,312 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1793] threadEXIT-->L1027-13: Formula: (= v_threadThread1of4ForFork0_thidvar0_12 (let ((.cse0 (mod |v_threadThread2of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))  InVars {threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  OutVars{threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  AuxVars[]  AssignedVars[][287], [threadThread2of4ForFork0InUse, 214#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, 278#L1027-13true, 5#$Ultimate##0true, threadThread3of4ForFork0InUse, threadThread4of4ForFork0InUse, 141#$Ultimate##0true, threadThread1of4ForFork0NotInUse])
[2024-03-11 23:09:33,312 INFO  L383   tUnfolder$Statistics]: this new event has 291 ancestors and is cut-off event
[2024-03-11 23:09:33,312 INFO  L386   tUnfolder$Statistics]:   existing Event has 234 ancestors and is cut-off event
[2024-03-11 23:09:33,312 INFO  L386   tUnfolder$Statistics]:   existing Event has 177 ancestors and is cut-off event
[2024-03-11 23:09:33,312 INFO  L386   tUnfolder$Statistics]:   existing Event has 234 ancestors and is cut-off event
[2024-03-11 23:09:33,313 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1790] threadEXIT-->L1027-13: Formula: (= (let ((.cse0 (mod |v_threadThread1of4ForFork0_#t~mem8_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread2of4ForFork0_thidvar0_10)  InVars {threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  OutVars{threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  AuxVars[]  AssignedVars[][107], [214#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, 5#$Ultimate##0true, threadThread3of4ForFork0InUse, threadThread4of4ForFork0InUse, 141#$Ultimate##0true, threadThread1of4ForFork0InUse, 10#L1027-13true, threadThread2of4ForFork0NotInUse])
[2024-03-11 23:09:33,313 INFO  L383   tUnfolder$Statistics]: this new event has 291 ancestors and is cut-off event
[2024-03-11 23:09:33,313 INFO  L386   tUnfolder$Statistics]:   existing Event has 234 ancestors and is cut-off event
[2024-03-11 23:09:33,313 INFO  L386   tUnfolder$Statistics]:   existing Event has 177 ancestors and is cut-off event
[2024-03-11 23:09:33,313 INFO  L386   tUnfolder$Statistics]:   existing Event has 234 ancestors and is cut-off event
[2024-03-11 23:09:33,393 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1791] threadEXIT-->L1027-13: Formula: (= (let ((.cse0 (mod |v_threadThread1of4ForFork0_#t~mem8_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread3of4ForFork0_thidvar0_10)  InVars {threadThread3of4ForFork0_thidvar0=v_threadThread3of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_12|}  OutVars{threadThread3of4ForFork0_thidvar0=v_threadThread3of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_12|}  AuxVars[]  AssignedVars[][160], [threadThread3of4ForFork0NotInUse, threadThread4of4ForFork0NotInUse, 135#L1036-10true, threadThread1of4ForFork0InUse, 10#L1027-13true, threadThread2of4ForFork0NotInUse])
[2024-03-11 23:09:33,394 INFO  L383   tUnfolder$Statistics]: this new event has 297 ancestors and is cut-off event
[2024-03-11 23:09:33,394 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2024-03-11 23:09:33,394 INFO  L386   tUnfolder$Statistics]:   existing Event has 183 ancestors and is cut-off event
[2024-03-11 23:09:33,394 INFO  L386   tUnfolder$Statistics]:   existing Event has 183 ancestors and is cut-off event
[2024-03-11 23:09:33,398 INFO  L381   tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1792] threadEXIT-->L1027-13: Formula: (= v_threadThread4of4ForFork0_thidvar0_10 (let ((.cse0 (mod |v_threadThread1of4ForFork0_#t~mem8_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))  InVars {threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_10}  OutVars{threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_10}  AuxVars[]  AssignedVars[][166], [threadThread3of4ForFork0NotInUse, threadThread4of4ForFork0NotInUse, 135#L1036-10true, threadThread1of4ForFork0InUse, 10#L1027-13true, threadThread2of4ForFork0NotInUse])
[2024-03-11 23:09:33,398 INFO  L383   tUnfolder$Statistics]: this new event has 297 ancestors and is cut-off event
[2024-03-11 23:09:33,398 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2024-03-11 23:09:33,398 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2024-03-11 23:09:33,399 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2024-03-11 23:09:33,399 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2024-03-11 23:09:33,399 INFO  L381   tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1793] threadEXIT-->L1027-13: Formula: (= v_threadThread1of4ForFork0_thidvar0_12 (let ((.cse0 (mod |v_threadThread2of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))  InVars {threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  OutVars{threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  AuxVars[]  AssignedVars[][287], [278#L1027-13true, threadThread2of4ForFork0InUse, threadThread3of4ForFork0NotInUse, threadThread4of4ForFork0NotInUse, 135#L1036-10true, threadThread1of4ForFork0NotInUse])
[2024-03-11 23:09:33,400 INFO  L383   tUnfolder$Statistics]: this new event has 297 ancestors and is cut-off event
[2024-03-11 23:09:33,400 INFO  L386   tUnfolder$Statistics]:   existing Event has 183 ancestors and is cut-off event
[2024-03-11 23:09:33,400 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2024-03-11 23:09:33,400 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2024-03-11 23:09:33,400 INFO  L386   tUnfolder$Statistics]:   existing Event has 126 ancestors and is cut-off event
[2024-03-11 23:09:33,400 INFO  L381   tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1796] threadEXIT-->L1027-13: Formula: (= (let ((.cse0 (mod |v_threadThread2of4ForFork0_#t~mem8_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_threadThread4of4ForFork0_thidvar0_12)  InVars {threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_12}  OutVars{threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_12}  AuxVars[]  AssignedVars[][167], [threadThread2of4ForFork0InUse, 278#L1027-13true, threadThread3of4ForFork0NotInUse, threadThread4of4ForFork0NotInUse, 135#L1036-10true, threadThread1of4ForFork0NotInUse])
[2024-03-11 23:09:33,401 INFO  L383   tUnfolder$Statistics]: this new event has 297 ancestors and is cut-off event
[2024-03-11 23:09:33,401 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2024-03-11 23:09:33,401 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2024-03-11 23:09:33,401 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2024-03-11 23:09:33,401 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2024-03-11 23:09:33,450 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1785] threadEXIT-->L1027-13: Formula: (= (let ((.cse0 (mod |v_threadThread3of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread1of4ForFork0_thidvar0_8)  InVars {threadThread3of4ForFork0_#t~mem8=|v_threadThread3of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_8}  OutVars{threadThread3of4ForFork0_#t~mem8=|v_threadThread3of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_8}  AuxVars[]  AssignedVars[][285], [threadThread3of4ForFork0InUse, threadThread4of4ForFork0NotInUse, 233#L1027-13true, 135#L1036-10true, threadThread1of4ForFork0NotInUse, threadThread2of4ForFork0NotInUse])
[2024-03-11 23:09:33,450 INFO  L383   tUnfolder$Statistics]: this new event has 297 ancestors and is cut-off event
[2024-03-11 23:09:33,450 INFO  L386   tUnfolder$Statistics]:   existing Event has 183 ancestors and is cut-off event
[2024-03-11 23:09:33,450 INFO  L386   tUnfolder$Statistics]:   existing Event has 183 ancestors and is cut-off event
[2024-03-11 23:09:33,450 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2024-03-11 23:09:33,453 INFO  L381   tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1797] threadEXIT-->L1027-13: Formula: (= (let ((.cse0 (mod |v_threadThread4of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread1of4ForFork0_thidvar0_14)  InVars {threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_14}  OutVars{threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_14}  AuxVars[]  AssignedVars[][288], [threadThread3of4ForFork0NotInUse, 124#L1027-13true, threadThread4of4ForFork0InUse, 135#L1036-10true, threadThread1of4ForFork0NotInUse, threadThread2of4ForFork0NotInUse])
[2024-03-11 23:09:33,453 INFO  L383   tUnfolder$Statistics]: this new event has 297 ancestors and is cut-off event
[2024-03-11 23:09:33,453 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2024-03-11 23:09:33,453 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2024-03-11 23:09:33,453 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2024-03-11 23:09:33,453 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2024-03-11 23:09:33,455 INFO  L381   tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1790] threadEXIT-->L1027-13: Formula: (= (let ((.cse0 (mod |v_threadThread1of4ForFork0_#t~mem8_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread2of4ForFork0_thidvar0_10)  InVars {threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  OutVars{threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  AuxVars[]  AssignedVars[][107], [threadThread3of4ForFork0NotInUse, threadThread4of4ForFork0NotInUse, 135#L1036-10true, threadThread1of4ForFork0InUse, 10#L1027-13true, threadThread2of4ForFork0NotInUse])
[2024-03-11 23:09:33,455 INFO  L383   tUnfolder$Statistics]: this new event has 297 ancestors and is cut-off event
[2024-03-11 23:09:33,455 INFO  L386   tUnfolder$Statistics]:   existing Event has 126 ancestors and is cut-off event
[2024-03-11 23:09:33,456 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2024-03-11 23:09:33,456 INFO  L386   tUnfolder$Statistics]:   existing Event has 183 ancestors and is cut-off event
[2024-03-11 23:09:33,456 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2024-03-11 23:09:33,456 INFO  L381   tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1798] threadEXIT-->L1027-13: Formula: (= v_threadThread2of4ForFork0_thidvar0_14 (let ((.cse0 (mod |v_threadThread4of4ForFork0_#t~mem8_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))))  InVars {threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_10|, threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_14}  OutVars{threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_10|, threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_14}  AuxVars[]  AssignedVars[][109], [threadThread3of4ForFork0NotInUse, 124#L1027-13true, threadThread4of4ForFork0InUse, 135#L1036-10true, threadThread1of4ForFork0NotInUse, threadThread2of4ForFork0NotInUse])
[2024-03-11 23:09:33,456 INFO  L383   tUnfolder$Statistics]: this new event has 297 ancestors and is cut-off event
[2024-03-11 23:09:33,456 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2024-03-11 23:09:33,456 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2024-03-11 23:09:33,457 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2024-03-11 23:09:33,457 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2024-03-11 23:09:33,464 INFO  L381   tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1791] threadEXIT-->L1027-13: Formula: (= (let ((.cse0 (mod |v_threadThread1of4ForFork0_#t~mem8_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread3of4ForFork0_thidvar0_10)  InVars {threadThread3of4ForFork0_thidvar0=v_threadThread3of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_12|}  OutVars{threadThread3of4ForFork0_thidvar0=v_threadThread3of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_12|}  AuxVars[]  AssignedVars[][160], [214#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread3of4ForFork0NotInUse, threadThread4of4ForFork0NotInUse, threadThread1of4ForFork0InUse, 10#L1027-13true, threadThread2of4ForFork0NotInUse])
[2024-03-11 23:09:33,464 INFO  L383   tUnfolder$Statistics]: this new event has 314 ancestors and is cut-off event
[2024-03-11 23:09:33,464 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:33,465 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:33,465 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:33,465 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:33,466 INFO  L381   tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1792] threadEXIT-->L1027-13: Formula: (= v_threadThread4of4ForFork0_thidvar0_10 (let ((.cse0 (mod |v_threadThread1of4ForFork0_#t~mem8_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))  InVars {threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_10}  OutVars{threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_10}  AuxVars[]  AssignedVars[][166], [214#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread3of4ForFork0NotInUse, threadThread4of4ForFork0NotInUse, threadThread1of4ForFork0InUse, threadThread2of4ForFork0NotInUse, 10#L1027-13true])
[2024-03-11 23:09:33,467 INFO  L383   tUnfolder$Statistics]: this new event has 314 ancestors and is cut-off event
[2024-03-11 23:09:33,467 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:33,467 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:33,467 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:33,467 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:33,468 INFO  L381   tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1793] threadEXIT-->L1027-13: Formula: (= v_threadThread1of4ForFork0_thidvar0_12 (let ((.cse0 (mod |v_threadThread2of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))  InVars {threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  OutVars{threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  AuxVars[]  AssignedVars[][287], [threadThread2of4ForFork0InUse, 214#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, 278#L1027-13true, threadThread3of4ForFork0NotInUse, threadThread4of4ForFork0NotInUse, threadThread1of4ForFork0NotInUse])
[2024-03-11 23:09:33,468 INFO  L383   tUnfolder$Statistics]: this new event has 314 ancestors and is cut-off event
[2024-03-11 23:09:33,468 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:33,468 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:33,469 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:33,469 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:33,469 INFO  L381   tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1796] threadEXIT-->L1027-13: Formula: (= (let ((.cse0 (mod |v_threadThread2of4ForFork0_#t~mem8_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_threadThread4of4ForFork0_thidvar0_12)  InVars {threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_12}  OutVars{threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_12}  AuxVars[]  AssignedVars[][167], [threadThread2of4ForFork0InUse, 214#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, 278#L1027-13true, threadThread3of4ForFork0NotInUse, threadThread4of4ForFork0NotInUse, threadThread1of4ForFork0NotInUse])
[2024-03-11 23:09:33,469 INFO  L383   tUnfolder$Statistics]: this new event has 314 ancestors and is cut-off event
[2024-03-11 23:09:33,469 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:33,469 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:33,469 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:33,469 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:33,509 INFO  L381   tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1785] threadEXIT-->L1027-13: Formula: (= (let ((.cse0 (mod |v_threadThread3of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread1of4ForFork0_thidvar0_8)  InVars {threadThread3of4ForFork0_#t~mem8=|v_threadThread3of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_8}  OutVars{threadThread3of4ForFork0_#t~mem8=|v_threadThread3of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_8}  AuxVars[]  AssignedVars[][285], [214#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread3of4ForFork0InUse, threadThread4of4ForFork0NotInUse, 233#L1027-13true, threadThread1of4ForFork0NotInUse, threadThread2of4ForFork0NotInUse])
[2024-03-11 23:09:33,510 INFO  L383   tUnfolder$Statistics]: this new event has 314 ancestors and is cut-off event
[2024-03-11 23:09:33,510 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:33,510 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:33,510 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:33,510 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:33,511 INFO  L381   tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1797] threadEXIT-->L1027-13: Formula: (= (let ((.cse0 (mod |v_threadThread4of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread1of4ForFork0_thidvar0_14)  InVars {threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_14}  OutVars{threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_14}  AuxVars[]  AssignedVars[][288], [214#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread3of4ForFork0NotInUse, 124#L1027-13true, threadThread4of4ForFork0InUse, threadThread1of4ForFork0NotInUse, threadThread2of4ForFork0NotInUse])
[2024-03-11 23:09:33,511 INFO  L383   tUnfolder$Statistics]: this new event has 314 ancestors and is cut-off event
[2024-03-11 23:09:33,511 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:33,511 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:33,511 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:33,511 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:33,512 INFO  L381   tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1790] threadEXIT-->L1027-13: Formula: (= (let ((.cse0 (mod |v_threadThread1of4ForFork0_#t~mem8_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread2of4ForFork0_thidvar0_10)  InVars {threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  OutVars{threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  AuxVars[]  AssignedVars[][107], [214#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread3of4ForFork0NotInUse, threadThread4of4ForFork0NotInUse, threadThread1of4ForFork0InUse, 10#L1027-13true, threadThread2of4ForFork0NotInUse])
[2024-03-11 23:09:33,512 INFO  L383   tUnfolder$Statistics]: this new event has 314 ancestors and is cut-off event
[2024-03-11 23:09:33,513 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:33,513 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:33,513 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:33,513 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:33,514 INFO  L381   tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1798] threadEXIT-->L1027-13: Formula: (= v_threadThread2of4ForFork0_thidvar0_14 (let ((.cse0 (mod |v_threadThread4of4ForFork0_#t~mem8_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))))  InVars {threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_10|, threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_14}  OutVars{threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_10|, threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_14}  AuxVars[]  AssignedVars[][109], [214#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread3of4ForFork0NotInUse, 124#L1027-13true, threadThread4of4ForFork0InUse, threadThread1of4ForFork0NotInUse, threadThread2of4ForFork0NotInUse])
[2024-03-11 23:09:33,514 INFO  L383   tUnfolder$Statistics]: this new event has 314 ancestors and is cut-off event
[2024-03-11 23:09:33,514 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:33,514 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:33,514 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:33,514 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:33,516 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1790] threadEXIT-->L1027-13: Formula: (= (let ((.cse0 (mod |v_threadThread1of4ForFork0_#t~mem8_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread2of4ForFork0_thidvar0_10)  InVars {threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  OutVars{threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  AuxVars[]  AssignedVars[][107], [threadThread3of4ForFork0InUse, threadThread4of4ForFork0InUse, 141#$Ultimate##0true, 233#L1027-13true, 135#L1036-10true, threadThread1of4ForFork0InUse, 10#L1027-13true, threadThread2of4ForFork0NotInUse])
[2024-03-11 23:09:33,517 INFO  L383   tUnfolder$Statistics]: this new event has 339 ancestors and is cut-off event
[2024-03-11 23:09:33,517 INFO  L386   tUnfolder$Statistics]:   existing Event has 225 ancestors and is cut-off event
[2024-03-11 23:09:33,517 INFO  L386   tUnfolder$Statistics]:   existing Event has 282 ancestors and is cut-off event
[2024-03-11 23:09:33,517 INFO  L386   tUnfolder$Statistics]:   existing Event has 282 ancestors and is cut-off event
[2024-03-11 23:09:33,520 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1793] threadEXIT-->L1027-13: Formula: (= v_threadThread1of4ForFork0_thidvar0_12 (let ((.cse0 (mod |v_threadThread2of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))  InVars {threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  OutVars{threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  AuxVars[]  AssignedVars[][287], [5#$Ultimate##0true, threadThread2of4ForFork0InUse, 278#L1027-13true, threadThread3of4ForFork0InUse, 124#L1027-13true, threadThread4of4ForFork0InUse, 135#L1036-10true, threadThread1of4ForFork0NotInUse])
[2024-03-11 23:09:33,520 INFO  L383   tUnfolder$Statistics]: this new event has 339 ancestors and is cut-off event
[2024-03-11 23:09:33,520 INFO  L386   tUnfolder$Statistics]:   existing Event has 282 ancestors and is cut-off event
[2024-03-11 23:09:33,520 INFO  L386   tUnfolder$Statistics]:   existing Event has 225 ancestors and is cut-off event
[2024-03-11 23:09:33,520 INFO  L386   tUnfolder$Statistics]:   existing Event has 282 ancestors and is cut-off event
[2024-03-11 23:09:33,520 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1790] threadEXIT-->L1027-13: Formula: (= (let ((.cse0 (mod |v_threadThread1of4ForFork0_#t~mem8_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread2of4ForFork0_thidvar0_10)  InVars {threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  OutVars{threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  AuxVars[]  AssignedVars[][107], [5#$Ultimate##0true, threadThread3of4ForFork0InUse, 124#L1027-13true, threadThread4of4ForFork0InUse, 135#L1036-10true, threadThread1of4ForFork0InUse, 10#L1027-13true, threadThread2of4ForFork0NotInUse])
[2024-03-11 23:09:33,520 INFO  L383   tUnfolder$Statistics]: this new event has 339 ancestors and is cut-off event
[2024-03-11 23:09:33,520 INFO  L386   tUnfolder$Statistics]:   existing Event has 282 ancestors and is cut-off event
[2024-03-11 23:09:33,520 INFO  L386   tUnfolder$Statistics]:   existing Event has 225 ancestors and is cut-off event
[2024-03-11 23:09:33,521 INFO  L386   tUnfolder$Statistics]:   existing Event has 282 ancestors and is cut-off event
[2024-03-11 23:09:33,539 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1793] threadEXIT-->L1027-13: Formula: (= v_threadThread1of4ForFork0_thidvar0_12 (let ((.cse0 (mod |v_threadThread2of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))  InVars {threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  OutVars{threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  AuxVars[]  AssignedVars[][287], [278#L1027-13true, threadThread2of4ForFork0InUse, threadThread3of4ForFork0InUse, threadThread4of4ForFork0InUse, 141#$Ultimate##0true, 233#L1027-13true, 135#L1036-10true, threadThread1of4ForFork0NotInUse])
[2024-03-11 23:09:33,539 INFO  L383   tUnfolder$Statistics]: this new event has 339 ancestors and is cut-off event
[2024-03-11 23:09:33,539 INFO  L386   tUnfolder$Statistics]:   existing Event has 282 ancestors and is cut-off event
[2024-03-11 23:09:33,539 INFO  L386   tUnfolder$Statistics]:   existing Event has 282 ancestors and is cut-off event
[2024-03-11 23:09:33,539 INFO  L386   tUnfolder$Statistics]:   existing Event has 225 ancestors and is cut-off event
[2024-03-11 23:09:33,541 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1797] threadEXIT-->L1027-13: Formula: (= (let ((.cse0 (mod |v_threadThread4of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread1of4ForFork0_thidvar0_14)  InVars {threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_14}  OutVars{threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_14}  AuxVars[]  AssignedVars[][288], [threadThread2of4ForFork0InUse, threadThread3of4ForFork0InUse, 124#L1027-13true, threadThread4of4ForFork0InUse, 233#L1027-13true, 135#L1036-10true, 127#$Ultimate##0true, threadThread1of4ForFork0NotInUse])
[2024-03-11 23:09:33,541 INFO  L383   tUnfolder$Statistics]: this new event has 339 ancestors and is cut-off event
[2024-03-11 23:09:33,541 INFO  L386   tUnfolder$Statistics]:   existing Event has 225 ancestors and is cut-off event
[2024-03-11 23:09:33,541 INFO  L386   tUnfolder$Statistics]:   existing Event has 282 ancestors and is cut-off event
[2024-03-11 23:09:33,541 INFO  L386   tUnfolder$Statistics]:   existing Event has 282 ancestors and is cut-off event
[2024-03-11 23:09:33,543 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1798] threadEXIT-->L1027-13: Formula: (= v_threadThread2of4ForFork0_thidvar0_14 (let ((.cse0 (mod |v_threadThread4of4ForFork0_#t~mem8_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))))  InVars {threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_10|, threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_14}  OutVars{threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_10|, threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_14}  AuxVars[]  AssignedVars[][109], [5#$Ultimate##0true, threadThread3of4ForFork0InUse, 124#L1027-13true, threadThread4of4ForFork0InUse, 135#L1036-10true, threadThread1of4ForFork0InUse, 10#L1027-13true, threadThread2of4ForFork0NotInUse])
[2024-03-11 23:09:33,543 INFO  L383   tUnfolder$Statistics]: this new event has 339 ancestors and is cut-off event
[2024-03-11 23:09:33,543 INFO  L386   tUnfolder$Statistics]:   existing Event has 225 ancestors and is cut-off event
[2024-03-11 23:09:33,543 INFO  L386   tUnfolder$Statistics]:   existing Event has 282 ancestors and is cut-off event
[2024-03-11 23:09:33,543 INFO  L386   tUnfolder$Statistics]:   existing Event has 282 ancestors and is cut-off event
[2024-03-11 23:09:33,544 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1797] threadEXIT-->L1027-13: Formula: (= (let ((.cse0 (mod |v_threadThread4of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread1of4ForFork0_thidvar0_14)  InVars {threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_14}  OutVars{threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_14}  AuxVars[]  AssignedVars[][288], [5#$Ultimate##0true, threadThread2of4ForFork0InUse, 278#L1027-13true, threadThread3of4ForFork0InUse, 124#L1027-13true, threadThread4of4ForFork0InUse, 135#L1036-10true, threadThread1of4ForFork0NotInUse])
[2024-03-11 23:09:33,544 INFO  L383   tUnfolder$Statistics]: this new event has 339 ancestors and is cut-off event
[2024-03-11 23:09:33,544 INFO  L386   tUnfolder$Statistics]:   existing Event has 282 ancestors and is cut-off event
[2024-03-11 23:09:33,544 INFO  L386   tUnfolder$Statistics]:   existing Event has 282 ancestors and is cut-off event
[2024-03-11 23:09:33,544 INFO  L386   tUnfolder$Statistics]:   existing Event has 225 ancestors and is cut-off event
[2024-03-11 23:09:33,582 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1793] threadEXIT-->L1027-13: Formula: (= v_threadThread1of4ForFork0_thidvar0_12 (let ((.cse0 (mod |v_threadThread2of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))  InVars {threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  OutVars{threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  AuxVars[]  AssignedVars[][287], [278#L1027-13true, threadThread2of4ForFork0InUse, 214#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread3of4ForFork0InUse, threadThread4of4ForFork0InUse, 141#$Ultimate##0true, 233#L1027-13true, threadThread1of4ForFork0NotInUse])
[2024-03-11 23:09:33,582 INFO  L383   tUnfolder$Statistics]: this new event has 356 ancestors and is cut-off event
[2024-03-11 23:09:33,582 INFO  L386   tUnfolder$Statistics]:   existing Event has 242 ancestors and is cut-off event
[2024-03-11 23:09:33,582 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2024-03-11 23:09:33,582 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2024-03-11 23:09:33,583 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1790] threadEXIT-->L1027-13: Formula: (= (let ((.cse0 (mod |v_threadThread1of4ForFork0_#t~mem8_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread2of4ForFork0_thidvar0_10)  InVars {threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  OutVars{threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  AuxVars[]  AssignedVars[][107], [214#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread3of4ForFork0InUse, threadThread4of4ForFork0InUse, 141#$Ultimate##0true, 233#L1027-13true, threadThread1of4ForFork0InUse, 10#L1027-13true, threadThread2of4ForFork0NotInUse])
[2024-03-11 23:09:33,583 INFO  L383   tUnfolder$Statistics]: this new event has 356 ancestors and is cut-off event
[2024-03-11 23:09:33,583 INFO  L386   tUnfolder$Statistics]:   existing Event has 242 ancestors and is cut-off event
[2024-03-11 23:09:33,583 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2024-03-11 23:09:33,583 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2024-03-11 23:09:33,584 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1798] threadEXIT-->L1027-13: Formula: (= v_threadThread2of4ForFork0_thidvar0_14 (let ((.cse0 (mod |v_threadThread4of4ForFork0_#t~mem8_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))))  InVars {threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_10|, threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_14}  OutVars{threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_10|, threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_14}  AuxVars[]  AssignedVars[][109], [214#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread3of4ForFork0InUse, 124#L1027-13true, 37#$Ultimate##0true, threadThread4of4ForFork0InUse, 233#L1027-13true, threadThread1of4ForFork0InUse, threadThread2of4ForFork0NotInUse])
[2024-03-11 23:09:33,584 INFO  L383   tUnfolder$Statistics]: this new event has 356 ancestors and is cut-off event
[2024-03-11 23:09:33,584 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2024-03-11 23:09:33,584 INFO  L386   tUnfolder$Statistics]:   existing Event has 242 ancestors and is cut-off event
[2024-03-11 23:09:33,584 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2024-03-11 23:09:33,584 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1796] threadEXIT-->L1027-13: Formula: (= (let ((.cse0 (mod |v_threadThread2of4ForFork0_#t~mem8_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_threadThread4of4ForFork0_thidvar0_12)  InVars {threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_12}  OutVars{threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_12}  AuxVars[]  AssignedVars[][167], [278#L1027-13true, threadThread2of4ForFork0InUse, 214#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread3of4ForFork0InUse, threadThread4of4ForFork0NotInUse, 37#$Ultimate##0true, 233#L1027-13true, threadThread1of4ForFork0InUse])
[2024-03-11 23:09:33,584 INFO  L383   tUnfolder$Statistics]: this new event has 356 ancestors and is cut-off event
[2024-03-11 23:09:33,585 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2024-03-11 23:09:33,585 INFO  L386   tUnfolder$Statistics]:   existing Event has 242 ancestors and is cut-off event
[2024-03-11 23:09:33,585 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2024-03-11 23:09:33,585 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1792] threadEXIT-->L1027-13: Formula: (= v_threadThread4of4ForFork0_thidvar0_10 (let ((.cse0 (mod |v_threadThread1of4ForFork0_#t~mem8_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))  InVars {threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_10}  OutVars{threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_10}  AuxVars[]  AssignedVars[][166], [threadThread2of4ForFork0InUse, 214#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread3of4ForFork0InUse, threadThread4of4ForFork0NotInUse, 233#L1027-13true, 127#$Ultimate##0true, threadThread1of4ForFork0InUse, 10#L1027-13true])
[2024-03-11 23:09:33,586 INFO  L383   tUnfolder$Statistics]: this new event has 356 ancestors and is cut-off event
[2024-03-11 23:09:33,586 INFO  L386   tUnfolder$Statistics]:   existing Event has 242 ancestors and is cut-off event
[2024-03-11 23:09:33,586 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2024-03-11 23:09:33,586 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2024-03-11 23:09:33,586 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1797] threadEXIT-->L1027-13: Formula: (= (let ((.cse0 (mod |v_threadThread4of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread1of4ForFork0_thidvar0_14)  InVars {threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_14}  OutVars{threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_14}  AuxVars[]  AssignedVars[][288], [threadThread2of4ForFork0InUse, 214#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread3of4ForFork0InUse, 124#L1027-13true, threadThread4of4ForFork0InUse, 233#L1027-13true, 127#$Ultimate##0true, threadThread1of4ForFork0NotInUse])
[2024-03-11 23:09:33,586 INFO  L383   tUnfolder$Statistics]: this new event has 356 ancestors and is cut-off event
[2024-03-11 23:09:33,586 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2024-03-11 23:09:33,586 INFO  L386   tUnfolder$Statistics]:   existing Event has 242 ancestors and is cut-off event
[2024-03-11 23:09:33,586 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2024-03-11 23:09:33,590 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1792] threadEXIT-->L1027-13: Formula: (= v_threadThread4of4ForFork0_thidvar0_10 (let ((.cse0 (mod |v_threadThread1of4ForFork0_#t~mem8_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))  InVars {threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_10}  OutVars{threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_10}  AuxVars[]  AssignedVars[][166], [5#$Ultimate##0true, 278#L1027-13true, threadThread2of4ForFork0InUse, 214#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread3of4ForFork0InUse, threadThread4of4ForFork0NotInUse, threadThread1of4ForFork0InUse, 10#L1027-13true])
[2024-03-11 23:09:33,590 INFO  L383   tUnfolder$Statistics]: this new event has 356 ancestors and is cut-off event
[2024-03-11 23:09:33,590 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2024-03-11 23:09:33,590 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2024-03-11 23:09:33,590 INFO  L386   tUnfolder$Statistics]:   existing Event has 242 ancestors and is cut-off event
[2024-03-11 23:09:33,590 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1798] threadEXIT-->L1027-13: Formula: (= v_threadThread2of4ForFork0_thidvar0_14 (let ((.cse0 (mod |v_threadThread4of4ForFork0_#t~mem8_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))))  InVars {threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_10|, threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_14}  OutVars{threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_10|, threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_14}  AuxVars[]  AssignedVars[][109], [5#$Ultimate##0true, 214#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread3of4ForFork0InUse, 124#L1027-13true, threadThread4of4ForFork0InUse, threadThread1of4ForFork0InUse, 10#L1027-13true, threadThread2of4ForFork0NotInUse])
[2024-03-11 23:09:33,590 INFO  L383   tUnfolder$Statistics]: this new event has 356 ancestors and is cut-off event
[2024-03-11 23:09:33,590 INFO  L386   tUnfolder$Statistics]:   existing Event has 242 ancestors and is cut-off event
[2024-03-11 23:09:33,590 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2024-03-11 23:09:33,591 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2024-03-11 23:09:33,591 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1793] threadEXIT-->L1027-13: Formula: (= v_threadThread1of4ForFork0_thidvar0_12 (let ((.cse0 (mod |v_threadThread2of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))  InVars {threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  OutVars{threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  AuxVars[]  AssignedVars[][287], [5#$Ultimate##0true, 278#L1027-13true, threadThread2of4ForFork0InUse, 214#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread3of4ForFork0InUse, 124#L1027-13true, threadThread4of4ForFork0InUse, threadThread1of4ForFork0NotInUse])
[2024-03-11 23:09:33,591 INFO  L383   tUnfolder$Statistics]: this new event has 356 ancestors and is cut-off event
[2024-03-11 23:09:33,591 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2024-03-11 23:09:33,591 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2024-03-11 23:09:33,591 INFO  L386   tUnfolder$Statistics]:   existing Event has 242 ancestors and is cut-off event
[2024-03-11 23:09:33,592 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1796] threadEXIT-->L1027-13: Formula: (= (let ((.cse0 (mod |v_threadThread2of4ForFork0_#t~mem8_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_threadThread4of4ForFork0_thidvar0_12)  InVars {threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_12}  OutVars{threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_12}  AuxVars[]  AssignedVars[][167], [5#$Ultimate##0true, threadThread2of4ForFork0InUse, 214#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, 278#L1027-13true, threadThread3of4ForFork0InUse, threadThread4of4ForFork0NotInUse, threadThread1of4ForFork0InUse, 10#L1027-13true])
[2024-03-11 23:09:33,592 INFO  L383   tUnfolder$Statistics]: this new event has 356 ancestors and is cut-off event
[2024-03-11 23:09:33,592 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2024-03-11 23:09:33,592 INFO  L386   tUnfolder$Statistics]:   existing Event has 242 ancestors and is cut-off event
[2024-03-11 23:09:33,592 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2024-03-11 23:09:33,592 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1790] threadEXIT-->L1027-13: Formula: (= (let ((.cse0 (mod |v_threadThread1of4ForFork0_#t~mem8_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread2of4ForFork0_thidvar0_10)  InVars {threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  OutVars{threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  AuxVars[]  AssignedVars[][107], [5#$Ultimate##0true, 214#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread3of4ForFork0InUse, 124#L1027-13true, threadThread4of4ForFork0InUse, threadThread1of4ForFork0InUse, 10#L1027-13true, threadThread2of4ForFork0NotInUse])
[2024-03-11 23:09:33,592 INFO  L383   tUnfolder$Statistics]: this new event has 356 ancestors and is cut-off event
[2024-03-11 23:09:33,592 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2024-03-11 23:09:33,592 INFO  L386   tUnfolder$Statistics]:   existing Event has 242 ancestors and is cut-off event
[2024-03-11 23:09:33,592 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2024-03-11 23:09:33,593 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1797] threadEXIT-->L1027-13: Formula: (= (let ((.cse0 (mod |v_threadThread4of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread1of4ForFork0_thidvar0_14)  InVars {threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_14}  OutVars{threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_14}  AuxVars[]  AssignedVars[][288], [5#$Ultimate##0true, 278#L1027-13true, threadThread2of4ForFork0InUse, 214#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread3of4ForFork0InUse, 124#L1027-13true, threadThread4of4ForFork0InUse, threadThread1of4ForFork0NotInUse])
[2024-03-11 23:09:33,593 INFO  L383   tUnfolder$Statistics]: this new event has 356 ancestors and is cut-off event
[2024-03-11 23:09:33,593 INFO  L386   tUnfolder$Statistics]:   existing Event has 242 ancestors and is cut-off event
[2024-03-11 23:09:33,593 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2024-03-11 23:09:33,593 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2024-03-11 23:09:33,636 INFO  L130       PetriNetUnfolder]: 909/6311 cut-off events.
[2024-03-11 23:09:33,637 INFO  L131       PetriNetUnfolder]: For 851/919 co-relation queries the response was YES.
[2024-03-11 23:09:33,698 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7193 conditions, 6311 events. 909/6311 cut-off events. For 851/919 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 53431 event pairs, 20 based on Foata normal form. 62/5229 useless extension candidates. Maximal degree in co-relation 2099. Up to 186 conditions per place. 
[2024-03-11 23:09:33,698 INFO  L82        GeneralOperation]: Start removeDead. Operand has 323 places, 353 transitions, 810 flow
[2024-03-11 23:09:33,737 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 293 places, 313 transitions, 706 flow
[2024-03-11 23:09:33,737 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2024-03-11 23:09:33,737 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 293 places, 313 transitions, 706 flow
[2024-03-11 23:09:33,737 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 293 places, 313 transitions, 706 flow
[2024-03-11 23:09:33,737 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 293 places, 313 transitions, 706 flow
[2024-03-11 23:09:33,938 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1790] threadEXIT-->L1027-13: Formula: (= (let ((.cse0 (mod |v_threadThread1of4ForFork0_#t~mem8_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread2of4ForFork0_thidvar0_10)  InVars {threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  OutVars{threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  AuxVars[]  AssignedVars[][95], [threadThread3of4ForFork0NotInUse, threadThread4of4ForFork0NotInUse, 135#L1036-10true, threadThread1of4ForFork0InUse, 10#L1027-13true, threadThread2of4ForFork0NotInUse])
[2024-03-11 23:09:33,938 INFO  L383   tUnfolder$Statistics]: this new event has 240 ancestors and is cut-off event
[2024-03-11 23:09:33,938 INFO  L386   tUnfolder$Statistics]:   existing Event has 126 ancestors and is cut-off event
[2024-03-11 23:09:33,938 INFO  L386   tUnfolder$Statistics]:   existing Event has 183 ancestors and is cut-off event
[2024-03-11 23:09:33,938 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2024-03-11 23:09:33,939 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1793] threadEXIT-->L1027-13: Formula: (= v_threadThread1of4ForFork0_thidvar0_12 (let ((.cse0 (mod |v_threadThread2of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))  InVars {threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  OutVars{threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  AuxVars[]  AssignedVars[][255], [278#L1027-13true, threadThread2of4ForFork0InUse, threadThread3of4ForFork0NotInUse, threadThread4of4ForFork0NotInUse, 135#L1036-10true, threadThread1of4ForFork0NotInUse])
[2024-03-11 23:09:33,940 INFO  L383   tUnfolder$Statistics]: this new event has 240 ancestors and is cut-off event
[2024-03-11 23:09:33,940 INFO  L386   tUnfolder$Statistics]:   existing Event has 183 ancestors and is cut-off event
[2024-03-11 23:09:33,940 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2024-03-11 23:09:33,940 INFO  L386   tUnfolder$Statistics]:   existing Event has 126 ancestors and is cut-off event
[2024-03-11 23:09:34,124 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1797] threadEXIT-->L1027-13: Formula: (= (let ((.cse0 (mod |v_threadThread4of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread1of4ForFork0_thidvar0_14)  InVars {threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_14}  OutVars{threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_14}  AuxVars[]  AssignedVars[][256], [threadThread3of4ForFork0NotInUse, 124#L1027-13true, threadThread4of4ForFork0InUse, 135#L1036-10true, threadThread1of4ForFork0NotInUse, threadThread2of4ForFork0NotInUse])
[2024-03-11 23:09:34,124 INFO  L383   tUnfolder$Statistics]: this new event has 240 ancestors and is cut-off event
[2024-03-11 23:09:34,124 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2024-03-11 23:09:34,125 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2024-03-11 23:09:34,125 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2024-03-11 23:09:34,125 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1798] threadEXIT-->L1027-13: Formula: (= v_threadThread2of4ForFork0_thidvar0_14 (let ((.cse0 (mod |v_threadThread4of4ForFork0_#t~mem8_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))))  InVars {threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_10|, threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_14}  OutVars{threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_10|, threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_14}  AuxVars[]  AssignedVars[][96], [threadThread3of4ForFork0NotInUse, 124#L1027-13true, threadThread4of4ForFork0InUse, 135#L1036-10true, threadThread1of4ForFork0NotInUse, threadThread2of4ForFork0NotInUse])
[2024-03-11 23:09:34,125 INFO  L383   tUnfolder$Statistics]: this new event has 240 ancestors and is cut-off event
[2024-03-11 23:09:34,125 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2024-03-11 23:09:34,126 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2024-03-11 23:09:34,126 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2024-03-11 23:09:34,129 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1788] threadEXIT-->L1027-13: Formula: (= (let ((.cse0 (mod |v_threadThread3of4ForFork0_#t~mem8_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread4of4ForFork0_thidvar0_8)  InVars {threadThread3of4ForFork0_#t~mem8=|v_threadThread3of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_8}  OutVars{threadThread3of4ForFork0_#t~mem8=|v_threadThread3of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_8}  AuxVars[]  AssignedVars[][146], [threadThread3of4ForFork0InUse, threadThread4of4ForFork0NotInUse, 233#L1027-13true, 135#L1036-10true, threadThread1of4ForFork0NotInUse, threadThread2of4ForFork0NotInUse])
[2024-03-11 23:09:34,129 INFO  L383   tUnfolder$Statistics]: this new event has 240 ancestors and is cut-off event
[2024-03-11 23:09:34,129 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2024-03-11 23:09:34,129 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2024-03-11 23:09:34,129 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2024-03-11 23:09:34,131 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1792] threadEXIT-->L1027-13: Formula: (= v_threadThread4of4ForFork0_thidvar0_10 (let ((.cse0 (mod |v_threadThread1of4ForFork0_#t~mem8_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))  InVars {threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_10}  OutVars{threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_10}  AuxVars[]  AssignedVars[][147], [threadThread3of4ForFork0NotInUse, threadThread4of4ForFork0NotInUse, 135#L1036-10true, threadThread1of4ForFork0InUse, threadThread2of4ForFork0NotInUse, 10#L1027-13true])
[2024-03-11 23:09:34,131 INFO  L383   tUnfolder$Statistics]: this new event has 240 ancestors and is cut-off event
[2024-03-11 23:09:34,131 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2024-03-11 23:09:34,131 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2024-03-11 23:09:34,131 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2024-03-11 23:09:34,132 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1796] threadEXIT-->L1027-13: Formula: (= (let ((.cse0 (mod |v_threadThread2of4ForFork0_#t~mem8_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_threadThread4of4ForFork0_thidvar0_12)  InVars {threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_12}  OutVars{threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_12}  AuxVars[]  AssignedVars[][148], [threadThread2of4ForFork0InUse, 278#L1027-13true, threadThread3of4ForFork0NotInUse, threadThread4of4ForFork0NotInUse, 135#L1036-10true, threadThread1of4ForFork0NotInUse])
[2024-03-11 23:09:34,132 INFO  L383   tUnfolder$Statistics]: this new event has 240 ancestors and is cut-off event
[2024-03-11 23:09:34,132 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2024-03-11 23:09:34,132 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2024-03-11 23:09:34,132 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2024-03-11 23:09:34,196 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1790] threadEXIT-->L1027-13: Formula: (= (let ((.cse0 (mod |v_threadThread1of4ForFork0_#t~mem8_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread2of4ForFork0_thidvar0_10)  InVars {threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  OutVars{threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  AuxVars[]  AssignedVars[][95], [5#$Ultimate##0true, threadThread3of4ForFork0InUse, threadThread4of4ForFork0NotInUse, 135#L1036-10true, threadThread1of4ForFork0InUse, 10#L1027-13true, threadThread2of4ForFork0NotInUse])
[2024-03-11 23:09:34,196 INFO  L383   tUnfolder$Statistics]: this new event has 257 ancestors and is cut-off event
[2024-03-11 23:09:34,197 INFO  L386   tUnfolder$Statistics]:   existing Event has 143 ancestors and is cut-off event
[2024-03-11 23:09:34,197 INFO  L386   tUnfolder$Statistics]:   existing Event has 200 ancestors and is cut-off event
[2024-03-11 23:09:34,197 INFO  L386   tUnfolder$Statistics]:   existing Event has 200 ancestors and is cut-off event
[2024-03-11 23:09:34,234 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1786] threadEXIT-->L1027-13: Formula: (= v_threadThread2of4ForFork0_thidvar0_8 (let ((.cse0 (mod |v_threadThread3of4ForFork0_#t~mem8_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))  InVars {threadThread3of4ForFork0_#t~mem8=|v_threadThread3of4ForFork0_#t~mem8_10|, threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_8}  OutVars{threadThread3of4ForFork0_#t~mem8=|v_threadThread3of4ForFork0_#t~mem8_10|, threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_8}  AuxVars[]  AssignedVars[][94], [214#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread3of4ForFork0InUse, threadThread4of4ForFork0NotInUse, 233#L1027-13true, threadThread1of4ForFork0NotInUse, threadThread2of4ForFork0NotInUse])
[2024-03-11 23:09:34,234 INFO  L383   tUnfolder$Statistics]: this new event has 257 ancestors and is cut-off event
[2024-03-11 23:09:34,234 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:34,234 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:34,234 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:34,235 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1799] threadEXIT-->L1027-13: Formula: (= (let ((.cse0 (mod |v_threadThread4of4ForFork0_#t~mem8_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_threadThread3of4ForFork0_thidvar0_14)  InVars {threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_12|, threadThread3of4ForFork0_thidvar0=v_threadThread3of4ForFork0_thidvar0_14}  OutVars{threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_12|, threadThread3of4ForFork0_thidvar0=v_threadThread3of4ForFork0_thidvar0_14}  AuxVars[]  AssignedVars[][144], [threadThread3of4ForFork0NotInUse, 124#L1027-13true, threadThread4of4ForFork0InUse, 135#L1036-10true, threadThread1of4ForFork0NotInUse, threadThread2of4ForFork0NotInUse])
[2024-03-11 23:09:34,235 INFO  L383   tUnfolder$Statistics]: this new event has 240 ancestors and is not cut-off event
[2024-03-11 23:09:34,235 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is not cut-off event
[2024-03-11 23:09:34,235 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is not cut-off event
[2024-03-11 23:09:34,235 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is not cut-off event
[2024-03-11 23:09:34,236 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1790] threadEXIT-->L1027-13: Formula: (= (let ((.cse0 (mod |v_threadThread1of4ForFork0_#t~mem8_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread2of4ForFork0_thidvar0_10)  InVars {threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  OutVars{threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  AuxVars[]  AssignedVars[][95], [214#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread3of4ForFork0NotInUse, threadThread4of4ForFork0NotInUse, threadThread1of4ForFork0InUse, 10#L1027-13true, threadThread2of4ForFork0NotInUse])
[2024-03-11 23:09:34,236 INFO  L383   tUnfolder$Statistics]: this new event has 257 ancestors and is cut-off event
[2024-03-11 23:09:34,236 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:34,236 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:34,236 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:34,236 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1793] threadEXIT-->L1027-13: Formula: (= v_threadThread1of4ForFork0_thidvar0_12 (let ((.cse0 (mod |v_threadThread2of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))  InVars {threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  OutVars{threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  AuxVars[]  AssignedVars[][255], [threadThread2of4ForFork0InUse, 214#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, 278#L1027-13true, threadThread3of4ForFork0NotInUse, threadThread4of4ForFork0NotInUse, threadThread1of4ForFork0NotInUse])
[2024-03-11 23:09:34,237 INFO  L383   tUnfolder$Statistics]: this new event has 257 ancestors and is cut-off event
[2024-03-11 23:09:34,237 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:34,237 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:34,237 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:34,237 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1797] threadEXIT-->L1027-13: Formula: (= (let ((.cse0 (mod |v_threadThread4of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread1of4ForFork0_thidvar0_14)  InVars {threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_14}  OutVars{threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_14}  AuxVars[]  AssignedVars[][256], [214#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread3of4ForFork0NotInUse, 124#L1027-13true, threadThread4of4ForFork0InUse, threadThread1of4ForFork0NotInUse, threadThread2of4ForFork0NotInUse])
[2024-03-11 23:09:34,238 INFO  L383   tUnfolder$Statistics]: this new event has 257 ancestors and is cut-off event
[2024-03-11 23:09:34,238 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:34,238 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:34,238 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:34,238 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1798] threadEXIT-->L1027-13: Formula: (= v_threadThread2of4ForFork0_thidvar0_14 (let ((.cse0 (mod |v_threadThread4of4ForFork0_#t~mem8_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))))  InVars {threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_10|, threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_14}  OutVars{threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_10|, threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_14}  AuxVars[]  AssignedVars[][96], [214#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread3of4ForFork0NotInUse, 124#L1027-13true, threadThread4of4ForFork0InUse, threadThread1of4ForFork0NotInUse, threadThread2of4ForFork0NotInUse])
[2024-03-11 23:09:34,238 INFO  L383   tUnfolder$Statistics]: this new event has 257 ancestors and is cut-off event
[2024-03-11 23:09:34,238 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:34,239 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:34,239 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:34,240 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1788] threadEXIT-->L1027-13: Formula: (= (let ((.cse0 (mod |v_threadThread3of4ForFork0_#t~mem8_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread4of4ForFork0_thidvar0_8)  InVars {threadThread3of4ForFork0_#t~mem8=|v_threadThread3of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_8}  OutVars{threadThread3of4ForFork0_#t~mem8=|v_threadThread3of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_8}  AuxVars[]  AssignedVars[][146], [214#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread3of4ForFork0InUse, threadThread4of4ForFork0NotInUse, 233#L1027-13true, threadThread1of4ForFork0NotInUse, threadThread2of4ForFork0NotInUse])
[2024-03-11 23:09:34,240 INFO  L383   tUnfolder$Statistics]: this new event has 257 ancestors and is cut-off event
[2024-03-11 23:09:34,240 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:34,241 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:34,241 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:34,241 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1792] threadEXIT-->L1027-13: Formula: (= v_threadThread4of4ForFork0_thidvar0_10 (let ((.cse0 (mod |v_threadThread1of4ForFork0_#t~mem8_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))  InVars {threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_10}  OutVars{threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_10}  AuxVars[]  AssignedVars[][147], [214#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread3of4ForFork0NotInUse, threadThread4of4ForFork0NotInUse, threadThread1of4ForFork0InUse, threadThread2of4ForFork0NotInUse, 10#L1027-13true])
[2024-03-11 23:09:34,241 INFO  L383   tUnfolder$Statistics]: this new event has 257 ancestors and is cut-off event
[2024-03-11 23:09:34,242 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:34,242 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:34,242 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:34,242 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1796] threadEXIT-->L1027-13: Formula: (= (let ((.cse0 (mod |v_threadThread2of4ForFork0_#t~mem8_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_threadThread4of4ForFork0_thidvar0_12)  InVars {threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_12}  OutVars{threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_12}  AuxVars[]  AssignedVars[][148], [threadThread2of4ForFork0InUse, 214#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, 278#L1027-13true, threadThread3of4ForFork0NotInUse, threadThread4of4ForFork0NotInUse, threadThread1of4ForFork0NotInUse])
[2024-03-11 23:09:34,242 INFO  L383   tUnfolder$Statistics]: this new event has 257 ancestors and is cut-off event
[2024-03-11 23:09:34,242 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:34,242 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:34,243 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:34,251 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1790] threadEXIT-->L1027-13: Formula: (= (let ((.cse0 (mod |v_threadThread1of4ForFork0_#t~mem8_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread2of4ForFork0_thidvar0_10)  InVars {threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  OutVars{threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  AuxVars[]  AssignedVars[][95], [5#$Ultimate##0true, threadThread3of4ForFork0InUse, threadThread4of4ForFork0InUse, 141#$Ultimate##0true, 135#L1036-10true, threadThread1of4ForFork0InUse, 10#L1027-13true, threadThread2of4ForFork0NotInUse])
[2024-03-11 23:09:34,251 INFO  L383   tUnfolder$Statistics]: this new event has 274 ancestors and is cut-off event
[2024-03-11 23:09:34,251 INFO  L386   tUnfolder$Statistics]:   existing Event has 160 ancestors and is cut-off event
[2024-03-11 23:09:34,251 INFO  L386   tUnfolder$Statistics]:   existing Event has 217 ancestors and is cut-off event
[2024-03-11 23:09:34,252 INFO  L386   tUnfolder$Statistics]:   existing Event has 217 ancestors and is cut-off event
[2024-03-11 23:09:34,298 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1798] threadEXIT-->L1027-13: Formula: (= v_threadThread2of4ForFork0_thidvar0_14 (let ((.cse0 (mod |v_threadThread4of4ForFork0_#t~mem8_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))))  InVars {threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_10|, threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_14}  OutVars{threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_10|, threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_14}  AuxVars[]  AssignedVars[][96], [5#$Ultimate##0true, threadThread3of4ForFork0InUse, 124#L1027-13true, 37#$Ultimate##0true, threadThread4of4ForFork0InUse, 135#L1036-10true, threadThread1of4ForFork0InUse, threadThread2of4ForFork0NotInUse])
[2024-03-11 23:09:34,298 INFO  L383   tUnfolder$Statistics]: this new event has 274 ancestors and is cut-off event
[2024-03-11 23:09:34,298 INFO  L386   tUnfolder$Statistics]:   existing Event has 217 ancestors and is cut-off event
[2024-03-11 23:09:34,298 INFO  L386   tUnfolder$Statistics]:   existing Event has 160 ancestors and is cut-off event
[2024-03-11 23:09:34,299 INFO  L386   tUnfolder$Statistics]:   existing Event has 217 ancestors and is cut-off event
[2024-03-11 23:09:34,300 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1797] threadEXIT-->L1027-13: Formula: (= (let ((.cse0 (mod |v_threadThread4of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread1of4ForFork0_thidvar0_14)  InVars {threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_14}  OutVars{threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_14}  AuxVars[]  AssignedVars[][256], [5#$Ultimate##0true, threadThread2of4ForFork0InUse, threadThread3of4ForFork0InUse, 124#L1027-13true, threadThread4of4ForFork0InUse, 135#L1036-10true, 127#$Ultimate##0true, threadThread1of4ForFork0NotInUse])
[2024-03-11 23:09:34,300 INFO  L383   tUnfolder$Statistics]: this new event has 274 ancestors and is cut-off event
[2024-03-11 23:09:34,300 INFO  L386   tUnfolder$Statistics]:   existing Event has 217 ancestors and is cut-off event
[2024-03-11 23:09:34,300 INFO  L386   tUnfolder$Statistics]:   existing Event has 217 ancestors and is cut-off event
[2024-03-11 23:09:34,300 INFO  L386   tUnfolder$Statistics]:   existing Event has 160 ancestors and is cut-off event
[2024-03-11 23:09:34,301 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1793] threadEXIT-->L1027-13: Formula: (= v_threadThread1of4ForFork0_thidvar0_12 (let ((.cse0 (mod |v_threadThread2of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))  InVars {threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  OutVars{threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  AuxVars[]  AssignedVars[][255], [threadThread2of4ForFork0InUse, 278#L1027-13true, 5#$Ultimate##0true, threadThread3of4ForFork0InUse, threadThread4of4ForFork0NotInUse, 135#L1036-10true, threadThread1of4ForFork0NotInUse])
[2024-03-11 23:09:34,301 INFO  L383   tUnfolder$Statistics]: this new event has 257 ancestors and is cut-off event
[2024-03-11 23:09:34,301 INFO  L386   tUnfolder$Statistics]:   existing Event has 200 ancestors and is cut-off event
[2024-03-11 23:09:34,301 INFO  L386   tUnfolder$Statistics]:   existing Event has 200 ancestors and is cut-off event
[2024-03-11 23:09:34,301 INFO  L386   tUnfolder$Statistics]:   existing Event has 143 ancestors and is cut-off event
[2024-03-11 23:09:34,302 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1793] threadEXIT-->L1027-13: Formula: (= v_threadThread1of4ForFork0_thidvar0_12 (let ((.cse0 (mod |v_threadThread2of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))  InVars {threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  OutVars{threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  AuxVars[]  AssignedVars[][255], [278#L1027-13true, threadThread2of4ForFork0InUse, 5#$Ultimate##0true, threadThread3of4ForFork0InUse, threadThread4of4ForFork0InUse, 141#$Ultimate##0true, 135#L1036-10true, threadThread1of4ForFork0NotInUse])
[2024-03-11 23:09:34,302 INFO  L383   tUnfolder$Statistics]: this new event has 274 ancestors and is cut-off event
[2024-03-11 23:09:34,302 INFO  L386   tUnfolder$Statistics]:   existing Event has 217 ancestors and is cut-off event
[2024-03-11 23:09:34,302 INFO  L386   tUnfolder$Statistics]:   existing Event has 217 ancestors and is cut-off event
[2024-03-11 23:09:34,302 INFO  L386   tUnfolder$Statistics]:   existing Event has 160 ancestors and is cut-off event
[2024-03-11 23:09:34,373 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1785] threadEXIT-->L1027-13: Formula: (= (let ((.cse0 (mod |v_threadThread3of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread1of4ForFork0_thidvar0_8)  InVars {threadThread3of4ForFork0_#t~mem8=|v_threadThread3of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_8}  OutVars{threadThread3of4ForFork0_#t~mem8=|v_threadThread3of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_8}  AuxVars[]  AssignedVars[][254], [214#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread3of4ForFork0InUse, threadThread4of4ForFork0NotInUse, 233#L1027-13true, threadThread1of4ForFork0NotInUse, threadThread2of4ForFork0NotInUse])
[2024-03-11 23:09:34,374 INFO  L383   tUnfolder$Statistics]: this new event has 257 ancestors and is not cut-off event
[2024-03-11 23:09:34,374 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is not cut-off event
[2024-03-11 23:09:34,374 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is not cut-off event
[2024-03-11 23:09:34,374 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is not cut-off event
[2024-03-11 23:09:34,374 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1795] threadEXIT-->L1027-13: Formula: (= v_threadThread3of4ForFork0_thidvar0_12 (let ((.cse0 (mod |v_threadThread2of4ForFork0_#t~mem8_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))  InVars {threadThread3of4ForFork0_thidvar0=v_threadThread3of4ForFork0_thidvar0_12, threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_12|}  OutVars{threadThread3of4ForFork0_thidvar0=v_threadThread3of4ForFork0_thidvar0_12, threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_12|}  AuxVars[]  AssignedVars[][143], [threadThread2of4ForFork0InUse, 214#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, 278#L1027-13true, threadThread3of4ForFork0NotInUse, threadThread4of4ForFork0NotInUse, threadThread1of4ForFork0NotInUse])
[2024-03-11 23:09:34,375 INFO  L383   tUnfolder$Statistics]: this new event has 257 ancestors and is not cut-off event
[2024-03-11 23:09:34,375 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is not cut-off event
[2024-03-11 23:09:34,375 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is not cut-off event
[2024-03-11 23:09:34,375 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is not cut-off event
[2024-03-11 23:09:34,375 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1791] threadEXIT-->L1027-13: Formula: (= (let ((.cse0 (mod |v_threadThread1of4ForFork0_#t~mem8_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread3of4ForFork0_thidvar0_10)  InVars {threadThread3of4ForFork0_thidvar0=v_threadThread3of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_12|}  OutVars{threadThread3of4ForFork0_thidvar0=v_threadThread3of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_12|}  AuxVars[]  AssignedVars[][142], [214#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread3of4ForFork0NotInUse, threadThread4of4ForFork0NotInUse, threadThread1of4ForFork0InUse, threadThread2of4ForFork0NotInUse, 10#L1027-13true])
[2024-03-11 23:09:34,375 INFO  L383   tUnfolder$Statistics]: this new event has 257 ancestors and is not cut-off event
[2024-03-11 23:09:34,375 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is not cut-off event
[2024-03-11 23:09:34,375 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is not cut-off event
[2024-03-11 23:09:34,376 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is not cut-off event
[2024-03-11 23:09:34,376 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1799] threadEXIT-->L1027-13: Formula: (= (let ((.cse0 (mod |v_threadThread4of4ForFork0_#t~mem8_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_threadThread3of4ForFork0_thidvar0_14)  InVars {threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_12|, threadThread3of4ForFork0_thidvar0=v_threadThread3of4ForFork0_thidvar0_14}  OutVars{threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_12|, threadThread3of4ForFork0_thidvar0=v_threadThread3of4ForFork0_thidvar0_14}  AuxVars[]  AssignedVars[][144], [214#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread3of4ForFork0NotInUse, 124#L1027-13true, threadThread4of4ForFork0InUse, threadThread1of4ForFork0NotInUse, threadThread2of4ForFork0NotInUse])
[2024-03-11 23:09:34,376 INFO  L383   tUnfolder$Statistics]: this new event has 257 ancestors and is not cut-off event
[2024-03-11 23:09:34,376 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is not cut-off event
[2024-03-11 23:09:34,376 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is not cut-off event
[2024-03-11 23:09:34,376 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is not cut-off event
[2024-03-11 23:09:34,395 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1798] threadEXIT-->L1027-13: Formula: (= v_threadThread2of4ForFork0_thidvar0_14 (let ((.cse0 (mod |v_threadThread4of4ForFork0_#t~mem8_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))))  InVars {threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_10|, threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_14}  OutVars{threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_10|, threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_14}  AuxVars[]  AssignedVars[][96], [214#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, 5#$Ultimate##0true, threadThread3of4ForFork0InUse, 124#L1027-13true, threadThread4of4ForFork0InUse, 37#$Ultimate##0true, threadThread1of4ForFork0InUse, threadThread2of4ForFork0NotInUse])
[2024-03-11 23:09:34,395 INFO  L383   tUnfolder$Statistics]: this new event has 291 ancestors and is cut-off event
[2024-03-11 23:09:34,395 INFO  L386   tUnfolder$Statistics]:   existing Event has 177 ancestors and is cut-off event
[2024-03-11 23:09:34,395 INFO  L386   tUnfolder$Statistics]:   existing Event has 234 ancestors and is cut-off event
[2024-03-11 23:09:34,395 INFO  L386   tUnfolder$Statistics]:   existing Event has 234 ancestors and is cut-off event
[2024-03-11 23:09:34,396 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1796] threadEXIT-->L1027-13: Formula: (= (let ((.cse0 (mod |v_threadThread2of4ForFork0_#t~mem8_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_threadThread4of4ForFork0_thidvar0_12)  InVars {threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_12}  OutVars{threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_12}  AuxVars[]  AssignedVars[][148], [threadThread2of4ForFork0InUse, 214#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, 278#L1027-13true, 5#$Ultimate##0true, threadThread3of4ForFork0InUse, threadThread4of4ForFork0NotInUse, 37#$Ultimate##0true, threadThread1of4ForFork0InUse])
[2024-03-11 23:09:34,396 INFO  L383   tUnfolder$Statistics]: this new event has 291 ancestors and is cut-off event
[2024-03-11 23:09:34,396 INFO  L386   tUnfolder$Statistics]:   existing Event has 234 ancestors and is cut-off event
[2024-03-11 23:09:34,396 INFO  L386   tUnfolder$Statistics]:   existing Event has 177 ancestors and is cut-off event
[2024-03-11 23:09:34,396 INFO  L386   tUnfolder$Statistics]:   existing Event has 234 ancestors and is cut-off event
[2024-03-11 23:09:34,397 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1792] threadEXIT-->L1027-13: Formula: (= v_threadThread4of4ForFork0_thidvar0_10 (let ((.cse0 (mod |v_threadThread1of4ForFork0_#t~mem8_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))  InVars {threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_10}  OutVars{threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_10}  AuxVars[]  AssignedVars[][147], [5#$Ultimate##0true, threadThread2of4ForFork0InUse, 214#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread3of4ForFork0InUse, threadThread4of4ForFork0NotInUse, 127#$Ultimate##0true, threadThread1of4ForFork0InUse, 10#L1027-13true])
[2024-03-11 23:09:34,398 INFO  L383   tUnfolder$Statistics]: this new event has 291 ancestors and is cut-off event
[2024-03-11 23:09:34,398 INFO  L386   tUnfolder$Statistics]:   existing Event has 177 ancestors and is cut-off event
[2024-03-11 23:09:34,398 INFO  L386   tUnfolder$Statistics]:   existing Event has 234 ancestors and is cut-off event
[2024-03-11 23:09:34,398 INFO  L386   tUnfolder$Statistics]:   existing Event has 234 ancestors and is cut-off event
[2024-03-11 23:09:34,398 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1797] threadEXIT-->L1027-13: Formula: (= (let ((.cse0 (mod |v_threadThread4of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread1of4ForFork0_thidvar0_14)  InVars {threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_14}  OutVars{threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_14}  AuxVars[]  AssignedVars[][256], [5#$Ultimate##0true, threadThread2of4ForFork0InUse, 214#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread3of4ForFork0InUse, 124#L1027-13true, threadThread4of4ForFork0InUse, 127#$Ultimate##0true, threadThread1of4ForFork0NotInUse])
[2024-03-11 23:09:34,399 INFO  L383   tUnfolder$Statistics]: this new event has 291 ancestors and is cut-off event
[2024-03-11 23:09:34,399 INFO  L386   tUnfolder$Statistics]:   existing Event has 234 ancestors and is cut-off event
[2024-03-11 23:09:34,399 INFO  L386   tUnfolder$Statistics]:   existing Event has 234 ancestors and is cut-off event
[2024-03-11 23:09:34,399 INFO  L386   tUnfolder$Statistics]:   existing Event has 177 ancestors and is cut-off event
[2024-03-11 23:09:34,400 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1793] threadEXIT-->L1027-13: Formula: (= v_threadThread1of4ForFork0_thidvar0_12 (let ((.cse0 (mod |v_threadThread2of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))  InVars {threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  OutVars{threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  AuxVars[]  AssignedVars[][255], [threadThread2of4ForFork0InUse, 214#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, 278#L1027-13true, 5#$Ultimate##0true, threadThread3of4ForFork0InUse, threadThread4of4ForFork0InUse, 141#$Ultimate##0true, threadThread1of4ForFork0NotInUse])
[2024-03-11 23:09:34,400 INFO  L383   tUnfolder$Statistics]: this new event has 291 ancestors and is cut-off event
[2024-03-11 23:09:34,400 INFO  L386   tUnfolder$Statistics]:   existing Event has 234 ancestors and is cut-off event
[2024-03-11 23:09:34,400 INFO  L386   tUnfolder$Statistics]:   existing Event has 177 ancestors and is cut-off event
[2024-03-11 23:09:34,401 INFO  L386   tUnfolder$Statistics]:   existing Event has 234 ancestors and is cut-off event
[2024-03-11 23:09:34,401 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1790] threadEXIT-->L1027-13: Formula: (= (let ((.cse0 (mod |v_threadThread1of4ForFork0_#t~mem8_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread2of4ForFork0_thidvar0_10)  InVars {threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  OutVars{threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  AuxVars[]  AssignedVars[][95], [214#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, 5#$Ultimate##0true, threadThread3of4ForFork0InUse, threadThread4of4ForFork0InUse, 141#$Ultimate##0true, threadThread1of4ForFork0InUse, 10#L1027-13true, threadThread2of4ForFork0NotInUse])
[2024-03-11 23:09:34,401 INFO  L383   tUnfolder$Statistics]: this new event has 291 ancestors and is cut-off event
[2024-03-11 23:09:34,401 INFO  L386   tUnfolder$Statistics]:   existing Event has 234 ancestors and is cut-off event
[2024-03-11 23:09:34,401 INFO  L386   tUnfolder$Statistics]:   existing Event has 177 ancestors and is cut-off event
[2024-03-11 23:09:34,401 INFO  L386   tUnfolder$Statistics]:   existing Event has 234 ancestors and is cut-off event
[2024-03-11 23:09:34,501 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1791] threadEXIT-->L1027-13: Formula: (= (let ((.cse0 (mod |v_threadThread1of4ForFork0_#t~mem8_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread3of4ForFork0_thidvar0_10)  InVars {threadThread3of4ForFork0_thidvar0=v_threadThread3of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_12|}  OutVars{threadThread3of4ForFork0_thidvar0=v_threadThread3of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_12|}  AuxVars[]  AssignedVars[][142], [threadThread3of4ForFork0NotInUse, threadThread4of4ForFork0NotInUse, 135#L1036-10true, threadThread1of4ForFork0InUse, 10#L1027-13true, threadThread2of4ForFork0NotInUse])
[2024-03-11 23:09:34,501 INFO  L383   tUnfolder$Statistics]: this new event has 297 ancestors and is cut-off event
[2024-03-11 23:09:34,501 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2024-03-11 23:09:34,501 INFO  L386   tUnfolder$Statistics]:   existing Event has 183 ancestors and is cut-off event
[2024-03-11 23:09:34,501 INFO  L386   tUnfolder$Statistics]:   existing Event has 183 ancestors and is cut-off event
[2024-03-11 23:09:34,506 INFO  L381   tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1792] threadEXIT-->L1027-13: Formula: (= v_threadThread4of4ForFork0_thidvar0_10 (let ((.cse0 (mod |v_threadThread1of4ForFork0_#t~mem8_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))  InVars {threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_10}  OutVars{threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_10}  AuxVars[]  AssignedVars[][147], [threadThread3of4ForFork0NotInUse, threadThread4of4ForFork0NotInUse, 135#L1036-10true, threadThread1of4ForFork0InUse, 10#L1027-13true, threadThread2of4ForFork0NotInUse])
[2024-03-11 23:09:34,506 INFO  L383   tUnfolder$Statistics]: this new event has 297 ancestors and is cut-off event
[2024-03-11 23:09:34,506 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2024-03-11 23:09:34,507 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2024-03-11 23:09:34,507 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2024-03-11 23:09:34,507 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2024-03-11 23:09:34,508 INFO  L381   tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1793] threadEXIT-->L1027-13: Formula: (= v_threadThread1of4ForFork0_thidvar0_12 (let ((.cse0 (mod |v_threadThread2of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))  InVars {threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  OutVars{threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  AuxVars[]  AssignedVars[][255], [278#L1027-13true, threadThread2of4ForFork0InUse, threadThread3of4ForFork0NotInUse, threadThread4of4ForFork0NotInUse, 135#L1036-10true, threadThread1of4ForFork0NotInUse])
[2024-03-11 23:09:34,508 INFO  L383   tUnfolder$Statistics]: this new event has 297 ancestors and is cut-off event
[2024-03-11 23:09:34,508 INFO  L386   tUnfolder$Statistics]:   existing Event has 183 ancestors and is cut-off event
[2024-03-11 23:09:34,508 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2024-03-11 23:09:34,508 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2024-03-11 23:09:34,508 INFO  L386   tUnfolder$Statistics]:   existing Event has 126 ancestors and is cut-off event
[2024-03-11 23:09:34,509 INFO  L381   tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1796] threadEXIT-->L1027-13: Formula: (= (let ((.cse0 (mod |v_threadThread2of4ForFork0_#t~mem8_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_threadThread4of4ForFork0_thidvar0_12)  InVars {threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_12}  OutVars{threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_12}  AuxVars[]  AssignedVars[][148], [threadThread2of4ForFork0InUse, 278#L1027-13true, threadThread3of4ForFork0NotInUse, threadThread4of4ForFork0NotInUse, 135#L1036-10true, threadThread1of4ForFork0NotInUse])
[2024-03-11 23:09:34,509 INFO  L383   tUnfolder$Statistics]: this new event has 297 ancestors and is cut-off event
[2024-03-11 23:09:34,509 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2024-03-11 23:09:34,509 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2024-03-11 23:09:34,509 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2024-03-11 23:09:34,509 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2024-03-11 23:09:34,564 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1785] threadEXIT-->L1027-13: Formula: (= (let ((.cse0 (mod |v_threadThread3of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread1of4ForFork0_thidvar0_8)  InVars {threadThread3of4ForFork0_#t~mem8=|v_threadThread3of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_8}  OutVars{threadThread3of4ForFork0_#t~mem8=|v_threadThread3of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_8}  AuxVars[]  AssignedVars[][254], [threadThread3of4ForFork0InUse, threadThread4of4ForFork0NotInUse, 233#L1027-13true, 135#L1036-10true, threadThread1of4ForFork0NotInUse, threadThread2of4ForFork0NotInUse])
[2024-03-11 23:09:34,565 INFO  L383   tUnfolder$Statistics]: this new event has 297 ancestors and is cut-off event
[2024-03-11 23:09:34,565 INFO  L386   tUnfolder$Statistics]:   existing Event has 183 ancestors and is cut-off event
[2024-03-11 23:09:34,565 INFO  L386   tUnfolder$Statistics]:   existing Event has 183 ancestors and is cut-off event
[2024-03-11 23:09:34,565 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2024-03-11 23:09:34,567 INFO  L381   tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1797] threadEXIT-->L1027-13: Formula: (= (let ((.cse0 (mod |v_threadThread4of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread1of4ForFork0_thidvar0_14)  InVars {threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_14}  OutVars{threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_14}  AuxVars[]  AssignedVars[][256], [threadThread3of4ForFork0NotInUse, 124#L1027-13true, threadThread4of4ForFork0InUse, 135#L1036-10true, threadThread1of4ForFork0NotInUse, threadThread2of4ForFork0NotInUse])
[2024-03-11 23:09:34,568 INFO  L383   tUnfolder$Statistics]: this new event has 297 ancestors and is cut-off event
[2024-03-11 23:09:34,568 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2024-03-11 23:09:34,568 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2024-03-11 23:09:34,568 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2024-03-11 23:09:34,568 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2024-03-11 23:09:34,571 INFO  L381   tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1790] threadEXIT-->L1027-13: Formula: (= (let ((.cse0 (mod |v_threadThread1of4ForFork0_#t~mem8_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread2of4ForFork0_thidvar0_10)  InVars {threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  OutVars{threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  AuxVars[]  AssignedVars[][95], [threadThread3of4ForFork0NotInUse, threadThread4of4ForFork0NotInUse, 135#L1036-10true, threadThread1of4ForFork0InUse, 10#L1027-13true, threadThread2of4ForFork0NotInUse])
[2024-03-11 23:09:34,571 INFO  L383   tUnfolder$Statistics]: this new event has 297 ancestors and is cut-off event
[2024-03-11 23:09:34,571 INFO  L386   tUnfolder$Statistics]:   existing Event has 126 ancestors and is cut-off event
[2024-03-11 23:09:34,571 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2024-03-11 23:09:34,571 INFO  L386   tUnfolder$Statistics]:   existing Event has 183 ancestors and is cut-off event
[2024-03-11 23:09:34,571 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2024-03-11 23:09:34,572 INFO  L381   tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1798] threadEXIT-->L1027-13: Formula: (= v_threadThread2of4ForFork0_thidvar0_14 (let ((.cse0 (mod |v_threadThread4of4ForFork0_#t~mem8_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))))  InVars {threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_10|, threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_14}  OutVars{threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_10|, threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_14}  AuxVars[]  AssignedVars[][96], [threadThread3of4ForFork0NotInUse, 124#L1027-13true, threadThread4of4ForFork0InUse, 135#L1036-10true, threadThread1of4ForFork0NotInUse, threadThread2of4ForFork0NotInUse])
[2024-03-11 23:09:34,572 INFO  L383   tUnfolder$Statistics]: this new event has 297 ancestors and is cut-off event
[2024-03-11 23:09:34,572 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2024-03-11 23:09:34,572 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2024-03-11 23:09:34,572 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2024-03-11 23:09:34,572 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2024-03-11 23:09:34,582 INFO  L381   tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1791] threadEXIT-->L1027-13: Formula: (= (let ((.cse0 (mod |v_threadThread1of4ForFork0_#t~mem8_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread3of4ForFork0_thidvar0_10)  InVars {threadThread3of4ForFork0_thidvar0=v_threadThread3of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_12|}  OutVars{threadThread3of4ForFork0_thidvar0=v_threadThread3of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_12|}  AuxVars[]  AssignedVars[][142], [214#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread3of4ForFork0NotInUse, threadThread4of4ForFork0NotInUse, threadThread1of4ForFork0InUse, 10#L1027-13true, threadThread2of4ForFork0NotInUse])
[2024-03-11 23:09:34,582 INFO  L383   tUnfolder$Statistics]: this new event has 314 ancestors and is cut-off event
[2024-03-11 23:09:34,582 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:34,582 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:34,583 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:34,583 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:34,584 INFO  L381   tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1792] threadEXIT-->L1027-13: Formula: (= v_threadThread4of4ForFork0_thidvar0_10 (let ((.cse0 (mod |v_threadThread1of4ForFork0_#t~mem8_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))  InVars {threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_10}  OutVars{threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_10}  AuxVars[]  AssignedVars[][147], [214#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread3of4ForFork0NotInUse, threadThread4of4ForFork0NotInUse, threadThread1of4ForFork0InUse, threadThread2of4ForFork0NotInUse, 10#L1027-13true])
[2024-03-11 23:09:34,585 INFO  L383   tUnfolder$Statistics]: this new event has 314 ancestors and is cut-off event
[2024-03-11 23:09:34,585 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:34,585 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:34,585 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:34,585 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:34,586 INFO  L381   tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1793] threadEXIT-->L1027-13: Formula: (= v_threadThread1of4ForFork0_thidvar0_12 (let ((.cse0 (mod |v_threadThread2of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))  InVars {threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  OutVars{threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  AuxVars[]  AssignedVars[][255], [threadThread2of4ForFork0InUse, 214#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, 278#L1027-13true, threadThread3of4ForFork0NotInUse, threadThread4of4ForFork0NotInUse, threadThread1of4ForFork0NotInUse])
[2024-03-11 23:09:34,587 INFO  L383   tUnfolder$Statistics]: this new event has 314 ancestors and is cut-off event
[2024-03-11 23:09:34,587 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:34,587 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:34,587 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:34,587 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:34,587 INFO  L381   tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1796] threadEXIT-->L1027-13: Formula: (= (let ((.cse0 (mod |v_threadThread2of4ForFork0_#t~mem8_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_threadThread4of4ForFork0_thidvar0_12)  InVars {threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_12}  OutVars{threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_12}  AuxVars[]  AssignedVars[][148], [threadThread2of4ForFork0InUse, 214#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, 278#L1027-13true, threadThread3of4ForFork0NotInUse, threadThread4of4ForFork0NotInUse, threadThread1of4ForFork0NotInUse])
[2024-03-11 23:09:34,587 INFO  L383   tUnfolder$Statistics]: this new event has 314 ancestors and is cut-off event
[2024-03-11 23:09:34,588 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:34,588 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:34,588 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:34,588 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:34,635 INFO  L381   tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1785] threadEXIT-->L1027-13: Formula: (= (let ((.cse0 (mod |v_threadThread3of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread1of4ForFork0_thidvar0_8)  InVars {threadThread3of4ForFork0_#t~mem8=|v_threadThread3of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_8}  OutVars{threadThread3of4ForFork0_#t~mem8=|v_threadThread3of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_8}  AuxVars[]  AssignedVars[][254], [214#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread3of4ForFork0InUse, threadThread4of4ForFork0NotInUse, 233#L1027-13true, threadThread1of4ForFork0NotInUse, threadThread2of4ForFork0NotInUse])
[2024-03-11 23:09:34,635 INFO  L383   tUnfolder$Statistics]: this new event has 314 ancestors and is cut-off event
[2024-03-11 23:09:34,635 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:34,635 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:34,635 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:34,635 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:34,636 INFO  L381   tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1797] threadEXIT-->L1027-13: Formula: (= (let ((.cse0 (mod |v_threadThread4of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread1of4ForFork0_thidvar0_14)  InVars {threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_14}  OutVars{threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_14}  AuxVars[]  AssignedVars[][256], [214#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread3of4ForFork0NotInUse, 124#L1027-13true, threadThread4of4ForFork0InUse, threadThread1of4ForFork0NotInUse, threadThread2of4ForFork0NotInUse])
[2024-03-11 23:09:34,636 INFO  L383   tUnfolder$Statistics]: this new event has 314 ancestors and is cut-off event
[2024-03-11 23:09:34,637 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:34,637 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:34,637 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:34,637 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:34,637 INFO  L381   tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1790] threadEXIT-->L1027-13: Formula: (= (let ((.cse0 (mod |v_threadThread1of4ForFork0_#t~mem8_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread2of4ForFork0_thidvar0_10)  InVars {threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  OutVars{threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  AuxVars[]  AssignedVars[][95], [214#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread3of4ForFork0NotInUse, threadThread4of4ForFork0NotInUse, threadThread1of4ForFork0InUse, 10#L1027-13true, threadThread2of4ForFork0NotInUse])
[2024-03-11 23:09:34,638 INFO  L383   tUnfolder$Statistics]: this new event has 314 ancestors and is cut-off event
[2024-03-11 23:09:34,638 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:34,638 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:34,638 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:34,638 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:34,638 INFO  L381   tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1798] threadEXIT-->L1027-13: Formula: (= v_threadThread2of4ForFork0_thidvar0_14 (let ((.cse0 (mod |v_threadThread4of4ForFork0_#t~mem8_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))))  InVars {threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_10|, threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_14}  OutVars{threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_10|, threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_14}  AuxVars[]  AssignedVars[][96], [214#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread3of4ForFork0NotInUse, 124#L1027-13true, threadThread4of4ForFork0InUse, threadThread1of4ForFork0NotInUse, threadThread2of4ForFork0NotInUse])
[2024-03-11 23:09:34,639 INFO  L383   tUnfolder$Statistics]: this new event has 314 ancestors and is cut-off event
[2024-03-11 23:09:34,639 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:34,639 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:34,639 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:34,639 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2024-03-11 23:09:34,641 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1790] threadEXIT-->L1027-13: Formula: (= (let ((.cse0 (mod |v_threadThread1of4ForFork0_#t~mem8_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread2of4ForFork0_thidvar0_10)  InVars {threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  OutVars{threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  AuxVars[]  AssignedVars[][95], [threadThread3of4ForFork0InUse, threadThread4of4ForFork0InUse, 141#$Ultimate##0true, 233#L1027-13true, 135#L1036-10true, threadThread1of4ForFork0InUse, 10#L1027-13true, threadThread2of4ForFork0NotInUse])
[2024-03-11 23:09:34,642 INFO  L383   tUnfolder$Statistics]: this new event has 339 ancestors and is cut-off event
[2024-03-11 23:09:34,642 INFO  L386   tUnfolder$Statistics]:   existing Event has 225 ancestors and is cut-off event
[2024-03-11 23:09:34,642 INFO  L386   tUnfolder$Statistics]:   existing Event has 282 ancestors and is cut-off event
[2024-03-11 23:09:34,642 INFO  L386   tUnfolder$Statistics]:   existing Event has 282 ancestors and is cut-off event
[2024-03-11 23:09:34,645 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1793] threadEXIT-->L1027-13: Formula: (= v_threadThread1of4ForFork0_thidvar0_12 (let ((.cse0 (mod |v_threadThread2of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))  InVars {threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  OutVars{threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  AuxVars[]  AssignedVars[][255], [5#$Ultimate##0true, threadThread2of4ForFork0InUse, 278#L1027-13true, threadThread3of4ForFork0InUse, 124#L1027-13true, threadThread4of4ForFork0InUse, 135#L1036-10true, threadThread1of4ForFork0NotInUse])
[2024-03-11 23:09:34,645 INFO  L383   tUnfolder$Statistics]: this new event has 339 ancestors and is cut-off event
[2024-03-11 23:09:34,645 INFO  L386   tUnfolder$Statistics]:   existing Event has 282 ancestors and is cut-off event
[2024-03-11 23:09:34,645 INFO  L386   tUnfolder$Statistics]:   existing Event has 225 ancestors and is cut-off event
[2024-03-11 23:09:34,645 INFO  L386   tUnfolder$Statistics]:   existing Event has 282 ancestors and is cut-off event
[2024-03-11 23:09:34,645 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1790] threadEXIT-->L1027-13: Formula: (= (let ((.cse0 (mod |v_threadThread1of4ForFork0_#t~mem8_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread2of4ForFork0_thidvar0_10)  InVars {threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  OutVars{threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  AuxVars[]  AssignedVars[][95], [5#$Ultimate##0true, threadThread3of4ForFork0InUse, 124#L1027-13true, threadThread4of4ForFork0InUse, 135#L1036-10true, threadThread1of4ForFork0InUse, 10#L1027-13true, threadThread2of4ForFork0NotInUse])
[2024-03-11 23:09:34,645 INFO  L383   tUnfolder$Statistics]: this new event has 339 ancestors and is cut-off event
[2024-03-11 23:09:34,646 INFO  L386   tUnfolder$Statistics]:   existing Event has 282 ancestors and is cut-off event
[2024-03-11 23:09:34,646 INFO  L386   tUnfolder$Statistics]:   existing Event has 225 ancestors and is cut-off event
[2024-03-11 23:09:34,646 INFO  L386   tUnfolder$Statistics]:   existing Event has 282 ancestors and is cut-off event
[2024-03-11 23:09:34,666 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1793] threadEXIT-->L1027-13: Formula: (= v_threadThread1of4ForFork0_thidvar0_12 (let ((.cse0 (mod |v_threadThread2of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))  InVars {threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  OutVars{threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  AuxVars[]  AssignedVars[][255], [278#L1027-13true, threadThread2of4ForFork0InUse, threadThread3of4ForFork0InUse, threadThread4of4ForFork0InUse, 141#$Ultimate##0true, 233#L1027-13true, 135#L1036-10true, threadThread1of4ForFork0NotInUse])
[2024-03-11 23:09:34,667 INFO  L383   tUnfolder$Statistics]: this new event has 339 ancestors and is cut-off event
[2024-03-11 23:09:34,667 INFO  L386   tUnfolder$Statistics]:   existing Event has 282 ancestors and is cut-off event
[2024-03-11 23:09:34,667 INFO  L386   tUnfolder$Statistics]:   existing Event has 282 ancestors and is cut-off event
[2024-03-11 23:09:34,667 INFO  L386   tUnfolder$Statistics]:   existing Event has 225 ancestors and is cut-off event
[2024-03-11 23:09:34,668 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1797] threadEXIT-->L1027-13: Formula: (= (let ((.cse0 (mod |v_threadThread4of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread1of4ForFork0_thidvar0_14)  InVars {threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_14}  OutVars{threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_14}  AuxVars[]  AssignedVars[][256], [threadThread2of4ForFork0InUse, threadThread3of4ForFork0InUse, 124#L1027-13true, threadThread4of4ForFork0InUse, 233#L1027-13true, 135#L1036-10true, 127#$Ultimate##0true, threadThread1of4ForFork0NotInUse])
[2024-03-11 23:09:34,668 INFO  L383   tUnfolder$Statistics]: this new event has 339 ancestors and is cut-off event
[2024-03-11 23:09:34,668 INFO  L386   tUnfolder$Statistics]:   existing Event has 225 ancestors and is cut-off event
[2024-03-11 23:09:34,668 INFO  L386   tUnfolder$Statistics]:   existing Event has 282 ancestors and is cut-off event
[2024-03-11 23:09:34,668 INFO  L386   tUnfolder$Statistics]:   existing Event has 282 ancestors and is cut-off event
[2024-03-11 23:09:34,670 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1798] threadEXIT-->L1027-13: Formula: (= v_threadThread2of4ForFork0_thidvar0_14 (let ((.cse0 (mod |v_threadThread4of4ForFork0_#t~mem8_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))))  InVars {threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_10|, threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_14}  OutVars{threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_10|, threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_14}  AuxVars[]  AssignedVars[][96], [5#$Ultimate##0true, threadThread3of4ForFork0InUse, 124#L1027-13true, threadThread4of4ForFork0InUse, 135#L1036-10true, threadThread1of4ForFork0InUse, 10#L1027-13true, threadThread2of4ForFork0NotInUse])
[2024-03-11 23:09:34,670 INFO  L383   tUnfolder$Statistics]: this new event has 339 ancestors and is cut-off event
[2024-03-11 23:09:34,670 INFO  L386   tUnfolder$Statistics]:   existing Event has 225 ancestors and is cut-off event
[2024-03-11 23:09:34,671 INFO  L386   tUnfolder$Statistics]:   existing Event has 282 ancestors and is cut-off event
[2024-03-11 23:09:34,671 INFO  L386   tUnfolder$Statistics]:   existing Event has 282 ancestors and is cut-off event
[2024-03-11 23:09:34,671 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1797] threadEXIT-->L1027-13: Formula: (= (let ((.cse0 (mod |v_threadThread4of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread1of4ForFork0_thidvar0_14)  InVars {threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_14}  OutVars{threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_14}  AuxVars[]  AssignedVars[][256], [5#$Ultimate##0true, threadThread2of4ForFork0InUse, 278#L1027-13true, threadThread3of4ForFork0InUse, 124#L1027-13true, threadThread4of4ForFork0InUse, 135#L1036-10true, threadThread1of4ForFork0NotInUse])
[2024-03-11 23:09:34,671 INFO  L383   tUnfolder$Statistics]: this new event has 339 ancestors and is cut-off event
[2024-03-11 23:09:34,671 INFO  L386   tUnfolder$Statistics]:   existing Event has 282 ancestors and is cut-off event
[2024-03-11 23:09:34,671 INFO  L386   tUnfolder$Statistics]:   existing Event has 282 ancestors and is cut-off event
[2024-03-11 23:09:34,671 INFO  L386   tUnfolder$Statistics]:   existing Event has 225 ancestors and is cut-off event
[2024-03-11 23:09:34,716 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1793] threadEXIT-->L1027-13: Formula: (= v_threadThread1of4ForFork0_thidvar0_12 (let ((.cse0 (mod |v_threadThread2of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))  InVars {threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  OutVars{threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  AuxVars[]  AssignedVars[][255], [278#L1027-13true, threadThread2of4ForFork0InUse, 214#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread3of4ForFork0InUse, threadThread4of4ForFork0InUse, 141#$Ultimate##0true, 233#L1027-13true, threadThread1of4ForFork0NotInUse])
[2024-03-11 23:09:34,716 INFO  L383   tUnfolder$Statistics]: this new event has 356 ancestors and is cut-off event
[2024-03-11 23:09:34,716 INFO  L386   tUnfolder$Statistics]:   existing Event has 242 ancestors and is cut-off event
[2024-03-11 23:09:34,716 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2024-03-11 23:09:34,716 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2024-03-11 23:09:34,717 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1790] threadEXIT-->L1027-13: Formula: (= (let ((.cse0 (mod |v_threadThread1of4ForFork0_#t~mem8_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread2of4ForFork0_thidvar0_10)  InVars {threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  OutVars{threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  AuxVars[]  AssignedVars[][95], [214#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread3of4ForFork0InUse, threadThread4of4ForFork0InUse, 141#$Ultimate##0true, 233#L1027-13true, threadThread1of4ForFork0InUse, 10#L1027-13true, threadThread2of4ForFork0NotInUse])
[2024-03-11 23:09:34,717 INFO  L383   tUnfolder$Statistics]: this new event has 356 ancestors and is cut-off event
[2024-03-11 23:09:34,717 INFO  L386   tUnfolder$Statistics]:   existing Event has 242 ancestors and is cut-off event
[2024-03-11 23:09:34,717 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2024-03-11 23:09:34,717 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2024-03-11 23:09:34,718 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1798] threadEXIT-->L1027-13: Formula: (= v_threadThread2of4ForFork0_thidvar0_14 (let ((.cse0 (mod |v_threadThread4of4ForFork0_#t~mem8_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))))  InVars {threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_10|, threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_14}  OutVars{threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_10|, threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_14}  AuxVars[]  AssignedVars[][96], [214#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread3of4ForFork0InUse, 124#L1027-13true, 37#$Ultimate##0true, threadThread4of4ForFork0InUse, 233#L1027-13true, threadThread1of4ForFork0InUse, threadThread2of4ForFork0NotInUse])
[2024-03-11 23:09:34,718 INFO  L383   tUnfolder$Statistics]: this new event has 356 ancestors and is cut-off event
[2024-03-11 23:09:34,718 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2024-03-11 23:09:34,718 INFO  L386   tUnfolder$Statistics]:   existing Event has 242 ancestors and is cut-off event
[2024-03-11 23:09:34,718 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2024-03-11 23:09:34,719 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1796] threadEXIT-->L1027-13: Formula: (= (let ((.cse0 (mod |v_threadThread2of4ForFork0_#t~mem8_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_threadThread4of4ForFork0_thidvar0_12)  InVars {threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_12}  OutVars{threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_12}  AuxVars[]  AssignedVars[][148], [278#L1027-13true, threadThread2of4ForFork0InUse, 214#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread3of4ForFork0InUse, threadThread4of4ForFork0NotInUse, 37#$Ultimate##0true, 233#L1027-13true, threadThread1of4ForFork0InUse])
[2024-03-11 23:09:34,719 INFO  L383   tUnfolder$Statistics]: this new event has 356 ancestors and is cut-off event
[2024-03-11 23:09:34,719 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2024-03-11 23:09:34,719 INFO  L386   tUnfolder$Statistics]:   existing Event has 242 ancestors and is cut-off event
[2024-03-11 23:09:34,719 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2024-03-11 23:09:34,720 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1792] threadEXIT-->L1027-13: Formula: (= v_threadThread4of4ForFork0_thidvar0_10 (let ((.cse0 (mod |v_threadThread1of4ForFork0_#t~mem8_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))  InVars {threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_10}  OutVars{threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_10}  AuxVars[]  AssignedVars[][147], [threadThread2of4ForFork0InUse, 214#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread3of4ForFork0InUse, threadThread4of4ForFork0NotInUse, 233#L1027-13true, 127#$Ultimate##0true, threadThread1of4ForFork0InUse, 10#L1027-13true])
[2024-03-11 23:09:34,720 INFO  L383   tUnfolder$Statistics]: this new event has 356 ancestors and is cut-off event
[2024-03-11 23:09:34,720 INFO  L386   tUnfolder$Statistics]:   existing Event has 242 ancestors and is cut-off event
[2024-03-11 23:09:34,720 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2024-03-11 23:09:34,720 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2024-03-11 23:09:34,720 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1797] threadEXIT-->L1027-13: Formula: (= (let ((.cse0 (mod |v_threadThread4of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread1of4ForFork0_thidvar0_14)  InVars {threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_14}  OutVars{threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_14}  AuxVars[]  AssignedVars[][256], [threadThread2of4ForFork0InUse, 214#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread3of4ForFork0InUse, 124#L1027-13true, threadThread4of4ForFork0InUse, 233#L1027-13true, 127#$Ultimate##0true, threadThread1of4ForFork0NotInUse])
[2024-03-11 23:09:34,721 INFO  L383   tUnfolder$Statistics]: this new event has 356 ancestors and is cut-off event
[2024-03-11 23:09:34,721 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2024-03-11 23:09:34,721 INFO  L386   tUnfolder$Statistics]:   existing Event has 242 ancestors and is cut-off event
[2024-03-11 23:09:34,721 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2024-03-11 23:09:34,725 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1792] threadEXIT-->L1027-13: Formula: (= v_threadThread4of4ForFork0_thidvar0_10 (let ((.cse0 (mod |v_threadThread1of4ForFork0_#t~mem8_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))  InVars {threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_10}  OutVars{threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_10}  AuxVars[]  AssignedVars[][147], [5#$Ultimate##0true, 278#L1027-13true, threadThread2of4ForFork0InUse, 214#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread3of4ForFork0InUse, threadThread4of4ForFork0NotInUse, threadThread1of4ForFork0InUse, 10#L1027-13true])
[2024-03-11 23:09:34,725 INFO  L383   tUnfolder$Statistics]: this new event has 356 ancestors and is cut-off event
[2024-03-11 23:09:34,725 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2024-03-11 23:09:34,725 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2024-03-11 23:09:34,725 INFO  L386   tUnfolder$Statistics]:   existing Event has 242 ancestors and is cut-off event
[2024-03-11 23:09:34,725 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1798] threadEXIT-->L1027-13: Formula: (= v_threadThread2of4ForFork0_thidvar0_14 (let ((.cse0 (mod |v_threadThread4of4ForFork0_#t~mem8_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))))  InVars {threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_10|, threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_14}  OutVars{threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_10|, threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_14}  AuxVars[]  AssignedVars[][96], [5#$Ultimate##0true, 214#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread3of4ForFork0InUse, 124#L1027-13true, threadThread4of4ForFork0InUse, threadThread1of4ForFork0InUse, 10#L1027-13true, threadThread2of4ForFork0NotInUse])
[2024-03-11 23:09:34,726 INFO  L383   tUnfolder$Statistics]: this new event has 356 ancestors and is cut-off event
[2024-03-11 23:09:34,726 INFO  L386   tUnfolder$Statistics]:   existing Event has 242 ancestors and is cut-off event
[2024-03-11 23:09:34,726 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2024-03-11 23:09:34,726 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2024-03-11 23:09:34,726 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1793] threadEXIT-->L1027-13: Formula: (= v_threadThread1of4ForFork0_thidvar0_12 (let ((.cse0 (mod |v_threadThread2of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))  InVars {threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  OutVars{threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  AuxVars[]  AssignedVars[][255], [5#$Ultimate##0true, 278#L1027-13true, threadThread2of4ForFork0InUse, 214#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread3of4ForFork0InUse, 124#L1027-13true, threadThread4of4ForFork0InUse, threadThread1of4ForFork0NotInUse])
[2024-03-11 23:09:34,726 INFO  L383   tUnfolder$Statistics]: this new event has 356 ancestors and is cut-off event
[2024-03-11 23:09:34,726 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2024-03-11 23:09:34,726 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2024-03-11 23:09:34,726 INFO  L386   tUnfolder$Statistics]:   existing Event has 242 ancestors and is cut-off event
[2024-03-11 23:09:34,727 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1796] threadEXIT-->L1027-13: Formula: (= (let ((.cse0 (mod |v_threadThread2of4ForFork0_#t~mem8_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_threadThread4of4ForFork0_thidvar0_12)  InVars {threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_12}  OutVars{threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_12}  AuxVars[]  AssignedVars[][148], [5#$Ultimate##0true, threadThread2of4ForFork0InUse, 214#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, 278#L1027-13true, threadThread3of4ForFork0InUse, threadThread4of4ForFork0NotInUse, threadThread1of4ForFork0InUse, 10#L1027-13true])
[2024-03-11 23:09:34,727 INFO  L383   tUnfolder$Statistics]: this new event has 356 ancestors and is cut-off event
[2024-03-11 23:09:34,727 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2024-03-11 23:09:34,727 INFO  L386   tUnfolder$Statistics]:   existing Event has 242 ancestors and is cut-off event
[2024-03-11 23:09:34,727 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2024-03-11 23:09:34,727 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1790] threadEXIT-->L1027-13: Formula: (= (let ((.cse0 (mod |v_threadThread1of4ForFork0_#t~mem8_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread2of4ForFork0_thidvar0_10)  InVars {threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  OutVars{threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  AuxVars[]  AssignedVars[][95], [5#$Ultimate##0true, 214#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread3of4ForFork0InUse, 124#L1027-13true, threadThread4of4ForFork0InUse, threadThread1of4ForFork0InUse, 10#L1027-13true, threadThread2of4ForFork0NotInUse])
[2024-03-11 23:09:34,728 INFO  L383   tUnfolder$Statistics]: this new event has 356 ancestors and is cut-off event
[2024-03-11 23:09:34,728 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2024-03-11 23:09:34,728 INFO  L386   tUnfolder$Statistics]:   existing Event has 242 ancestors and is cut-off event
[2024-03-11 23:09:34,728 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2024-03-11 23:09:34,728 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1797] threadEXIT-->L1027-13: Formula: (= (let ((.cse0 (mod |v_threadThread4of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread1of4ForFork0_thidvar0_14)  InVars {threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_14}  OutVars{threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_14}  AuxVars[]  AssignedVars[][256], [5#$Ultimate##0true, 278#L1027-13true, threadThread2of4ForFork0InUse, 214#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread3of4ForFork0InUse, 124#L1027-13true, threadThread4of4ForFork0InUse, threadThread1of4ForFork0NotInUse])
[2024-03-11 23:09:34,728 INFO  L383   tUnfolder$Statistics]: this new event has 356 ancestors and is cut-off event
[2024-03-11 23:09:34,728 INFO  L386   tUnfolder$Statistics]:   existing Event has 242 ancestors and is cut-off event
[2024-03-11 23:09:34,728 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2024-03-11 23:09:34,728 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2024-03-11 23:09:34,777 INFO  L130       PetriNetUnfolder]: 909/6311 cut-off events.
[2024-03-11 23:09:34,777 INFO  L131       PetriNetUnfolder]: For 851/857 co-relation queries the response was YES.
[2024-03-11 23:09:34,854 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7193 conditions, 6311 events. 909/6311 cut-off events. For 851/857 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 53309 event pairs, 20 based on Foata normal form. 0/5167 useless extension candidates. Maximal degree in co-relation 2099. Up to 186 conditions per place. 
[2024-03-11 23:09:35,066 INFO  L119        LiptonReduction]: Number of co-enabled transitions 50264
[2024-03-11 23:09:40,291 INFO  L134        LiptonReduction]: Checked pairs total: 354475
[2024-03-11 23:09:40,291 INFO  L136        LiptonReduction]: Total number of compositions: 194
[2024-03-11 23:09:40,292 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-11 23:09:40,292 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;@21a18a5e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2024-03-11 23:09:40,292 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 31 error locations.
[2024-03-11 23:09:40,293 INFO  L130       PetriNetUnfolder]: 0/0 cut-off events.
[2024-03-11 23:09:40,293 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2024-03-11 23:09:40,293 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 23:09:40,293 INFO  L209   CegarLoopForPetriNet]: trace histogram [1]
[2024-03-11 23:09:40,293 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 28 more)] ===
[2024-03-11 23:09:40,293 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 23:09:40,294 INFO  L85        PathProgramCache]: Analyzing trace with hash 2019, now seen corresponding path program 1 times
[2024-03-11 23:09:40,294 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 23:09:40,294 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91910949]
[2024-03-11 23:09:40,294 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:09:40,294 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 23:09:40,297 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 23:09:40,298 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 23:09:40,298 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 23:09:40,299 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91910949]
[2024-03-11 23:09:40,299 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91910949] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 23:09:40,299 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 23:09:40,299 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0
[2024-03-11 23:09:40,299 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062594038]
[2024-03-11 23:09:40,299 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 23:09:40,299 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-03-11 23:09:40,299 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 23:09:40,300 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-03-11 23:09:40,300 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-03-11 23:09:40,300 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 313 out of 547
[2024-03-11 23:09:40,301 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 167 transitions, 414 flow. Second operand  has 2 states, 2 states have (on average 313.5) internal successors, (627), 2 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:09:40,301 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 23:09:40,301 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 547
[2024-03-11 23:09:40,301 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 23:10:22,884 INFO  L130       PetriNetUnfolder]: 267074/516780 cut-off events.
[2024-03-11 23:10:22,884 INFO  L131       PetriNetUnfolder]: For 51546/104579 co-relation queries the response was YES.
[2024-03-11 23:10:24,185 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 888149 conditions, 516780 events. 267074/516780 cut-off events. For 51546/104579 co-relation queries the response was YES. Maximal size of possible extension queue 9497. Compared 6353724 event pairs, 204304 based on Foata normal form. 0/433724 useless extension candidates. Maximal degree in co-relation 746515. Up to 345094 conditions per place. 
[2024-03-11 23:10:26,708 INFO  L137   encePairwiseOnDemand]: 542/547 looper letters, 66 selfloop transitions, 0 changer transitions 0/162 dead transitions.
[2024-03-11 23:10:26,709 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 162 transitions, 536 flow
[2024-03-11 23:10:26,709 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-03-11 23:10:26,710 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2024-03-11 23:10:26,710 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 697 transitions.
[2024-03-11 23:10:26,711 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6371115173674589
[2024-03-11 23:10:26,711 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 697 transitions.
[2024-03-11 23:10:26,711 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 697 transitions.
[2024-03-11 23:10:26,711 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 23:10:26,711 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 697 transitions.
[2024-03-11 23:10:26,712 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 348.5) internal successors, (697), 2 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:10:26,713 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 547.0) internal successors, (1641), 3 states have internal predecessors, (1641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:10:26,714 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 547.0) internal successors, (1641), 3 states have internal predecessors, (1641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:10:26,714 INFO  L175             Difference]: Start difference. First operand has 157 places, 167 transitions, 414 flow. Second operand 2 states and 697 transitions.
[2024-03-11 23:10:26,714 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 162 transitions, 536 flow
[2024-03-11 23:10:26,761 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 162 transitions, 536 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-11 23:10:26,762 INFO  L231             Difference]: Finished difference. Result has 153 places, 162 transitions, 404 flow
[2024-03-11 23:10:26,762 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=404, PETRI_PLACES=153, PETRI_TRANSITIONS=162}
[2024-03-11 23:10:26,763 INFO  L288   CegarLoopForPetriNet]: 157 programPoint places, -4 predicate places.
[2024-03-11 23:10:26,763 INFO  L495      AbstractCegarLoop]: Abstraction has has 153 places, 162 transitions, 404 flow
[2024-03-11 23:10:26,763 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 313.5) internal successors, (627), 2 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:10:26,763 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 23:10:26,764 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-03-11 23:10:26,764 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2024-03-11 23:10:26,764 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 28 more)] ===
[2024-03-11 23:10:26,764 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 23:10:26,764 INFO  L85        PathProgramCache]: Analyzing trace with hash -325286040, now seen corresponding path program 1 times
[2024-03-11 23:10:26,764 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 23:10:26,764 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960546279]
[2024-03-11 23:10:26,765 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:10:26,765 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 23:10:26,778 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 23:10:26,875 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 23:10:26,875 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 23:10:26,876 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960546279]
[2024-03-11 23:10:26,876 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960546279] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 23:10:26,876 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 23:10:26,876 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-11 23:10:26,876 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776639137]
[2024-03-11 23:10:26,876 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 23:10:26,876 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-11 23:10:26,877 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 23:10:26,877 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-11 23:10:26,877 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-11 23:10:27,681 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 259 out of 547
[2024-03-11 23:10:27,683 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 162 transitions, 404 flow. Second operand  has 6 states, 6 states have (on average 260.0) internal successors, (1560), 6 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:10:27,683 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 23:10:27,683 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 259 of 547
[2024-03-11 23:10:27,683 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
