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


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


Checking for data races
Using default analysis
Version 2329fc70
Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data -tc /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/AutomizerReach.xml -i /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/thread-join-counter-outer-race-4.i -s /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5c4d9327c15cdd6f8cbe544af68182476337b21d5bfe21353a45ea7b3e2e4c4c
--- Real Ultimate output ---
This is Ultimate 0.2.2-dev-2329fc7
[2023-10-26 09:06:27,369 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2023-10-26 09:06:27,371 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2023-10-26 09:06:27,418 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2023-10-26 09:06:27,419 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2023-10-26 09:06:27,421 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2023-10-26 09:06:27,423 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2023-10-26 09:06:27,424 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2023-10-26 09:06:27,426 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2023-10-26 09:06:27,439 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2023-10-26 09:06:27,439 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2023-10-26 09:06:27,440 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2023-10-26 09:06:27,440 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2023-10-26 09:06:27,441 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2023-10-26 09:06:27,442 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2023-10-26 09:06:27,443 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2023-10-26 09:06:27,443 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2023-10-26 09:06:27,444 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2023-10-26 09:06:27,445 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2023-10-26 09:06:27,446 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2023-10-26 09:06:27,447 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2023-10-26 09:06:27,448 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2023-10-26 09:06:27,449 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2023-10-26 09:06:27,449 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2023-10-26 09:06:27,452 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2023-10-26 09:06:27,462 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2023-10-26 09:06:27,462 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2023-10-26 09:06:27,463 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2023-10-26 09:06:27,464 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2023-10-26 09:06:27,468 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2023-10-26 09:06:27,469 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2023-10-26 09:06:27,469 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2023-10-26 09:06:27,486 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2023-10-26 09:06:27,486 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2023-10-26 09:06:27,487 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2023-10-26 09:06:27,487 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2023-10-26 09:06:27,488 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2023-10-26 09:06:27,488 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2023-10-26 09:06:27,488 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2023-10-26 09:06:27,489 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2023-10-26 09:06:27,490 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2023-10-26 09:06:27,490 INFO  L101        SettingsManager]: Beginning loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2023-10-26 09:06:27,531 INFO  L113        SettingsManager]: Loading preferences was successful
[2023-10-26 09:06:27,532 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2023-10-26 09:06:27,532 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-10-26 09:06:27,532 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-10-26 09:06:27,533 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-10-26 09:06:27,533 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-10-26 09:06:27,534 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-10-26 09:06:27,534 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2023-10-26 09:06:27,534 INFO  L138        SettingsManager]:  * Use SBE=true
[2023-10-26 09:06:27,534 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-10-26 09:06:27,535 INFO  L138        SettingsManager]:  * sizeof long=4
[2023-10-26 09:06:27,535 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2023-10-26 09:06:27,535 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2023-10-26 09:06:27,535 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2023-10-26 09:06:27,535 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2023-10-26 09:06:27,536 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2023-10-26 09:06:27,536 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-10-26 09:06:27,536 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2023-10-26 09:06:27,536 INFO  L138        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2023-10-26 09:06:27,536 INFO  L138        SettingsManager]:  * sizeof long double=12
[2023-10-26 09:06:27,536 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2023-10-26 09:06:27,536 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2023-10-26 09:06:27,537 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2023-10-26 09:06:27,537 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-10-26 09:06:27,537 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2023-10-26 09:06:27,537 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2023-10-26 09:06:27,537 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-10-26 09:06:27,537 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-10-26 09:06:27,538 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2023-10-26 09:06:27,538 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2023-10-26 09:06:27,538 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2023-10-26 09:06:27,538 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-10-26 09:06:27,539 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2023-10-26 09:06:27,539 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-10-26 09:06:27,539 INFO  L138        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2023-10-26 09:06:27,539 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2023-10-26 09:06:27,539 INFO  L138        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2023-10-26 09:06:27,540 INFO  L138        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) )


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5c4d9327c15cdd6f8cbe544af68182476337b21d5bfe21353a45ea7b3e2e4c4c
[2023-10-26 09:06:27,929 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2023-10-26 09:06:27,963 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-10-26 09:06:27,965 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-10-26 09:06:27,966 INFO  L271        PluginConnector]: Initializing CDTParser...
[2023-10-26 09:06:27,966 INFO  L275        PluginConnector]: CDTParser initialized
[2023-10-26 09:06:27,967 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/thread-join-counter-outer-race-4.i
[2023-10-26 09:06:29,666 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2023-10-26 09:06:30,043 INFO  L351              CDTParser]: Found 1 translation units.
[2023-10-26 09:06:30,052 INFO  L172              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/thread-join-counter-outer-race-4.i
[2023-10-26 09:06:30,066 INFO  L394              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/4fbc8b2c1/bdc7a8bb836c4560b08c395d84509663/FLAG43e41874e
[2023-10-26 09:06:30,101 INFO  L402              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/4fbc8b2c1/bdc7a8bb836c4560b08c395d84509663
[2023-10-26 09:06:30,103 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-10-26 09:06:30,106 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2023-10-26 09:06:30,107 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-10-26 09:06:30,107 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-10-26 09:06:30,110 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2023-10-26 09:06:30,112 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 09:06:30" (1/1) ...
[2023-10-26 09:06:30,116 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22f9eb97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:06:30, skipping insertion in model container
[2023-10-26 09:06:30,121 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 09:06:30" (1/1) ...
[2023-10-26 09:06:30,129 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2023-10-26 09:06:30,194 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2023-10-26 09:06:30,650 WARN  L623        FunctionHandler]: Unknown extern function pthread_detach
[2023-10-26 09:06:30,658 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-10-26 09:06:30,686 INFO  L203         MainTranslator]: Completed pre-run
[2023-10-26 09:06:30,776 WARN  L623        FunctionHandler]: Unknown extern function pthread_detach
[2023-10-26 09:06:30,783 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-10-26 09:06:30,825 INFO  L208         MainTranslator]: Completed translation
[2023-10-26 09:06:30,826 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:06:30 WrapperNode
[2023-10-26 09:06:30,826 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-10-26 09:06:30,827 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-10-26 09:06:30,841 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-10-26 09:06:30,841 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2023-10-26 09:06:30,847 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:06:30" (1/1) ...
[2023-10-26 09:06:30,889 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:06:30" (1/1) ...
[2023-10-26 09:06:30,922 INFO  L138                Inliner]: procedures = 159, calls = 37, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 95
[2023-10-26 09:06:30,922 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-10-26 09:06:30,923 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-10-26 09:06:30,923 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2023-10-26 09:06:30,923 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2023-10-26 09:06:30,930 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:06:30" (1/1) ...
[2023-10-26 09:06:30,935 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:06:30" (1/1) ...
[2023-10-26 09:06:30,946 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:06:30" (1/1) ...
[2023-10-26 09:06:30,950 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:06:30" (1/1) ...
[2023-10-26 09:06:30,958 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:06:30" (1/1) ...
[2023-10-26 09:06:30,966 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:06:30" (1/1) ...
[2023-10-26 09:06:30,973 INFO  L185        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:06:30" (1/1) ...
[2023-10-26 09:06:30,977 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:06:30" (1/1) ...
[2023-10-26 09:06:30,981 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-10-26 09:06:30,982 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-10-26 09:06:30,989 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2023-10-26 09:06:30,989 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2023-10-26 09:06:30,990 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:06:30" (1/1) ...
[2023-10-26 09:06:30,998 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-10-26 09:06:31,012 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 09:06:31,024 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2023-10-26 09:06:31,064 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2023-10-26 09:06:31,069 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2023-10-26 09:06:31,069 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2023-10-26 09:06:31,073 INFO  L130     BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock
[2023-10-26 09:06:31,079 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2023-10-26 09:06:31,080 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2023-10-26 09:06:31,080 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-10-26 09:06:31,080 INFO  L130     BoogieDeclarations]: Found specification of procedure pthread_detach
[2023-10-26 09:06:31,080 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2023-10-26 09:06:31,081 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2023-10-26 09:06:31,081 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2023-10-26 09:06:31,081 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-10-26 09:06:31,081 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-10-26 09:06:31,082 WARN  L209             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2023-10-26 09:06:31,304 INFO  L235             CfgBuilder]: Building ICFG
[2023-10-26 09:06:31,306 INFO  L261             CfgBuilder]: Building CFG for each procedure with an implementation
[2023-10-26 09:06:31,650 INFO  L276             CfgBuilder]: Performing block encoding
[2023-10-26 09:06:31,667 INFO  L295             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-10-26 09:06:31,668 INFO  L300             CfgBuilder]: Removed 2 assume(true) statements.
[2023-10-26 09:06:31,670 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:06:31 BoogieIcfgContainer
[2023-10-26 09:06:31,671 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-10-26 09:06:31,672 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-10-26 09:06:31,675 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2023-10-26 09:06:31,682 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2023-10-26 09:06:31,697 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 09:06:30" (1/3) ...
[2023-10-26 09:06:31,699 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@232fecc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 09:06:31, skipping insertion in model container
[2023-10-26 09:06:31,699 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:06:30" (2/3) ...
[2023-10-26 09:06:31,699 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@232fecc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 09:06:31, skipping insertion in model container
[2023-10-26 09:06:31,699 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:06:31" (3/3) ...
[2023-10-26 09:06:31,701 INFO  L112   eAbstractionObserver]: Analyzing ICFG thread-join-counter-outer-race-4.i
[2023-10-26 09:06:31,708 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2023-10-26 09:06:31,715 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-10-26 09:06:31,725 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations.
[2023-10-26 09:06:31,725 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2023-10-26 09:06:31,803 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2023-10-26 09:06:31,871 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 133 places, 134 transitions, 273 flow
[2023-10-26 09:06:32,009 INFO  L130       PetriNetUnfolder]: 7/174 cut-off events.
[2023-10-26 09:06:32,009 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-26 09:06:32,014 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 179 conditions, 174 events. 7/174 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 210 event pairs, 0 based on Foata normal form. 0/153 useless extension candidates. Maximal degree in co-relation 88. Up to 4 conditions per place. 
[2023-10-26 09:06:32,015 INFO  L82        GeneralOperation]: Start removeDead. Operand has 133 places, 134 transitions, 273 flow
[2023-10-26 09:06:32,030 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 133 places, 134 transitions, 273 flow
[2023-10-26 09:06:32,033 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-10-26 09:06:32,049 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 134 transitions, 273 flow
[2023-10-26 09:06:32,056 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 134 transitions, 273 flow
[2023-10-26 09:06:32,057 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 133 places, 134 transitions, 273 flow
[2023-10-26 09:06:32,132 INFO  L130       PetriNetUnfolder]: 7/174 cut-off events.
[2023-10-26 09:06:32,138 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-26 09:06:32,155 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 179 conditions, 174 events. 7/174 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 210 event pairs, 0 based on Foata normal form. 0/153 useless extension candidates. Maximal degree in co-relation 88. Up to 4 conditions per place. 
[2023-10-26 09:06:32,157 INFO  L119        LiptonReduction]: Number of co-enabled transitions 3068
[2023-10-26 09:06:36,343 INFO  L134        LiptonReduction]: Checked pairs total: 11184
[2023-10-26 09:06:36,343 INFO  L136        LiptonReduction]: Total number of compositions: 98
[2023-10-26 09:06:36,385 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-10-26 09:06:36,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;@4cc6d504, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-10-26 09:06:36,391 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 12 error locations.
[2023-10-26 09:06:36,395 INFO  L130       PetriNetUnfolder]: 0/6 cut-off events.
[2023-10-26 09:06:36,400 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-26 09:06:36,400 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 09:06:36,400 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1]
[2023-10-26 09:06:36,401 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 9 more)] ===
[2023-10-26 09:06:36,405 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 09:06:36,420 INFO  L85        PathProgramCache]: Analyzing trace with hash 13631503, now seen corresponding path program 1 times
[2023-10-26 09:06:36,428 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 09:06:36,428 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244739225]
[2023-10-26 09:06:36,428 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 09:06:36,429 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 09:06:36,604 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 09:06:36,762 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 09:06:36,763 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 09:06:36,763 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244739225]
[2023-10-26 09:06:36,764 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244739225] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 09:06:36,764 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 09:06:36,764 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-26 09:06:36,765 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862104283]
[2023-10-26 09:06:36,771 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 09:06:36,777 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-26 09:06:36,793 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 09:06:36,811 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-26 09:06:36,822 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-26 09:06:36,863 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 119 out of 232
[2023-10-26 09:06:36,866 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 44 transitions, 93 flow. Second operand  has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:06:36,867 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 09:06:36,867 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 232
[2023-10-26 09:06:36,867 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 09:06:37,042 INFO  L130       PetriNetUnfolder]: 134/429 cut-off events.
[2023-10-26 09:06:37,042 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-26 09:06:37,045 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 743 conditions, 429 events. 134/429 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2288 event pairs, 50 based on Foata normal form. 0/387 useless extension candidates. Maximal degree in co-relation 689. Up to 159 conditions per place. 
[2023-10-26 09:06:37,049 INFO  L137   encePairwiseOnDemand]: 219/232 looper letters, 39 selfloop transitions, 8 changer transitions 0/63 dead transitions.
[2023-10-26 09:06:37,049 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 63 transitions, 225 flow
[2023-10-26 09:06:37,050 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-26 09:06:37,052 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-26 09:06:37,066 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 411 transitions.
[2023-10-26 09:06:37,072 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5905172413793104
[2023-10-26 09:06:37,072 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 411 transitions.
[2023-10-26 09:06:37,073 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 411 transitions.
[2023-10-26 09:06:37,091 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 09:06:37,094 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 411 transitions.
[2023-10-26 09:06:37,098 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:06:37,104 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:06:37,105 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:06:37,106 INFO  L175             Difference]: Start difference. First operand has 45 places, 44 transitions, 93 flow. Second operand 3 states and 411 transitions.
[2023-10-26 09:06:37,107 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 63 transitions, 225 flow
[2023-10-26 09:06:37,114 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 63 transitions, 225 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-26 09:06:37,117 INFO  L231             Difference]: Finished difference. Result has 48 places, 50 transitions, 159 flow
[2023-10-26 09:06:37,123 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=159, PETRI_PLACES=48, PETRI_TRANSITIONS=50}
[2023-10-26 09:06:37,126 INFO  L288   CegarLoopForPetriNet]: 45 programPoint places, 3 predicate places.
[2023-10-26 09:06:37,141 INFO  L495      AbstractCegarLoop]: Abstraction has has 48 places, 50 transitions, 159 flow
[2023-10-26 09:06:37,142 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:06:37,142 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 09:06:37,142 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 09:06:37,143 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-10-26 09:06:37,143 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 9 more)] ===
[2023-10-26 09:06:37,144 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 09:06:37,145 INFO  L85        PathProgramCache]: Analyzing trace with hash 750408184, now seen corresponding path program 1 times
[2023-10-26 09:06:37,147 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 09:06:37,147 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590316787]
[2023-10-26 09:06:37,147 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 09:06:37,148 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 09:06:37,178 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 09:06:37,248 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 09:06:37,249 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 09:06:37,250 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590316787]
[2023-10-26 09:06:37,250 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590316787] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 09:06:37,250 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 09:06:37,250 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-26 09:06:37,250 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309421335]
[2023-10-26 09:06:37,251 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 09:06:37,252 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-26 09:06:37,252 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 09:06:37,252 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-26 09:06:37,252 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-26 09:06:37,268 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 126 out of 232
[2023-10-26 09:06:37,270 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 50 transitions, 159 flow. Second operand  has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:06:37,271 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 09:06:37,271 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 232
[2023-10-26 09:06:37,271 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 09:06:37,405 INFO  L130       PetriNetUnfolder]: 121/425 cut-off events.
[2023-10-26 09:06:37,406 INFO  L131       PetriNetUnfolder]: For 122/125 co-relation queries the response was YES.
[2023-10-26 09:06:37,406 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 863 conditions, 425 events. 121/425 cut-off events. For 122/125 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2388 event pairs, 64 based on Foata normal form. 0/391 useless extension candidates. Maximal degree in co-relation 802. Up to 205 conditions per place. 
[2023-10-26 09:06:37,409 INFO  L137   encePairwiseOnDemand]: 228/232 looper letters, 28 selfloop transitions, 3 changer transitions 2/59 dead transitions.
[2023-10-26 09:06:37,409 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 59 transitions, 249 flow
[2023-10-26 09:06:37,409 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-26 09:06:37,409 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-26 09:06:37,415 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 409 transitions.
[2023-10-26 09:06:37,415 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5876436781609196
[2023-10-26 09:06:37,415 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 409 transitions.
[2023-10-26 09:06:37,415 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 409 transitions.
[2023-10-26 09:06:37,416 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 09:06:37,416 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 409 transitions.
[2023-10-26 09:06:37,417 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:06:37,419 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:06:37,422 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:06:37,422 INFO  L175             Difference]: Start difference. First operand has 48 places, 50 transitions, 159 flow. Second operand 3 states and 409 transitions.
[2023-10-26 09:06:37,423 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 59 transitions, 249 flow
[2023-10-26 09:06:37,433 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 59 transitions, 231 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-26 09:06:37,434 INFO  L231             Difference]: Finished difference. Result has 50 places, 52 transitions, 165 flow
[2023-10-26 09:06:37,435 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=165, PETRI_PLACES=50, PETRI_TRANSITIONS=52}
[2023-10-26 09:06:37,435 INFO  L288   CegarLoopForPetriNet]: 45 programPoint places, 5 predicate places.
[2023-10-26 09:06:37,435 INFO  L495      AbstractCegarLoop]: Abstraction has has 50 places, 52 transitions, 165 flow
[2023-10-26 09:06:37,436 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:06:37,436 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 09:06:37,436 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 09:06:37,436 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-10-26 09:06:37,437 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 9 more)] ===
[2023-10-26 09:06:37,437 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 09:06:37,437 INFO  L85        PathProgramCache]: Analyzing trace with hash 439345902, now seen corresponding path program 1 times
[2023-10-26 09:06:37,437 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 09:06:37,437 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690844853]
[2023-10-26 09:06:37,438 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 09:06:37,438 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 09:06:37,472 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 09:06:37,518 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 09:06:37,518 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 09:06:37,518 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690844853]
[2023-10-26 09:06:37,519 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690844853] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 09:06:37,519 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 09:06:37,520 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-26 09:06:37,520 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885521642]
[2023-10-26 09:06:37,521 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 09:06:37,521 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-26 09:06:37,521 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 09:06:37,522 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-26 09:06:37,523 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-26 09:06:37,567 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 120 out of 232
[2023-10-26 09:06:37,567 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 52 transitions, 165 flow. Second operand  has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:06:37,567 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 09:06:37,568 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 232
[2023-10-26 09:06:37,569 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 09:06:37,667 INFO  L130       PetriNetUnfolder]: 120/423 cut-off events.
[2023-10-26 09:06:37,672 INFO  L131       PetriNetUnfolder]: For 82/87 co-relation queries the response was YES.
[2023-10-26 09:06:37,673 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 866 conditions, 423 events. 120/423 cut-off events. For 82/87 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2366 event pairs, 71 based on Foata normal form. 4/390 useless extension candidates. Maximal degree in co-relation 804. Up to 238 conditions per place. 
[2023-10-26 09:06:37,674 INFO  L137   encePairwiseOnDemand]: 226/232 looper letters, 30 selfloop transitions, 7 changer transitions 0/62 dead transitions.
[2023-10-26 09:06:37,675 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 62 transitions, 267 flow
[2023-10-26 09:06:37,675 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-26 09:06:37,675 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-26 09:06:37,676 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 391 transitions.
[2023-10-26 09:06:37,676 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5617816091954023
[2023-10-26 09:06:37,689 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 391 transitions.
[2023-10-26 09:06:37,689 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 391 transitions.
[2023-10-26 09:06:37,690 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 09:06:37,690 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 391 transitions.
[2023-10-26 09:06:37,691 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:06:37,692 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:06:37,692 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:06:37,692 INFO  L175             Difference]: Start difference. First operand has 50 places, 52 transitions, 165 flow. Second operand 3 states and 391 transitions.
[2023-10-26 09:06:37,692 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 62 transitions, 267 flow
[2023-10-26 09:06:37,695 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 62 transitions, 261 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-26 09:06:37,696 INFO  L231             Difference]: Finished difference. Result has 52 places, 57 transitions, 215 flow
[2023-10-26 09:06:37,696 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=215, PETRI_PLACES=52, PETRI_TRANSITIONS=57}
[2023-10-26 09:06:37,697 INFO  L288   CegarLoopForPetriNet]: 45 programPoint places, 7 predicate places.
[2023-10-26 09:06:37,699 INFO  L495      AbstractCegarLoop]: Abstraction has has 52 places, 57 transitions, 215 flow
[2023-10-26 09:06:37,700 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:06:37,700 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 09:06:37,700 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 09:06:37,700 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-10-26 09:06:37,701 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 9 more)] ===
[2023-10-26 09:06:37,701 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 09:06:37,701 INFO  L85        PathProgramCache]: Analyzing trace with hash 969654521, now seen corresponding path program 1 times
[2023-10-26 09:06:37,702 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 09:06:37,702 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967209298]
[2023-10-26 09:06:37,702 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 09:06:37,702 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 09:06:37,732 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 09:06:37,780 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 09:06:37,780 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 09:06:37,780 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967209298]
[2023-10-26 09:06:37,781 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967209298] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 09:06:37,781 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 09:06:37,781 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-26 09:06:37,781 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820234410]
[2023-10-26 09:06:37,782 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 09:06:37,782 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-26 09:06:37,786 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 09:06:37,787 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-26 09:06:37,788 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-26 09:06:37,803 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 124 out of 232
[2023-10-26 09:06:37,803 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 57 transitions, 215 flow. Second operand  has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:06:37,803 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 09:06:37,804 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 232
[2023-10-26 09:06:37,804 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 09:06:37,919 INFO  L130       PetriNetUnfolder]: 117/389 cut-off events.
[2023-10-26 09:06:37,922 INFO  L131       PetriNetUnfolder]: For 191/207 co-relation queries the response was YES.
[2023-10-26 09:06:37,922 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 901 conditions, 389 events. 117/389 cut-off events. For 191/207 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2115 event pairs, 67 based on Foata normal form. 5/358 useless extension candidates. Maximal degree in co-relation 834. Up to 236 conditions per place. 
[2023-10-26 09:06:37,923 INFO  L137   encePairwiseOnDemand]: 228/232 looper letters, 36 selfloop transitions, 4 changer transitions 0/68 dead transitions.
[2023-10-26 09:06:37,923 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 68 transitions, 327 flow
[2023-10-26 09:06:37,924 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-26 09:06:37,924 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-26 09:06:37,925 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 404 transitions.
[2023-10-26 09:06:37,925 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5804597701149425
[2023-10-26 09:06:37,925 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 404 transitions.
[2023-10-26 09:06:37,925 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 404 transitions.
[2023-10-26 09:06:37,928 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 09:06:37,928 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 404 transitions.
[2023-10-26 09:06:37,929 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:06:37,930 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:06:37,931 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:06:37,931 INFO  L175             Difference]: Start difference. First operand has 52 places, 57 transitions, 215 flow. Second operand 3 states and 404 transitions.
[2023-10-26 09:06:37,931 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 68 transitions, 327 flow
[2023-10-26 09:06:37,934 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 68 transitions, 311 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-26 09:06:37,935 INFO  L231             Difference]: Finished difference. Result has 53 places, 59 transitions, 225 flow
[2023-10-26 09:06:37,935 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=225, PETRI_PLACES=53, PETRI_TRANSITIONS=59}
[2023-10-26 09:06:37,937 INFO  L288   CegarLoopForPetriNet]: 45 programPoint places, 8 predicate places.
[2023-10-26 09:06:37,937 INFO  L495      AbstractCegarLoop]: Abstraction has has 53 places, 59 transitions, 225 flow
[2023-10-26 09:06:37,937 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:06:37,951 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 09:06:37,951 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1]
[2023-10-26 09:06:37,951 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2023-10-26 09:06:37,952 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 9 more)] ===
[2023-10-26 09:06:37,952 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 09:06:37,952 INFO  L85        PathProgramCache]: Analyzing trace with hash 598293283, now seen corresponding path program 1 times
[2023-10-26 09:06:37,952 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 09:06:37,952 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735474160]
[2023-10-26 09:06:37,952 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 09:06:37,953 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 09:06:38,079 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-26 09:06:38,080 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-10-26 09:06:38,096 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-26 09:06:38,161 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-10-26 09:06:38,161 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-10-26 09:06:38,162 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 12 remaining)
[2023-10-26 09:06:38,165 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (10 of 12 remaining)
[2023-10-26 09:06:38,166 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (9 of 12 remaining)
[2023-10-26 09:06:38,166 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (8 of 12 remaining)
[2023-10-26 09:06:38,166 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (7 of 12 remaining)
[2023-10-26 09:06:38,166 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 12 remaining)
[2023-10-26 09:06:38,166 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 12 remaining)
[2023-10-26 09:06:38,167 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 12 remaining)
[2023-10-26 09:06:38,167 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (3 of 12 remaining)
[2023-10-26 09:06:38,167 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 12 remaining)
[2023-10-26 09:06:38,167 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 12 remaining)
[2023-10-26 09:06:38,167 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (0 of 12 remaining)
[2023-10-26 09:06:38,167 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2023-10-26 09:06:38,168 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1]
[2023-10-26 09:06:38,171 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-10-26 09:06:38,171 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2023-10-26 09:06:38,209 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2023-10-26 09:06:38,213 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 162 places, 161 transitions, 334 flow
[2023-10-26 09:06:38,263 INFO  L130       PetriNetUnfolder]: 10/259 cut-off events.
[2023-10-26 09:06:38,263 INFO  L131       PetriNetUnfolder]: For 2/2 co-relation queries the response was YES.
[2023-10-26 09:06:38,264 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 269 conditions, 259 events. 10/259 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 351 event pairs, 0 based on Foata normal form. 0/226 useless extension candidates. Maximal degree in co-relation 175. Up to 6 conditions per place. 
[2023-10-26 09:06:38,264 INFO  L82        GeneralOperation]: Start removeDead. Operand has 162 places, 161 transitions, 334 flow
[2023-10-26 09:06:38,265 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 162 places, 161 transitions, 334 flow
[2023-10-26 09:06:38,265 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-10-26 09:06:38,265 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 161 transitions, 334 flow
[2023-10-26 09:06:38,265 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 162 places, 161 transitions, 334 flow
[2023-10-26 09:06:38,266 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 162 places, 161 transitions, 334 flow
[2023-10-26 09:06:38,303 INFO  L130       PetriNetUnfolder]: 10/259 cut-off events.
[2023-10-26 09:06:38,317 INFO  L131       PetriNetUnfolder]: For 2/2 co-relation queries the response was YES.
[2023-10-26 09:06:38,318 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 269 conditions, 259 events. 10/259 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 351 event pairs, 0 based on Foata normal form. 0/226 useless extension candidates. Maximal degree in co-relation 175. Up to 6 conditions per place. 
[2023-10-26 09:06:38,321 INFO  L119        LiptonReduction]: Number of co-enabled transitions 7540
[2023-10-26 09:06:42,072 INFO  L134        LiptonReduction]: Checked pairs total: 34782
[2023-10-26 09:06:42,072 INFO  L136        LiptonReduction]: Total number of compositions: 108
[2023-10-26 09:06:42,073 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-10-26 09:06:42,074 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;@4cc6d504, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-10-26 09:06:42,074 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 15 error locations.
[2023-10-26 09:06:42,075 INFO  L130       PetriNetUnfolder]: 0/6 cut-off events.
[2023-10-26 09:06:42,075 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-26 09:06:42,075 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 09:06:42,075 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1]
[2023-10-26 09:06:42,076 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-10-26 09:06:42,076 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 09:06:42,076 INFO  L85        PathProgramCache]: Analyzing trace with hash 22736524, now seen corresponding path program 1 times
[2023-10-26 09:06:42,076 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 09:06:42,076 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534005188]
[2023-10-26 09:06:42,076 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 09:06:42,076 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 09:06:42,102 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 09:06:42,135 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 09:06:42,135 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 09:06:42,137 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534005188]
[2023-10-26 09:06:42,137 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534005188] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 09:06:42,138 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 09:06:42,138 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-26 09:06:42,138 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073518568]
[2023-10-26 09:06:42,138 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 09:06:42,138 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-26 09:06:42,138 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 09:06:42,139 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-26 09:06:42,139 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-26 09:06:42,174 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 141 out of 269
[2023-10-26 09:06:42,175 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 61 transitions, 134 flow. Second operand  has 3 states, 3 states have (on average 142.33333333333334) internal successors, (427), 3 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:06:42,175 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 09:06:42,175 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 269
[2023-10-26 09:06:42,175 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 09:06:43,376 INFO  L130       PetriNetUnfolder]: 4106/7967 cut-off events.
[2023-10-26 09:06:43,376 INFO  L131       PetriNetUnfolder]: For 57/57 co-relation queries the response was YES.
[2023-10-26 09:06:43,397 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14665 conditions, 7967 events. 4106/7967 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 62182 event pairs, 1764 based on Foata normal form. 0/7275 useless extension candidates. Maximal degree in co-relation 5743. Up to 3425 conditions per place. 
[2023-10-26 09:06:43,472 INFO  L137   encePairwiseOnDemand]: 252/269 looper letters, 61 selfloop transitions, 11 changer transitions 0/92 dead transitions.
[2023-10-26 09:06:43,472 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 92 transitions, 345 flow
[2023-10-26 09:06:43,472 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-26 09:06:43,472 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-26 09:06:43,473 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 503 transitions.
[2023-10-26 09:06:43,478 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6232961586121437
[2023-10-26 09:06:43,478 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 503 transitions.
[2023-10-26 09:06:43,478 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 503 transitions.
[2023-10-26 09:06:43,478 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 09:06:43,479 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 503 transitions.
[2023-10-26 09:06:43,480 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:06:43,481 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:06:43,481 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:06:43,481 INFO  L175             Difference]: Start difference. First operand has 64 places, 61 transitions, 134 flow. Second operand 3 states and 503 transitions.
[2023-10-26 09:06:43,481 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 92 transitions, 345 flow
[2023-10-26 09:06:43,490 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 92 transitions, 343 flow, removed 1 selfloop flow, removed 0 redundant places.
[2023-10-26 09:06:43,492 INFO  L231             Difference]: Finished difference. Result has 67 places, 70 transitions, 224 flow
[2023-10-26 09:06:43,492 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=224, PETRI_PLACES=67, PETRI_TRANSITIONS=70}
[2023-10-26 09:06:43,495 INFO  L288   CegarLoopForPetriNet]: 64 programPoint places, 3 predicate places.
[2023-10-26 09:06:43,495 INFO  L495      AbstractCegarLoop]: Abstraction has has 67 places, 70 transitions, 224 flow
[2023-10-26 09:06:43,497 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 142.33333333333334) internal successors, (427), 3 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:06:43,498 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 09:06:43,498 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 09:06:43,498 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2023-10-26 09:06:43,498 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-10-26 09:06:43,498 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 09:06:43,498 INFO  L85        PathProgramCache]: Analyzing trace with hash 1006456856, now seen corresponding path program 1 times
[2023-10-26 09:06:43,499 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 09:06:43,499 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377697226]
[2023-10-26 09:06:43,499 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 09:06:43,499 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 09:06:43,520 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 09:06:43,531 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 09:06:43,531 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 09:06:43,531 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377697226]
[2023-10-26 09:06:43,531 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377697226] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 09:06:43,531 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 09:06:43,532 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-26 09:06:43,533 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769652732]
[2023-10-26 09:06:43,533 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 09:06:43,533 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-26 09:06:43,535 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 09:06:43,536 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-26 09:06:43,536 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-26 09:06:43,560 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 151 out of 269
[2023-10-26 09:06:43,561 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 70 transitions, 224 flow. Second operand  has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:06:43,561 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 09:06:43,561 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 269
[2023-10-26 09:06:43,561 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 09:06:44,673 INFO  L130       PetriNetUnfolder]: 3685/7514 cut-off events.
[2023-10-26 09:06:44,673 INFO  L131       PetriNetUnfolder]: For 2646/3130 co-relation queries the response was YES.
[2023-10-26 09:06:44,692 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16029 conditions, 7514 events. 3685/7514 cut-off events. For 2646/3130 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 62308 event pairs, 2270 based on Foata normal form. 44/6885 useless extension candidates. Maximal degree in co-relation 5090. Up to 4360 conditions per place. 
[2023-10-26 09:06:44,745 INFO  L137   encePairwiseOnDemand]: 264/269 looper letters, 50 selfloop transitions, 4 changer transitions 0/90 dead transitions.
[2023-10-26 09:06:44,761 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 90 transitions, 384 flow
[2023-10-26 09:06:44,762 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-26 09:06:44,762 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-26 09:06:44,762 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 503 transitions.
[2023-10-26 09:06:44,763 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6232961586121437
[2023-10-26 09:06:44,763 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 503 transitions.
[2023-10-26 09:06:44,763 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 503 transitions.
[2023-10-26 09:06:44,763 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 09:06:44,763 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 503 transitions.
[2023-10-26 09:06:44,764 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:06:44,766 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:06:44,766 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:06:44,766 INFO  L175             Difference]: Start difference. First operand has 67 places, 70 transitions, 224 flow. Second operand 3 states and 503 transitions.
[2023-10-26 09:06:44,766 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 90 transitions, 384 flow
[2023-10-26 09:06:44,773 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 90 transitions, 358 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-26 09:06:44,774 INFO  L231             Difference]: Finished difference. Result has 69 places, 73 transitions, 232 flow
[2023-10-26 09:06:44,774 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=232, PETRI_PLACES=69, PETRI_TRANSITIONS=73}
[2023-10-26 09:06:44,776 INFO  L288   CegarLoopForPetriNet]: 64 programPoint places, 5 predicate places.
[2023-10-26 09:06:44,776 INFO  L495      AbstractCegarLoop]: Abstraction has has 69 places, 73 transitions, 232 flow
[2023-10-26 09:06:44,777 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:06:44,777 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 09:06:44,777 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 09:06:44,777 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2023-10-26 09:06:44,777 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-10-26 09:06:44,777 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 09:06:44,778 INFO  L85        PathProgramCache]: Analyzing trace with hash -420520761, now seen corresponding path program 1 times
[2023-10-26 09:06:44,782 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 09:06:44,782 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809293742]
[2023-10-26 09:06:44,782 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 09:06:44,782 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 09:06:44,793 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 09:06:44,824 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 09:06:44,824 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 09:06:44,825 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809293742]
[2023-10-26 09:06:44,825 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809293742] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 09:06:44,825 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 09:06:44,825 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-26 09:06:44,825 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268802762]
[2023-10-26 09:06:44,825 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 09:06:44,826 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-26 09:06:44,826 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 09:06:44,826 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-26 09:06:44,826 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-26 09:06:44,865 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 144 out of 269
[2023-10-26 09:06:44,867 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 73 transitions, 232 flow. Second operand  has 3 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:06:44,867 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 09:06:44,867 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 269
[2023-10-26 09:06:44,867 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 09:06:45,955 INFO  L130       PetriNetUnfolder]: 3968/7815 cut-off events.
[2023-10-26 09:06:45,969 INFO  L131       PetriNetUnfolder]: For 1629/1907 co-relation queries the response was YES.
[2023-10-26 09:06:45,978 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17024 conditions, 7815 events. 3968/7815 cut-off events. For 1629/1907 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 63275 event pairs, 2601 based on Foata normal form. 60/7073 useless extension candidates. Maximal degree in co-relation 13547. Up to 5524 conditions per place. 
[2023-10-26 09:06:46,036 INFO  L137   encePairwiseOnDemand]: 261/269 looper letters, 51 selfloop transitions, 12 changer transitions 0/96 dead transitions.
[2023-10-26 09:06:46,036 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 96 transitions, 422 flow
[2023-10-26 09:06:46,036 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-26 09:06:46,037 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-26 09:06:46,037 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 484 transitions.
[2023-10-26 09:06:46,038 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5997521685254027
[2023-10-26 09:06:46,038 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 484 transitions.
[2023-10-26 09:06:46,038 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 484 transitions.
[2023-10-26 09:06:46,038 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 09:06:46,038 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 484 transitions.
[2023-10-26 09:06:46,045 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:06:46,046 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:06:46,046 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:06:46,046 INFO  L175             Difference]: Start difference. First operand has 69 places, 73 transitions, 232 flow. Second operand 3 states and 484 transitions.
[2023-10-26 09:06:46,047 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 96 transitions, 422 flow
[2023-10-26 09:06:46,066 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 96 transitions, 414 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-26 09:06:46,069 INFO  L231             Difference]: Finished difference. Result has 71 places, 83 transitions, 330 flow
[2023-10-26 09:06:46,070 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=330, PETRI_PLACES=71, PETRI_TRANSITIONS=83}
[2023-10-26 09:06:46,071 INFO  L288   CegarLoopForPetriNet]: 64 programPoint places, 7 predicate places.
[2023-10-26 09:06:46,071 INFO  L495      AbstractCegarLoop]: Abstraction has has 71 places, 83 transitions, 330 flow
[2023-10-26 09:06:46,071 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:06:46,071 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 09:06:46,071 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 09:06:46,072 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2023-10-26 09:06:46,072 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-10-26 09:06:46,072 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 09:06:46,072 INFO  L85        PathProgramCache]: Analyzing trace with hash 777101591, now seen corresponding path program 1 times
[2023-10-26 09:06:46,072 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 09:06:46,072 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915143313]
[2023-10-26 09:06:46,073 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 09:06:46,073 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 09:06:46,086 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 09:06:46,123 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 09:06:46,124 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 09:06:46,124 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915143313]
[2023-10-26 09:06:46,124 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915143313] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 09:06:46,124 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 09:06:46,124 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-26 09:06:46,124 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156889631]
[2023-10-26 09:06:46,124 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 09:06:46,125 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-26 09:06:46,125 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 09:06:46,125 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-26 09:06:46,125 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-26 09:06:46,140 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 149 out of 269
[2023-10-26 09:06:46,141 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 83 transitions, 330 flow. Second operand  has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:06:46,141 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 09:06:46,141 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 269
[2023-10-26 09:06:46,141 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 09:06:47,327 INFO  L130       PetriNetUnfolder]: 4157/8465 cut-off events.
[2023-10-26 09:06:47,341 INFO  L131       PetriNetUnfolder]: For 5135/6762 co-relation queries the response was YES.
[2023-10-26 09:06:47,507 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20170 conditions, 8465 events. 4157/8465 cut-off events. For 5135/6762 co-relation queries the response was YES. Maximal size of possible extension queue 427. Compared 72159 event pairs, 2727 based on Foata normal form. 253/7737 useless extension candidates. Maximal degree in co-relation 12648. Up to 5667 conditions per place. 
[2023-10-26 09:06:47,548 INFO  L137   encePairwiseOnDemand]: 264/269 looper letters, 63 selfloop transitions, 6 changer transitions 0/111 dead transitions.
[2023-10-26 09:06:47,565 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 111 transitions, 571 flow
[2023-10-26 09:06:47,566 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-26 09:06:47,566 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-26 09:06:47,566 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 499 transitions.
[2023-10-26 09:06:47,567 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6183395291201983
[2023-10-26 09:06:47,567 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 499 transitions.
[2023-10-26 09:06:47,567 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 499 transitions.
[2023-10-26 09:06:47,567 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 09:06:47,567 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 499 transitions.
[2023-10-26 09:06:47,568 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:06:47,569 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:06:47,570 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:06:47,570 INFO  L175             Difference]: Start difference. First operand has 71 places, 83 transitions, 330 flow. Second operand 3 states and 499 transitions.
[2023-10-26 09:06:47,570 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 111 transitions, 571 flow
[2023-10-26 09:06:47,577 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 111 transitions, 539 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-26 09:06:47,578 INFO  L231             Difference]: Finished difference. Result has 72 places, 87 transitions, 348 flow
[2023-10-26 09:06:47,579 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=348, PETRI_PLACES=72, PETRI_TRANSITIONS=87}
[2023-10-26 09:06:47,585 INFO  L288   CegarLoopForPetriNet]: 64 programPoint places, 8 predicate places.
[2023-10-26 09:06:47,585 INFO  L495      AbstractCegarLoop]: Abstraction has has 72 places, 87 transitions, 348 flow
[2023-10-26 09:06:47,585 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:06:47,585 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 09:06:47,585 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 09:06:47,586 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2023-10-26 09:06:47,586 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-10-26 09:06:47,586 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 09:06:47,586 INFO  L85        PathProgramCache]: Analyzing trace with hash 1261976369, now seen corresponding path program 1 times
[2023-10-26 09:06:47,586 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 09:06:47,586 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881279157]
[2023-10-26 09:06:47,587 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 09:06:47,587 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 09:06:47,615 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 09:06:47,647 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 09:06:47,647 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 09:06:47,648 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881279157]
[2023-10-26 09:06:47,648 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881279157] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 09:06:47,648 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 09:06:47,648 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-26 09:06:47,648 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244296771]
[2023-10-26 09:06:47,649 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 09:06:47,649 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-26 09:06:47,649 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 09:06:47,650 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-26 09:06:47,650 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-26 09:06:47,687 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 145 out of 269
[2023-10-26 09:06:47,688 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 87 transitions, 348 flow. Second operand  has 3 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:06:47,688 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 09:06:47,688 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 269
[2023-10-26 09:06:47,688 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 09:06:48,853 INFO  L130       PetriNetUnfolder]: 6039/11385 cut-off events.
[2023-10-26 09:06:48,853 INFO  L131       PetriNetUnfolder]: For 6574/7585 co-relation queries the response was YES.
[2023-10-26 09:06:48,900 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28271 conditions, 11385 events. 6039/11385 cut-off events. For 6574/7585 co-relation queries the response was YES. Maximal size of possible extension queue 482. Compared 91649 event pairs, 3093 based on Foata normal form. 252/10449 useless extension candidates. Maximal degree in co-relation 15661. Up to 7558 conditions per place. 
[2023-10-26 09:06:48,949 INFO  L137   encePairwiseOnDemand]: 260/269 looper letters, 70 selfloop transitions, 19 changer transitions 0/122 dead transitions.
[2023-10-26 09:06:48,965 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 122 transitions, 661 flow
[2023-10-26 09:06:48,966 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-26 09:06:48,966 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-26 09:06:48,967 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 493 transitions.
[2023-10-26 09:06:48,967 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.61090458488228
[2023-10-26 09:06:48,967 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 493 transitions.
[2023-10-26 09:06:48,967 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 493 transitions.
[2023-10-26 09:06:48,967 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 09:06:48,968 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 493 transitions.
[2023-10-26 09:06:48,968 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 164.33333333333334) internal successors, (493), 3 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:06:48,969 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:06:48,970 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:06:48,970 INFO  L175             Difference]: Start difference. First operand has 72 places, 87 transitions, 348 flow. Second operand 3 states and 493 transitions.
[2023-10-26 09:06:48,970 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 122 transitions, 661 flow
[2023-10-26 09:06:48,973 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 122 transitions, 655 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-10-26 09:06:48,974 INFO  L231             Difference]: Finished difference. Result has 75 places, 102 transitions, 524 flow
[2023-10-26 09:06:48,975 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=524, PETRI_PLACES=75, PETRI_TRANSITIONS=102}
[2023-10-26 09:06:48,975 INFO  L288   CegarLoopForPetriNet]: 64 programPoint places, 11 predicate places.
[2023-10-26 09:06:48,975 INFO  L495      AbstractCegarLoop]: Abstraction has has 75 places, 102 transitions, 524 flow
[2023-10-26 09:06:48,976 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:06:48,981 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 09:06:48,981 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 09:06:48,981 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2023-10-26 09:06:48,981 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-10-26 09:06:48,982 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 09:06:48,982 INFO  L85        PathProgramCache]: Analyzing trace with hash -1922484543, now seen corresponding path program 1 times
[2023-10-26 09:06:48,983 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 09:06:48,983 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030924346]
[2023-10-26 09:06:48,983 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 09:06:48,983 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 09:06:49,005 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 09:06:49,111 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 09:06:49,111 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 09:06:49,111 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030924346]
[2023-10-26 09:06:49,112 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030924346] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-26 09:06:49,112 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1271339325]
[2023-10-26 09:06:49,112 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 09:06:49,112 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 09:06:49,112 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 09:06:49,127 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-26 09:06:49,196 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2023-10-26 09:06:49,306 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 09:06:49,308 INFO  L263         TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 4 conjunts are in the unsatisfiable core
[2023-10-26 09:06:49,310 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 09:06:49,448 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 09:06:49,449 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-10-26 09:06:49,449 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1271339325] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 09:06:49,449 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2023-10-26 09:06:49,449 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6
[2023-10-26 09:06:49,449 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904064909]
[2023-10-26 09:06:49,449 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 09:06:49,450 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-10-26 09:06:49,450 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 09:06:49,450 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-10-26 09:06:49,450 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2023-10-26 09:06:49,498 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 147 out of 269
[2023-10-26 09:06:49,498 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 102 transitions, 524 flow. Second operand  has 5 states, 5 states have (on average 149.6) internal successors, (748), 5 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:06:49,499 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 09:06:49,499 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 269
[2023-10-26 09:06:49,499 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 09:06:51,481 INFO  L130       PetriNetUnfolder]: 8285/15913 cut-off events.
[2023-10-26 09:06:51,481 INFO  L131       PetriNetUnfolder]: For 17760/19750 co-relation queries the response was YES.
[2023-10-26 09:06:51,510 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 45043 conditions, 15913 events. 8285/15913 cut-off events. For 17760/19750 co-relation queries the response was YES. Maximal size of possible extension queue 672. Compared 138602 event pairs, 2025 based on Foata normal form. 619/15242 useless extension candidates. Maximal degree in co-relation 25629. Up to 5856 conditions per place. 
[2023-10-26 09:06:51,632 INFO  L137   encePairwiseOnDemand]: 261/269 looper letters, 167 selfloop transitions, 16 changer transitions 3/236 dead transitions.
[2023-10-26 09:06:51,632 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 236 transitions, 1545 flow
[2023-10-26 09:06:51,632 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2023-10-26 09:06:51,632 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-10-26 09:06:51,634 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1151 transitions.
[2023-10-26 09:06:51,641 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6112586298459904
[2023-10-26 09:06:51,641 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 1151 transitions.
[2023-10-26 09:06:51,641 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 1151 transitions.
[2023-10-26 09:06:51,641 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 09:06:51,642 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1151 transitions.
[2023-10-26 09:06:51,643 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 164.42857142857142) internal successors, (1151), 7 states have internal predecessors, (1151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:06:51,647 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 269.0) internal successors, (2152), 8 states have internal predecessors, (2152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:06:51,647 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 269.0) internal successors, (2152), 8 states have internal predecessors, (2152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:06:51,648 INFO  L175             Difference]: Start difference. First operand has 75 places, 102 transitions, 524 flow. Second operand 7 states and 1151 transitions.
[2023-10-26 09:06:51,648 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 236 transitions, 1545 flow
[2023-10-26 09:06:51,859 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 236 transitions, 1445 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-26 09:06:51,861 INFO  L231             Difference]: Finished difference. Result has 82 places, 117 transitions, 584 flow
[2023-10-26 09:06:51,870 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=584, PETRI_PLACES=82, PETRI_TRANSITIONS=117}
[2023-10-26 09:06:51,871 INFO  L288   CegarLoopForPetriNet]: 64 programPoint places, 18 predicate places.
[2023-10-26 09:06:51,871 INFO  L495      AbstractCegarLoop]: Abstraction has has 82 places, 117 transitions, 584 flow
[2023-10-26 09:06:51,872 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 149.6) internal successors, (748), 5 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:06:51,872 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 09:06:51,872 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 09:06:51,879 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2023-10-26 09:06:52,076 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10
[2023-10-26 09:06:52,077 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-10-26 09:06:52,078 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 09:06:52,078 INFO  L85        PathProgramCache]: Analyzing trace with hash 597665167, now seen corresponding path program 1 times
[2023-10-26 09:06:52,078 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 09:06:52,078 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53529843]
[2023-10-26 09:06:52,079 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 09:06:52,079 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 09:06:52,101 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 09:06:52,211 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 09:06:52,211 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 09:06:52,211 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53529843]
[2023-10-26 09:06:52,211 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53529843] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 09:06:52,211 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 09:06:52,211 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-10-26 09:06:52,211 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923494821]
[2023-10-26 09:06:52,212 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 09:06:52,212 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-26 09:06:52,212 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 09:06:52,212 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-26 09:06:52,212 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-26 09:06:52,235 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 143 out of 269
[2023-10-26 09:06:52,244 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 117 transitions, 584 flow. Second operand  has 3 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:06:52,244 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 09:06:52,244 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 269
[2023-10-26 09:06:52,244 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 09:06:53,491 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([656] L688-3-->L688-5: Formula: (= |v_threadThread1of2ForFork0_#t~nondet4_15| |v_#race~threads_alive~0_32|)  InVars {}  OutVars{threadThread1of2ForFork0_#t~nondet4=|v_threadThread1of2ForFork0_#t~nondet4_15|, #race~threads_alive~0=|v_#race~threads_alive~0_32|}  AuxVars[]  AssignedVars[threadThread1of2ForFork0_#t~nondet4, #race~threads_alive~0][54], [30#L701-2true, threadThread1of2ForFork0InUse, Black: 188#true, threadThread2of2ForFork0InUse, 47#L688-5true, Black: 167#(= |#race~threads_alive~0| 0), 95#L687true, Black: 265#(and (<= 0 |ULTIMATE.start_main_#t~post8#1|) (<= 0 ~threads_alive~0)), Black: 215#(<= 0 |ULTIMATE.start_main_#t~post8#1|), Black: 202#(<= 0 ~threads_alive~0), Black: 173#(= |#race~data~0| 0), 194#true, Black: 179#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 185#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 272#true])
[2023-10-26 09:06:53,492 INFO  L383   tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event
[2023-10-26 09:06:53,492 INFO  L386   tUnfolder$Statistics]:   existing Event has 46 ancestors and is cut-off event
[2023-10-26 09:06:53,492 INFO  L386   tUnfolder$Statistics]:   existing Event has 46 ancestors and is cut-off event
[2023-10-26 09:06:53,492 INFO  L386   tUnfolder$Statistics]:   existing Event has 46 ancestors and is cut-off event
[2023-10-26 09:06:53,586 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([656] L688-3-->L688-5: Formula: (= |v_threadThread1of2ForFork0_#t~nondet4_15| |v_#race~threads_alive~0_32|)  InVars {}  OutVars{threadThread1of2ForFork0_#t~nondet4=|v_threadThread1of2ForFork0_#t~nondet4_15|, #race~threads_alive~0=|v_#race~threads_alive~0_32|}  AuxVars[]  AssignedVars[threadThread1of2ForFork0_#t~nondet4, #race~threads_alive~0][37], [30#L701-2true, Black: 188#true, threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, 47#L688-5true, 274#(= (select (select |#pthreadsMutex| |~#threads_alive_mutex~0.base|) |~#threads_alive_mutex~0.offset|) 1), Black: 167#(= |#race~threads_alive~0| 0), Black: 265#(and (<= 0 |ULTIMATE.start_main_#t~post8#1|) (<= 0 ~threads_alive~0)), Black: 215#(<= 0 |ULTIMATE.start_main_#t~post8#1|), Black: 202#(<= 0 ~threads_alive~0), Black: 173#(= |#race~data~0| 0), 194#true, Black: 179#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 185#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 127#L688true])
[2023-10-26 09:06:53,586 INFO  L383   tUnfolder$Statistics]: this new event has 47 ancestors and is cut-off event
[2023-10-26 09:06:53,586 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is cut-off event
[2023-10-26 09:06:53,586 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is cut-off event
[2023-10-26 09:06:53,586 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is cut-off event
[2023-10-26 09:06:53,942 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([656] L688-3-->L688-5: Formula: (= |v_threadThread1of2ForFork0_#t~nondet4_15| |v_#race~threads_alive~0_32|)  InVars {}  OutVars{threadThread1of2ForFork0_#t~nondet4=|v_threadThread1of2ForFork0_#t~nondet4_15|, #race~threads_alive~0=|v_#race~threads_alive~0_32|}  AuxVars[]  AssignedVars[threadThread1of2ForFork0_#t~nondet4, #race~threads_alive~0][54], [Black: 188#true, threadThread1of2ForFork0InUse, 30#L701-2true, threadThread2of2ForFork0InUse, 63#L690true, 47#L688-5true, Black: 167#(= |#race~threads_alive~0| 0), Black: 265#(and (<= 0 |ULTIMATE.start_main_#t~post8#1|) (<= 0 ~threads_alive~0)), Black: 215#(<= 0 |ULTIMATE.start_main_#t~post8#1|), Black: 202#(<= 0 ~threads_alive~0), Black: 173#(= |#race~data~0| 0), 194#true, Black: 179#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 185#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 272#true])
[2023-10-26 09:06:53,942 INFO  L383   tUnfolder$Statistics]: this new event has 52 ancestors and is cut-off event
[2023-10-26 09:06:53,942 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2023-10-26 09:06:53,942 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2023-10-26 09:06:53,942 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2023-10-26 09:06:54,029 INFO  L130       PetriNetUnfolder]: 8494/17801 cut-off events.
[2023-10-26 09:06:54,039 INFO  L131       PetriNetUnfolder]: For 20941/23812 co-relation queries the response was YES.
[2023-10-26 09:06:54,117 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 50895 conditions, 17801 events. 8494/17801 cut-off events. For 20941/23812 co-relation queries the response was YES. Maximal size of possible extension queue 818. Compared 171881 event pairs, 1830 based on Foata normal form. 1341/17783 useless extension candidates. Maximal degree in co-relation 38987. Up to 6594 conditions per place. 
[2023-10-26 09:06:54,285 INFO  L137   encePairwiseOnDemand]: 257/269 looper letters, 84 selfloop transitions, 14 changer transitions 0/160 dead transitions.
[2023-10-26 09:06:54,296 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 160 transitions, 996 flow
[2023-10-26 09:06:54,296 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-26 09:06:54,296 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-26 09:06:54,297 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 487 transitions.
[2023-10-26 09:06:54,301 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6034696406443618
[2023-10-26 09:06:54,301 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 487 transitions.
[2023-10-26 09:06:54,301 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 487 transitions.
[2023-10-26 09:06:54,301 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 09:06:54,301 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 487 transitions.
[2023-10-26 09:06:54,302 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:06:54,303 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:06:54,303 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:06:54,305 INFO  L175             Difference]: Start difference. First operand has 82 places, 117 transitions, 584 flow. Second operand 3 states and 487 transitions.
[2023-10-26 09:06:54,305 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 160 transitions, 996 flow
[2023-10-26 09:06:54,339 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 160 transitions, 996 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-26 09:06:54,353 INFO  L231             Difference]: Finished difference. Result has 85 places, 126 transitions, 670 flow
[2023-10-26 09:06:54,356 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=584, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=670, PETRI_PLACES=85, PETRI_TRANSITIONS=126}
[2023-10-26 09:06:54,357 INFO  L288   CegarLoopForPetriNet]: 64 programPoint places, 21 predicate places.
[2023-10-26 09:06:54,357 INFO  L495      AbstractCegarLoop]: Abstraction has has 85 places, 126 transitions, 670 flow
[2023-10-26 09:06:54,357 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:06:54,357 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 09:06:54,358 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 09:06:54,358 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2023-10-26 09:06:54,358 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-10-26 09:06:54,358 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 09:06:54,359 INFO  L85        PathProgramCache]: Analyzing trace with hash -2119960399, now seen corresponding path program 2 times
[2023-10-26 09:06:54,359 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 09:06:54,359 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021431494]
[2023-10-26 09:06:54,360 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 09:06:54,360 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 09:06:54,385 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 09:06:54,578 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-10-26 09:06:54,579 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 09:06:54,579 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021431494]
[2023-10-26 09:06:54,579 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021431494] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 09:06:54,579 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 09:06:54,579 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-10-26 09:06:54,579 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909867685]
[2023-10-26 09:06:54,579 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 09:06:54,580 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-10-26 09:06:54,580 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 09:06:54,580 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-10-26 09:06:54,581 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2023-10-26 09:06:54,650 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 142 out of 269
[2023-10-26 09:06:54,651 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 126 transitions, 670 flow. Second operand  has 5 states, 5 states have (on average 145.0) internal successors, (725), 5 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:06:54,651 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 09:06:54,651 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 269
[2023-10-26 09:06:54,651 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 09:06:55,159 INFO  L130       PetriNetUnfolder]: 1010/2573 cut-off events.
[2023-10-26 09:06:55,160 INFO  L131       PetriNetUnfolder]: For 2202/2418 co-relation queries the response was YES.
[2023-10-26 09:06:55,163 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7517 conditions, 2573 events. 1010/2573 cut-off events. For 2202/2418 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 18646 event pairs, 329 based on Foata normal form. 222/2707 useless extension candidates. Maximal degree in co-relation 5322. Up to 1190 conditions per place. 
[2023-10-26 09:06:55,186 INFO  L137   encePairwiseOnDemand]: 258/269 looper letters, 40 selfloop transitions, 16 changer transitions 0/91 dead transitions.
[2023-10-26 09:06:55,187 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 91 transitions, 528 flow
[2023-10-26 09:06:55,187 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-10-26 09:06:55,187 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-10-26 09:06:55,191 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 615 transitions.
[2023-10-26 09:06:55,193 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5715613382899628
[2023-10-26 09:06:55,193 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 615 transitions.
[2023-10-26 09:06:55,193 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 615 transitions.
[2023-10-26 09:06:55,194 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 09:06:55,194 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 615 transitions.
[2023-10-26 09:06:55,198 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 153.75) internal successors, (615), 4 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:06:55,209 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 269.0) internal successors, (1345), 5 states have internal predecessors, (1345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:06:55,209 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 269.0) internal successors, (1345), 5 states have internal predecessors, (1345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:06:55,210 INFO  L175             Difference]: Start difference. First operand has 85 places, 126 transitions, 670 flow. Second operand 4 states and 615 transitions.
[2023-10-26 09:06:55,210 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 91 transitions, 528 flow
[2023-10-26 09:06:55,230 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 91 transitions, 462 flow, removed 21 selfloop flow, removed 6 redundant places.
[2023-10-26 09:06:55,232 INFO  L231             Difference]: Finished difference. Result has 75 places, 77 transitions, 333 flow
[2023-10-26 09:06:55,232 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=333, PETRI_PLACES=75, PETRI_TRANSITIONS=77}
[2023-10-26 09:06:55,233 INFO  L288   CegarLoopForPetriNet]: 64 programPoint places, 11 predicate places.
[2023-10-26 09:06:55,233 INFO  L495      AbstractCegarLoop]: Abstraction has has 75 places, 77 transitions, 333 flow
[2023-10-26 09:06:55,233 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 145.0) internal successors, (725), 5 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:06:55,233 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 09:06:55,233 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 09:06:55,237 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2023-10-26 09:06:55,237 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-10-26 09:06:55,238 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 09:06:55,238 INFO  L85        PathProgramCache]: Analyzing trace with hash -674470246, now seen corresponding path program 1 times
[2023-10-26 09:06:55,238 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 09:06:55,238 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117597179]
[2023-10-26 09:06:55,238 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 09:06:55,238 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 09:06:55,269 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 09:06:55,294 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked.
[2023-10-26 09:06:55,295 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 09:06:55,295 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117597179]
[2023-10-26 09:06:55,295 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117597179] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 09:06:55,295 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 09:06:55,295 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-26 09:06:55,295 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453864536]
[2023-10-26 09:06:55,296 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 09:06:55,296 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-26 09:06:55,296 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 09:06:55,296 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-26 09:06:55,297 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-26 09:06:55,314 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 149 out of 269
[2023-10-26 09:06:55,314 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 77 transitions, 333 flow. Second operand  has 3 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:06:55,315 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 09:06:55,315 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 269
[2023-10-26 09:06:55,315 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 09:06:55,657 INFO  L130       PetriNetUnfolder]: 1161/2703 cut-off events.
[2023-10-26 09:06:55,657 INFO  L131       PetriNetUnfolder]: For 1713/1792 co-relation queries the response was YES.
[2023-10-26 09:06:55,660 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7394 conditions, 2703 events. 1161/2703 cut-off events. For 1713/1792 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 19190 event pairs, 663 based on Foata normal form. 3/2518 useless extension candidates. Maximal degree in co-relation 5369. Up to 1652 conditions per place. 
[2023-10-26 09:06:55,685 INFO  L137   encePairwiseOnDemand]: 263/269 looper letters, 56 selfloop transitions, 8 changer transitions 0/100 dead transitions.
[2023-10-26 09:06:55,685 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 100 transitions, 561 flow
[2023-10-26 09:06:55,686 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-26 09:06:55,686 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-26 09:06:55,687 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 497 transitions.
[2023-10-26 09:06:55,687 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6158612143742255
[2023-10-26 09:06:55,687 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 497 transitions.
[2023-10-26 09:06:55,687 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 497 transitions.
[2023-10-26 09:06:55,687 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 09:06:55,701 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 497 transitions.
[2023-10-26 09:06:55,704 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 165.66666666666666) internal successors, (497), 3 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:06:55,706 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:06:55,706 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:06:55,707 INFO  L175             Difference]: Start difference. First operand has 75 places, 77 transitions, 333 flow. Second operand 3 states and 497 transitions.
[2023-10-26 09:06:55,707 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 100 transitions, 561 flow
[2023-10-26 09:06:55,711 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 100 transitions, 538 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-26 09:06:55,712 INFO  L231             Difference]: Finished difference. Result has 77 places, 82 transitions, 383 flow
[2023-10-26 09:06:55,712 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=383, PETRI_PLACES=77, PETRI_TRANSITIONS=82}
[2023-10-26 09:06:55,713 INFO  L288   CegarLoopForPetriNet]: 64 programPoint places, 13 predicate places.
[2023-10-26 09:06:55,713 INFO  L495      AbstractCegarLoop]: Abstraction has has 77 places, 82 transitions, 383 flow
[2023-10-26 09:06:55,714 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:06:55,714 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 09:06:55,714 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 09:06:55,714 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2023-10-26 09:06:55,714 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-10-26 09:06:55,715 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 09:06:55,715 INFO  L85        PathProgramCache]: Analyzing trace with hash 545280907, now seen corresponding path program 1 times
[2023-10-26 09:06:55,715 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 09:06:55,715 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296596014]
[2023-10-26 09:06:55,715 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 09:06:55,715 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 09:06:55,754 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 09:06:55,859 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2023-10-26 09:06:55,859 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 09:06:55,859 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296596014]
[2023-10-26 09:06:55,859 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296596014] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 09:06:55,859 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 09:06:55,859 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-10-26 09:06:55,861 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636470507]
[2023-10-26 09:06:55,861 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 09:06:55,861 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-26 09:06:55,861 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 09:06:55,861 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-26 09:06:55,862 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-26 09:06:55,889 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 146 out of 269
[2023-10-26 09:06:55,890 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 82 transitions, 383 flow. Second operand  has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:06:55,905 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 09:06:55,905 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 269
[2023-10-26 09:06:55,905 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 09:06:56,247 INFO  L130       PetriNetUnfolder]: 1581/3753 cut-off events.
[2023-10-26 09:06:56,247 INFO  L131       PetriNetUnfolder]: For 3378/3613 co-relation queries the response was YES.
[2023-10-26 09:06:56,252 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11007 conditions, 3753 events. 1581/3753 cut-off events. For 3378/3613 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 29364 event pairs, 288 based on Foata normal form. 143/3777 useless extension candidates. Maximal degree in co-relation 7716. Up to 1817 conditions per place. 
[2023-10-26 09:06:56,280 INFO  L137   encePairwiseOnDemand]: 260/269 looper letters, 67 selfloop transitions, 15 changer transitions 0/119 dead transitions.
[2023-10-26 09:06:56,293 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 119 transitions, 732 flow
[2023-10-26 09:06:56,294 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-26 09:06:56,294 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-26 09:06:56,295 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 496 transitions.
[2023-10-26 09:06:56,295 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6146220570012392
[2023-10-26 09:06:56,295 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 496 transitions.
[2023-10-26 09:06:56,295 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 496 transitions.
[2023-10-26 09:06:56,296 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 09:06:56,296 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 496 transitions.
[2023-10-26 09:06:56,297 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 165.33333333333334) internal successors, (496), 3 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:06:56,298 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:06:56,310 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:06:56,311 INFO  L175             Difference]: Start difference. First operand has 77 places, 82 transitions, 383 flow. Second operand 3 states and 496 transitions.
[2023-10-26 09:06:56,311 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 119 transitions, 732 flow
[2023-10-26 09:06:56,317 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 119 transitions, 704 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-26 09:06:56,319 INFO  L231             Difference]: Finished difference. Result has 78 places, 95 transitions, 505 flow
[2023-10-26 09:06:56,319 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=505, PETRI_PLACES=78, PETRI_TRANSITIONS=95}
[2023-10-26 09:06:56,320 INFO  L288   CegarLoopForPetriNet]: 64 programPoint places, 14 predicate places.
[2023-10-26 09:06:56,320 INFO  L495      AbstractCegarLoop]: Abstraction has has 78 places, 95 transitions, 505 flow
[2023-10-26 09:06:56,321 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:06:56,321 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 09:06:56,321 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 09:06:56,321 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2023-10-26 09:06:56,321 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-10-26 09:06:56,322 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 09:06:56,322 INFO  L85        PathProgramCache]: Analyzing trace with hash 2143255471, now seen corresponding path program 2 times
[2023-10-26 09:06:56,322 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 09:06:56,325 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581050819]
[2023-10-26 09:06:56,325 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 09:06:56,326 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 09:06:56,356 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 09:06:56,512 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2023-10-26 09:06:56,512 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 09:06:56,513 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581050819]
[2023-10-26 09:06:56,513 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581050819] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-26 09:06:56,513 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [777966994]
[2023-10-26 09:06:56,513 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2023-10-26 09:06:56,513 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 09:06:56,513 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 09:06:56,527 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-26 09:06:56,569 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2023-10-26 09:06:56,673 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2023-10-26 09:06:56,673 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-26 09:06:56,674 INFO  L263         TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 9 conjunts are in the unsatisfiable core
[2023-10-26 09:06:56,676 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 09:06:56,849 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-10-26 09:06:56,902 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 09:06:56,904 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16
[2023-10-26 09:06:56,934 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2023-10-26 09:06:56,934 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-26 09:06:57,005 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 09:06:57,005 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20
[2023-10-26 09:06:57,010 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25
[2023-10-26 09:06:57,053 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2023-10-26 09:06:57,053 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [777966994] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-26 09:06:57,053 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-26 09:06:57,053 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9
[2023-10-26 09:06:57,053 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514640690]
[2023-10-26 09:06:57,054 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-26 09:06:57,055 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2023-10-26 09:06:57,055 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 09:06:57,055 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2023-10-26 09:06:57,056 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90
[2023-10-26 09:06:57,281 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 145 out of 269
[2023-10-26 09:06:57,282 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 95 transitions, 505 flow. Second operand  has 10 states, 10 states have (on average 148.3) internal successors, (1483), 10 states have internal predecessors, (1483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:06:57,282 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 09:06:57,282 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 269
[2023-10-26 09:06:57,282 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 09:06:57,715 INFO  L130       PetriNetUnfolder]: 800/2211 cut-off events.
[2023-10-26 09:06:57,715 INFO  L131       PetriNetUnfolder]: For 2345/2426 co-relation queries the response was YES.
[2023-10-26 09:06:57,739 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6911 conditions, 2211 events. 800/2211 cut-off events. For 2345/2426 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 16413 event pairs, 251 based on Foata normal form. 88/2214 useless extension candidates. Maximal degree in co-relation 4732. Up to 1130 conditions per place. 
[2023-10-26 09:06:57,747 INFO  L137   encePairwiseOnDemand]: 264/269 looper letters, 61 selfloop transitions, 13 changer transitions 1/111 dead transitions.
[2023-10-26 09:06:57,747 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 111 transitions, 719 flow
[2023-10-26 09:06:57,748 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-10-26 09:06:57,748 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-10-26 09:06:57,749 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 631 transitions.
[2023-10-26 09:06:57,749 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5864312267657993
[2023-10-26 09:06:57,749 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 631 transitions.
[2023-10-26 09:06:57,749 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 631 transitions.
[2023-10-26 09:06:57,750 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 09:06:57,750 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 631 transitions.
[2023-10-26 09:06:57,751 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 157.75) internal successors, (631), 4 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:06:57,764 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 269.0) internal successors, (1345), 5 states have internal predecessors, (1345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:06:57,764 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 269.0) internal successors, (1345), 5 states have internal predecessors, (1345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:06:57,764 INFO  L175             Difference]: Start difference. First operand has 78 places, 95 transitions, 505 flow. Second operand 4 states and 631 transitions.
[2023-10-26 09:06:57,764 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 111 transitions, 719 flow
[2023-10-26 09:06:57,769 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 111 transitions, 703 flow, removed 1 selfloop flow, removed 1 redundant places.
[2023-10-26 09:06:57,771 INFO  L231             Difference]: Finished difference. Result has 80 places, 90 transitions, 478 flow
[2023-10-26 09:06:57,771 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=478, PETRI_PLACES=80, PETRI_TRANSITIONS=90}
[2023-10-26 09:06:57,771 INFO  L288   CegarLoopForPetriNet]: 64 programPoint places, 16 predicate places.
[2023-10-26 09:06:57,772 INFO  L495      AbstractCegarLoop]: Abstraction has has 80 places, 90 transitions, 478 flow
[2023-10-26 09:06:57,772 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 148.3) internal successors, (1483), 10 states have internal predecessors, (1483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:06:57,772 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 09:06:57,772 INFO  L209   CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1]
[2023-10-26 09:06:57,792 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2023-10-26 09:06:57,976 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,3 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 09:06:57,976 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-10-26 09:06:57,977 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 09:06:57,977 INFO  L85        PathProgramCache]: Analyzing trace with hash -1802055890, now seen corresponding path program 1 times
[2023-10-26 09:06:57,977 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 09:06:57,977 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134673493]
[2023-10-26 09:06:57,977 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 09:06:57,977 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 09:06:58,027 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-26 09:06:58,028 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-10-26 09:06:58,040 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-26 09:06:58,065 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-10-26 09:06:58,065 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-10-26 09:06:58,066 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 15 remaining)
[2023-10-26 09:06:58,066 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining)
[2023-10-26 09:06:58,066 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining)
[2023-10-26 09:06:58,066 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining)
[2023-10-26 09:06:58,066 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining)
[2023-10-26 09:06:58,066 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining)
[2023-10-26 09:06:58,066 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (8 of 15 remaining)
[2023-10-26 09:06:58,067 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining)
[2023-10-26 09:06:58,067 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining)
[2023-10-26 09:06:58,067 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining)
[2023-10-26 09:06:58,067 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 15 remaining)
[2023-10-26 09:06:58,067 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (3 of 15 remaining)
[2023-10-26 09:06:58,067 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining)
[2023-10-26 09:06:58,067 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining)
[2023-10-26 09:06:58,068 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining)
[2023-10-26 09:06:58,068 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2023-10-26 09:06:58,068 INFO  L445         BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 09:06:58,068 WARN  L233   ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-10-26 09:06:58,068 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances.
[2023-10-26 09:06:58,100 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2023-10-26 09:06:58,102 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 191 places, 188 transitions, 397 flow
[2023-10-26 09:06:58,136 INFO  L130       PetriNetUnfolder]: 13/344 cut-off events.
[2023-10-26 09:06:58,148 INFO  L131       PetriNetUnfolder]: For 7/7 co-relation queries the response was YES.
[2023-10-26 09:06:58,149 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 360 conditions, 344 events. 13/344 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 491 event pairs, 0 based on Foata normal form. 0/299 useless extension candidates. Maximal degree in co-relation 263. Up to 8 conditions per place. 
[2023-10-26 09:06:58,149 INFO  L82        GeneralOperation]: Start removeDead. Operand has 191 places, 188 transitions, 397 flow
[2023-10-26 09:06:58,153 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 191 places, 188 transitions, 397 flow
[2023-10-26 09:06:58,153 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-10-26 09:06:58,153 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 191 places, 188 transitions, 397 flow
[2023-10-26 09:06:58,153 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 191 places, 188 transitions, 397 flow
[2023-10-26 09:06:58,153 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 191 places, 188 transitions, 397 flow
[2023-10-26 09:06:58,186 INFO  L130       PetriNetUnfolder]: 13/344 cut-off events.
[2023-10-26 09:06:58,187 INFO  L131       PetriNetUnfolder]: For 7/7 co-relation queries the response was YES.
[2023-10-26 09:06:58,187 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 360 conditions, 344 events. 13/344 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 491 event pairs, 0 based on Foata normal form. 0/299 useless extension candidates. Maximal degree in co-relation 263. Up to 8 conditions per place. 
[2023-10-26 09:06:58,207 INFO  L119        LiptonReduction]: Number of co-enabled transitions 13416
[2023-10-26 09:07:02,744 INFO  L134        LiptonReduction]: Checked pairs total: 63011
[2023-10-26 09:07:02,744 INFO  L136        LiptonReduction]: Total number of compositions: 119
[2023-10-26 09:07:02,745 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-10-26 09:07:02,746 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;@4cc6d504, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-10-26 09:07:02,746 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 18 error locations.
[2023-10-26 09:07:02,747 INFO  L130       PetriNetUnfolder]: 0/6 cut-off events.
[2023-10-26 09:07:02,747 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-26 09:07:02,747 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 09:07:02,747 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1]
[2023-10-26 09:07:02,747 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2023-10-26 09:07:02,747 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 09:07:02,747 INFO  L85        PathProgramCache]: Analyzing trace with hash 33015180, now seen corresponding path program 1 times
[2023-10-26 09:07:02,747 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 09:07:02,747 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008123213]
[2023-10-26 09:07:02,747 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 09:07:02,748 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 09:07:02,778 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 09:07:02,789 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 09:07:02,789 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 09:07:02,790 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008123213]
[2023-10-26 09:07:02,790 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008123213] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 09:07:02,790 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 09:07:02,790 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-26 09:07:02,791 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282171583]
[2023-10-26 09:07:02,791 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 09:07:02,791 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-26 09:07:02,791 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 09:07:02,792 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-26 09:07:02,792 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-26 09:07:02,836 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 163 out of 307
[2023-10-26 09:07:02,837 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 77 transitions, 175 flow. Second operand  has 3 states, 3 states have (on average 164.33333333333334) internal successors, (493), 3 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:07:02,845 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 09:07:02,845 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 307
[2023-10-26 09:07:02,845 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 09:07:13,250 INFO  L130       PetriNetUnfolder]: 72169/116333 cut-off events.
[2023-10-26 09:07:13,250 INFO  L131       PetriNetUnfolder]: For 1881/1881 co-relation queries the response was YES.
[2023-10-26 09:07:13,449 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 219426 conditions, 116333 events. 72169/116333 cut-off events. For 1881/1881 co-relation queries the response was YES. Maximal size of possible extension queue 3388. Compared 1041871 event pairs, 31556 based on Foata normal form. 0/105895 useless extension candidates. Maximal degree in co-relation 36488. Up to 53205 conditions per place. 
[2023-10-26 09:07:14,015 INFO  L137   encePairwiseOnDemand]: 286/307 looper letters, 77 selfloop transitions, 14 changer transitions 0/117 dead transitions.
[2023-10-26 09:07:14,015 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 117 transitions, 449 flow
[2023-10-26 09:07:14,016 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-26 09:07:14,016 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-26 09:07:14,036 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 589 transitions.
[2023-10-26 09:07:14,037 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6395222584147665
[2023-10-26 09:07:14,037 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 589 transitions.
[2023-10-26 09:07:14,037 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 589 transitions.
[2023-10-26 09:07:14,037 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 09:07:14,037 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 589 transitions.
[2023-10-26 09:07:14,038 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 196.33333333333334) internal successors, (589), 3 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:07:14,040 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 307.0) internal successors, (1228), 4 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:07:14,040 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 307.0) internal successors, (1228), 4 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:07:14,040 INFO  L175             Difference]: Start difference. First operand has 82 places, 77 transitions, 175 flow. Second operand 3 states and 589 transitions.
[2023-10-26 09:07:14,040 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 117 transitions, 449 flow
[2023-10-26 09:07:14,044 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 117 transitions, 441 flow, removed 4 selfloop flow, removed 0 redundant places.
[2023-10-26 09:07:14,058 INFO  L231             Difference]: Finished difference. Result has 85 places, 89 transitions, 287 flow
[2023-10-26 09:07:14,058 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=287, PETRI_PLACES=85, PETRI_TRANSITIONS=89}
[2023-10-26 09:07:14,059 INFO  L288   CegarLoopForPetriNet]: 82 programPoint places, 3 predicate places.
[2023-10-26 09:07:14,059 INFO  L495      AbstractCegarLoop]: Abstraction has has 85 places, 89 transitions, 287 flow
[2023-10-26 09:07:14,059 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 164.33333333333334) internal successors, (493), 3 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:07:14,059 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 09:07:14,059 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 09:07:14,059 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2023-10-26 09:07:14,060 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2023-10-26 09:07:14,060 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 09:07:14,060 INFO  L85        PathProgramCache]: Analyzing trace with hash 265562788, now seen corresponding path program 1 times
[2023-10-26 09:07:14,060 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 09:07:14,061 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918273972]
[2023-10-26 09:07:14,061 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 09:07:14,061 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 09:07:14,067 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 09:07:14,092 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 09:07:14,092 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 09:07:14,092 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918273972]
[2023-10-26 09:07:14,092 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918273972] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 09:07:14,092 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 09:07:14,092 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-26 09:07:14,093 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217337183]
[2023-10-26 09:07:14,093 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 09:07:14,094 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-26 09:07:14,094 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 09:07:14,094 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-26 09:07:14,094 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-26 09:07:14,144 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 168 out of 307
[2023-10-26 09:07:14,144 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 89 transitions, 287 flow. Second operand  has 3 states, 3 states have (on average 170.0) internal successors, (510), 3 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:07:14,145 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 09:07:14,145 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 307
[2023-10-26 09:07:14,145 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 09:07:19,205 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([984] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_50| |v_threadThread2of3ForFork0_#t~nondet4_17|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_17|, #race~threads_alive~0=|v_#race~threads_alive~0_50|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet4, #race~threads_alive~0][74], [threadThread3of3ForFork0InUse, 72#L688-2true, 9#L688-5true, 194#true, 200#true, Black: 196#(= |#race~threads_alive~0| 0), 149#L685-2true, threadThread1of3ForFork0InUse, 68#L705-4true, threadThread2of3ForFork0InUse])
[2023-10-26 09:07:19,206 INFO  L383   tUnfolder$Statistics]: this new event has 60 ancestors and is cut-off event
[2023-10-26 09:07:19,206 INFO  L386   tUnfolder$Statistics]:   existing Event has 55 ancestors and is cut-off event
[2023-10-26 09:07:19,206 INFO  L386   tUnfolder$Statistics]:   existing Event has 55 ancestors and is cut-off event
[2023-10-26 09:07:19,206 INFO  L386   tUnfolder$Statistics]:   existing Event has 55 ancestors and is cut-off event
[2023-10-26 09:07:19,206 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([758] L705-4-->L705-1: Formula: (= 0 |v_#race~threads_alive~0_7|)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|}  AuxVars[]  AssignedVars[#race~threads_alive~0][19], [threadThread3of3ForFork0InUse, 72#L688-2true, 200#true, 156#L688-2true, Black: 194#true, 80#L705-1true, 149#L685-2true, threadThread1of3ForFork0InUse, 196#(= |#race~threads_alive~0| 0), threadThread2of3ForFork0InUse])
[2023-10-26 09:07:19,206 INFO  L383   tUnfolder$Statistics]: this new event has 59 ancestors and is cut-off event
[2023-10-26 09:07:19,207 INFO  L386   tUnfolder$Statistics]:   existing Event has 54 ancestors and is cut-off event
[2023-10-26 09:07:19,207 INFO  L386   tUnfolder$Statistics]:   existing Event has 54 ancestors and is cut-off event
[2023-10-26 09:07:19,207 INFO  L386   tUnfolder$Statistics]:   existing Event has 54 ancestors and is cut-off event
[2023-10-26 09:07:19,207 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([941] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_44| |v_threadThread1of3ForFork0_#t~nondet4_13|)  InVars {}  OutVars{threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_13|, #race~threads_alive~0=|v_#race~threads_alive~0_44|}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet4, #race~threads_alive~0][37], [threadThread3of3ForFork0InUse, 200#true, 194#true, 156#L688-2true, Black: 196#(= |#race~threads_alive~0| 0), 149#L685-2true, threadThread1of3ForFork0InUse, 68#L705-4true, threadThread2of3ForFork0InUse, 119#L688-5true])
[2023-10-26 09:07:19,207 INFO  L383   tUnfolder$Statistics]: this new event has 60 ancestors and is cut-off event
[2023-10-26 09:07:19,207 INFO  L386   tUnfolder$Statistics]:   existing Event has 55 ancestors and is cut-off event
[2023-10-26 09:07:19,207 INFO  L386   tUnfolder$Statistics]:   existing Event has 55 ancestors and is cut-off event
[2023-10-26 09:07:19,207 INFO  L386   tUnfolder$Statistics]:   existing Event has 55 ancestors and is cut-off event
[2023-10-26 09:07:19,729 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([984] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_50| |v_threadThread2of3ForFork0_#t~nondet4_17|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_17|, #race~threads_alive~0=|v_#race~threads_alive~0_50|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet4, #race~threads_alive~0][74], [threadThread3of3ForFork0InUse, 116#L685-4true, 72#L688-2true, 9#L688-5true, 194#true, 200#true, Black: 196#(= |#race~threads_alive~0| 0), threadThread1of3ForFork0InUse, 68#L705-4true, threadThread2of3ForFork0InUse])
[2023-10-26 09:07:19,729 INFO  L383   tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event
[2023-10-26 09:07:19,729 INFO  L386   tUnfolder$Statistics]:   existing Event has 56 ancestors and is cut-off event
[2023-10-26 09:07:19,730 INFO  L386   tUnfolder$Statistics]:   existing Event has 56 ancestors and is cut-off event
[2023-10-26 09:07:19,730 INFO  L386   tUnfolder$Statistics]:   existing Event has 56 ancestors and is cut-off event
[2023-10-26 09:07:19,730 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([758] L705-4-->L705-1: Formula: (= 0 |v_#race~threads_alive~0_7|)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|}  AuxVars[]  AssignedVars[#race~threads_alive~0][19], [threadThread3of3ForFork0InUse, 116#L685-4true, 72#L688-2true, 200#true, 156#L688-2true, Black: 194#true, 80#L705-1true, threadThread1of3ForFork0InUse, 196#(= |#race~threads_alive~0| 0), threadThread2of3ForFork0InUse])
[2023-10-26 09:07:19,730 INFO  L383   tUnfolder$Statistics]: this new event has 60 ancestors and is cut-off event
[2023-10-26 09:07:19,730 INFO  L386   tUnfolder$Statistics]:   existing Event has 55 ancestors and is cut-off event
[2023-10-26 09:07:19,730 INFO  L386   tUnfolder$Statistics]:   existing Event has 55 ancestors and is cut-off event
[2023-10-26 09:07:19,730 INFO  L386   tUnfolder$Statistics]:   existing Event has 55 ancestors and is cut-off event
[2023-10-26 09:07:19,730 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([941] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_44| |v_threadThread1of3ForFork0_#t~nondet4_13|)  InVars {}  OutVars{threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_13|, #race~threads_alive~0=|v_#race~threads_alive~0_44|}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet4, #race~threads_alive~0][37], [threadThread3of3ForFork0InUse, 116#L685-4true, 200#true, 194#true, 156#L688-2true, Black: 196#(= |#race~threads_alive~0| 0), threadThread1of3ForFork0InUse, 68#L705-4true, threadThread2of3ForFork0InUse, 119#L688-5true])
[2023-10-26 09:07:19,731 INFO  L383   tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event
[2023-10-26 09:07:19,731 INFO  L386   tUnfolder$Statistics]:   existing Event has 56 ancestors and is cut-off event
[2023-10-26 09:07:19,731 INFO  L386   tUnfolder$Statistics]:   existing Event has 56 ancestors and is cut-off event
[2023-10-26 09:07:19,731 INFO  L386   tUnfolder$Statistics]:   existing Event has 56 ancestors and is cut-off event
[2023-10-26 09:07:20,228 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([984] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_50| |v_threadThread2of3ForFork0_#t~nondet4_17|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_17|, #race~threads_alive~0=|v_#race~threads_alive~0_50|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet4, #race~threads_alive~0][74], [threadThread3of3ForFork0InUse, 72#L688-2true, 9#L688-5true, 194#true, 200#true, Black: 196#(= |#race~threads_alive~0| 0), 70#L686true, threadThread1of3ForFork0InUse, 68#L705-4true, threadThread2of3ForFork0InUse])
[2023-10-26 09:07:20,235 INFO  L383   tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event
[2023-10-26 09:07:20,235 INFO  L386   tUnfolder$Statistics]:   existing Event has 57 ancestors and is cut-off event
[2023-10-26 09:07:20,235 INFO  L386   tUnfolder$Statistics]:   existing Event has 57 ancestors and is cut-off event
[2023-10-26 09:07:20,235 INFO  L386   tUnfolder$Statistics]:   existing Event has 57 ancestors and is cut-off event
[2023-10-26 09:07:20,235 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([758] L705-4-->L705-1: Formula: (= 0 |v_#race~threads_alive~0_7|)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|}  AuxVars[]  AssignedVars[#race~threads_alive~0][19], [threadThread3of3ForFork0InUse, 72#L688-2true, 156#L688-2true, 200#true, Black: 194#true, 80#L705-1true, 70#L686true, threadThread1of3ForFork0InUse, 196#(= |#race~threads_alive~0| 0), threadThread2of3ForFork0InUse])
[2023-10-26 09:07:20,236 INFO  L383   tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event
[2023-10-26 09:07:20,236 INFO  L386   tUnfolder$Statistics]:   existing Event has 56 ancestors and is cut-off event
[2023-10-26 09:07:20,236 INFO  L386   tUnfolder$Statistics]:   existing Event has 56 ancestors and is cut-off event
[2023-10-26 09:07:20,236 INFO  L386   tUnfolder$Statistics]:   existing Event has 56 ancestors and is cut-off event
[2023-10-26 09:07:20,236 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([941] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_44| |v_threadThread1of3ForFork0_#t~nondet4_13|)  InVars {}  OutVars{threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_13|, #race~threads_alive~0=|v_#race~threads_alive~0_44|}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet4, #race~threads_alive~0][37], [threadThread3of3ForFork0InUse, 200#true, 194#true, 156#L688-2true, Black: 196#(= |#race~threads_alive~0| 0), 70#L686true, threadThread1of3ForFork0InUse, 68#L705-4true, threadThread2of3ForFork0InUse, 119#L688-5true])
[2023-10-26 09:07:20,236 INFO  L383   tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event
[2023-10-26 09:07:20,236 INFO  L386   tUnfolder$Statistics]:   existing Event has 57 ancestors and is cut-off event
[2023-10-26 09:07:20,236 INFO  L386   tUnfolder$Statistics]:   existing Event has 57 ancestors and is cut-off event
[2023-10-26 09:07:20,236 INFO  L386   tUnfolder$Statistics]:   existing Event has 57 ancestors and is cut-off event
[2023-10-26 09:07:20,967 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([984] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_50| |v_threadThread2of3ForFork0_#t~nondet4_17|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_17|, #race~threads_alive~0=|v_#race~threads_alive~0_50|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet4, #race~threads_alive~0][74], [threadThread3of3ForFork0InUse, 72#L688-2true, 9#L688-5true, 194#true, 200#true, Black: 196#(= |#race~threads_alive~0| 0), 6#L688true, threadThread1of3ForFork0InUse, 68#L705-4true, threadThread2of3ForFork0InUse])
[2023-10-26 09:07:20,967 INFO  L383   tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event
[2023-10-26 09:07:20,967 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-10-26 09:07:20,967 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-10-26 09:07:20,967 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-10-26 09:07:20,968 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([758] L705-4-->L705-1: Formula: (= 0 |v_#race~threads_alive~0_7|)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|}  AuxVars[]  AssignedVars[#race~threads_alive~0][19], [threadThread3of3ForFork0InUse, 72#L688-2true, 200#true, 156#L688-2true, Black: 194#true, 80#L705-1true, 6#L688true, threadThread1of3ForFork0InUse, 196#(= |#race~threads_alive~0| 0), threadThread2of3ForFork0InUse])
[2023-10-26 09:07:20,968 INFO  L383   tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event
[2023-10-26 09:07:20,968 INFO  L386   tUnfolder$Statistics]:   existing Event has 58 ancestors and is cut-off event
[2023-10-26 09:07:20,968 INFO  L386   tUnfolder$Statistics]:   existing Event has 58 ancestors and is cut-off event
[2023-10-26 09:07:20,968 INFO  L386   tUnfolder$Statistics]:   existing Event has 58 ancestors and is cut-off event
[2023-10-26 09:07:20,968 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([941] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_44| |v_threadThread1of3ForFork0_#t~nondet4_13|)  InVars {}  OutVars{threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_13|, #race~threads_alive~0=|v_#race~threads_alive~0_44|}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet4, #race~threads_alive~0][37], [threadThread3of3ForFork0InUse, 194#true, 200#true, 156#L688-2true, Black: 196#(= |#race~threads_alive~0| 0), 6#L688true, threadThread1of3ForFork0InUse, 68#L705-4true, threadThread2of3ForFork0InUse, 119#L688-5true])
[2023-10-26 09:07:20,977 INFO  L383   tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event
[2023-10-26 09:07:20,977 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-10-26 09:07:20,977 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-10-26 09:07:20,978 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-10-26 09:07:20,978 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([859] L688-->L688-1: Formula: (= |v_#race~threads_alive~0_10| 0)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_10|}  AuxVars[]  AssignedVars[#race~threads_alive~0][105], [threadThread3of3ForFork0InUse, 72#L688-2true, 200#true, 156#L688-2true, Black: 194#true, 64#L688-1true, threadThread1of3ForFork0InUse, 196#(= |#race~threads_alive~0| 0), 68#L705-4true, threadThread2of3ForFork0InUse])
[2023-10-26 09:07:20,978 INFO  L383   tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event
[2023-10-26 09:07:20,986 INFO  L386   tUnfolder$Statistics]:   existing Event has 58 ancestors and is cut-off event
[2023-10-26 09:07:20,986 INFO  L386   tUnfolder$Statistics]:   existing Event has 58 ancestors and is cut-off event
[2023-10-26 09:07:20,987 INFO  L386   tUnfolder$Statistics]:   existing Event has 58 ancestors and is cut-off event
[2023-10-26 09:07:22,892 INFO  L130       PetriNetUnfolder]: 61911/103015 cut-off events.
[2023-10-26 09:07:22,892 INFO  L131       PetriNetUnfolder]: For 48263/52767 co-relation queries the response was YES.
[2023-10-26 09:07:23,138 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 239892 conditions, 103015 events. 61911/103015 cut-off events. For 48263/52767 co-relation queries the response was YES. Maximal size of possible extension queue 3459. Compared 973491 event pairs, 40172 based on Foata normal form. 626/93124 useless extension candidates. Maximal degree in co-relation 98726. Up to 73895 conditions per place. 
[2023-10-26 09:07:25,249 INFO  L137   encePairwiseOnDemand]: 297/307 looper letters, 65 selfloop transitions, 16 changer transitions 0/121 dead transitions.
[2023-10-26 09:07:25,249 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 121 transitions, 549 flow
[2023-10-26 09:07:25,250 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-26 09:07:25,250 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-26 09:07:25,251 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 571 transitions.
[2023-10-26 09:07:25,265 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6199782844733985
[2023-10-26 09:07:25,265 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 571 transitions.
[2023-10-26 09:07:25,266 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 571 transitions.
[2023-10-26 09:07:25,266 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 09:07:25,266 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 571 transitions.
[2023-10-26 09:07:25,282 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 190.33333333333334) internal successors, (571), 3 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:07:25,284 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 307.0) internal successors, (1228), 4 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:07:25,284 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 307.0) internal successors, (1228), 4 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:07:25,284 INFO  L175             Difference]: Start difference. First operand has 85 places, 89 transitions, 287 flow. Second operand 3 states and 571 transitions.
[2023-10-26 09:07:25,284 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 121 transitions, 549 flow
[2023-10-26 09:07:25,509 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 121 transitions, 509 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-26 09:07:25,511 INFO  L231             Difference]: Finished difference. Result has 87 places, 103 transitions, 405 flow
[2023-10-26 09:07:25,511 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=405, PETRI_PLACES=87, PETRI_TRANSITIONS=103}
[2023-10-26 09:07:25,511 INFO  L288   CegarLoopForPetriNet]: 82 programPoint places, 5 predicate places.
[2023-10-26 09:07:25,512 INFO  L495      AbstractCegarLoop]: Abstraction has has 87 places, 103 transitions, 405 flow
[2023-10-26 09:07:25,512 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 170.0) internal successors, (510), 3 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:07:25,512 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 09:07:25,513 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 09:07:25,513 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2023-10-26 09:07:25,513 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2023-10-26 09:07:25,513 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 09:07:25,513 INFO  L85        PathProgramCache]: Analyzing trace with hash -1657692777, now seen corresponding path program 1 times
[2023-10-26 09:07:25,513 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 09:07:25,514 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915236522]
[2023-10-26 09:07:25,514 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 09:07:25,514 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 09:07:25,521 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 09:07:25,546 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 09:07:25,546 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 09:07:25,547 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915236522]
[2023-10-26 09:07:25,547 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915236522] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 09:07:25,547 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 09:07:25,547 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-26 09:07:25,547 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021603480]
[2023-10-26 09:07:25,547 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 09:07:25,548 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-26 09:07:25,548 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 09:07:25,548 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-26 09:07:25,548 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-26 09:07:25,559 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 176 out of 307
[2023-10-26 09:07:25,560 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 103 transitions, 405 flow. Second operand  has 3 states, 3 states have (on average 177.33333333333334) internal successors, (532), 3 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:07:25,560 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 09:07:25,560 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 307
[2023-10-26 09:07:25,560 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 09:07:32,127 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([941] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_44| |v_threadThread1of3ForFork0_#t~nondet4_13|)  InVars {}  OutVars{threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_13|, #race~threads_alive~0=|v_#race~threads_alive~0_44|}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet4, #race~threads_alive~0][37], [threadThread3of3ForFork0InUse, 200#true, 156#L688-2true, Black: 196#(= |#race~threads_alive~0| 0), 206#true, 149#L685-2true, threadThread1of3ForFork0InUse, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, threadThread2of3ForFork0InUse, 119#L688-5true])
[2023-10-26 09:07:32,127 INFO  L383   tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event
[2023-10-26 09:07:32,127 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-10-26 09:07:32,128 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-10-26 09:07:32,128 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-10-26 09:07:32,136 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([984] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_50| |v_threadThread2of3ForFork0_#t~nondet4_17|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_17|, #race~threads_alive~0=|v_#race~threads_alive~0_50|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet4, #race~threads_alive~0][79], [threadThread3of3ForFork0InUse, 72#L688-2true, 9#L688-5true, 200#true, Black: 196#(= |#race~threads_alive~0| 0), 206#true, 149#L685-2true, threadThread1of3ForFork0InUse, 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), threadThread2of3ForFork0InUse])
[2023-10-26 09:07:32,136 INFO  L383   tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event
[2023-10-26 09:07:32,136 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-10-26 09:07:32,136 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-10-26 09:07:32,136 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-10-26 09:07:32,525 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([941] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_44| |v_threadThread1of3ForFork0_#t~nondet4_13|)  InVars {}  OutVars{threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_13|, #race~threads_alive~0=|v_#race~threads_alive~0_44|}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet4, #race~threads_alive~0][37], [threadThread3of3ForFork0InUse, 116#L685-4true, 200#true, 156#L688-2true, Black: 196#(= |#race~threads_alive~0| 0), 206#true, threadThread1of3ForFork0InUse, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, threadThread2of3ForFork0InUse, 119#L688-5true])
[2023-10-26 09:07:32,526 INFO  L383   tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event
[2023-10-26 09:07:32,526 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2023-10-26 09:07:32,526 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2023-10-26 09:07:32,526 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2023-10-26 09:07:32,532 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([984] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_50| |v_threadThread2of3ForFork0_#t~nondet4_17|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_17|, #race~threads_alive~0=|v_#race~threads_alive~0_50|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet4, #race~threads_alive~0][79], [threadThread3of3ForFork0InUse, 72#L688-2true, 116#L685-4true, 9#L688-5true, 200#true, Black: 196#(= |#race~threads_alive~0| 0), 206#true, threadThread1of3ForFork0InUse, 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), threadThread2of3ForFork0InUse])
[2023-10-26 09:07:32,532 INFO  L383   tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event
[2023-10-26 09:07:32,532 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2023-10-26 09:07:32,532 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2023-10-26 09:07:32,532 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2023-10-26 09:07:34,598 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([941] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_44| |v_threadThread1of3ForFork0_#t~nondet4_13|)  InVars {}  OutVars{threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_13|, #race~threads_alive~0=|v_#race~threads_alive~0_44|}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet4, #race~threads_alive~0][37], [threadThread3of3ForFork0InUse, 200#true, 156#L688-2true, Black: 196#(= |#race~threads_alive~0| 0), 70#L686true, 206#true, threadThread1of3ForFork0InUse, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, threadThread2of3ForFork0InUse, 119#L688-5true])
[2023-10-26 09:07:34,599 INFO  L383   tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event
[2023-10-26 09:07:34,599 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-26 09:07:34,599 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-26 09:07:34,599 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-26 09:07:34,608 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([984] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_50| |v_threadThread2of3ForFork0_#t~nondet4_17|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_17|, #race~threads_alive~0=|v_#race~threads_alive~0_50|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet4, #race~threads_alive~0][79], [threadThread3of3ForFork0InUse, 72#L688-2true, 9#L688-5true, 200#true, Black: 196#(= |#race~threads_alive~0| 0), 70#L686true, 206#true, threadThread1of3ForFork0InUse, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, threadThread2of3ForFork0InUse])
[2023-10-26 09:07:34,608 INFO  L383   tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event
[2023-10-26 09:07:34,609 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-26 09:07:34,609 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-26 09:07:34,610 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-26 09:07:34,985 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([859] L688-->L688-1: Formula: (= |v_#race~threads_alive~0_10| 0)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_10|}  AuxVars[]  AssignedVars[#race~threads_alive~0][107], [threadThread3of3ForFork0InUse, 72#L688-2true, 200#true, 156#L688-2true, Black: 194#true, 64#L688-1true, 206#true, threadThread1of3ForFork0InUse, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, threadThread2of3ForFork0InUse])
[2023-10-26 09:07:34,985 INFO  L383   tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event
[2023-10-26 09:07:34,985 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-10-26 09:07:34,986 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-10-26 09:07:34,986 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-10-26 09:07:35,582 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([941] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_44| |v_threadThread1of3ForFork0_#t~nondet4_13|)  InVars {}  OutVars{threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_13|, #race~threads_alive~0=|v_#race~threads_alive~0_44|}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet4, #race~threads_alive~0][37], [threadThread3of3ForFork0InUse, 200#true, 156#L688-2true, Black: 196#(= |#race~threads_alive~0| 0), 6#L688true, 206#true, threadThread1of3ForFork0InUse, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, threadThread2of3ForFork0InUse, 119#L688-5true])
[2023-10-26 09:07:35,583 INFO  L383   tUnfolder$Statistics]: this new event has 65 ancestors and is cut-off event
[2023-10-26 09:07:35,583 INFO  L386   tUnfolder$Statistics]:   existing Event has 65 ancestors and is cut-off event
[2023-10-26 09:07:35,583 INFO  L386   tUnfolder$Statistics]:   existing Event has 65 ancestors and is cut-off event
[2023-10-26 09:07:35,583 INFO  L386   tUnfolder$Statistics]:   existing Event has 65 ancestors and is cut-off event
[2023-10-26 09:07:35,586 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([984] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_50| |v_threadThread2of3ForFork0_#t~nondet4_17|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_17|, #race~threads_alive~0=|v_#race~threads_alive~0_50|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet4, #race~threads_alive~0][79], [threadThread3of3ForFork0InUse, 72#L688-2true, 9#L688-5true, 200#true, Black: 196#(= |#race~threads_alive~0| 0), 6#L688true, 206#true, threadThread1of3ForFork0InUse, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, threadThread2of3ForFork0InUse])
[2023-10-26 09:07:35,586 INFO  L383   tUnfolder$Statistics]: this new event has 65 ancestors and is cut-off event
[2023-10-26 09:07:35,586 INFO  L386   tUnfolder$Statistics]:   existing Event has 65 ancestors and is cut-off event
[2023-10-26 09:07:35,587 INFO  L386   tUnfolder$Statistics]:   existing Event has 65 ancestors and is cut-off event
[2023-10-26 09:07:35,587 INFO  L386   tUnfolder$Statistics]:   existing Event has 65 ancestors and is cut-off event
[2023-10-26 09:07:37,655 INFO  L130       PetriNetUnfolder]: 70720/120727 cut-off events.
[2023-10-26 09:07:37,655 INFO  L131       PetriNetUnfolder]: For 84139/95985 co-relation queries the response was YES.
[2023-10-26 09:07:37,977 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 288992 conditions, 120727 events. 70720/120727 cut-off events. For 84139/95985 co-relation queries the response was YES. Maximal size of possible extension queue 4315. Compared 1202860 event pairs, 40332 based on Foata normal form. 2269/110394 useless extension candidates. Maximal degree in co-relation 124221. Up to 73684 conditions per place. 
[2023-10-26 09:07:38,465 INFO  L137   encePairwiseOnDemand]: 301/307 looper letters, 76 selfloop transitions, 5 changer transitions 0/131 dead transitions.
[2023-10-26 09:07:38,465 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 131 transitions, 655 flow
[2023-10-26 09:07:38,465 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-26 09:07:38,465 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-26 09:07:38,474 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 591 transitions.
[2023-10-26 09:07:38,474 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6416938110749185
[2023-10-26 09:07:38,474 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 591 transitions.
[2023-10-26 09:07:38,474 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 591 transitions.
[2023-10-26 09:07:38,475 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 09:07:38,475 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 591 transitions.
[2023-10-26 09:07:38,485 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 197.0) internal successors, (591), 3 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:07:38,487 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 307.0) internal successors, (1228), 4 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:07:38,492 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 307.0) internal successors, (1228), 4 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:07:38,493 INFO  L175             Difference]: Start difference. First operand has 87 places, 103 transitions, 405 flow. Second operand 3 states and 591 transitions.
[2023-10-26 09:07:38,493 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 131 transitions, 655 flow
[2023-10-26 09:07:38,643 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 131 transitions, 623 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-26 09:07:38,644 INFO  L231             Difference]: Finished difference. Result has 89 places, 107 transitions, 411 flow
[2023-10-26 09:07:38,657 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=373, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=411, PETRI_PLACES=89, PETRI_TRANSITIONS=107}
[2023-10-26 09:07:38,658 INFO  L288   CegarLoopForPetriNet]: 82 programPoint places, 7 predicate places.
[2023-10-26 09:07:38,658 INFO  L495      AbstractCegarLoop]: Abstraction has has 89 places, 107 transitions, 411 flow
[2023-10-26 09:07:38,658 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 177.33333333333334) internal successors, (532), 3 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:07:38,660 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 09:07:38,660 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 09:07:38,660 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2023-10-26 09:07:38,660 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2023-10-26 09:07:38,661 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 09:07:38,661 INFO  L85        PathProgramCache]: Analyzing trace with hash -2092777545, now seen corresponding path program 1 times
[2023-10-26 09:07:38,661 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 09:07:38,661 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405121748]
[2023-10-26 09:07:38,661 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 09:07:38,661 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 09:07:38,685 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 09:07:38,712 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 09:07:38,712 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 09:07:38,712 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405121748]
[2023-10-26 09:07:38,712 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405121748] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 09:07:38,712 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 09:07:38,713 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-26 09:07:38,713 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025057884]
[2023-10-26 09:07:38,713 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 09:07:38,714 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-26 09:07:38,714 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 09:07:38,714 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-26 09:07:38,714 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-26 09:07:38,741 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 174 out of 307
[2023-10-26 09:07:38,741 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 107 transitions, 411 flow. Second operand  has 3 states, 3 states have (on average 177.66666666666666) internal successors, (533), 3 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:07:38,742 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 09:07:38,742 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 307
[2023-10-26 09:07:38,742 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 09:07:47,669 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([941] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_44| |v_threadThread1of3ForFork0_#t~nondet4_13|)  InVars {}  OutVars{threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_13|, #race~threads_alive~0=|v_#race~threads_alive~0_44|}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet4, #race~threads_alive~0][41], [threadThread3of3ForFork0InUse, Black: 208#(= |#race~data~0| 0), 156#L688-2true, Black: 196#(= |#race~threads_alive~0| 0), 206#true, 149#L685-2true, threadThread1of3ForFork0InUse, 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), threadThread2of3ForFork0InUse, 212#true, 119#L688-5true])
[2023-10-26 09:07:47,670 INFO  L383   tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event
[2023-10-26 09:07:47,670 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-10-26 09:07:47,670 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-10-26 09:07:47,670 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-10-26 09:07:47,678 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([984] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_50| |v_threadThread2of3ForFork0_#t~nondet4_17|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_17|, #race~threads_alive~0=|v_#race~threads_alive~0_50|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet4, #race~threads_alive~0][86], [threadThread3of3ForFork0InUse, 72#L688-2true, Black: 208#(= |#race~data~0| 0), 9#L688-5true, Black: 196#(= |#race~threads_alive~0| 0), 206#true, 149#L685-2true, threadThread1of3ForFork0InUse, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, threadThread2of3ForFork0InUse, 212#true])
[2023-10-26 09:07:47,678 INFO  L383   tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event
[2023-10-26 09:07:47,678 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-10-26 09:07:47,678 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-10-26 09:07:47,678 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-10-26 09:07:48,144 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([941] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_44| |v_threadThread1of3ForFork0_#t~nondet4_13|)  InVars {}  OutVars{threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_13|, #race~threads_alive~0=|v_#race~threads_alive~0_44|}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet4, #race~threads_alive~0][41], [threadThread3of3ForFork0InUse, 116#L685-4true, Black: 208#(= |#race~data~0| 0), 156#L688-2true, Black: 196#(= |#race~threads_alive~0| 0), 206#true, threadThread1of3ForFork0InUse, 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), threadThread2of3ForFork0InUse, 119#L688-5true, 212#true])
[2023-10-26 09:07:48,144 INFO  L383   tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event
[2023-10-26 09:07:48,144 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2023-10-26 09:07:48,144 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2023-10-26 09:07:48,144 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2023-10-26 09:07:48,149 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([984] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_50| |v_threadThread2of3ForFork0_#t~nondet4_17|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_17|, #race~threads_alive~0=|v_#race~threads_alive~0_50|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet4, #race~threads_alive~0][86], [threadThread3of3ForFork0InUse, 72#L688-2true, 116#L685-4true, 9#L688-5true, Black: 208#(= |#race~data~0| 0), Black: 196#(= |#race~threads_alive~0| 0), 206#true, threadThread1of3ForFork0InUse, 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), threadThread2of3ForFork0InUse, 212#true])
[2023-10-26 09:07:48,150 INFO  L383   tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event
[2023-10-26 09:07:48,150 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2023-10-26 09:07:48,150 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2023-10-26 09:07:48,150 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2023-10-26 09:07:48,916 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([941] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_44| |v_threadThread1of3ForFork0_#t~nondet4_13|)  InVars {}  OutVars{threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_13|, #race~threads_alive~0=|v_#race~threads_alive~0_44|}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet4, #race~threads_alive~0][41], [threadThread3of3ForFork0InUse, Black: 208#(= |#race~data~0| 0), 156#L688-2true, Black: 196#(= |#race~threads_alive~0| 0), 70#L686true, 206#true, threadThread1of3ForFork0InUse, 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), threadThread2of3ForFork0InUse, 119#L688-5true, 212#true])
[2023-10-26 09:07:48,916 INFO  L383   tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event
[2023-10-26 09:07:48,916 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-26 09:07:48,916 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-26 09:07:48,916 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-26 09:07:48,921 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([984] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_50| |v_threadThread2of3ForFork0_#t~nondet4_17|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_17|, #race~threads_alive~0=|v_#race~threads_alive~0_50|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet4, #race~threads_alive~0][86], [threadThread3of3ForFork0InUse, 72#L688-2true, 9#L688-5true, Black: 208#(= |#race~data~0| 0), Black: 196#(= |#race~threads_alive~0| 0), 70#L686true, 206#true, threadThread1of3ForFork0InUse, 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), threadThread2of3ForFork0InUse, 212#true])
[2023-10-26 09:07:48,921 INFO  L383   tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event
[2023-10-26 09:07:48,921 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-26 09:07:48,921 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-26 09:07:48,921 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-26 09:07:49,329 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([859] L688-->L688-1: Formula: (= |v_#race~threads_alive~0_10| 0)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_10|}  AuxVars[]  AssignedVars[#race~threads_alive~0][125], [threadThread3of3ForFork0InUse, 72#L688-2true, Black: 208#(= |#race~data~0| 0), 156#L688-2true, Black: 194#true, 206#true, 64#L688-1true, threadThread1of3ForFork0InUse, 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), threadThread2of3ForFork0InUse, 212#true])
[2023-10-26 09:07:49,330 INFO  L383   tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event
[2023-10-26 09:07:49,330 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-10-26 09:07:49,330 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-10-26 09:07:49,330 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-10-26 09:07:49,994 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([941] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_44| |v_threadThread1of3ForFork0_#t~nondet4_13|)  InVars {}  OutVars{threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_13|, #race~threads_alive~0=|v_#race~threads_alive~0_44|}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet4, #race~threads_alive~0][41], [threadThread3of3ForFork0InUse, Black: 208#(= |#race~data~0| 0), 156#L688-2true, Black: 196#(= |#race~threads_alive~0| 0), 6#L688true, 206#true, threadThread1of3ForFork0InUse, 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), threadThread2of3ForFork0InUse, 212#true, 119#L688-5true])
[2023-10-26 09:07:49,994 INFO  L383   tUnfolder$Statistics]: this new event has 65 ancestors and is cut-off event
[2023-10-26 09:07:49,994 INFO  L386   tUnfolder$Statistics]:   existing Event has 65 ancestors and is cut-off event
[2023-10-26 09:07:49,994 INFO  L386   tUnfolder$Statistics]:   existing Event has 65 ancestors and is cut-off event
[2023-10-26 09:07:49,995 INFO  L386   tUnfolder$Statistics]:   existing Event has 65 ancestors and is cut-off event
[2023-10-26 09:07:49,998 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([984] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_50| |v_threadThread2of3ForFork0_#t~nondet4_17|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_17|, #race~threads_alive~0=|v_#race~threads_alive~0_50|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet4, #race~threads_alive~0][86], [threadThread3of3ForFork0InUse, 72#L688-2true, 9#L688-5true, Black: 208#(= |#race~data~0| 0), Black: 196#(= |#race~threads_alive~0| 0), 6#L688true, 206#true, threadThread1of3ForFork0InUse, 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), threadThread2of3ForFork0InUse, 212#true])
[2023-10-26 09:07:49,998 INFO  L383   tUnfolder$Statistics]: this new event has 65 ancestors and is cut-off event
[2023-10-26 09:07:49,998 INFO  L386   tUnfolder$Statistics]:   existing Event has 65 ancestors and is cut-off event
[2023-10-26 09:07:49,998 INFO  L386   tUnfolder$Statistics]:   existing Event has 65 ancestors and is cut-off event
[2023-10-26 09:07:49,998 INFO  L386   tUnfolder$Statistics]:   existing Event has 65 ancestors and is cut-off event
[2023-10-26 09:07:52,091 INFO  L130       PetriNetUnfolder]: 80048/137390 cut-off events.
[2023-10-26 09:07:52,091 INFO  L131       PetriNetUnfolder]: For 90837/104282 co-relation queries the response was YES.
[2023-10-26 09:07:52,518 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 333514 conditions, 137390 events. 80048/137390 cut-off events. For 90837/104282 co-relation queries the response was YES. Maximal size of possible extension queue 5073. Compared 1412577 event pairs, 45808 based on Foata normal form. 2771/124165 useless extension candidates. Maximal degree in co-relation 239260. Up to 86226 conditions per place. 
[2023-10-26 09:07:53,105 INFO  L137   encePairwiseOnDemand]: 300/307 looper letters, 85 selfloop transitions, 9 changer transitions 0/146 dead transitions.
[2023-10-26 09:07:53,105 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 146 transitions, 747 flow
[2023-10-26 09:07:53,106 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-26 09:07:53,106 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-26 09:07:53,107 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 588 transitions.
[2023-10-26 09:07:53,107 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6384364820846905
[2023-10-26 09:07:53,107 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 588 transitions.
[2023-10-26 09:07:53,107 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 588 transitions.
[2023-10-26 09:07:53,108 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 09:07:53,108 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 588 transitions.
[2023-10-26 09:07:53,110 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 196.0) internal successors, (588), 3 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:07:53,111 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 307.0) internal successors, (1228), 4 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:07:53,136 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 307.0) internal successors, (1228), 4 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:07:53,136 INFO  L175             Difference]: Start difference. First operand has 89 places, 107 transitions, 411 flow. Second operand 3 states and 588 transitions.
[2023-10-26 09:07:53,136 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 146 transitions, 747 flow
[2023-10-26 09:07:55,236 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 146 transitions, 731 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-26 09:07:55,250 INFO  L231             Difference]: Finished difference. Result has 91 places, 114 transitions, 477 flow
[2023-10-26 09:07:55,252 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=401, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=477, PETRI_PLACES=91, PETRI_TRANSITIONS=114}
[2023-10-26 09:07:55,252 INFO  L288   CegarLoopForPetriNet]: 82 programPoint places, 9 predicate places.
[2023-10-26 09:07:55,265 INFO  L495      AbstractCegarLoop]: Abstraction has has 91 places, 114 transitions, 477 flow
[2023-10-26 09:07:55,266 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 177.66666666666666) internal successors, (533), 3 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:07:55,266 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 09:07:55,267 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 09:07:55,267 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2023-10-26 09:07:55,267 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2023-10-26 09:07:55,268 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 09:07:55,268 INFO  L85        PathProgramCache]: Analyzing trace with hash -694365201, now seen corresponding path program 1 times
[2023-10-26 09:07:55,268 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 09:07:55,269 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321574735]
[2023-10-26 09:07:55,269 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 09:07:55,269 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 09:07:55,277 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 09:07:55,302 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 09:07:55,302 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 09:07:55,303 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321574735]
[2023-10-26 09:07:55,303 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321574735] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 09:07:55,303 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 09:07:55,303 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-26 09:07:55,303 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192526313]
[2023-10-26 09:07:55,303 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 09:07:55,303 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-26 09:07:55,304 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 09:07:55,304 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-26 09:07:55,304 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-26 09:07:55,333 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 169 out of 307
[2023-10-26 09:07:55,334 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 114 transitions, 477 flow. Second operand  has 3 states, 3 states have (on average 174.33333333333334) internal successors, (523), 3 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:07:55,349 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 09:07:55,349 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 307
[2023-10-26 09:07:55,349 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 09:08:03,327 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1031] L708-2-->ULTIMATE.startEXIT: Formula: (and (= |v_ULTIMATE.start_main_#res#1_50| v_~data~0_52) (= |v_ULTIMATE.start_main_#res#1_50| |v_ULTIMATE.start_#t~ret16#1_18|))  InVars {~data~0=v_~data~0_52}  OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_50|, ULTIMATE.start_#t~ret16#1=|v_ULTIMATE.start_#t~ret16#1_18|, ~data~0=v_~data~0_52}  AuxVars[]  AssignedVars[ULTIMATE.start_main_#res#1, ULTIMATE.start_#t~ret16#1][20], [threadThread3of3ForFork0InUse, 2#ULTIMATE.startEXITtrue, Black: 194#true, 14#L685true, 122#L688-1true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 206#true, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 96#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 212#true])
[2023-10-26 09:08:03,327 INFO  L383   tUnfolder$Statistics]: this new event has 58 ancestors and is cut-off event
[2023-10-26 09:08:03,327 INFO  L386   tUnfolder$Statistics]:   existing Event has 58 ancestors and is cut-off event
[2023-10-26 09:08:03,327 INFO  L386   tUnfolder$Statistics]:   existing Event has 58 ancestors and is cut-off event
[2023-10-26 09:08:03,327 INFO  L386   tUnfolder$Statistics]:   existing Event has 58 ancestors and is cut-off event
[2023-10-26 09:08:04,256 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1031] L708-2-->ULTIMATE.startEXIT: Formula: (and (= |v_ULTIMATE.start_main_#res#1_50| v_~data~0_52) (= |v_ULTIMATE.start_main_#res#1_50| |v_ULTIMATE.start_#t~ret16#1_18|))  InVars {~data~0=v_~data~0_52}  OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_50|, ULTIMATE.start_#t~ret16#1=|v_ULTIMATE.start_#t~ret16#1_18|, ~data~0=v_~data~0_52}  AuxVars[]  AssignedVars[ULTIMATE.start_main_#res#1, ULTIMATE.start_#t~ret16#1][20], [threadThread3of3ForFork0InUse, 2#ULTIMATE.startEXITtrue, Black: 194#true, 122#L688-1true, 149#L685-2true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 206#true, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 96#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 212#true])
[2023-10-26 09:08:04,256 INFO  L383   tUnfolder$Statistics]: this new event has 59 ancestors and is cut-off event
[2023-10-26 09:08:04,256 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-10-26 09:08:04,256 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-10-26 09:08:04,256 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-10-26 09:08:04,408 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([941] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_44| |v_threadThread1of3ForFork0_#t~nondet4_13|)  InVars {}  OutVars{threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_13|, #race~threads_alive~0=|v_#race~threads_alive~0_44|}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet4, #race~threads_alive~0][35], [threadThread3of3ForFork0InUse, 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), Black: 196#(= |#race~threads_alive~0| 0), 149#L685-2true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 119#L688-5true, Black: 208#(= |#race~data~0| 0), 156#L688-2true, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), threadThread1of3ForFork0InUse, 68#L705-4true, threadThread2of3ForFork0InUse, 212#true])
[2023-10-26 09:08:04,408 INFO  L383   tUnfolder$Statistics]: this new event has 60 ancestors and is cut-off event
[2023-10-26 09:08:04,408 INFO  L386   tUnfolder$Statistics]:   existing Event has 55 ancestors and is cut-off event
[2023-10-26 09:08:04,408 INFO  L386   tUnfolder$Statistics]:   existing Event has 55 ancestors and is cut-off event
[2023-10-26 09:08:04,408 INFO  L386   tUnfolder$Statistics]:   existing Event has 55 ancestors and is cut-off event
[2023-10-26 09:08:04,409 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([758] L705-4-->L705-1: Formula: (= 0 |v_#race~threads_alive~0_7|)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|}  AuxVars[]  AssignedVars[#race~threads_alive~0][18], [threadThread3of3ForFork0InUse, 72#L688-2true, Black: 194#true, 80#L705-1true, 149#L685-2true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), 156#L688-2true, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 212#true])
[2023-10-26 09:08:04,409 INFO  L383   tUnfolder$Statistics]: this new event has 59 ancestors and is cut-off event
[2023-10-26 09:08:04,409 INFO  L386   tUnfolder$Statistics]:   existing Event has 54 ancestors and is cut-off event
[2023-10-26 09:08:04,409 INFO  L386   tUnfolder$Statistics]:   existing Event has 54 ancestors and is cut-off event
[2023-10-26 09:08:04,409 INFO  L386   tUnfolder$Statistics]:   existing Event has 54 ancestors and is cut-off event
[2023-10-26 09:08:04,409 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([984] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_50| |v_threadThread2of3ForFork0_#t~nondet4_17|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_17|, #race~threads_alive~0=|v_#race~threads_alive~0_50|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet4, #race~threads_alive~0][91], [threadThread3of3ForFork0InUse, 72#L688-2true, 9#L688-5true, Black: 196#(= |#race~threads_alive~0| 0), 149#L685-2true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), threadThread1of3ForFork0InUse, 68#L705-4true, threadThread2of3ForFork0InUse, 212#true])
[2023-10-26 09:08:04,409 INFO  L383   tUnfolder$Statistics]: this new event has 60 ancestors and is cut-off event
[2023-10-26 09:08:04,409 INFO  L386   tUnfolder$Statistics]:   existing Event has 55 ancestors and is cut-off event
[2023-10-26 09:08:04,409 INFO  L386   tUnfolder$Statistics]:   existing Event has 55 ancestors and is cut-off event
[2023-10-26 09:08:04,409 INFO  L386   tUnfolder$Statistics]:   existing Event has 55 ancestors and is cut-off event
[2023-10-26 09:08:05,325 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([985] L685-2-->L685-4: Formula: (= |v_#race~data~0_21| |v_threadThread3of3ForFork0_#t~nondet2_15|)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_21|, threadThread3of3ForFork0_#t~nondet2=|v_threadThread3of3ForFork0_#t~nondet2_15|}  AuxVars[]  AssignedVars[#race~data~0, threadThread3of3ForFork0_#t~nondet2][120], [threadThread3of3ForFork0InUse, Black: 194#true, 122#L688-1true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 116#L685-4true, Black: 208#(= |#race~data~0| 0), 96#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 168#L708-2true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 212#true])
[2023-10-26 09:08:05,326 INFO  L383   tUnfolder$Statistics]: this new event has 59 ancestors and is not cut-off event
[2023-10-26 09:08:05,326 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is not cut-off event
[2023-10-26 09:08:05,326 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is not cut-off event
[2023-10-26 09:08:05,326 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is not cut-off event
[2023-10-26 09:08:05,434 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([941] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_44| |v_threadThread1of3ForFork0_#t~nondet4_13|)  InVars {}  OutVars{threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_13|, #race~threads_alive~0=|v_#race~threads_alive~0_44|}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet4, #race~threads_alive~0][35], [threadThread3of3ForFork0InUse, 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), Black: 196#(= |#race~threads_alive~0| 0), Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 119#L688-5true, 116#L685-4true, Black: 208#(= |#race~data~0| 0), 156#L688-2true, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), threadThread1of3ForFork0InUse, 68#L705-4true, threadThread2of3ForFork0InUse, 212#true])
[2023-10-26 09:08:05,434 INFO  L383   tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event
[2023-10-26 09:08:05,434 INFO  L386   tUnfolder$Statistics]:   existing Event has 56 ancestors and is cut-off event
[2023-10-26 09:08:05,434 INFO  L386   tUnfolder$Statistics]:   existing Event has 56 ancestors and is cut-off event
[2023-10-26 09:08:05,434 INFO  L386   tUnfolder$Statistics]:   existing Event has 56 ancestors and is cut-off event
[2023-10-26 09:08:05,435 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([758] L705-4-->L705-1: Formula: (= 0 |v_#race~threads_alive~0_7|)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|}  AuxVars[]  AssignedVars[#race~threads_alive~0][18], [threadThread3of3ForFork0InUse, 72#L688-2true, Black: 194#true, 80#L705-1true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 116#L685-4true, Black: 208#(= |#race~data~0| 0), 156#L688-2true, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 212#true])
[2023-10-26 09:08:05,435 INFO  L383   tUnfolder$Statistics]: this new event has 60 ancestors and is cut-off event
[2023-10-26 09:08:05,435 INFO  L386   tUnfolder$Statistics]:   existing Event has 55 ancestors and is cut-off event
[2023-10-26 09:08:05,435 INFO  L386   tUnfolder$Statistics]:   existing Event has 55 ancestors and is cut-off event
[2023-10-26 09:08:05,435 INFO  L386   tUnfolder$Statistics]:   existing Event has 55 ancestors and is cut-off event
[2023-10-26 09:08:05,435 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([984] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_50| |v_threadThread2of3ForFork0_#t~nondet4_17|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_17|, #race~threads_alive~0=|v_#race~threads_alive~0_50|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet4, #race~threads_alive~0][91], [threadThread3of3ForFork0InUse, 72#L688-2true, 9#L688-5true, Black: 196#(= |#race~threads_alive~0| 0), 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 116#L685-4true, Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), threadThread1of3ForFork0InUse, 68#L705-4true, threadThread2of3ForFork0InUse, 212#true])
[2023-10-26 09:08:05,435 INFO  L383   tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event
[2023-10-26 09:08:05,435 INFO  L386   tUnfolder$Statistics]:   existing Event has 56 ancestors and is cut-off event
[2023-10-26 09:08:05,435 INFO  L386   tUnfolder$Statistics]:   existing Event has 56 ancestors and is cut-off event
[2023-10-26 09:08:05,436 INFO  L386   tUnfolder$Statistics]:   existing Event has 56 ancestors and is cut-off event
[2023-10-26 09:08:06,417 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([941] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_44| |v_threadThread1of3ForFork0_#t~nondet4_13|)  InVars {}  OutVars{threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_13|, #race~threads_alive~0=|v_#race~threads_alive~0_44|}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet4, #race~threads_alive~0][35], [threadThread3of3ForFork0InUse, 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), Black: 196#(= |#race~threads_alive~0| 0), 70#L686true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 119#L688-5true, Black: 208#(= |#race~data~0| 0), 156#L688-2true, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), threadThread1of3ForFork0InUse, 68#L705-4true, threadThread2of3ForFork0InUse, 212#true])
[2023-10-26 09:08:06,417 INFO  L383   tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event
[2023-10-26 09:08:06,418 INFO  L386   tUnfolder$Statistics]:   existing Event has 57 ancestors and is cut-off event
[2023-10-26 09:08:06,418 INFO  L386   tUnfolder$Statistics]:   existing Event has 57 ancestors and is cut-off event
[2023-10-26 09:08:06,418 INFO  L386   tUnfolder$Statistics]:   existing Event has 57 ancestors and is cut-off event
[2023-10-26 09:08:06,418 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([758] L705-4-->L705-1: Formula: (= 0 |v_#race~threads_alive~0_7|)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|}  AuxVars[]  AssignedVars[#race~threads_alive~0][18], [threadThread3of3ForFork0InUse, 72#L688-2true, Black: 194#true, 70#L686true, 80#L705-1true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), 156#L688-2true, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 212#true])
[2023-10-26 09:08:06,418 INFO  L383   tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event
[2023-10-26 09:08:06,418 INFO  L386   tUnfolder$Statistics]:   existing Event has 56 ancestors and is cut-off event
[2023-10-26 09:08:06,418 INFO  L386   tUnfolder$Statistics]:   existing Event has 56 ancestors and is cut-off event
[2023-10-26 09:08:06,429 INFO  L386   tUnfolder$Statistics]:   existing Event has 56 ancestors and is cut-off event
[2023-10-26 09:08:06,429 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([984] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_50| |v_threadThread2of3ForFork0_#t~nondet4_17|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_17|, #race~threads_alive~0=|v_#race~threads_alive~0_50|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet4, #race~threads_alive~0][91], [threadThread3of3ForFork0InUse, 72#L688-2true, 9#L688-5true, Black: 196#(= |#race~threads_alive~0| 0), 70#L686true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), threadThread1of3ForFork0InUse, 68#L705-4true, threadThread2of3ForFork0InUse, 212#true])
[2023-10-26 09:08:06,429 INFO  L383   tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event
[2023-10-26 09:08:06,429 INFO  L386   tUnfolder$Statistics]:   existing Event has 57 ancestors and is cut-off event
[2023-10-26 09:08:06,429 INFO  L386   tUnfolder$Statistics]:   existing Event has 57 ancestors and is cut-off event
[2023-10-26 09:08:06,430 INFO  L386   tUnfolder$Statistics]:   existing Event has 57 ancestors and is cut-off event
[2023-10-26 09:08:08,534 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([941] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_44| |v_threadThread1of3ForFork0_#t~nondet4_13|)  InVars {}  OutVars{threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_13|, #race~threads_alive~0=|v_#race~threads_alive~0_44|}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet4, #race~threads_alive~0][35], [threadThread3of3ForFork0InUse, 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), Black: 196#(= |#race~threads_alive~0| 0), 6#L688true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 119#L688-5true, Black: 208#(= |#race~data~0| 0), 156#L688-2true, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), threadThread1of3ForFork0InUse, 68#L705-4true, threadThread2of3ForFork0InUse, 212#true])
[2023-10-26 09:08:08,534 INFO  L383   tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event
[2023-10-26 09:08:08,534 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-10-26 09:08:08,534 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-10-26 09:08:08,534 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-10-26 09:08:08,534 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([758] L705-4-->L705-1: Formula: (= 0 |v_#race~threads_alive~0_7|)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|}  AuxVars[]  AssignedVars[#race~threads_alive~0][18], [threadThread3of3ForFork0InUse, 72#L688-2true, Black: 194#true, 80#L705-1true, 6#L688true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), 156#L688-2true, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 212#true])
[2023-10-26 09:08:08,535 INFO  L383   tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event
[2023-10-26 09:08:08,535 INFO  L386   tUnfolder$Statistics]:   existing Event has 58 ancestors and is cut-off event
[2023-10-26 09:08:08,535 INFO  L386   tUnfolder$Statistics]:   existing Event has 58 ancestors and is cut-off event
[2023-10-26 09:08:08,535 INFO  L386   tUnfolder$Statistics]:   existing Event has 58 ancestors and is cut-off event
[2023-10-26 09:08:08,537 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([984] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_50| |v_threadThread2of3ForFork0_#t~nondet4_17|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_17|, #race~threads_alive~0=|v_#race~threads_alive~0_50|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet4, #race~threads_alive~0][91], [threadThread3of3ForFork0InUse, 72#L688-2true, 9#L688-5true, Black: 196#(= |#race~threads_alive~0| 0), 6#L688true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), threadThread1of3ForFork0InUse, 68#L705-4true, threadThread2of3ForFork0InUse, 212#true])
[2023-10-26 09:08:08,537 INFO  L383   tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event
[2023-10-26 09:08:08,537 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-10-26 09:08:08,537 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-10-26 09:08:08,537 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-10-26 09:08:08,538 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([859] L688-->L688-1: Formula: (= |v_#race~threads_alive~0_10| 0)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_10|}  AuxVars[]  AssignedVars[#race~threads_alive~0][129], [threadThread3of3ForFork0InUse, 72#L688-2true, Black: 194#true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), 156#L688-2true, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 64#L688-1true, threadThread1of3ForFork0InUse, 68#L705-4true, threadThread2of3ForFork0InUse, 212#true])
[2023-10-26 09:08:08,538 INFO  L383   tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event
[2023-10-26 09:08:08,538 INFO  L386   tUnfolder$Statistics]:   existing Event has 58 ancestors and is cut-off event
[2023-10-26 09:08:08,538 INFO  L386   tUnfolder$Statistics]:   existing Event has 58 ancestors and is cut-off event
[2023-10-26 09:08:08,538 INFO  L386   tUnfolder$Statistics]:   existing Event has 58 ancestors and is cut-off event
[2023-10-26 09:08:15,564 INFO  L130       PetriNetUnfolder]: 117057/193039 cut-off events.
[2023-10-26 09:08:15,564 INFO  L131       PetriNetUnfolder]: For 158026/169600 co-relation queries the response was YES.
[2023-10-26 09:08:16,986 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 504642 conditions, 193039 events. 117057/193039 cut-off events. For 158026/169600 co-relation queries the response was YES. Maximal size of possible extension queue 6334. Compared 1920667 event pairs, 63393 based on Foata normal form. 1083/172268 useless extension candidates. Maximal degree in co-relation 281947. Up to 136766 conditions per place. 
[2023-10-26 09:08:17,819 INFO  L137   encePairwiseOnDemand]: 296/307 looper letters, 95 selfloop transitions, 28 changer transitions 0/164 dead transitions.
[2023-10-26 09:08:17,820 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 164 transitions, 937 flow
[2023-10-26 09:08:17,820 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-26 09:08:17,820 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-26 09:08:17,821 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 580 transitions.
[2023-10-26 09:08:17,822 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6297502714440825
[2023-10-26 09:08:17,822 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 580 transitions.
[2023-10-26 09:08:17,822 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 580 transitions.
[2023-10-26 09:08:17,822 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 09:08:17,822 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 580 transitions.
[2023-10-26 09:08:17,823 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 193.33333333333334) internal successors, (580), 3 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:08:17,824 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 307.0) internal successors, (1228), 4 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:08:17,824 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 307.0) internal successors, (1228), 4 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:08:17,825 INFO  L175             Difference]: Start difference. First operand has 91 places, 114 transitions, 477 flow. Second operand 3 states and 580 transitions.
[2023-10-26 09:08:17,825 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 164 transitions, 937 flow
[2023-10-26 09:08:18,479 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 164 transitions, 919 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-26 09:08:18,480 INFO  L231             Difference]: Finished difference. Result has 93 places, 138 transitions, 749 flow
[2023-10-26 09:08:18,480 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=459, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=749, PETRI_PLACES=93, PETRI_TRANSITIONS=138}
[2023-10-26 09:08:18,481 INFO  L288   CegarLoopForPetriNet]: 82 programPoint places, 11 predicate places.
[2023-10-26 09:08:18,481 INFO  L495      AbstractCegarLoop]: Abstraction has has 93 places, 138 transitions, 749 flow
[2023-10-26 09:08:18,481 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 174.33333333333334) internal successors, (523), 3 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:08:18,481 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 09:08:18,482 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 09:08:18,482 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2023-10-26 09:08:18,482 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2023-10-26 09:08:18,482 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 09:08:18,482 INFO  L85        PathProgramCache]: Analyzing trace with hash -1017840435, now seen corresponding path program 1 times
[2023-10-26 09:08:18,483 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 09:08:18,483 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877352657]
[2023-10-26 09:08:18,483 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 09:08:18,483 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 09:08:18,531 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 09:08:18,628 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 09:08:18,628 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 09:08:18,628 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877352657]
[2023-10-26 09:08:18,629 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877352657] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-26 09:08:18,629 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [585112056]
[2023-10-26 09:08:18,629 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 09:08:18,629 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 09:08:18,629 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 09:08:18,647 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-26 09:08:18,699 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2023-10-26 09:08:18,791 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 09:08:18,795 INFO  L263         TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 4 conjunts are in the unsatisfiable core
[2023-10-26 09:08:18,796 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 09:08:18,834 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 09:08:18,835 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-10-26 09:08:18,835 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [585112056] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 09:08:18,835 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2023-10-26 09:08:18,835 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6
[2023-10-26 09:08:18,835 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479485923]
[2023-10-26 09:08:18,836 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 09:08:18,836 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-10-26 09:08:18,836 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 09:08:18,836 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-10-26 09:08:18,837 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2023-10-26 09:08:18,868 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 172 out of 307
[2023-10-26 09:08:18,869 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 138 transitions, 749 flow. Second operand  has 5 states, 5 states have (on average 174.8) internal successors, (874), 5 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:08:18,869 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 09:08:18,869 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 307
[2023-10-26 09:08:18,869 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 09:08:29,241 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([828] L705-2-->L706: Formula: (not (= v_~threads_alive~0_5 0))  InVars {~threads_alive~0=v_~threads_alive~0_5}  OutVars{~threads_alive~0=v_~threads_alive~0_5}  AuxVars[]  AssignedVars[][22], [threadThread3of3ForFork0InUse, 170#L688-1true, Black: 194#true, 14#L685true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 146#L706true, Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 103#threadEXITtrue, threadThread1of3ForFork0InUse, 228#(<= 1 ~threads_alive~0), Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), threadThread2of3ForFork0InUse])
[2023-10-26 09:08:29,241 INFO  L383   tUnfolder$Statistics]: this new event has 58 ancestors and is cut-off event
[2023-10-26 09:08:29,241 INFO  L386   tUnfolder$Statistics]:   existing Event has 58 ancestors and is cut-off event
[2023-10-26 09:08:29,241 INFO  L386   tUnfolder$Statistics]:   existing Event has 58 ancestors and is cut-off event
[2023-10-26 09:08:29,241 INFO  L386   tUnfolder$Statistics]:   existing Event has 58 ancestors and is cut-off event
[2023-10-26 09:08:30,806 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([828] L705-2-->L706: Formula: (not (= v_~threads_alive~0_5 0))  InVars {~threads_alive~0=v_~threads_alive~0_5}  OutVars{~threads_alive~0=v_~threads_alive~0_5}  AuxVars[]  AssignedVars[][22], [threadThread3of3ForFork0InUse, Black: 194#true, 14#L685true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 146#L706true, Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 96#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 103#threadEXITtrue, threadThread1of3ForFork0InUse, 228#(<= 1 ~threads_alive~0), threadThread2of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|)])
[2023-10-26 09:08:30,806 INFO  L383   tUnfolder$Statistics]: this new event has 59 ancestors and is cut-off event
[2023-10-26 09:08:30,806 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-10-26 09:08:30,807 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-10-26 09:08:30,807 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-10-26 09:08:30,886 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([888] L688-2-->L688-3: Formula: (= v_~threads_alive~0_7 (+ v_~threads_alive~0_6 2))  InVars {~threads_alive~0=v_~threads_alive~0_7}  OutVars{~threads_alive~0=v_~threads_alive~0_6}  AuxVars[]  AssignedVars[~threads_alive~0][119], [threadThread3of3ForFork0InUse, Black: 194#true, 224#true, 14#L685true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), 143#L688-3true, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 103#threadEXITtrue, threadThread1of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), threadThread2of3ForFork0InUse, 163#L705-2true])
[2023-10-26 09:08:30,886 INFO  L383   tUnfolder$Statistics]: this new event has 59 ancestors and is cut-off event
[2023-10-26 09:08:30,886 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-10-26 09:08:30,886 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-10-26 09:08:30,886 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-10-26 09:08:30,887 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([828] L705-2-->L706: Formula: (not (= v_~threads_alive~0_5 0))  InVars {~threads_alive~0=v_~threads_alive~0_5}  OutVars{~threads_alive~0=v_~threads_alive~0_5}  AuxVars[]  AssignedVars[][22], [threadThread3of3ForFork0InUse, 170#L688-1true, Black: 194#true, 149#L685-2true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 146#L706true, Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 103#threadEXITtrue, threadThread1of3ForFork0InUse, 228#(<= 1 ~threads_alive~0), Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), threadThread2of3ForFork0InUse])
[2023-10-26 09:08:30,887 INFO  L383   tUnfolder$Statistics]: this new event has 59 ancestors and is cut-off event
[2023-10-26 09:08:30,887 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-10-26 09:08:30,887 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-10-26 09:08:30,887 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-10-26 09:08:30,888 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([888] L688-2-->L688-3: Formula: (= v_~threads_alive~0_7 (+ v_~threads_alive~0_6 2))  InVars {~threads_alive~0=v_~threads_alive~0_7}  OutVars{~threads_alive~0=v_~threads_alive~0_6}  AuxVars[]  AssignedVars[~threads_alive~0][119], [threadThread3of3ForFork0InUse, Black: 194#true, 224#true, 149#L685-2true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), 143#L688-3true, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 103#threadEXITtrue, threadThread1of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), threadThread2of3ForFork0InUse, 163#L705-2true])
[2023-10-26 09:08:30,888 INFO  L383   tUnfolder$Statistics]: this new event has 60 ancestors and is cut-off event
[2023-10-26 09:08:30,888 INFO  L386   tUnfolder$Statistics]:   existing Event has 60 ancestors and is cut-off event
[2023-10-26 09:08:30,889 INFO  L386   tUnfolder$Statistics]:   existing Event has 60 ancestors and is cut-off event
[2023-10-26 09:08:30,889 INFO  L386   tUnfolder$Statistics]:   existing Event has 60 ancestors and is cut-off event
[2023-10-26 09:08:35,010 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([828] L705-2-->L706: Formula: (not (= v_~threads_alive~0_5 0))  InVars {~threads_alive~0=v_~threads_alive~0_5}  OutVars{~threads_alive~0=v_~threads_alive~0_5}  AuxVars[]  AssignedVars[][22], [threadThread3of3ForFork0InUse, Black: 194#true, 149#L685-2true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 146#L706true, Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 96#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 103#threadEXITtrue, threadThread1of3ForFork0InUse, 228#(<= 1 ~threads_alive~0), threadThread2of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|)])
[2023-10-26 09:08:35,010 INFO  L383   tUnfolder$Statistics]: this new event has 60 ancestors and is cut-off event
[2023-10-26 09:08:35,010 INFO  L386   tUnfolder$Statistics]:   existing Event has 60 ancestors and is cut-off event
[2023-10-26 09:08:35,010 INFO  L386   tUnfolder$Statistics]:   existing Event has 60 ancestors and is cut-off event
[2023-10-26 09:08:35,010 INFO  L386   tUnfolder$Statistics]:   existing Event has 60 ancestors and is cut-off event
[2023-10-26 09:08:35,093 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([828] L705-2-->L706: Formula: (not (= v_~threads_alive~0_5 0))  InVars {~threads_alive~0=v_~threads_alive~0_5}  OutVars{~threads_alive~0=v_~threads_alive~0_5}  AuxVars[]  AssignedVars[][22], [threadThread3of3ForFork0InUse, 170#L688-1true, Black: 194#true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 146#L706true, 116#L685-4true, Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 103#threadEXITtrue, threadThread1of3ForFork0InUse, 228#(<= 1 ~threads_alive~0), Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), threadThread2of3ForFork0InUse])
[2023-10-26 09:08:35,093 INFO  L383   tUnfolder$Statistics]: this new event has 60 ancestors and is cut-off event
[2023-10-26 09:08:35,093 INFO  L386   tUnfolder$Statistics]:   existing Event has 60 ancestors and is cut-off event
[2023-10-26 09:08:35,093 INFO  L386   tUnfolder$Statistics]:   existing Event has 60 ancestors and is cut-off event
[2023-10-26 09:08:35,093 INFO  L386   tUnfolder$Statistics]:   existing Event has 60 ancestors and is cut-off event
[2023-10-26 09:08:35,094 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([888] L688-2-->L688-3: Formula: (= v_~threads_alive~0_7 (+ v_~threads_alive~0_6 2))  InVars {~threads_alive~0=v_~threads_alive~0_7}  OutVars{~threads_alive~0=v_~threads_alive~0_6}  AuxVars[]  AssignedVars[~threads_alive~0][119], [threadThread3of3ForFork0InUse, Black: 194#true, 224#true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 116#L685-4true, Black: 208#(= |#race~data~0| 0), 143#L688-3true, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 103#threadEXITtrue, threadThread1of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), threadThread2of3ForFork0InUse, 163#L705-2true])
[2023-10-26 09:08:35,094 INFO  L383   tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event
[2023-10-26 09:08:35,095 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-10-26 09:08:35,095 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-10-26 09:08:35,095 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-10-26 09:08:35,926 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([859] L688-->L688-1: Formula: (= |v_#race~threads_alive~0_10| 0)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_10|}  AuxVars[]  AssignedVars[#race~threads_alive~0][328], [threadThread3of3ForFork0InUse, Black: 194#true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), 96#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 76#L688-6true, 64#L688-1true, threadThread1of3ForFork0InUse, 228#(<= 1 ~threads_alive~0), 163#L705-2true, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), threadThread2of3ForFork0InUse])
[2023-10-26 09:08:35,926 INFO  L383   tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event
[2023-10-26 09:08:35,926 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-26 09:08:35,926 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-26 09:08:35,926 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-26 09:08:36,586 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([828] L705-2-->L706: Formula: (not (= v_~threads_alive~0_5 0))  InVars {~threads_alive~0=v_~threads_alive~0_5}  OutVars{~threads_alive~0=v_~threads_alive~0_5}  AuxVars[]  AssignedVars[][22], [threadThread3of3ForFork0InUse, Black: 194#true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 146#L706true, 116#L685-4true, Black: 208#(= |#race~data~0| 0), 96#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 103#threadEXITtrue, threadThread1of3ForFork0InUse, 228#(<= 1 ~threads_alive~0), threadThread2of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|)])
[2023-10-26 09:08:36,586 INFO  L383   tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event
[2023-10-26 09:08:36,586 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-10-26 09:08:36,586 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-10-26 09:08:36,586 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-10-26 09:08:36,672 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([828] L705-2-->L706: Formula: (not (= v_~threads_alive~0_5 0))  InVars {~threads_alive~0=v_~threads_alive~0_5}  OutVars{~threads_alive~0=v_~threads_alive~0_5}  AuxVars[]  AssignedVars[][22], [threadThread3of3ForFork0InUse, 170#L688-1true, Black: 194#true, 70#L686true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 146#L706true, Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 103#threadEXITtrue, threadThread1of3ForFork0InUse, 228#(<= 1 ~threads_alive~0), Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), threadThread2of3ForFork0InUse])
[2023-10-26 09:08:36,672 INFO  L383   tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event
[2023-10-26 09:08:36,672 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-10-26 09:08:36,672 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-10-26 09:08:36,672 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-10-26 09:08:36,673 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([888] L688-2-->L688-3: Formula: (= v_~threads_alive~0_7 (+ v_~threads_alive~0_6 2))  InVars {~threads_alive~0=v_~threads_alive~0_7}  OutVars{~threads_alive~0=v_~threads_alive~0_6}  AuxVars[]  AssignedVars[~threads_alive~0][119], [threadThread3of3ForFork0InUse, Black: 194#true, 224#true, 70#L686true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), 143#L688-3true, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 103#threadEXITtrue, threadThread1of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), threadThread2of3ForFork0InUse, 163#L705-2true])
[2023-10-26 09:08:36,673 INFO  L383   tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event
[2023-10-26 09:08:36,674 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2023-10-26 09:08:36,674 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2023-10-26 09:08:36,674 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2023-10-26 09:08:36,770 INFO  L381   tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([859] L688-->L688-1: Formula: (= |v_#race~threads_alive~0_10| 0)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_10|}  AuxVars[]  AssignedVars[#race~threads_alive~0][328], [threadThread3of3ForFork0InUse, Black: 194#true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 96#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 76#L688-6true, 64#L688-1true, threadThread1of3ForFork0InUse, 228#(<= 1 ~threads_alive~0), Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), threadThread2of3ForFork0InUse, 163#L705-2true])
[2023-10-26 09:08:36,770 INFO  L383   tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event
[2023-10-26 09:08:36,770 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-26 09:08:36,770 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-26 09:08:36,770 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-26 09:08:36,770 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-26 09:08:37,441 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([859] L688-->L688-1: Formula: (= |v_#race~threads_alive~0_10| 0)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_10|}  AuxVars[]  AssignedVars[#race~threads_alive~0][328], [threadThread3of3ForFork0InUse, Black: 194#true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), 156#L688-2true, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 160#L698-2true, 76#L688-6true, 64#L688-1true, threadThread1of3ForFork0InUse, 228#(<= 1 ~threads_alive~0), Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), threadThread2of3ForFork0InUse])
[2023-10-26 09:08:37,441 INFO  L383   tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event
[2023-10-26 09:08:37,442 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-26 09:08:37,442 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-26 09:08:37,442 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-26 09:08:38,348 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([828] L705-2-->L706: Formula: (not (= v_~threads_alive~0_5 0))  InVars {~threads_alive~0=v_~threads_alive~0_5}  OutVars{~threads_alive~0=v_~threads_alive~0_5}  AuxVars[]  AssignedVars[][22], [threadThread3of3ForFork0InUse, Black: 194#true, 70#L686true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 146#L706true, Black: 208#(= |#race~data~0| 0), 96#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 103#threadEXITtrue, threadThread1of3ForFork0InUse, 228#(<= 1 ~threads_alive~0), threadThread2of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|)])
[2023-10-26 09:08:38,348 INFO  L383   tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event
[2023-10-26 09:08:38,348 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2023-10-26 09:08:38,348 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2023-10-26 09:08:38,348 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2023-10-26 09:08:39,092 INFO  L381   tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([859] L688-->L688-1: Formula: (= |v_#race~threads_alive~0_10| 0)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_10|}  AuxVars[]  AssignedVars[#race~threads_alive~0][328], [threadThread3of3ForFork0InUse, Black: 194#true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), 156#L688-2true, 160#L698-2true, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 76#L688-6true, 64#L688-1true, threadThread1of3ForFork0InUse, 228#(<= 1 ~threads_alive~0), threadThread2of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|)])
[2023-10-26 09:08:39,092 INFO  L383   tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event
[2023-10-26 09:08:39,092 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-26 09:08:39,092 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-26 09:08:39,092 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-26 09:08:39,093 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-26 09:08:40,243 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([828] L705-2-->L706: Formula: (not (= v_~threads_alive~0_5 0))  InVars {~threads_alive~0=v_~threads_alive~0_5}  OutVars{~threads_alive~0=v_~threads_alive~0_5}  AuxVars[]  AssignedVars[][22], [threadThread3of3ForFork0InUse, 170#L688-1true, Black: 194#true, 6#L688true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 146#L706true, Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 103#threadEXITtrue, threadThread1of3ForFork0InUse, 228#(<= 1 ~threads_alive~0), Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), threadThread2of3ForFork0InUse])
[2023-10-26 09:08:40,244 INFO  L383   tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event
[2023-10-26 09:08:40,244 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-26 09:08:40,244 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-26 09:08:40,244 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-26 09:08:40,246 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([888] L688-2-->L688-3: Formula: (= v_~threads_alive~0_7 (+ v_~threads_alive~0_6 2))  InVars {~threads_alive~0=v_~threads_alive~0_7}  OutVars{~threads_alive~0=v_~threads_alive~0_6}  AuxVars[]  AssignedVars[~threads_alive~0][119], [threadThread3of3ForFork0InUse, Black: 194#true, 224#true, 6#L688true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), 143#L688-3true, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 103#threadEXITtrue, threadThread1of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), threadThread2of3ForFork0InUse, 163#L705-2true])
[2023-10-26 09:08:40,246 INFO  L383   tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event
[2023-10-26 09:08:40,247 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-10-26 09:08:40,247 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-10-26 09:08:40,247 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-10-26 09:08:40,331 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([859] L688-->L688-1: Formula: (= |v_#race~threads_alive~0_10| 0)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_10|}  AuxVars[]  AssignedVars[#race~threads_alive~0][230], [threadThread3of3ForFork0InUse, 170#L688-1true, Black: 194#true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 64#L688-1true, 103#threadEXITtrue, threadThread1of3ForFork0InUse, 228#(<= 1 ~threads_alive~0), Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), 163#L705-2true, threadThread2of3ForFork0InUse])
[2023-10-26 09:08:40,331 INFO  L383   tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event
[2023-10-26 09:08:40,331 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-26 09:08:40,331 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-26 09:08:40,331 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-26 09:08:40,892 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([859] L688-->L688-1: Formula: (= |v_#race~threads_alive~0_10| 0)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_10|}  AuxVars[]  AssignedVars[#race~threads_alive~0][230], [75#threadErr2ASSERT_VIOLATIONDATA_RACEtrue, threadThread3of3ForFork0InUse, Black: 194#true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), 156#L688-2true, 160#L698-2true, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 64#L688-1true, threadThread1of3ForFork0InUse, 228#(<= 1 ~threads_alive~0), Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), threadThread2of3ForFork0InUse])
[2023-10-26 09:08:40,893 INFO  L383   tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event
[2023-10-26 09:08:40,893 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-26 09:08:40,893 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-26 09:08:40,893 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-26 09:08:40,961 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L688-2-->L688-4: Formula: (= (+ 2 v_~threads_alive~0_36) v_~threads_alive~0_37)  InVars {~threads_alive~0=v_~threads_alive~0_37}  OutVars{~threads_alive~0=v_~threads_alive~0_36, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_15|}  AuxVars[]  AssignedVars[~threads_alive~0, threadThread3of3ForFork0_#t~nondet4][275], [threadThread3of3ForFork0InUse, 139#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 194#true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 57#L688-4true, 34#L698-3true, 112#threadEXITtrue, Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 245#(<= 0 |ULTIMATE.start_main_#t~post8#1|), threadThread1of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), threadThread2of3ForFork0InUse])
[2023-10-26 09:08:40,961 INFO  L383   tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event
[2023-10-26 09:08:40,961 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-26 09:08:40,962 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-26 09:08:40,962 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-26 09:08:41,370 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([828] L705-2-->L706: Formula: (not (= v_~threads_alive~0_5 0))  InVars {~threads_alive~0=v_~threads_alive~0_5}  OutVars{~threads_alive~0=v_~threads_alive~0_5}  AuxVars[]  AssignedVars[][22], [threadThread3of3ForFork0InUse, Black: 194#true, 6#L688true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 146#L706true, Black: 208#(= |#race~data~0| 0), 96#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 103#threadEXITtrue, threadThread1of3ForFork0InUse, 228#(<= 1 ~threads_alive~0), threadThread2of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|)])
[2023-10-26 09:08:41,370 INFO  L383   tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event
[2023-10-26 09:08:41,370 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-10-26 09:08:41,370 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-10-26 09:08:41,370 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-10-26 09:08:41,435 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([859] L688-->L688-1: Formula: (= |v_#race~threads_alive~0_10| 0)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_10|}  AuxVars[]  AssignedVars[#race~threads_alive~0][230], [threadThread3of3ForFork0InUse, Black: 194#true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), 156#L688-2true, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 103#threadEXITtrue, 64#L688-1true, threadThread1of3ForFork0InUse, 228#(<= 1 ~threads_alive~0), Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), 163#L705-2true, threadThread2of3ForFork0InUse])
[2023-10-26 09:08:41,435 INFO  L383   tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event
[2023-10-26 09:08:41,435 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-10-26 09:08:41,435 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-10-26 09:08:41,435 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-10-26 09:08:41,508 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([859] L688-->L688-1: Formula: (= |v_#race~threads_alive~0_10| 0)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_10|}  AuxVars[]  AssignedVars[#race~threads_alive~0][230], [threadThread3of3ForFork0InUse, Black: 194#true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 96#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 103#threadEXITtrue, 64#L688-1true, threadThread1of3ForFork0InUse, 228#(<= 1 ~threads_alive~0), Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), 163#L705-2true, threadThread2of3ForFork0InUse])
[2023-10-26 09:08:41,508 INFO  L383   tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event
[2023-10-26 09:08:41,508 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-10-26 09:08:41,508 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-10-26 09:08:41,508 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-10-26 09:08:42,607 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([859] L688-->L688-1: Formula: (= |v_#race~threads_alive~0_10| 0)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_10|}  AuxVars[]  AssignedVars[#race~threads_alive~0][230], [threadThread3of3ForFork0InUse, Black: 194#true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), 156#L688-2true, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 160#L698-2true, 103#threadEXITtrue, 64#L688-1true, threadThread1of3ForFork0InUse, 228#(<= 1 ~threads_alive~0), Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), threadThread2of3ForFork0InUse])
[2023-10-26 09:08:42,607 INFO  L383   tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event
[2023-10-26 09:08:42,607 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-10-26 09:08:42,607 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-10-26 09:08:42,608 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-10-26 09:08:44,280 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([829] L698-5-->L698-6: Formula: (= |v_ULTIMATE.start_main_#t~nondet9#1_3| |v_#race~threads_alive~0_4|)  InVars {ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|}  OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|, #race~threads_alive~0=|v_#race~threads_alive~0_4|}  AuxVars[]  AssignedVars[#race~threads_alive~0][105], [threadThread3of3ForFork0InUse, 161#L698-6true, 224#true, Black: 196#(= |#race~threads_alive~0| 0), 62#L688-2true, Black: 200#true, 218#true, Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 96#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 76#L688-6true, threadThread1of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), threadThread2of3ForFork0InUse])
[2023-10-26 09:08:44,280 INFO  L383   tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event
[2023-10-26 09:08:44,281 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2023-10-26 09:08:44,281 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2023-10-26 09:08:44,281 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2023-10-26 09:08:44,685 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([859] L688-->L688-1: Formula: (= |v_#race~threads_alive~0_10| 0)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_10|}  AuxVars[]  AssignedVars[#race~threads_alive~0][230], [threadThread3of3ForFork0InUse, 75#threadErr2ASSERT_VIOLATIONDATA_RACEtrue, Black: 194#true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), 156#L688-2true, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 64#L688-1true, threadThread1of3ForFork0InUse, 228#(<= 1 ~threads_alive~0), 68#L705-4true, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), threadThread2of3ForFork0InUse])
[2023-10-26 09:08:44,686 INFO  L383   tUnfolder$Statistics]: this new event has 66 ancestors and is cut-off event
[2023-10-26 09:08:44,686 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-10-26 09:08:44,686 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-10-26 09:08:44,686 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-10-26 09:08:44,686 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([859] L688-->L688-1: Formula: (= |v_#race~threads_alive~0_10| 0)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_10|}  AuxVars[]  AssignedVars[#race~threads_alive~0][230], [threadThread3of3ForFork0InUse, 75#threadErr2ASSERT_VIOLATIONDATA_RACEtrue, Black: 194#true, 80#L705-1true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), 156#L688-2true, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 64#L688-1true, threadThread1of3ForFork0InUse, 228#(<= 1 ~threads_alive~0), Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), threadThread2of3ForFork0InUse])
[2023-10-26 09:08:44,686 INFO  L383   tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event
[2023-10-26 09:08:44,686 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2023-10-26 09:08:44,686 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2023-10-26 09:08:44,686 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2023-10-26 09:08:44,687 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([859] L688-->L688-1: Formula: (= |v_#race~threads_alive~0_10| 0)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_10|}  AuxVars[]  AssignedVars[#race~threads_alive~0][230], [threadThread3of3ForFork0InUse, 75#threadErr2ASSERT_VIOLATIONDATA_RACEtrue, Black: 194#true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), 156#L688-2true, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 64#L688-1true, threadThread1of3ForFork0InUse, 228#(<= 1 ~threads_alive~0), Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), 163#L705-2true, threadThread2of3ForFork0InUse])
[2023-10-26 09:08:44,687 INFO  L383   tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event
[2023-10-26 09:08:44,687 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-26 09:08:44,687 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-26 09:08:44,687 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-26 09:08:45,187 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([829] L698-5-->L698-6: Formula: (= |v_ULTIMATE.start_main_#t~nondet9#1_3| |v_#race~threads_alive~0_4|)  InVars {ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|}  OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|, #race~threads_alive~0=|v_#race~threads_alive~0_4|}  AuxVars[]  AssignedVars[#race~threads_alive~0][105], [threadThread3of3ForFork0InUse, 161#L698-6true, Black: 196#(= |#race~threads_alive~0| 0), 62#L688-2true, Black: 200#true, 218#true, Black: 208#(= |#race~data~0| 0), 297#(and (<= 0 |ULTIMATE.start_main_#t~post8#1|) (<= 1 ~threads_alive~0)), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 96#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 76#L688-6true, threadThread1of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), threadThread2of3ForFork0InUse])
[2023-10-26 09:08:45,187 INFO  L383   tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event
[2023-10-26 09:08:45,188 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2023-10-26 09:08:45,188 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2023-10-26 09:08:45,188 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2023-10-26 09:08:46,189 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([941] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_44| |v_threadThread1of3ForFork0_#t~nondet4_13|)  InVars {}  OutVars{threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_13|, #race~threads_alive~0=|v_#race~threads_alive~0_44|}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet4, #race~threads_alive~0][45], [threadThread3of3ForFork0InUse, 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), 224#true, Black: 196#(= |#race~threads_alive~0| 0), 62#L688-2true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 119#L688-5true, 112#threadEXITtrue, Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), threadThread1of3ForFork0InUse, 163#L705-2true, threadThread2of3ForFork0InUse, Black: 218#true])
[2023-10-26 09:08:46,189 INFO  L383   tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event
[2023-10-26 09:08:46,189 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2023-10-26 09:08:46,189 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2023-10-26 09:08:46,189 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2023-10-26 09:08:46,189 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L688-2-->L688-4: Formula: (= (+ 2 v_~threads_alive~0_36) v_~threads_alive~0_37)  InVars {~threads_alive~0=v_~threads_alive~0_37}  OutVars{~threads_alive~0=v_~threads_alive~0_36, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_15|}  AuxVars[]  AssignedVars[~threads_alive~0, threadThread3of3ForFork0_#t~nondet4][304], [threadThread3of3ForFork0InUse, Black: 194#true, 224#true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 57#L688-4true, Black: 208#(= |#race~data~0| 0), 112#threadEXITtrue, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), threadThread1of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), 163#L705-2true, threadThread2of3ForFork0InUse, 23#L688-3true])
[2023-10-26 09:08:46,190 INFO  L383   tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event
[2023-10-26 09:08:46,190 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2023-10-26 09:08:46,190 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2023-10-26 09:08:46,190 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2023-10-26 09:08:46,558 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L688-2-->L688-4: Formula: (= (+ 2 v_~threads_alive~0_36) v_~threads_alive~0_37)  InVars {~threads_alive~0=v_~threads_alive~0_37}  OutVars{~threads_alive~0=v_~threads_alive~0_36, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_15|}  AuxVars[]  AssignedVars[~threads_alive~0, threadThread3of3ForFork0_#t~nondet4][275], [threadThread3of3ForFork0InUse, Black: 194#true, 164#L698-5true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 57#L688-4true, Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 96#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 103#threadEXITtrue, 245#(<= 0 |ULTIMATE.start_main_#t~post8#1|), threadThread1of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), threadThread2of3ForFork0InUse])
[2023-10-26 09:08:46,558 INFO  L383   tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event
[2023-10-26 09:08:46,558 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2023-10-26 09:08:46,558 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2023-10-26 09:08:46,558 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2023-10-26 09:08:46,599 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L688-2-->L688-4: Formula: (= (+ 2 v_~threads_alive~0_36) v_~threads_alive~0_37)  InVars {~threads_alive~0=v_~threads_alive~0_37}  OutVars{~threads_alive~0=v_~threads_alive~0_36, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_15|}  AuxVars[]  AssignedVars[~threads_alive~0, threadThread3of3ForFork0_#t~nondet4][304], [threadThread3of3ForFork0InUse, 224#true, Black: 194#true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 57#L688-4true, 34#L698-3true, Black: 208#(= |#race~data~0| 0), 96#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 103#threadEXITtrue, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|)])
[2023-10-26 09:08:46,599 INFO  L383   tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event
[2023-10-26 09:08:46,599 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2023-10-26 09:08:46,600 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2023-10-26 09:08:46,600 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2023-10-26 09:08:46,601 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([829] L698-5-->L698-6: Formula: (= |v_ULTIMATE.start_main_#t~nondet9#1_3| |v_#race~threads_alive~0_4|)  InVars {ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|}  OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|, #race~threads_alive~0=|v_#race~threads_alive~0_4|}  AuxVars[]  AssignedVars[#race~threads_alive~0][13], [threadThread3of3ForFork0InUse, 161#L698-6true, 224#true, Black: 196#(= |#race~threads_alive~0| 0), 62#L688-2true, 218#true, Black: 200#true, Black: 208#(= |#race~data~0| 0), 96#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 103#threadEXITtrue, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|)])
[2023-10-26 09:08:46,601 INFO  L383   tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event
[2023-10-26 09:08:46,601 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2023-10-26 09:08:46,601 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2023-10-26 09:08:46,601 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2023-10-26 09:08:46,601 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L688-2-->L688-4: Formula: (= (+ 2 v_~threads_alive~0_36) v_~threads_alive~0_37)  InVars {~threads_alive~0=v_~threads_alive~0_37}  OutVars{~threads_alive~0=v_~threads_alive~0_36, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_15|}  AuxVars[]  AssignedVars[~threads_alive~0, threadThread3of3ForFork0_#t~nondet4][304], [threadThread3of3ForFork0InUse, 224#true, Black: 194#true, 164#L698-5true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 57#L688-4true, Black: 208#(= |#race~data~0| 0), 96#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 103#threadEXITtrue, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|)])
[2023-10-26 09:08:46,601 INFO  L383   tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event
[2023-10-26 09:08:46,602 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2023-10-26 09:08:46,602 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2023-10-26 09:08:46,602 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2023-10-26 09:08:46,608 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([829] L698-5-->L698-6: Formula: (= |v_ULTIMATE.start_main_#t~nondet9#1_3| |v_#race~threads_alive~0_4|)  InVars {ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|}  OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|, #race~threads_alive~0=|v_#race~threads_alive~0_4|}  AuxVars[]  AssignedVars[#race~threads_alive~0][13], [threadThread3of3ForFork0InUse, 75#threadErr2ASSERT_VIOLATIONDATA_RACEtrue, 161#L698-6true, 224#true, Black: 196#(= |#race~threads_alive~0| 0), 62#L688-2true, Black: 200#true, 218#true, Black: 208#(= |#race~data~0| 0), 156#L688-2true, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|)])
[2023-10-26 09:08:46,608 INFO  L383   tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event
[2023-10-26 09:08:46,608 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2023-10-26 09:08:46,608 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2023-10-26 09:08:46,608 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2023-10-26 09:08:46,640 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([941] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_44| |v_threadThread1of3ForFork0_#t~nondet4_13|)  InVars {}  OutVars{threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_13|, #race~threads_alive~0=|v_#race~threads_alive~0_44|}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet4, #race~threads_alive~0][45], [threadThread3of3ForFork0InUse, 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), 224#true, Black: 196#(= |#race~threads_alive~0| 0), 62#L688-2true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 119#L688-5true, 112#threadEXITtrue, Black: 208#(= |#race~data~0| 0), 160#L698-2true, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 218#true])
[2023-10-26 09:08:46,640 INFO  L383   tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event
[2023-10-26 09:08:46,640 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2023-10-26 09:08:46,640 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2023-10-26 09:08:46,640 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2023-10-26 09:08:46,907 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([984] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_50| |v_threadThread2of3ForFork0_#t~nondet4_17|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_17|, #race~threads_alive~0=|v_#race~threads_alive~0_50|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet4, #race~threads_alive~0][128], [threadThread3of3ForFork0InUse, 75#threadErr2ASSERT_VIOLATIONDATA_RACEtrue, 9#L688-5true, 224#true, Black: 196#(= |#race~threads_alive~0| 0), 62#L688-2true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), threadThread1of3ForFork0InUse, 68#L705-4true, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), threadThread2of3ForFork0InUse])
[2023-10-26 09:08:46,907 INFO  L383   tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event
[2023-10-26 09:08:46,907 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-10-26 09:08:46,908 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-10-26 09:08:46,908 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-10-26 09:08:46,908 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([984] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_50| |v_threadThread2of3ForFork0_#t~nondet4_17|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_17|, #race~threads_alive~0=|v_#race~threads_alive~0_50|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet4, #race~threads_alive~0][128], [threadThread3of3ForFork0InUse, 75#threadErr2ASSERT_VIOLATIONDATA_RACEtrue, 9#L688-5true, 224#true, Black: 196#(= |#race~threads_alive~0| 0), 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 64#L688-1true, threadThread1of3ForFork0InUse, 68#L705-4true, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), threadThread2of3ForFork0InUse])
[2023-10-26 09:08:46,908 INFO  L383   tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event
[2023-10-26 09:08:46,908 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-26 09:08:46,908 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-26 09:08:46,908 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-26 09:08:47,178 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([829] L698-5-->L698-6: Formula: (= |v_ULTIMATE.start_main_#t~nondet9#1_3| |v_#race~threads_alive~0_4|)  InVars {ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|}  OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|, #race~threads_alive~0=|v_#race~threads_alive~0_4|}  AuxVars[]  AssignedVars[#race~threads_alive~0][13], [threadThread3of3ForFork0InUse, 161#L698-6true, Black: 196#(= |#race~threads_alive~0| 0), 62#L688-2true, 218#true, Black: 200#true, Black: 208#(= |#race~data~0| 0), 297#(and (<= 0 |ULTIMATE.start_main_#t~post8#1|) (<= 1 ~threads_alive~0)), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 96#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 103#threadEXITtrue, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|)])
[2023-10-26 09:08:47,178 INFO  L383   tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event
[2023-10-26 09:08:47,178 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2023-10-26 09:08:47,178 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2023-10-26 09:08:47,178 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2023-10-26 09:08:47,223 INFO  L381   tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([829] L698-5-->L698-6: Formula: (= |v_ULTIMATE.start_main_#t~nondet9#1_3| |v_#race~threads_alive~0_4|)  InVars {ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|}  OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|, #race~threads_alive~0=|v_#race~threads_alive~0_4|}  AuxVars[]  AssignedVars[#race~threads_alive~0][13], [threadThread3of3ForFork0InUse, 161#L698-6true, 224#true, Black: 196#(= |#race~threads_alive~0| 0), 62#L688-2true, Black: 200#true, 218#true, Black: 208#(= |#race~data~0| 0), 96#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 103#threadEXITtrue, threadThread1of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), threadThread2of3ForFork0InUse])
[2023-10-26 09:08:47,224 INFO  L383   tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event
[2023-10-26 09:08:47,224 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2023-10-26 09:08:47,224 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2023-10-26 09:08:47,224 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2023-10-26 09:08:47,224 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2023-10-26 09:08:47,342 INFO  L381   tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([958] L688-2-->L688-4: Formula: (= (+ 2 v_~threads_alive~0_36) v_~threads_alive~0_37)  InVars {~threads_alive~0=v_~threads_alive~0_37}  OutVars{~threads_alive~0=v_~threads_alive~0_36, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_15|}  AuxVars[]  AssignedVars[~threads_alive~0, threadThread3of3ForFork0_#t~nondet4][304], [threadThread3of3ForFork0InUse, 224#true, Black: 194#true, 164#L698-5true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 57#L688-4true, Black: 208#(= |#race~data~0| 0), 96#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 103#threadEXITtrue, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|)])
[2023-10-26 09:08:47,342 INFO  L383   tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event
[2023-10-26 09:08:47,342 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2023-10-26 09:08:47,343 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2023-10-26 09:08:47,343 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2023-10-26 09:08:47,343 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2023-10-26 09:08:47,354 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([984] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_50| |v_threadThread2of3ForFork0_#t~nondet4_17|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_17|, #race~threads_alive~0=|v_#race~threads_alive~0_50|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet4, #race~threads_alive~0][128], [threadThread3of3ForFork0InUse, 75#threadErr2ASSERT_VIOLATIONDATA_RACEtrue, 9#L688-5true, 224#true, Black: 196#(= |#race~threads_alive~0| 0), 164#L698-5true, 62#L688-2true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|)])
[2023-10-26 09:08:47,354 INFO  L383   tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event
[2023-10-26 09:08:47,354 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2023-10-26 09:08:47,354 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2023-10-26 09:08:47,354 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2023-10-26 09:08:47,932 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1014] L688-6-->threadEXIT: Formula: (and (= (store |v_#pthreadsMutex_214| |v_~#threads_alive_mutex~0.base_143| (store (select |v_#pthreadsMutex_214| |v_~#threads_alive_mutex~0.base_143|) |v_~#threads_alive_mutex~0.offset_143| 0)) |v_#pthreadsMutex_213|) (= |v_threadThread1of3ForFork0_#res.base_7| 0) (= 0 |v_threadThread1of3ForFork0_#res.offset_7|))  InVars {#pthreadsMutex=|v_#pthreadsMutex_214|, ~#threads_alive_mutex~0.base=|v_~#threads_alive_mutex~0.base_143|, ~#threads_alive_mutex~0.offset=|v_~#threads_alive_mutex~0.offset_143|}  OutVars{#pthreadsMutex=|v_#pthreadsMutex_213|, threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_17|, threadThread1of3ForFork0_#res.base=|v_threadThread1of3ForFork0_#res.base_7|, threadThread1of3ForFork0_#res.offset=|v_threadThread1of3ForFork0_#res.offset_7|, ~#threads_alive_mutex~0.base=|v_~#threads_alive_mutex~0.base_143|, ~#threads_alive_mutex~0.offset=|v_~#threads_alive_mutex~0.offset_143|}  AuxVars[]  AssignedVars[#pthreadsMutex, threadThread1of3ForFork0_#t~nondet4, threadThread1of3ForFork0_#res.base, threadThread1of3ForFork0_#res.offset][104], [threadThread3of3ForFork0InUse, Black: 194#true, 164#L698-5true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), 297#(and (<= 0 |ULTIMATE.start_main_#t~post8#1|) (<= 1 ~threads_alive~0)), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 103#threadEXITtrue, 64#L688-1true, 129#L690true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|)])
[2023-10-26 09:08:47,932 INFO  L383   tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event
[2023-10-26 09:08:47,932 INFO  L386   tUnfolder$Statistics]:   existing Event has 69 ancestors and is cut-off event
[2023-10-26 09:08:47,932 INFO  L386   tUnfolder$Statistics]:   existing Event has 69 ancestors and is cut-off event
[2023-10-26 09:08:47,932 INFO  L386   tUnfolder$Statistics]:   existing Event has 69 ancestors and is cut-off event
[2023-10-26 09:08:48,416 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([984] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_50| |v_threadThread2of3ForFork0_#t~nondet4_17|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_17|, #race~threads_alive~0=|v_#race~threads_alive~0_50|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet4, #race~threads_alive~0][222], [threadThread3of3ForFork0InUse, 9#L688-5true, 224#true, Black: 196#(= |#race~threads_alive~0| 0), 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 76#L688-6true, 64#L688-1true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|)])
[2023-10-26 09:08:48,416 INFO  L383   tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event
[2023-10-26 09:08:48,416 INFO  L386   tUnfolder$Statistics]:   existing Event has 69 ancestors and is cut-off event
[2023-10-26 09:08:48,416 INFO  L386   tUnfolder$Statistics]:   existing Event has 69 ancestors and is cut-off event
[2023-10-26 09:08:48,416 INFO  L386   tUnfolder$Statistics]:   existing Event has 69 ancestors and is cut-off event
[2023-10-26 09:08:48,419 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([984] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_50| |v_threadThread2of3ForFork0_#t~nondet4_17|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_17|, #race~threads_alive~0=|v_#race~threads_alive~0_50|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet4, #race~threads_alive~0][222], [threadThread3of3ForFork0InUse, 9#L688-5true, 224#true, Black: 196#(= |#race~threads_alive~0| 0), 62#L688-2true, 218#true, 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 76#L688-6true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|)])
[2023-10-26 09:08:48,419 INFO  L383   tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event
[2023-10-26 09:08:48,419 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-10-26 09:08:48,419 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-10-26 09:08:48,419 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-10-26 09:08:48,420 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([864] L688-4-->L688-5: Formula: (= |v_threadThread3of3ForFork0_#t~nondet4_3| |v_#race~threads_alive~0_13|)  InVars {threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|}  OutVars{threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, #race~threads_alive~0=|v_#race~threads_alive~0_13|}  AuxVars[]  AssignedVars[#race~threads_alive~0][330], [threadThread3of3ForFork0InUse, 111#L688-5true, 224#true, Black: 196#(= |#race~threads_alive~0| 0), 218#true, 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), 156#L688-2true, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 76#L688-6true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|)])
[2023-10-26 09:08:48,420 INFO  L383   tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event
[2023-10-26 09:08:48,420 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-10-26 09:08:48,420 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-10-26 09:08:48,420 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-10-26 09:08:48,447 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([984] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_50| |v_threadThread2of3ForFork0_#t~nondet4_17|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_17|, #race~threads_alive~0=|v_#race~threads_alive~0_50|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet4, #race~threads_alive~0][128], [75#threadErr2ASSERT_VIOLATIONDATA_RACEtrue, threadThread3of3ForFork0InUse, 9#L688-5true, 18#L698-8true, 224#true, Black: 196#(= |#race~threads_alive~0| 0), 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 64#L688-1true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|)])
[2023-10-26 09:08:48,447 INFO  L383   tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event
[2023-10-26 09:08:48,447 INFO  L386   tUnfolder$Statistics]:   existing Event has 69 ancestors and is cut-off event
[2023-10-26 09:08:48,447 INFO  L386   tUnfolder$Statistics]:   existing Event has 69 ancestors and is cut-off event
[2023-10-26 09:08:48,448 INFO  L386   tUnfolder$Statistics]:   existing Event has 69 ancestors and is cut-off event
[2023-10-26 09:08:48,549 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1014] L688-6-->threadEXIT: Formula: (and (= (store |v_#pthreadsMutex_214| |v_~#threads_alive_mutex~0.base_143| (store (select |v_#pthreadsMutex_214| |v_~#threads_alive_mutex~0.base_143|) |v_~#threads_alive_mutex~0.offset_143| 0)) |v_#pthreadsMutex_213|) (= |v_threadThread1of3ForFork0_#res.base_7| 0) (= 0 |v_threadThread1of3ForFork0_#res.offset_7|))  InVars {#pthreadsMutex=|v_#pthreadsMutex_214|, ~#threads_alive_mutex~0.base=|v_~#threads_alive_mutex~0.base_143|, ~#threads_alive_mutex~0.offset=|v_~#threads_alive_mutex~0.offset_143|}  OutVars{#pthreadsMutex=|v_#pthreadsMutex_213|, threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_17|, threadThread1of3ForFork0_#res.base=|v_threadThread1of3ForFork0_#res.base_7|, threadThread1of3ForFork0_#res.offset=|v_threadThread1of3ForFork0_#res.offset_7|, ~#threads_alive_mutex~0.base=|v_~#threads_alive_mutex~0.base_143|, ~#threads_alive_mutex~0.offset=|v_~#threads_alive_mutex~0.offset_143|}  AuxVars[]  AssignedVars[#pthreadsMutex, threadThread1of3ForFork0_#t~nondet4, threadThread1of3ForFork0_#res.base, threadThread1of3ForFork0_#res.offset][104], [threadThread3of3ForFork0InUse, Black: 194#true, 164#L698-5true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 112#threadEXITtrue, Black: 208#(= |#race~data~0| 0), 297#(and (<= 0 |ULTIMATE.start_main_#t~post8#1|) (<= 1 ~threads_alive~0)), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 64#L688-1true, 103#threadEXITtrue, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|)])
[2023-10-26 09:08:48,549 INFO  L383   tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event
[2023-10-26 09:08:48,549 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-10-26 09:08:48,549 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-10-26 09:08:48,549 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-10-26 09:08:48,823 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([984] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_50| |v_threadThread2of3ForFork0_#t~nondet4_17|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_17|, #race~threads_alive~0=|v_#race~threads_alive~0_50|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet4, #race~threads_alive~0][128], [threadThread3of3ForFork0InUse, 75#threadErr2ASSERT_VIOLATIONDATA_RACEtrue, 9#L688-5true, 224#true, Black: 196#(= |#race~threads_alive~0| 0), 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 35#L701-2true, 64#L688-1true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|)])
[2023-10-26 09:08:48,824 INFO  L383   tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event
[2023-10-26 09:08:48,824 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-10-26 09:08:48,824 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-10-26 09:08:48,824 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-10-26 09:08:48,909 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([941] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_44| |v_threadThread1of3ForFork0_#t~nondet4_13|)  InVars {}  OutVars{threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_13|, #race~threads_alive~0=|v_#race~threads_alive~0_44|}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet4, #race~threads_alive~0][81], [threadThread3of3ForFork0InUse, 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), Black: 196#(= |#race~threads_alive~0| 0), 62#L688-2true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, 119#L688-5true, Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 129#L690true, 245#(<= 0 |ULTIMATE.start_main_#t~post8#1|), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 218#true])
[2023-10-26 09:08:48,910 INFO  L383   tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event
[2023-10-26 09:08:48,910 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-10-26 09:08:48,910 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-10-26 09:08:48,910 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-10-26 09:08:48,911 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([941] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_44| |v_threadThread1of3ForFork0_#t~nondet4_13|)  InVars {}  OutVars{threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_13|, #race~threads_alive~0=|v_#race~threads_alive~0_44|}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet4, #race~threads_alive~0][81], [threadThread3of3ForFork0InUse, 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), Black: 196#(= |#race~threads_alive~0| 0), 62#L688-2true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, 119#L688-5true, 112#threadEXITtrue, Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 245#(<= 0 |ULTIMATE.start_main_#t~post8#1|), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 218#true])
[2023-10-26 09:08:48,911 INFO  L383   tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event
[2023-10-26 09:08:48,911 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-26 09:08:48,911 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-26 09:08:48,912 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-26 09:08:48,931 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([864] L688-4-->L688-5: Formula: (= |v_threadThread3of3ForFork0_#t~nondet4_3| |v_#race~threads_alive~0_13|)  InVars {threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|}  OutVars{threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, #race~threads_alive~0=|v_#race~threads_alive~0_13|}  AuxVars[]  AssignedVars[#race~threads_alive~0][311], [threadThread3of3ForFork0InUse, 75#threadErr2ASSERT_VIOLATIONDATA_RACEtrue, 111#L688-5true, 18#L698-8true, 224#true, Black: 196#(= |#race~threads_alive~0| 0), 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), 156#L688-2true, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), threadThread1of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), threadThread2of3ForFork0InUse])
[2023-10-26 09:08:48,932 INFO  L383   tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event
[2023-10-26 09:08:48,932 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-10-26 09:08:48,932 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-10-26 09:08:48,932 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-10-26 09:08:48,939 INFO  L381   tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([941] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_44| |v_threadThread1of3ForFork0_#t~nondet4_13|)  InVars {}  OutVars{threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_13|, #race~threads_alive~0=|v_#race~threads_alive~0_44|}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet4, #race~threads_alive~0][81], [threadThread3of3ForFork0InUse, 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), Black: 196#(= |#race~threads_alive~0| 0), 62#L688-2true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, 119#L688-5true, 112#threadEXITtrue, Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 245#(<= 0 |ULTIMATE.start_main_#t~post8#1|), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 218#true])
[2023-10-26 09:08:48,939 INFO  L383   tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event
[2023-10-26 09:08:48,939 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-26 09:08:48,939 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-26 09:08:48,939 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-26 09:08:48,939 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-26 09:08:48,977 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([984] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_50| |v_threadThread2of3ForFork0_#t~nondet4_17|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_17|, #race~threads_alive~0=|v_#race~threads_alive~0_50|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet4, #race~threads_alive~0][222], [threadThread3of3ForFork0InUse, 9#L688-5true, 224#true, Black: 196#(= |#race~threads_alive~0| 0), 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, 57#L688-4true, Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 76#L688-6true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|)])
[2023-10-26 09:08:48,978 INFO  L383   tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event
[2023-10-26 09:08:48,978 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-26 09:08:48,978 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-26 09:08:48,978 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-26 09:08:49,024 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([829] L698-5-->L698-6: Formula: (= |v_ULTIMATE.start_main_#t~nondet9#1_3| |v_#race~threads_alive~0_4|)  InVars {ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|}  OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|, #race~threads_alive~0=|v_#race~threads_alive~0_4|}  AuxVars[]  AssignedVars[#race~threads_alive~0][13], [threadThread3of3ForFork0InUse, 75#threadErr2ASSERT_VIOLATIONDATA_RACEtrue, 161#L698-6true, Black: 196#(= |#race~threads_alive~0| 0), 62#L688-2true, 218#true, Black: 200#true, Black: 208#(= |#race~data~0| 0), 297#(and (<= 0 |ULTIMATE.start_main_#t~post8#1|) (<= 1 ~threads_alive~0)), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 129#L690true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|)])
[2023-10-26 09:08:49,025 INFO  L383   tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event
[2023-10-26 09:08:49,025 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-10-26 09:08:49,025 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-10-26 09:08:49,025 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-10-26 09:08:49,025 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L688-2-->L688-4: Formula: (= (+ 2 v_~threads_alive~0_36) v_~threads_alive~0_37)  InVars {~threads_alive~0=v_~threads_alive~0_37}  OutVars{~threads_alive~0=v_~threads_alive~0_36, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_15|}  AuxVars[]  AssignedVars[~threads_alive~0, threadThread3of3ForFork0_#t~nondet4][275], [threadThread3of3ForFork0InUse, 75#threadErr2ASSERT_VIOLATIONDATA_RACEtrue, Black: 194#true, 164#L698-5true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 57#L688-4true, Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 129#L690true, 245#(<= 0 |ULTIMATE.start_main_#t~post8#1|), threadThread1of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), threadThread2of3ForFork0InUse])
[2023-10-26 09:08:49,025 INFO  L383   tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event
[2023-10-26 09:08:49,025 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-10-26 09:08:49,025 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-10-26 09:08:49,026 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-10-26 09:08:49,223 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([984] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_50| |v_threadThread2of3ForFork0_#t~nondet4_17|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_17|, #race~threads_alive~0=|v_#race~threads_alive~0_50|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet4, #race~threads_alive~0][128], [threadThread3of3ForFork0InUse, 75#threadErr2ASSERT_VIOLATIONDATA_RACEtrue, 9#L688-5true, 224#true, Black: 196#(= |#race~threads_alive~0| 0), 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 7#threadEXITtrue, threadThread1of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), threadThread2of3ForFork0InUse, 163#L705-2true])
[2023-10-26 09:08:49,223 INFO  L383   tUnfolder$Statistics]: this new event has 70 ancestors and is not cut-off event
[2023-10-26 09:08:49,223 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is not cut-off event
[2023-10-26 09:08:49,223 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is not cut-off event
[2023-10-26 09:08:49,223 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is not cut-off event
[2023-10-26 09:08:49,821 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([864] L688-4-->L688-5: Formula: (= |v_threadThread3of3ForFork0_#t~nondet4_3| |v_#race~threads_alive~0_13|)  InVars {threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|}  OutVars{threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, #race~threads_alive~0=|v_#race~threads_alive~0_13|}  AuxVars[]  AssignedVars[#race~threads_alive~0][231], [threadThread3of3ForFork0InUse, 111#L688-5true, Black: 196#(= |#race~threads_alive~0| 0), 218#true, 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), 156#L688-2true, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 103#threadEXITtrue, 245#(<= 0 |ULTIMATE.start_main_#t~post8#1|), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|)])
[2023-10-26 09:08:49,821 INFO  L383   tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event
[2023-10-26 09:08:49,821 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-26 09:08:49,821 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-26 09:08:49,822 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-26 09:08:49,834 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([864] L688-4-->L688-5: Formula: (= |v_threadThread3of3ForFork0_#t~nondet4_3| |v_#race~threads_alive~0_13|)  InVars {threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|}  OutVars{threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, #race~threads_alive~0=|v_#race~threads_alive~0_13|}  AuxVars[]  AssignedVars[#race~threads_alive~0][231], [threadThread3of3ForFork0InUse, 75#threadErr2ASSERT_VIOLATIONDATA_RACEtrue, 111#L688-5true, Black: 196#(= |#race~threads_alive~0| 0), 218#true, 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), 156#L688-2true, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 245#(<= 0 |ULTIMATE.start_main_#t~post8#1|), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|)])
[2023-10-26 09:08:49,834 INFO  L383   tUnfolder$Statistics]: this new event has 70 ancestors and is not cut-off event
[2023-10-26 09:08:49,834 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is not cut-off event
[2023-10-26 09:08:49,834 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is not cut-off event
[2023-10-26 09:08:49,834 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is not cut-off event
[2023-10-26 09:08:49,839 INFO  L381   tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([941] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_44| |v_threadThread1of3ForFork0_#t~nondet4_13|)  InVars {}  OutVars{threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_13|, #race~threads_alive~0=|v_#race~threads_alive~0_44|}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet4, #race~threads_alive~0][81], [threadThread3of3ForFork0InUse, 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), Black: 196#(= |#race~threads_alive~0| 0), 62#L688-2true, 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 119#L688-5true, Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 129#L690true, 245#(<= 0 |ULTIMATE.start_main_#t~post8#1|), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 218#true])
[2023-10-26 09:08:49,839 INFO  L383   tUnfolder$Statistics]: this new event has 70 ancestors and is not cut-off event
[2023-10-26 09:08:49,839 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is not cut-off event
[2023-10-26 09:08:49,839 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is not cut-off event
[2023-10-26 09:08:49,839 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is not cut-off event
[2023-10-26 09:08:49,839 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is not cut-off event
[2023-10-26 09:08:49,839 INFO  L381   tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([941] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_44| |v_threadThread1of3ForFork0_#t~nondet4_13|)  InVars {}  OutVars{threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_13|, #race~threads_alive~0=|v_#race~threads_alive~0_44|}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet4, #race~threads_alive~0][81], [threadThread3of3ForFork0InUse, 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), Black: 196#(= |#race~threads_alive~0| 0), 62#L688-2true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, 119#L688-5true, 112#threadEXITtrue, Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 245#(<= 0 |ULTIMATE.start_main_#t~post8#1|), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 218#true])
[2023-10-26 09:08:49,839 INFO  L383   tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event
[2023-10-26 09:08:49,840 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-26 09:08:49,840 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-26 09:08:49,840 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-26 09:08:49,840 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-26 09:08:49,840 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-26 09:08:49,854 INFO  L381   tUnfolder$Statistics]: inserting event number 7 for the transition-marking pair ([941] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_44| |v_threadThread1of3ForFork0_#t~nondet4_13|)  InVars {}  OutVars{threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_13|, #race~threads_alive~0=|v_#race~threads_alive~0_44|}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet4, #race~threads_alive~0][81], [threadThread3of3ForFork0InUse, 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), Black: 196#(= |#race~threads_alive~0| 0), 62#L688-2true, 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 119#L688-5true, 112#threadEXITtrue, Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 245#(<= 0 |ULTIMATE.start_main_#t~post8#1|), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 218#true])
[2023-10-26 09:08:49,854 INFO  L383   tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event
[2023-10-26 09:08:49,854 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-26 09:08:49,855 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-26 09:08:49,855 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-26 09:08:49,855 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-26 09:08:49,855 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-26 09:08:49,855 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-26 09:08:49,855 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L688-2-->L688-4: Formula: (= (+ 2 v_~threads_alive~0_36) v_~threads_alive~0_37)  InVars {~threads_alive~0=v_~threads_alive~0_37}  OutVars{~threads_alive~0=v_~threads_alive~0_36, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_15|}  AuxVars[]  AssignedVars[~threads_alive~0, threadThread3of3ForFork0_#t~nondet4][336], [threadThread3of3ForFork0InUse, Black: 194#true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, 57#L688-4true, Black: 208#(= |#race~data~0| 0), 112#threadEXITtrue, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 245#(<= 0 |ULTIMATE.start_main_#t~post8#1|), threadThread1of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), threadThread2of3ForFork0InUse, 23#L688-3true])
[2023-10-26 09:08:49,855 INFO  L383   tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event
[2023-10-26 09:08:49,855 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-26 09:08:49,855 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-26 09:08:49,855 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-26 09:08:49,888 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([864] L688-4-->L688-5: Formula: (= |v_threadThread3of3ForFork0_#t~nondet4_3| |v_#race~threads_alive~0_13|)  InVars {threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|}  OutVars{threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, #race~threads_alive~0=|v_#race~threads_alive~0_13|}  AuxVars[]  AssignedVars[#race~threads_alive~0][231], [threadThread3of3ForFork0InUse, 111#L688-5true, 224#true, Black: 196#(= |#race~threads_alive~0| 0), 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 208#(= |#race~data~0| 0), 156#L688-2true, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 103#threadEXITtrue, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|)])
[2023-10-26 09:08:49,888 INFO  L383   tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event
[2023-10-26 09:08:49,888 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-26 09:08:49,888 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-26 09:08:49,888 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-26 09:08:49,890 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([984] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_50| |v_threadThread2of3ForFork0_#t~nondet4_17|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_17|, #race~threads_alive~0=|v_#race~threads_alive~0_50|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet4, #race~threads_alive~0][128], [threadThread3of3ForFork0InUse, 9#L688-5true, 224#true, Black: 196#(= |#race~threads_alive~0| 0), 62#L688-2true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 103#threadEXITtrue, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|)])
[2023-10-26 09:08:49,890 INFO  L383   tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event
[2023-10-26 09:08:49,890 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-26 09:08:49,890 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-26 09:08:49,890 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-26 09:08:49,902 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([941] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_44| |v_threadThread1of3ForFork0_#t~nondet4_13|)  InVars {}  OutVars{threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_13|, #race~threads_alive~0=|v_#race~threads_alive~0_44|}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet4, #race~threads_alive~0][45], [threadThread3of3ForFork0InUse, 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), 224#true, Black: 196#(= |#race~threads_alive~0| 0), 62#L688-2true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, 119#L688-5true, Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 129#L690true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 218#true])
[2023-10-26 09:08:49,902 INFO  L383   tUnfolder$Statistics]: this new event has 70 ancestors and is not cut-off event
[2023-10-26 09:08:49,902 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is not cut-off event
[2023-10-26 09:08:49,902 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is not cut-off event
[2023-10-26 09:08:49,902 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is not cut-off event
[2023-10-26 09:08:49,912 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([941] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_44| |v_threadThread1of3ForFork0_#t~nondet4_13|)  InVars {}  OutVars{threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_13|, #race~threads_alive~0=|v_#race~threads_alive~0_44|}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet4, #race~threads_alive~0][45], [threadThread3of3ForFork0InUse, 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), 224#true, Black: 196#(= |#race~threads_alive~0| 0), 62#L688-2true, 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 119#L688-5true, 112#threadEXITtrue, Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 218#true])
[2023-10-26 09:08:49,912 INFO  L383   tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event
[2023-10-26 09:08:49,912 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-26 09:08:49,912 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-26 09:08:49,912 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-26 09:08:49,936 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L688-2-->L688-4: Formula: (= (+ 2 v_~threads_alive~0_36) v_~threads_alive~0_37)  InVars {~threads_alive~0=v_~threads_alive~0_37}  OutVars{~threads_alive~0=v_~threads_alive~0_36, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_15|}  AuxVars[]  AssignedVars[~threads_alive~0, threadThread3of3ForFork0_#t~nondet4][275], [threadThread3of3ForFork0InUse, 75#threadErr2ASSERT_VIOLATIONDATA_RACEtrue, Black: 194#true, 164#L698-5true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 57#L688-4true, Black: 208#(= |#race~data~0| 0), 112#threadEXITtrue, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 245#(<= 0 |ULTIMATE.start_main_#t~post8#1|), threadThread1of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), threadThread2of3ForFork0InUse])
[2023-10-26 09:08:49,936 INFO  L383   tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event
[2023-10-26 09:08:49,937 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-26 09:08:49,937 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-26 09:08:49,937 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-26 09:08:50,433 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([984] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_50| |v_threadThread2of3ForFork0_#t~nondet4_17|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_17|, #race~threads_alive~0=|v_#race~threads_alive~0_50|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet4, #race~threads_alive~0][222], [threadThread3of3ForFork0InUse, 9#L688-5true, 224#true, Black: 196#(= |#race~threads_alive~0| 0), 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 76#L688-6true, 7#threadEXITtrue, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|)])
[2023-10-26 09:08:50,433 INFO  L383   tUnfolder$Statistics]: this new event has 74 ancestors and is cut-off event
[2023-10-26 09:08:50,433 INFO  L386   tUnfolder$Statistics]:   existing Event has 74 ancestors and is cut-off event
[2023-10-26 09:08:50,433 INFO  L386   tUnfolder$Statistics]:   existing Event has 74 ancestors and is cut-off event
[2023-10-26 09:08:50,433 INFO  L386   tUnfolder$Statistics]:   existing Event has 74 ancestors and is cut-off event
[2023-10-26 09:08:50,698 INFO  L130       PetriNetUnfolder]: 190525/317152 cut-off events.
[2023-10-26 09:08:50,699 INFO  L131       PetriNetUnfolder]: For 400239/430783 co-relation queries the response was YES.
[2023-10-26 09:08:51,780 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 899879 conditions, 317152 events. 190525/317152 cut-off events. For 400239/430783 co-relation queries the response was YES. Maximal size of possible extension queue 10515. Compared 3375792 event pairs, 46301 based on Foata normal form. 6530/291400 useless extension candidates. Maximal degree in co-relation 585968. Up to 118861 conditions per place. 
[2023-10-26 09:08:53,660 INFO  L137   encePairwiseOnDemand]: 298/307 looper letters, 268 selfloop transitions, 19 changer transitions 3/353 dead transitions.
[2023-10-26 09:08:53,660 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 353 transitions, 2513 flow
[2023-10-26 09:08:53,660 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2023-10-26 09:08:53,661 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-10-26 09:08:53,676 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1363 transitions.
[2023-10-26 09:08:53,677 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6342484876686831
[2023-10-26 09:08:53,679 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 1363 transitions.
[2023-10-26 09:08:53,679 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 1363 transitions.
[2023-10-26 09:08:53,680 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 09:08:53,680 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1363 transitions.
[2023-10-26 09:08:53,682 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 194.71428571428572) internal successors, (1363), 7 states have internal predecessors, (1363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:08:53,694 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 307.0) internal successors, (2456), 8 states have internal predecessors, (2456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:08:53,695 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 307.0) internal successors, (2456), 8 states have internal predecessors, (2456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:08:53,695 INFO  L175             Difference]: Start difference. First operand has 93 places, 138 transitions, 749 flow. Second operand 7 states and 1363 transitions.
[2023-10-26 09:08:53,695 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 353 transitions, 2513 flow
[2023-10-26 09:10:03,556 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 353 transitions, 2361 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-26 09:10:03,559 INFO  L231             Difference]: Finished difference. Result has 100 places, 158 transitions, 817 flow
[2023-10-26 09:10:03,559 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=693, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=817, PETRI_PLACES=100, PETRI_TRANSITIONS=158}
[2023-10-26 09:10:03,559 INFO  L288   CegarLoopForPetriNet]: 82 programPoint places, 18 predicate places.
[2023-10-26 09:10:03,563 INFO  L495      AbstractCegarLoop]: Abstraction has has 100 places, 158 transitions, 817 flow
[2023-10-26 09:10:03,563 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 174.8) internal successors, (874), 5 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:10:03,563 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 09:10:03,563 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 09:10:03,569 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2023-10-26 09:10:03,767 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22
[2023-10-26 09:10:03,768 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2023-10-26 09:10:03,768 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 09:10:03,769 INFO  L85        PathProgramCache]: Analyzing trace with hash -1277540627, now seen corresponding path program 1 times
[2023-10-26 09:10:03,769 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 09:10:03,769 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867572675]
[2023-10-26 09:10:03,769 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 09:10:03,770 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 09:10:03,801 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 09:10:03,942 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-10-26 09:10:03,942 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 09:10:03,942 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867572675]
[2023-10-26 09:10:03,942 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867572675] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 09:10:03,943 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 09:10:03,943 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-10-26 09:10:03,944 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758260368]
[2023-10-26 09:10:03,946 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 09:10:03,947 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-10-26 09:10:03,947 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 09:10:03,947 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-10-26 09:10:03,947 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2023-10-26 09:10:04,080 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 165 out of 307
[2023-10-26 09:10:04,081 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 158 transitions, 817 flow. Second operand  has 5 states, 5 states have (on average 168.4) internal successors, (842), 5 states have internal predecessors, (842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:10:04,081 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 09:10:04,081 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 307
[2023-10-26 09:10:04,081 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 09:10:06,503 INFO  L130       PetriNetUnfolder]: 15706/31175 cut-off events.
[2023-10-26 09:10:06,503 INFO  L131       PetriNetUnfolder]: For 23101/23856 co-relation queries the response was YES.
[2023-10-26 09:10:06,567 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 80768 conditions, 31175 events. 15706/31175 cut-off events. For 23101/23856 co-relation queries the response was YES. Maximal size of possible extension queue 750. Compared 287583 event pairs, 4035 based on Foata normal form. 2989/33084 useless extension candidates. Maximal degree in co-relation 52185. Up to 15852 conditions per place. 
[2023-10-26 09:10:06,646 INFO  L137   encePairwiseOnDemand]: 294/307 looper letters, 68 selfloop transitions, 13 changer transitions 0/118 dead transitions.
[2023-10-26 09:10:06,647 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 118 transitions, 663 flow
[2023-10-26 09:10:06,647 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-10-26 09:10:06,647 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-10-26 09:10:06,655 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 725 transitions.
[2023-10-26 09:10:06,656 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5903908794788274
[2023-10-26 09:10:06,657 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 725 transitions.
[2023-10-26 09:10:06,657 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 725 transitions.
[2023-10-26 09:10:06,657 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 09:10:06,657 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 725 transitions.
[2023-10-26 09:10:06,669 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 181.25) internal successors, (725), 4 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:10:06,670 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 307.0) internal successors, (1535), 5 states have internal predecessors, (1535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:10:06,671 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 307.0) internal successors, (1535), 5 states have internal predecessors, (1535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:10:06,671 INFO  L175             Difference]: Start difference. First operand has 100 places, 158 transitions, 817 flow. Second operand 4 states and 725 transitions.
[2023-10-26 09:10:06,671 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 118 transitions, 663 flow
[2023-10-26 09:10:06,849 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 118 transitions, 599 flow, removed 28 selfloop flow, removed 5 redundant places.
[2023-10-26 09:10:06,852 INFO  L231             Difference]: Finished difference. Result has 90 places, 93 transitions, 363 flow
[2023-10-26 09:10:06,852 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=337, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=363, PETRI_PLACES=90, PETRI_TRANSITIONS=93}
[2023-10-26 09:10:06,852 INFO  L288   CegarLoopForPetriNet]: 82 programPoint places, 8 predicate places.
[2023-10-26 09:10:06,852 INFO  L495      AbstractCegarLoop]: Abstraction has has 90 places, 93 transitions, 363 flow
[2023-10-26 09:10:06,853 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 168.4) internal successors, (842), 5 states have internal predecessors, (842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:10:06,853 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 09:10:06,853 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 09:10:06,853 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2023-10-26 09:10:06,853 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2023-10-26 09:10:06,854 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 09:10:06,854 INFO  L85        PathProgramCache]: Analyzing trace with hash 928932594, now seen corresponding path program 1 times
[2023-10-26 09:10:06,854 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 09:10:06,854 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218521820]
[2023-10-26 09:10:06,854 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 09:10:06,854 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 09:10:06,897 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 09:10:06,951 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked.
[2023-10-26 09:10:06,951 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 09:10:06,951 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218521820]
[2023-10-26 09:10:06,951 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218521820] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 09:10:06,951 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 09:10:06,951 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-26 09:10:06,952 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344964050]
[2023-10-26 09:10:06,952 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 09:10:06,952 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-26 09:10:06,955 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 09:10:06,955 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-26 09:10:06,955 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-26 09:10:06,970 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 174 out of 307
[2023-10-26 09:10:06,970 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 93 transitions, 363 flow. Second operand  has 3 states, 3 states have (on average 178.0) internal successors, (534), 3 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:10:06,970 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 09:10:06,971 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 307
[2023-10-26 09:10:06,971 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 09:10:08,795 INFO  L130       PetriNetUnfolder]: 12340/24716 cut-off events.
[2023-10-26 09:10:08,795 INFO  L131       PetriNetUnfolder]: For 11913/12428 co-relation queries the response was YES.
[2023-10-26 09:10:08,853 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 60037 conditions, 24716 events. 12340/24716 cut-off events. For 11913/12428 co-relation queries the response was YES. Maximal size of possible extension queue 734. Compared 226377 event pairs, 8112 based on Foata normal form. 8/22709 useless extension candidates. Maximal degree in co-relation 39253. Up to 16781 conditions per place. 
[2023-10-26 09:10:09,945 INFO  L137   encePairwiseOnDemand]: 301/307 looper letters, 77 selfloop transitions, 12 changer transitions 0/129 dead transitions.
[2023-10-26 09:10:09,945 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 129 transitions, 687 flow
[2023-10-26 09:10:09,946 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-26 09:10:09,946 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-26 09:10:09,946 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 587 transitions.
[2023-10-26 09:10:09,947 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6373507057546145
[2023-10-26 09:10:09,947 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 587 transitions.
[2023-10-26 09:10:09,947 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 587 transitions.
[2023-10-26 09:10:09,947 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 09:10:09,947 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 587 transitions.
[2023-10-26 09:10:09,949 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 195.66666666666666) internal successors, (587), 3 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:10:09,950 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 307.0) internal successors, (1228), 4 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:10:09,950 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 307.0) internal successors, (1228), 4 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:10:09,950 INFO  L175             Difference]: Start difference. First operand has 90 places, 93 transitions, 363 flow. Second operand 3 states and 587 transitions.
[2023-10-26 09:10:09,950 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 129 transitions, 687 flow
[2023-10-26 09:10:09,962 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 129 transitions, 667 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-26 09:10:09,963 INFO  L231             Difference]: Finished difference. Result has 91 places, 101 transitions, 448 flow
[2023-10-26 09:10:09,963 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=448, PETRI_PLACES=91, PETRI_TRANSITIONS=101}
[2023-10-26 09:10:09,968 INFO  L288   CegarLoopForPetriNet]: 82 programPoint places, 9 predicate places.
[2023-10-26 09:10:09,968 INFO  L495      AbstractCegarLoop]: Abstraction has has 91 places, 101 transitions, 448 flow
[2023-10-26 09:10:09,968 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 178.0) internal successors, (534), 3 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:10:09,969 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 09:10:09,969 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 09:10:09,969 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2023-10-26 09:10:09,969 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2023-10-26 09:10:09,969 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 09:10:09,969 INFO  L85        PathProgramCache]: Analyzing trace with hash -683014751, now seen corresponding path program 1 times
[2023-10-26 09:10:09,969 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 09:10:09,970 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558733845]
[2023-10-26 09:10:09,970 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 09:10:09,970 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 09:10:10,003 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 09:10:10,120 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2023-10-26 09:10:10,121 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 09:10:10,124 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558733845]
[2023-10-26 09:10:10,124 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558733845] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 09:10:10,124 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 09:10:10,124 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-10-26 09:10:10,125 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341920918]
[2023-10-26 09:10:10,125 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 09:10:10,125 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-26 09:10:10,126 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 09:10:10,126 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-26 09:10:10,128 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-26 09:10:10,170 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 169 out of 307
[2023-10-26 09:10:10,171 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 101 transitions, 448 flow. Second operand  has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:10:10,171 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 09:10:10,171 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 307
[2023-10-26 09:10:10,171 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 09:10:13,834 INFO  L130       PetriNetUnfolder]: 25377/49342 cut-off events.
[2023-10-26 09:10:13,834 INFO  L131       PetriNetUnfolder]: For 44120/46312 co-relation queries the response was YES.
[2023-10-26 09:10:13,966 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 128665 conditions, 49342 events. 25377/49342 cut-off events. For 44120/46312 co-relation queries the response was YES. Maximal size of possible extension queue 1426. Compared 488374 event pairs, 4916 based on Foata normal form. 1580/48575 useless extension candidates. Maximal degree in co-relation 92369. Up to 23483 conditions per place. 
[2023-10-26 09:10:14,121 INFO  L137   encePairwiseOnDemand]: 295/307 looper letters, 101 selfloop transitions, 13 changer transitions 0/155 dead transitions.
[2023-10-26 09:10:14,121 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 155 transitions, 941 flow
[2023-10-26 09:10:14,121 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-26 09:10:14,121 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-26 09:10:14,124 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 583 transitions.
[2023-10-26 09:10:14,124 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6330076004343105
[2023-10-26 09:10:14,125 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 583 transitions.
[2023-10-26 09:10:14,125 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 583 transitions.
[2023-10-26 09:10:14,125 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 09:10:14,125 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 583 transitions.
[2023-10-26 09:10:14,126 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 194.33333333333334) internal successors, (583), 3 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:10:14,127 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 307.0) internal successors, (1228), 4 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:10:14,127 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 307.0) internal successors, (1228), 4 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:10:14,127 INFO  L175             Difference]: Start difference. First operand has 91 places, 101 transitions, 448 flow. Second operand 3 states and 583 transitions.
[2023-10-26 09:10:14,127 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 155 transitions, 941 flow
[2023-10-26 09:10:14,304 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 155 transitions, 919 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-10-26 09:10:14,306 INFO  L231             Difference]: Finished difference. Result has 93 places, 111 transitions, 525 flow
[2023-10-26 09:10:14,306 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=525, PETRI_PLACES=93, PETRI_TRANSITIONS=111}
[2023-10-26 09:10:14,307 INFO  L288   CegarLoopForPetriNet]: 82 programPoint places, 11 predicate places.
[2023-10-26 09:10:14,307 INFO  L495      AbstractCegarLoop]: Abstraction has has 93 places, 111 transitions, 525 flow
[2023-10-26 09:10:14,308 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:10:14,308 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 09:10:14,308 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 09:10:14,309 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2023-10-26 09:10:14,309 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2023-10-26 09:10:14,309 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 09:10:14,309 INFO  L85        PathProgramCache]: Analyzing trace with hash 74336075, now seen corresponding path program 2 times
[2023-10-26 09:10:14,309 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 09:10:14,309 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853908897]
[2023-10-26 09:10:14,309 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 09:10:14,310 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 09:10:14,344 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 09:10:14,480 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2023-10-26 09:10:14,481 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 09:10:14,493 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853908897]
[2023-10-26 09:10:14,493 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853908897] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-26 09:10:14,493 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587957003]
[2023-10-26 09:10:14,494 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2023-10-26 09:10:14,494 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 09:10:14,494 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 09:10:14,495 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-26 09:10:14,537 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2023-10-26 09:10:14,652 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2023-10-26 09:10:14,652 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-26 09:10:14,653 INFO  L263         TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 9 conjunts are in the unsatisfiable core
[2023-10-26 09:10:14,657 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 09:10:14,748 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-10-26 09:10:14,793 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 09:10:14,794 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16
[2023-10-26 09:10:14,807 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2023-10-26 09:10:14,807 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-26 09:10:14,877 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 09:10:14,878 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20
[2023-10-26 09:10:14,880 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25
[2023-10-26 09:10:14,927 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2023-10-26 09:10:14,927 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [587957003] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-26 09:10:14,928 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-26 09:10:14,928 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9
[2023-10-26 09:10:14,928 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451588001]
[2023-10-26 09:10:14,929 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-26 09:10:14,929 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2023-10-26 09:10:14,929 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 09:10:14,929 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2023-10-26 09:10:14,929 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=55, Unknown=1, NotChecked=0, Total=90
[2023-10-26 09:10:15,200 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 168 out of 307
[2023-10-26 09:10:15,201 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 111 transitions, 525 flow. Second operand  has 10 states, 10 states have (on average 171.5) internal successors, (1715), 10 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:10:15,201 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 09:10:15,201 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 307
[2023-10-26 09:10:15,202 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 09:10:16,858 INFO  L130       PetriNetUnfolder]: 6946/16038 cut-off events.
[2023-10-26 09:10:16,858 INFO  L131       PetriNetUnfolder]: For 15357/16081 co-relation queries the response was YES.
[2023-10-26 09:10:16,893 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 45751 conditions, 16038 events. 6946/16038 cut-off events. For 15357/16081 co-relation queries the response was YES. Maximal size of possible extension queue 549. Compared 155470 event pairs, 2433 based on Foata normal form. 935/16109 useless extension candidates. Maximal degree in co-relation 23210. Up to 9699 conditions per place. 
[2023-10-26 09:10:16,932 INFO  L137   encePairwiseOnDemand]: 300/307 looper letters, 77 selfloop transitions, 12 changer transitions 0/129 dead transitions.
[2023-10-26 09:10:16,932 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 129 transitions, 740 flow
[2023-10-26 09:10:16,932 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-10-26 09:10:16,933 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-10-26 09:10:16,933 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 737 transitions.
[2023-10-26 09:10:16,934 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6001628664495114
[2023-10-26 09:10:16,934 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 737 transitions.
[2023-10-26 09:10:16,934 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 737 transitions.
[2023-10-26 09:10:16,934 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 09:10:16,934 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 737 transitions.
[2023-10-26 09:10:16,935 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 184.25) internal successors, (737), 4 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:10:16,936 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 307.0) internal successors, (1535), 5 states have internal predecessors, (1535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:10:16,937 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 307.0) internal successors, (1535), 5 states have internal predecessors, (1535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:10:16,937 INFO  L175             Difference]: Start difference. First operand has 93 places, 111 transitions, 525 flow. Second operand 4 states and 737 transitions.
[2023-10-26 09:10:16,937 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 129 transitions, 740 flow
[2023-10-26 09:10:16,952 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 129 transitions, 723 flow, removed 2 selfloop flow, removed 1 redundant places.
[2023-10-26 09:10:16,954 INFO  L231             Difference]: Finished difference. Result has 95 places, 101 transitions, 454 flow
[2023-10-26 09:10:16,954 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=430, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=454, PETRI_PLACES=95, PETRI_TRANSITIONS=101}
[2023-10-26 09:10:16,955 INFO  L288   CegarLoopForPetriNet]: 82 programPoint places, 13 predicate places.
[2023-10-26 09:10:16,955 INFO  L495      AbstractCegarLoop]: Abstraction has has 95 places, 101 transitions, 454 flow
[2023-10-26 09:10:16,956 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 171.5) internal successors, (1715), 10 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:10:16,956 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 09:10:16,956 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 09:10:16,963 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0
[2023-10-26 09:10:17,161 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,5 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 09:10:17,161 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2023-10-26 09:10:17,162 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 09:10:17,162 INFO  L85        PathProgramCache]: Analyzing trace with hash 1830676315, now seen corresponding path program 1 times
[2023-10-26 09:10:17,162 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 09:10:17,162 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408542765]
[2023-10-26 09:10:17,163 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 09:10:17,163 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 09:10:17,194 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 09:10:17,222 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked.
[2023-10-26 09:10:17,222 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 09:10:17,223 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408542765]
[2023-10-26 09:10:17,223 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408542765] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 09:10:17,223 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 09:10:17,223 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-26 09:10:17,223 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268843357]
[2023-10-26 09:10:17,223 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 09:10:17,223 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-26 09:10:17,237 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 09:10:17,237 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-26 09:10:17,237 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-26 09:10:17,266 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 169 out of 307
[2023-10-26 09:10:17,267 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 101 transitions, 454 flow. Second operand  has 3 states, 3 states have (on average 174.33333333333334) internal successors, (523), 3 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:10:17,267 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 09:10:17,267 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 307
[2023-10-26 09:10:17,267 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 09:10:18,733 INFO  L130       PetriNetUnfolder]: 7661/17723 cut-off events.
[2023-10-26 09:10:18,733 INFO  L131       PetriNetUnfolder]: For 18667/19190 co-relation queries the response was YES.
[2023-10-26 09:10:18,772 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 50483 conditions, 17723 events. 7661/17723 cut-off events. For 18667/19190 co-relation queries the response was YES. Maximal size of possible extension queue 562. Compared 171596 event pairs, 5125 based on Foata normal form. 1/16720 useless extension candidates. Maximal degree in co-relation 26943. Up to 12759 conditions per place. 
[2023-10-26 09:10:18,811 INFO  L137   encePairwiseOnDemand]: 304/307 looper letters, 72 selfloop transitions, 2 changer transitions 3/118 dead transitions.
[2023-10-26 09:10:18,811 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 118 transitions, 707 flow
[2023-10-26 09:10:18,811 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-26 09:10:18,812 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-26 09:10:18,812 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 559 transitions.
[2023-10-26 09:10:18,813 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6069489685124865
[2023-10-26 09:10:18,813 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 559 transitions.
[2023-10-26 09:10:18,813 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 559 transitions.
[2023-10-26 09:10:18,813 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 09:10:18,813 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 559 transitions.
[2023-10-26 09:10:18,814 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 186.33333333333334) internal successors, (559), 3 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:10:18,815 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 307.0) internal successors, (1228), 4 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:10:18,815 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 307.0) internal successors, (1228), 4 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:10:18,815 INFO  L175             Difference]: Start difference. First operand has 95 places, 101 transitions, 454 flow. Second operand 3 states and 559 transitions.
[2023-10-26 09:10:18,816 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 118 transitions, 707 flow
[2023-10-26 09:10:18,833 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 118 transitions, 689 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-26 09:10:18,835 INFO  L231             Difference]: Finished difference. Result has 94 places, 100 transitions, 444 flow
[2023-10-26 09:10:18,835 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=444, PETRI_PLACES=94, PETRI_TRANSITIONS=100}
[2023-10-26 09:10:18,836 INFO  L288   CegarLoopForPetriNet]: 82 programPoint places, 12 predicate places.
[2023-10-26 09:10:18,836 INFO  L495      AbstractCegarLoop]: Abstraction has has 94 places, 100 transitions, 444 flow
[2023-10-26 09:10:18,836 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 174.33333333333334) internal successors, (523), 3 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:10:18,836 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 09:10:18,837 INFO  L209   CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 09:10:18,837 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2023-10-26 09:10:18,837 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2023-10-26 09:10:18,837 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 09:10:18,837 INFO  L85        PathProgramCache]: Analyzing trace with hash 1793748985, now seen corresponding path program 1 times
[2023-10-26 09:10:18,837 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 09:10:18,838 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881298263]
[2023-10-26 09:10:18,838 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 09:10:18,839 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 09:10:18,896 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 09:10:18,920 INFO  L134       CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked.
[2023-10-26 09:10:18,920 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 09:10:18,921 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881298263]
[2023-10-26 09:10:18,921 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881298263] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 09:10:18,921 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 09:10:18,921 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-26 09:10:18,921 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010444825]
[2023-10-26 09:10:18,921 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 09:10:18,921 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-26 09:10:18,921 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 09:10:18,922 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-26 09:10:18,922 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-26 09:10:18,943 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 174 out of 307
[2023-10-26 09:10:18,943 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 100 transitions, 444 flow. Second operand  has 3 states, 3 states have (on average 178.66666666666666) internal successors, (536), 3 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:10:18,943 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 09:10:18,943 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 307
[2023-10-26 09:10:18,943 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 09:10:20,100 INFO  L130       PetriNetUnfolder]: 6863/16556 cut-off events.
[2023-10-26 09:10:20,101 INFO  L131       PetriNetUnfolder]: For 15647/15802 co-relation queries the response was YES.
[2023-10-26 09:10:20,140 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 46618 conditions, 16556 events. 6863/16556 cut-off events. For 15647/15802 co-relation queries the response was YES. Maximal size of possible extension queue 557. Compared 164400 event pairs, 4421 based on Foata normal form. 4/15578 useless extension candidates. Maximal degree in co-relation 26713. Up to 11071 conditions per place. 
[2023-10-26 09:10:20,177 INFO  L137   encePairwiseOnDemand]: 303/307 looper letters, 77 selfloop transitions, 4 changer transitions 0/124 dead transitions.
[2023-10-26 09:10:20,178 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 124 transitions, 705 flow
[2023-10-26 09:10:20,178 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-26 09:10:20,178 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-26 09:10:20,179 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 578 transitions.
[2023-10-26 09:10:20,179 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6275787187839305
[2023-10-26 09:10:20,179 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 578 transitions.
[2023-10-26 09:10:20,179 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 578 transitions.
[2023-10-26 09:10:20,180 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 09:10:20,180 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 578 transitions.
[2023-10-26 09:10:20,181 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 192.66666666666666) internal successors, (578), 3 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:10:20,208 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 307.0) internal successors, (1228), 4 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:10:20,208 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 307.0) internal successors, (1228), 4 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:10:20,209 INFO  L175             Difference]: Start difference. First operand has 94 places, 100 transitions, 444 flow. Second operand 3 states and 578 transitions.
[2023-10-26 09:10:20,209 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 124 transitions, 705 flow
[2023-10-26 09:10:20,227 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 124 transitions, 697 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-26 09:10:20,235 INFO  L231             Difference]: Finished difference. Result has 95 places, 102 transitions, 468 flow
[2023-10-26 09:10:20,235 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=468, PETRI_PLACES=95, PETRI_TRANSITIONS=102}
[2023-10-26 09:10:20,236 INFO  L288   CegarLoopForPetriNet]: 82 programPoint places, 13 predicate places.
[2023-10-26 09:10:20,237 INFO  L495      AbstractCegarLoop]: Abstraction has has 95 places, 102 transitions, 468 flow
[2023-10-26 09:10:20,237 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 178.66666666666666) internal successors, (536), 3 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:10:20,237 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 09:10:20,237 INFO  L209   CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1]
[2023-10-26 09:10:20,237 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2023-10-26 09:10:20,237 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2023-10-26 09:10:20,237 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 09:10:20,238 INFO  L85        PathProgramCache]: Analyzing trace with hash 2137542505, now seen corresponding path program 1 times
[2023-10-26 09:10:20,238 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 09:10:20,238 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267917767]
[2023-10-26 09:10:20,238 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 09:10:20,239 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 09:10:20,288 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-26 09:10:20,288 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-10-26 09:10:20,316 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-26 09:10:20,350 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-10-26 09:10:20,350 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-10-26 09:10:20,351 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 18 remaining)
[2023-10-26 09:10:20,351 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (16 of 18 remaining)
[2023-10-26 09:10:20,351 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (15 of 18 remaining)
[2023-10-26 09:10:20,351 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (14 of 18 remaining)
[2023-10-26 09:10:20,351 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (13 of 18 remaining)
[2023-10-26 09:10:20,351 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (12 of 18 remaining)
[2023-10-26 09:10:20,351 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (11 of 18 remaining)
[2023-10-26 09:10:20,352 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (10 of 18 remaining)
[2023-10-26 09:10:20,352 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (9 of 18 remaining)
[2023-10-26 09:10:20,352 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (8 of 18 remaining)
[2023-10-26 09:10:20,352 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (7 of 18 remaining)
[2023-10-26 09:10:20,352 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (6 of 18 remaining)
[2023-10-26 09:10:20,352 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 18 remaining)
[2023-10-26 09:10:20,352 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 18 remaining)
[2023-10-26 09:10:20,353 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (3 of 18 remaining)
[2023-10-26 09:10:20,353 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 18 remaining)
[2023-10-26 09:10:20,353 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 18 remaining)
[2023-10-26 09:10:20,353 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (0 of 18 remaining)
[2023-10-26 09:10:20,353 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2023-10-26 09:10:20,353 INFO  L445         BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 09:10:20,354 WARN  L233   ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-10-26 09:10:20,354 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances.
[2023-10-26 09:10:20,377 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2023-10-26 09:10:20,378 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 220 places, 215 transitions, 462 flow
[2023-10-26 09:10:20,406 INFO  L130       PetriNetUnfolder]: 16/429 cut-off events.
[2023-10-26 09:10:20,406 INFO  L131       PetriNetUnfolder]: For 16/16 co-relation queries the response was YES.
[2023-10-26 09:10:20,407 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 452 conditions, 429 events. 16/429 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 640 event pairs, 0 based on Foata normal form. 0/372 useless extension candidates. Maximal degree in co-relation 352. Up to 10 conditions per place. 
[2023-10-26 09:10:20,407 INFO  L82        GeneralOperation]: Start removeDead. Operand has 220 places, 215 transitions, 462 flow
[2023-10-26 09:10:20,421 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 220 places, 215 transitions, 462 flow
[2023-10-26 09:10:20,437 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-10-26 09:10:20,437 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 220 places, 215 transitions, 462 flow
[2023-10-26 09:10:20,437 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 220 places, 215 transitions, 462 flow
[2023-10-26 09:10:20,438 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 220 places, 215 transitions, 462 flow
[2023-10-26 09:10:20,478 INFO  L130       PetriNetUnfolder]: 16/429 cut-off events.
[2023-10-26 09:10:20,478 INFO  L131       PetriNetUnfolder]: For 16/16 co-relation queries the response was YES.
[2023-10-26 09:10:20,479 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 452 conditions, 429 events. 16/429 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 640 event pairs, 0 based on Foata normal form. 0/372 useless extension candidates. Maximal degree in co-relation 352. Up to 10 conditions per place. 
[2023-10-26 09:10:20,504 INFO  L119        LiptonReduction]: Number of co-enabled transitions 20696
[2023-10-26 09:10:23,859 INFO  L134        LiptonReduction]: Checked pairs total: 99608
[2023-10-26 09:10:23,859 INFO  L136        LiptonReduction]: Total number of compositions: 130
[2023-10-26 09:10:23,860 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-10-26 09:10:23,860 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;@4cc6d504, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-10-26 09:10:23,860 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 21 error locations.
[2023-10-26 09:10:23,861 INFO  L130       PetriNetUnfolder]: 0/6 cut-off events.
[2023-10-26 09:10:23,861 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-26 09:10:23,861 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 09:10:23,861 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1]
[2023-10-26 09:10:23,861 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 18 more)] ===
[2023-10-26 09:10:23,861 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 09:10:23,862 INFO  L85        PathProgramCache]: Analyzing trace with hash 44451972, now seen corresponding path program 1 times
[2023-10-26 09:10:23,862 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 09:10:23,862 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745384354]
[2023-10-26 09:10:23,862 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 09:10:23,862 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 09:10:23,885 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 09:10:23,899 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 09:10:23,899 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 09:10:23,900 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745384354]
[2023-10-26 09:10:23,900 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745384354] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 09:10:23,900 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 09:10:23,900 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-26 09:10:23,900 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595197262]
[2023-10-26 09:10:23,900 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 09:10:23,900 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-26 09:10:23,901 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 09:10:23,901 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-26 09:10:23,901 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-26 09:10:23,955 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 185 out of 345
[2023-10-26 09:10:23,955 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 93 transitions, 218 flow. Second operand  has 3 states, 3 states have (on average 186.33333333333334) internal successors, (559), 3 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:10:23,955 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 09:10:23,955 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 345
[2023-10-26 09:10:23,956 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
