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


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


Checking for data races
Using default analysis
Version 2329fc70
Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data -tc /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/AutomizerReach.xml -i /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/thread-join-array-dynamic-race-2.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 fa97db609b81da66bf52cc8a991e92a8e36f90f772d6309b33e0ed95dfe245e6
--- Real Ultimate output ---
This is Ultimate 0.2.2-dev-2329fc7
[2023-11-03 13:08:03,966 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2023-11-03 13:08:03,968 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2023-11-03 13:08:03,989 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2023-11-03 13:08:03,989 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2023-11-03 13:08:03,990 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2023-11-03 13:08:03,991 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2023-11-03 13:08:03,992 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2023-11-03 13:08:03,993 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2023-11-03 13:08:03,994 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2023-11-03 13:08:03,994 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2023-11-03 13:08:03,995 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2023-11-03 13:08:03,995 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2023-11-03 13:08:03,996 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2023-11-03 13:08:03,997 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2023-11-03 13:08:03,998 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2023-11-03 13:08:03,998 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2023-11-03 13:08:03,999 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2023-11-03 13:08:04,001 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2023-11-03 13:08:04,002 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2023-11-03 13:08:04,003 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2023-11-03 13:08:04,005 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2023-11-03 13:08:04,006 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2023-11-03 13:08:04,006 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2023-11-03 13:08:04,010 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2023-11-03 13:08:04,010 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2023-11-03 13:08:04,010 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2023-11-03 13:08:04,011 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2023-11-03 13:08:04,012 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2023-11-03 13:08:04,012 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2023-11-03 13:08:04,013 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2023-11-03 13:08:04,013 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2023-11-03 13:08:04,014 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2023-11-03 13:08:04,015 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2023-11-03 13:08:04,016 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2023-11-03 13:08:04,016 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2023-11-03 13:08:04,017 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2023-11-03 13:08:04,017 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2023-11-03 13:08:04,017 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2023-11-03 13:08:04,018 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2023-11-03 13:08:04,018 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2023-11-03 13:08:04,019 INFO  L101        SettingsManager]: Beginning loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2023-11-03 13:08:04,039 INFO  L113        SettingsManager]: Loading preferences was successful
[2023-11-03 13:08:04,039 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2023-11-03 13:08:04,039 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-11-03 13:08:04,039 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-11-03 13:08:04,040 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-11-03 13:08:04,040 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-11-03 13:08:04,040 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-11-03 13:08:04,040 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2023-11-03 13:08:04,041 INFO  L138        SettingsManager]:  * Use SBE=true
[2023-11-03 13:08:04,041 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-11-03 13:08:04,041 INFO  L138        SettingsManager]:  * sizeof long=4
[2023-11-03 13:08:04,041 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2023-11-03 13:08:04,041 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2023-11-03 13:08:04,041 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2023-11-03 13:08:04,041 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2023-11-03 13:08:04,042 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2023-11-03 13:08:04,042 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-11-03 13:08:04,042 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2023-11-03 13:08:04,042 INFO  L138        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2023-11-03 13:08:04,042 INFO  L138        SettingsManager]:  * sizeof long double=12
[2023-11-03 13:08:04,042 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2023-11-03 13:08:04,042 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2023-11-03 13:08:04,042 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2023-11-03 13:08:04,042 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-11-03 13:08:04,043 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2023-11-03 13:08:04,043 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2023-11-03 13:08:04,043 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-03 13:08:04,043 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-11-03 13:08:04,043 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2023-11-03 13:08:04,043 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2023-11-03 13:08:04,043 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2023-11-03 13:08:04,043 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-11-03 13:08:04,043 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2023-11-03 13:08:04,044 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-11-03 13:08:04,044 INFO  L138        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2023-11-03 13:08:04,044 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2023-11-03 13:08:04,044 INFO  L138        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2023-11-03 13:08:04,044 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 -> fa97db609b81da66bf52cc8a991e92a8e36f90f772d6309b33e0ed95dfe245e6
[2023-11-03 13:08:04,225 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2023-11-03 13:08:04,246 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-11-03 13:08:04,248 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-11-03 13:08:04,249 INFO  L271        PluginConnector]: Initializing CDTParser...
[2023-11-03 13:08:04,249 INFO  L275        PluginConnector]: CDTParser initialized
[2023-11-03 13:08:04,250 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/thread-join-array-dynamic-race-2.i
[2023-11-03 13:08:05,273 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2023-11-03 13:08:05,518 INFO  L351              CDTParser]: Found 1 translation units.
[2023-11-03 13:08:05,519 INFO  L172              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/thread-join-array-dynamic-race-2.i
[2023-11-03 13:08:05,529 INFO  L394              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/19af4087d/50278ee72af74f6988f761b948aed0de/FLAGd188b65ec
[2023-11-03 13:08:05,864 INFO  L402              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/19af4087d/50278ee72af74f6988f761b948aed0de
[2023-11-03 13:08:05,867 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-11-03 13:08:05,868 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2023-11-03 13:08:05,869 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-11-03 13:08:05,869 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-11-03 13:08:05,872 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2023-11-03 13:08:05,873 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:08:05" (1/1) ...
[2023-11-03 13:08:05,874 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6478e157 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:08:05, skipping insertion in model container
[2023-11-03 13:08:05,874 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:08:05" (1/1) ...
[2023-11-03 13:08:05,884 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2023-11-03 13:08:05,927 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2023-11-03 13:08:06,049 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2023-11-03 13:08:06,179 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-11-03 13:08:06,188 INFO  L203         MainTranslator]: Completed pre-run
[2023-11-03 13:08:06,198 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2023-11-03 13:08:06,221 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-11-03 13:08:06,258 INFO  L208         MainTranslator]: Completed translation
[2023-11-03 13:08:06,259 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:08:06 WrapperNode
[2023-11-03 13:08:06,259 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-11-03 13:08:06,260 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-11-03 13:08:06,260 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-11-03 13:08:06,260 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2023-11-03 13:08:06,265 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:08:06" (1/1) ...
[2023-11-03 13:08:06,278 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:08:06" (1/1) ...
[2023-11-03 13:08:06,297 INFO  L138                Inliner]: procedures = 269, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 82
[2023-11-03 13:08:06,297 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-11-03 13:08:06,298 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-11-03 13:08:06,298 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2023-11-03 13:08:06,298 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2023-11-03 13:08:06,305 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:08:06" (1/1) ...
[2023-11-03 13:08:06,305 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:08:06" (1/1) ...
[2023-11-03 13:08:06,309 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:08:06" (1/1) ...
[2023-11-03 13:08:06,309 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:08:06" (1/1) ...
[2023-11-03 13:08:06,315 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:08:06" (1/1) ...
[2023-11-03 13:08:06,318 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:08:06" (1/1) ...
[2023-11-03 13:08:06,319 INFO  L185        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:08:06" (1/1) ...
[2023-11-03 13:08:06,320 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:08:06" (1/1) ...
[2023-11-03 13:08:06,323 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-11-03 13:08:06,324 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-11-03 13:08:06,324 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2023-11-03 13:08:06,324 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2023-11-03 13:08:06,324 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:08:06" (1/1) ...
[2023-11-03 13:08:06,330 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-03 13:08:06,338 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 13:08:06,354 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2023-11-03 13:08:06,358 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2023-11-03 13:08:06,379 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2023-11-03 13:08:06,379 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2023-11-03 13:08:06,379 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-11-03 13:08:06,379 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2023-11-03 13:08:06,379 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2023-11-03 13:08:06,379 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2023-11-03 13:08:06,380 INFO  L130     BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock
[2023-11-03 13:08:06,380 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2023-11-03 13:08:06,380 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2023-11-03 13:08:06,380 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2023-11-03 13:08:06,380 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2023-11-03 13:08:06,380 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2023-11-03 13:08:06,380 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-11-03 13:08:06,380 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-11-03 13:08:06,382 WARN  L209             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2023-11-03 13:08:06,501 INFO  L235             CfgBuilder]: Building ICFG
[2023-11-03 13:08:06,503 INFO  L261             CfgBuilder]: Building CFG for each procedure with an implementation
[2023-11-03 13:08:06,714 INFO  L276             CfgBuilder]: Performing block encoding
[2023-11-03 13:08:06,720 INFO  L295             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-11-03 13:08:06,720 INFO  L300             CfgBuilder]: Removed 2 assume(true) statements.
[2023-11-03 13:08:06,722 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:08:06 BoogieIcfgContainer
[2023-11-03 13:08:06,722 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-11-03 13:08:06,724 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-11-03 13:08:06,724 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2023-11-03 13:08:06,727 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2023-11-03 13:08:06,727 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 01:08:05" (1/3) ...
[2023-11-03 13:08:06,727 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21b30e8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 01:08:06, skipping insertion in model container
[2023-11-03 13:08:06,727 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:08:06" (2/3) ...
[2023-11-03 13:08:06,728 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21b30e8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 01:08:06, skipping insertion in model container
[2023-11-03 13:08:06,728 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:08:06" (3/3) ...
[2023-11-03 13:08:06,729 INFO  L112   eAbstractionObserver]: Analyzing ICFG thread-join-array-dynamic-race-2.i
[2023-11-03 13:08:06,737 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2023-11-03 13:08:06,745 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-11-03 13:08:06,745 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations.
[2023-11-03 13:08:06,745 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2023-11-03 13:08:06,786 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2023-11-03 13:08:06,814 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 106 places, 107 transitions, 222 flow
[2023-11-03 13:08:06,860 INFO  L130       PetriNetUnfolder]: 6/156 cut-off events.
[2023-11-03 13:08:06,860 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-11-03 13:08:06,864 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 162 conditions, 156 events. 6/156 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 306 event pairs, 0 based on Foata normal form. 0/136 useless extension candidates. Maximal degree in co-relation 81. Up to 4 conditions per place. 
[2023-11-03 13:08:06,864 INFO  L82        GeneralOperation]: Start removeDead. Operand has 106 places, 107 transitions, 222 flow
[2023-11-03 13:08:06,869 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 106 places, 107 transitions, 222 flow
[2023-11-03 13:08:06,872 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-11-03 13:08:06,881 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 107 transitions, 222 flow
[2023-11-03 13:08:06,883 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 107 transitions, 222 flow
[2023-11-03 13:08:06,884 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 106 places, 107 transitions, 222 flow
[2023-11-03 13:08:06,912 INFO  L130       PetriNetUnfolder]: 6/156 cut-off events.
[2023-11-03 13:08:06,912 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-11-03 13:08:06,912 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 162 conditions, 156 events. 6/156 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 306 event pairs, 0 based on Foata normal form. 0/136 useless extension candidates. Maximal degree in co-relation 81. Up to 4 conditions per place. 
[2023-11-03 13:08:06,914 INFO  L119        LiptonReduction]: Number of co-enabled transitions 1568
[2023-11-03 13:08:10,437 INFO  L134        LiptonReduction]: Checked pairs total: 2097
[2023-11-03 13:08:10,438 INFO  L136        LiptonReduction]: Total number of compositions: 101
[2023-11-03 13:08:10,451 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-03 13:08:10,457 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;@4c36d5a2, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-11-03 13:08:10,457 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 8 error locations.
[2023-11-03 13:08:10,459 INFO  L130       PetriNetUnfolder]: 0/2 cut-off events.
[2023-11-03 13:08:10,459 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-11-03 13:08:10,459 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:08:10,459 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1]
[2023-11-03 13:08:10,460 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-11-03 13:08:10,463 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:08:10,463 INFO  L85        PathProgramCache]: Analyzing trace with hash 12251, now seen corresponding path program 1 times
[2023-11-03 13:08:10,470 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:08:10,471 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963036821]
[2023-11-03 13:08:10,471 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:08:10,471 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:08:10,545 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:08:10,593 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:08:10,593 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:08:10,593 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963036821]
[2023-11-03 13:08:10,594 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963036821] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:08:10,594 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:08:10,594 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2023-11-03 13:08:10,595 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522838878]
[2023-11-03 13:08:10,596 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:08:10,602 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-11-03 13:08:10,602 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:08:10,617 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-11-03 13:08:10,618 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-11-03 13:08:10,620 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 102 out of 208
[2023-11-03 13:08:10,621 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 21 transitions, 50 flow. Second operand  has 2 states, 2 states have (on average 103.0) internal successors, (206), 2 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:08:10,622 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:08:10,622 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 208
[2023-11-03 13:08:10,623 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:08:10,675 INFO  L130       PetriNetUnfolder]: 19/66 cut-off events.
[2023-11-03 13:08:10,675 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-11-03 13:08:10,675 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 127 conditions, 66 events. 19/66 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 206 event pairs, 18 based on Foata normal form. 0/53 useless extension candidates. Maximal degree in co-relation 99. Up to 55 conditions per place. 
[2023-11-03 13:08:10,676 INFO  L137   encePairwiseOnDemand]: 204/208 looper letters, 13 selfloop transitions, 0 changer transitions 0/17 dead transitions.
[2023-11-03 13:08:10,677 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 20 places, 17 transitions, 68 flow
[2023-11-03 13:08:10,678 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-11-03 13:08:10,680 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-11-03 13:08:10,685 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 221 transitions.
[2023-11-03 13:08:10,687 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.53125
[2023-11-03 13:08:10,688 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 221 transitions.
[2023-11-03 13:08:10,688 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 221 transitions.
[2023-11-03 13:08:10,689 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:08:10,691 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 221 transitions.
[2023-11-03 13:08:10,693 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 110.5) internal successors, (221), 2 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:08:10,697 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 208.0) internal successors, (624), 3 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:08:10,697 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 208.0) internal successors, (624), 3 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:08:10,698 INFO  L175             Difference]: Start difference. First operand has 23 places, 21 transitions, 50 flow. Second operand 2 states and 221 transitions.
[2023-11-03 13:08:10,699 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 20 places, 17 transitions, 68 flow
[2023-11-03 13:08:10,700 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 17 transitions, 68 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 13:08:10,701 INFO  L231             Difference]: Finished difference. Result has 20 places, 17 transitions, 42 flow
[2023-11-03 13:08:10,703 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=42, PETRI_PLACES=20, PETRI_TRANSITIONS=17}
[2023-11-03 13:08:10,706 INFO  L288   CegarLoopForPetriNet]: 23 programPoint places, -3 predicate places.
[2023-11-03 13:08:10,706 INFO  L495      AbstractCegarLoop]: Abstraction has has 20 places, 17 transitions, 42 flow
[2023-11-03 13:08:10,706 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 103.0) internal successors, (206), 2 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:08:10,706 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:08:10,707 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1]
[2023-11-03 13:08:10,707 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-11-03 13:08:10,707 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-11-03 13:08:10,707 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:08:10,708 INFO  L85        PathProgramCache]: Analyzing trace with hash 11737896, now seen corresponding path program 1 times
[2023-11-03 13:08:10,708 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:08:10,708 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304225780]
[2023-11-03 13:08:10,708 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:08:10,708 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:08:10,727 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:08:10,773 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:08:10,773 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:08:10,774 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304225780]
[2023-11-03 13:08:10,774 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304225780] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:08:10,774 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:08:10,774 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-03 13:08:10,775 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710602584]
[2023-11-03 13:08:10,775 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:08:10,776 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 13:08:10,776 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:08:10,777 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 13:08:10,777 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 13:08:10,789 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 98 out of 208
[2023-11-03 13:08:10,790 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 17 transitions, 42 flow. Second operand  has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:08:10,790 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:08:10,790 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 208
[2023-11-03 13:08:10,790 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:08:10,857 INFO  L130       PetriNetUnfolder]: 24/81 cut-off events.
[2023-11-03 13:08:10,857 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-11-03 13:08:10,858 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 161 conditions, 81 events. 24/81 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 274 event pairs, 13 based on Foata normal form. 0/69 useless extension candidates. Maximal degree in co-relation 157. Up to 50 conditions per place. 
[2023-11-03 13:08:10,859 INFO  L137   encePairwiseOnDemand]: 204/208 looper letters, 14 selfloop transitions, 3 changer transitions 3/22 dead transitions.
[2023-11-03 13:08:10,859 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 22 transitions, 92 flow
[2023-11-03 13:08:10,859 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 13:08:10,860 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 13:08:10,862 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 315 transitions.
[2023-11-03 13:08:10,863 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5048076923076923
[2023-11-03 13:08:10,863 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 315 transitions.
[2023-11-03 13:08:10,864 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 315 transitions.
[2023-11-03 13:08:10,865 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:08:10,865 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 315 transitions.
[2023-11-03 13:08:10,867 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:08:10,869 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 208.0) internal successors, (832), 4 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:08:10,869 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 208.0) internal successors, (832), 4 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:08:10,869 INFO  L175             Difference]: Start difference. First operand has 20 places, 17 transitions, 42 flow. Second operand 3 states and 315 transitions.
[2023-11-03 13:08:10,869 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 22 transitions, 92 flow
[2023-11-03 13:08:10,870 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 22 transitions, 92 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 13:08:10,870 INFO  L231             Difference]: Finished difference. Result has 24 places, 17 transitions, 57 flow
[2023-11-03 13:08:10,871 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=57, PETRI_PLACES=24, PETRI_TRANSITIONS=17}
[2023-11-03 13:08:10,871 INFO  L288   CegarLoopForPetriNet]: 23 programPoint places, 1 predicate places.
[2023-11-03 13:08:10,871 INFO  L495      AbstractCegarLoop]: Abstraction has has 24 places, 17 transitions, 57 flow
[2023-11-03 13:08:10,872 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:08:10,872 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:08:10,872 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1]
[2023-11-03 13:08:10,872 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-11-03 13:08:10,872 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-11-03 13:08:10,873 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:08:10,873 INFO  L85        PathProgramCache]: Analyzing trace with hash -1562108238, now seen corresponding path program 1 times
[2023-11-03 13:08:10,873 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:08:10,873 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360684815]
[2023-11-03 13:08:10,873 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:08:10,873 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:08:10,911 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-03 13:08:10,911 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-11-03 13:08:10,929 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-03 13:08:10,946 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-11-03 13:08:10,946 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-11-03 13:08:10,947 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining)
[2023-11-03 13:08:10,948 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 8 remaining)
[2023-11-03 13:08:10,949 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 8 remaining)
[2023-11-03 13:08:10,949 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (4 of 8 remaining)
[2023-11-03 13:08:10,949 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (3 of 8 remaining)
[2023-11-03 13:08:10,949 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (2 of 8 remaining)
[2023-11-03 13:08:10,949 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 8 remaining)
[2023-11-03 13:08:10,950 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 8 remaining)
[2023-11-03 13:08:10,950 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-11-03 13:08:10,950 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1]
[2023-11-03 13:08:10,952 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-11-03 13:08:10,952 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2023-11-03 13:08:10,969 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2023-11-03 13:08:10,972 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 123 places, 123 transitions, 264 flow
[2023-11-03 13:08:10,999 INFO  L130       PetriNetUnfolder]: 11/270 cut-off events.
[2023-11-03 13:08:10,999 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2023-11-03 13:08:11,000 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 284 conditions, 270 events. 11/270 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 618 event pairs, 0 based on Foata normal form. 0/234 useless extension candidates. Maximal degree in co-relation 158. Up to 8 conditions per place. 
[2023-11-03 13:08:11,000 INFO  L82        GeneralOperation]: Start removeDead. Operand has 123 places, 123 transitions, 264 flow
[2023-11-03 13:08:11,001 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 123 places, 123 transitions, 264 flow
[2023-11-03 13:08:11,001 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-11-03 13:08:11,001 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 123 transitions, 264 flow
[2023-11-03 13:08:11,002 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 123 transitions, 264 flow
[2023-11-03 13:08:11,002 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 123 places, 123 transitions, 264 flow
[2023-11-03 13:08:11,024 INFO  L130       PetriNetUnfolder]: 11/270 cut-off events.
[2023-11-03 13:08:11,024 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2023-11-03 13:08:11,025 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 284 conditions, 270 events. 11/270 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 618 event pairs, 0 based on Foata normal form. 0/234 useless extension candidates. Maximal degree in co-relation 158. Up to 8 conditions per place. 
[2023-11-03 13:08:11,027 INFO  L119        LiptonReduction]: Number of co-enabled transitions 3780
[2023-11-03 13:08:14,686 INFO  L134        LiptonReduction]: Checked pairs total: 7172
[2023-11-03 13:08:14,686 INFO  L136        LiptonReduction]: Total number of compositions: 106
[2023-11-03 13:08:14,688 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-03 13:08:14,689 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;@4c36d5a2, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-11-03 13:08:14,689 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 9 error locations.
[2023-11-03 13:08:14,690 INFO  L130       PetriNetUnfolder]: 0/2 cut-off events.
[2023-11-03 13:08:14,690 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-11-03 13:08:14,690 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:08:14,690 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1]
[2023-11-03 13:08:14,690 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-11-03 13:08:14,690 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:08:14,691 INFO  L85        PathProgramCache]: Analyzing trace with hash 20088, now seen corresponding path program 1 times
[2023-11-03 13:08:14,691 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:08:14,691 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740649301]
[2023-11-03 13:08:14,691 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:08:14,691 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:08:14,699 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:08:14,705 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:08:14,706 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:08:14,706 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740649301]
[2023-11-03 13:08:14,706 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740649301] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:08:14,706 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:08:14,706 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2023-11-03 13:08:14,707 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201260733]
[2023-11-03 13:08:14,707 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:08:14,707 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-11-03 13:08:14,707 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:08:14,707 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-11-03 13:08:14,708 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-11-03 13:08:14,708 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 116 out of 229
[2023-11-03 13:08:14,708 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 33 transitions, 84 flow. Second operand  has 2 states, 2 states have (on average 117.0) internal successors, (234), 2 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:08:14,708 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:08:14,709 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 229
[2023-11-03 13:08:14,709 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:08:14,829 INFO  L130       PetriNetUnfolder]: 378/759 cut-off events.
[2023-11-03 13:08:14,829 INFO  L131       PetriNetUnfolder]: For 38/38 co-relation queries the response was YES.
[2023-11-03 13:08:14,831 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1466 conditions, 759 events. 378/759 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3819 event pairs, 371 based on Foata normal form. 0/668 useless extension candidates. Maximal degree in co-relation 519. Up to 666 conditions per place. 
[2023-11-03 13:08:14,833 INFO  L137   encePairwiseOnDemand]: 225/229 looper letters, 21 selfloop transitions, 0 changer transitions 0/29 dead transitions.
[2023-11-03 13:08:14,833 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 29 transitions, 118 flow
[2023-11-03 13:08:14,834 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-11-03 13:08:14,834 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-11-03 13:08:14,835 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 257 transitions.
[2023-11-03 13:08:14,835 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5611353711790393
[2023-11-03 13:08:14,835 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 257 transitions.
[2023-11-03 13:08:14,835 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 257 transitions.
[2023-11-03 13:08:14,836 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:08:14,836 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 257 transitions.
[2023-11-03 13:08:14,837 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 128.5) internal successors, (257), 2 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:08:14,838 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 229.0) internal successors, (687), 3 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:08:14,838 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 229.0) internal successors, (687), 3 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:08:14,838 INFO  L175             Difference]: Start difference. First operand has 36 places, 33 transitions, 84 flow. Second operand 2 states and 257 transitions.
[2023-11-03 13:08:14,838 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 29 transitions, 118 flow
[2023-11-03 13:08:14,839 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 29 transitions, 118 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 13:08:14,839 INFO  L231             Difference]: Finished difference. Result has 33 places, 29 transitions, 76 flow
[2023-11-03 13:08:14,840 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=76, PETRI_PLACES=33, PETRI_TRANSITIONS=29}
[2023-11-03 13:08:14,840 INFO  L288   CegarLoopForPetriNet]: 36 programPoint places, -3 predicate places.
[2023-11-03 13:08:14,840 INFO  L495      AbstractCegarLoop]: Abstraction has has 33 places, 29 transitions, 76 flow
[2023-11-03 13:08:14,841 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 117.0) internal successors, (234), 2 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:08:14,841 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:08:14,841 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1]
[2023-11-03 13:08:14,841 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2023-11-03 13:08:14,841 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-11-03 13:08:14,841 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:08:14,842 INFO  L85        PathProgramCache]: Analyzing trace with hash 19281939, now seen corresponding path program 1 times
[2023-11-03 13:08:14,842 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:08:14,842 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602845436]
[2023-11-03 13:08:14,842 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:08:14,842 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:08:14,851 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:08:14,867 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:08:14,868 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:08:14,868 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602845436]
[2023-11-03 13:08:14,868 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602845436] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:08:14,868 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:08:14,868 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-03 13:08:14,868 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801650872]
[2023-11-03 13:08:14,868 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:08:14,868 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 13:08:14,869 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:08:14,869 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 13:08:14,869 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 13:08:14,881 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 111 out of 229
[2023-11-03 13:08:14,881 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 29 transitions, 76 flow. Second operand  has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:08:14,881 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:08:14,882 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 229
[2023-11-03 13:08:14,882 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:08:15,018 INFO  L130       PetriNetUnfolder]: 679/1281 cut-off events.
[2023-11-03 13:08:15,018 INFO  L131       PetriNetUnfolder]: For 42/42 co-relation queries the response was YES.
[2023-11-03 13:08:15,020 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2525 conditions, 1281 events. 679/1281 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 6810 event pairs, 416 based on Foata normal form. 0/1155 useless extension candidates. Maximal degree in co-relation 2520. Up to 850 conditions per place. 
[2023-11-03 13:08:15,023 INFO  L137   encePairwiseOnDemand]: 224/229 looper letters, 32 selfloop transitions, 4 changer transitions 0/41 dead transitions.
[2023-11-03 13:08:15,023 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 41 transitions, 172 flow
[2023-11-03 13:08:15,024 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 13:08:15,024 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 13:08:15,025 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 370 transitions.
[2023-11-03 13:08:15,025 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5385735080058224
[2023-11-03 13:08:15,025 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 370 transitions.
[2023-11-03 13:08:15,025 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 370 transitions.
[2023-11-03 13:08:15,026 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:08:15,026 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 370 transitions.
[2023-11-03 13:08:15,026 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:08:15,028 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 229.0) internal successors, (916), 4 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:08:15,029 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 229.0) internal successors, (916), 4 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:08:15,029 INFO  L175             Difference]: Start difference. First operand has 33 places, 29 transitions, 76 flow. Second operand 3 states and 370 transitions.
[2023-11-03 13:08:15,029 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 41 transitions, 172 flow
[2023-11-03 13:08:15,029 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 41 transitions, 172 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 13:08:15,030 INFO  L231             Difference]: Finished difference. Result has 37 places, 32 transitions, 106 flow
[2023-11-03 13:08:15,030 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=37, PETRI_TRANSITIONS=32}
[2023-11-03 13:08:15,031 INFO  L288   CegarLoopForPetriNet]: 36 programPoint places, 1 predicate places.
[2023-11-03 13:08:15,031 INFO  L495      AbstractCegarLoop]: Abstraction has has 37 places, 32 transitions, 106 flow
[2023-11-03 13:08:15,031 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:08:15,031 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:08:15,031 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:08:15,031 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2023-11-03 13:08:15,031 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-11-03 13:08:15,032 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:08:15,032 INFO  L85        PathProgramCache]: Analyzing trace with hash 15874969, now seen corresponding path program 1 times
[2023-11-03 13:08:15,032 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:08:15,032 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400594282]
[2023-11-03 13:08:15,032 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:08:15,032 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:08:15,043 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:08:15,062 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:08:15,062 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:08:15,062 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400594282]
[2023-11-03 13:08:15,062 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400594282] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:08:15,063 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:08:15,063 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-03 13:08:15,063 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614943010]
[2023-11-03 13:08:15,063 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:08:15,063 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 13:08:15,063 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:08:15,063 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 13:08:15,064 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 13:08:15,079 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 109 out of 229
[2023-11-03 13:08:15,079 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 32 transitions, 106 flow. Second operand  has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:08:15,079 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:08:15,079 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 229
[2023-11-03 13:08:15,079 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:08:15,257 INFO  L130       PetriNetUnfolder]: 739/1420 cut-off events.
[2023-11-03 13:08:15,258 INFO  L131       PetriNetUnfolder]: For 333/333 co-relation queries the response was YES.
[2023-11-03 13:08:15,259 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3150 conditions, 1420 events. 739/1420 cut-off events. For 333/333 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 8126 event pairs, 430 based on Foata normal form. 0/1298 useless extension candidates. Maximal degree in co-relation 3143. Up to 943 conditions per place. 
[2023-11-03 13:08:15,263 INFO  L137   encePairwiseOnDemand]: 223/229 looper letters, 35 selfloop transitions, 7 changer transitions 0/49 dead transitions.
[2023-11-03 13:08:15,264 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 49 transitions, 242 flow
[2023-11-03 13:08:15,264 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 13:08:15,264 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 13:08:15,265 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 367 transitions.
[2023-11-03 13:08:15,265 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5342066957787481
[2023-11-03 13:08:15,265 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 367 transitions.
[2023-11-03 13:08:15,265 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 367 transitions.
[2023-11-03 13:08:15,266 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:08:15,266 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 367 transitions.
[2023-11-03 13:08:15,267 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:08:15,268 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 229.0) internal successors, (916), 4 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:08:15,268 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 229.0) internal successors, (916), 4 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:08:15,268 INFO  L175             Difference]: Start difference. First operand has 37 places, 32 transitions, 106 flow. Second operand 3 states and 367 transitions.
[2023-11-03 13:08:15,268 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 49 transitions, 242 flow
[2023-11-03 13:08:15,272 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 49 transitions, 230 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-03 13:08:15,273 INFO  L231             Difference]: Finished difference. Result has 39 places, 37 transitions, 154 flow
[2023-11-03 13:08:15,273 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=154, PETRI_PLACES=39, PETRI_TRANSITIONS=37}
[2023-11-03 13:08:15,274 INFO  L288   CegarLoopForPetriNet]: 36 programPoint places, 3 predicate places.
[2023-11-03 13:08:15,274 INFO  L495      AbstractCegarLoop]: Abstraction has has 39 places, 37 transitions, 154 flow
[2023-11-03 13:08:15,274 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:08:15,275 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:08:15,275 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:08:15,275 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2023-11-03 13:08:15,275 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-11-03 13:08:15,275 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:08:15,275 INFO  L85        PathProgramCache]: Analyzing trace with hash -1219947716, now seen corresponding path program 1 times
[2023-11-03 13:08:15,276 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:08:15,276 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624701699]
[2023-11-03 13:08:15,276 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:08:15,276 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:08:15,288 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:08:15,379 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:08:15,380 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:08:15,380 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624701699]
[2023-11-03 13:08:15,380 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624701699] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-03 13:08:15,380 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1609344689]
[2023-11-03 13:08:15,380 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:08:15,380 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 13:08:15,381 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 13:08:15,383 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-03 13:08:15,384 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2023-11-03 13:08:15,458 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:08:15,460 INFO  L263         TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 4 conjunts are in the unsatisfiable core
[2023-11-03 13:08:15,461 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 13:08:15,510 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:08:15,510 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-03 13:08:15,535 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:08:15,536 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1609344689] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-03 13:08:15,536 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-03 13:08:15,536 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8
[2023-11-03 13:08:15,536 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228451385]
[2023-11-03 13:08:15,536 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-03 13:08:15,536 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2023-11-03 13:08:15,536 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:08:15,537 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2023-11-03 13:08:15,537 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2023-11-03 13:08:15,625 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 106 out of 229
[2023-11-03 13:08:15,626 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 37 transitions, 154 flow. Second operand  has 9 states, 9 states have (on average 107.77777777777777) internal successors, (970), 9 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:08:15,626 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:08:15,627 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 229
[2023-11-03 13:08:15,627 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:08:15,859 INFO  L130       PetriNetUnfolder]: 349/722 cut-off events.
[2023-11-03 13:08:15,859 INFO  L131       PetriNetUnfolder]: For 490/564 co-relation queries the response was YES.
[2023-11-03 13:08:15,860 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1765 conditions, 722 events. 349/722 cut-off events. For 490/564 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3573 event pairs, 88 based on Foata normal form. 84/758 useless extension candidates. Maximal degree in co-relation 1757. Up to 373 conditions per place. 
[2023-11-03 13:08:15,862 INFO  L137   encePairwiseOnDemand]: 222/229 looper letters, 42 selfloop transitions, 6 changer transitions 15/73 dead transitions.
[2023-11-03 13:08:15,862 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 73 transitions, 400 flow
[2023-11-03 13:08:15,863 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2023-11-03 13:08:15,863 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2023-11-03 13:08:15,866 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 902 transitions.
[2023-11-03 13:08:15,866 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.4923580786026201
[2023-11-03 13:08:15,866 INFO  L72            ComplementDD]: Start complementDD. Operand 8 states and 902 transitions.
[2023-11-03 13:08:15,867 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 8 states and 902 transitions.
[2023-11-03 13:08:15,867 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:08:15,867 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 902 transitions.
[2023-11-03 13:08:15,870 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 9 states, 8 states have (on average 112.75) internal successors, (902), 8 states have internal predecessors, (902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:08:15,873 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 9 states, 9 states have (on average 229.0) internal successors, (2061), 9 states have internal predecessors, (2061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:08:15,874 INFO  L81            ComplementDD]: Finished complementDD. Result  has 9 states, 9 states have (on average 229.0) internal successors, (2061), 9 states have internal predecessors, (2061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:08:15,874 INFO  L175             Difference]: Start difference. First operand has 39 places, 37 transitions, 154 flow. Second operand 8 states and 902 transitions.
[2023-11-03 13:08:15,874 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 73 transitions, 400 flow
[2023-11-03 13:08:15,876 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 73 transitions, 376 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-03 13:08:15,876 INFO  L231             Difference]: Finished difference. Result has 48 places, 39 transitions, 174 flow
[2023-11-03 13:08:15,877 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=174, PETRI_PLACES=48, PETRI_TRANSITIONS=39}
[2023-11-03 13:08:15,877 INFO  L288   CegarLoopForPetriNet]: 36 programPoint places, 12 predicate places.
[2023-11-03 13:08:15,877 INFO  L495      AbstractCegarLoop]: Abstraction has has 48 places, 39 transitions, 174 flow
[2023-11-03 13:08:15,878 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 107.77777777777777) internal successors, (970), 9 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:08:15,878 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:08:15,878 INFO  L209   CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1]
[2023-11-03 13:08:15,887 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2023-11-03 13:08:16,079 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 13:08:16,080 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-11-03 13:08:16,081 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:08:16,081 INFO  L85        PathProgramCache]: Analyzing trace with hash -113454216, now seen corresponding path program 1 times
[2023-11-03 13:08:16,081 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:08:16,081 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533980464]
[2023-11-03 13:08:16,081 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:08:16,082 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:08:16,109 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-03 13:08:16,109 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-11-03 13:08:16,119 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-03 13:08:16,125 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-11-03 13:08:16,125 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-11-03 13:08:16,125 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining)
[2023-11-03 13:08:16,125 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining)
[2023-11-03 13:08:16,125 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining)
[2023-11-03 13:08:16,125 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining)
[2023-11-03 13:08:16,126 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining)
[2023-11-03 13:08:16,126 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining)
[2023-11-03 13:08:16,126 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining)
[2023-11-03 13:08:16,126 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining)
[2023-11-03 13:08:16,126 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining)
[2023-11-03 13:08:16,126 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2023-11-03 13:08:16,126 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1]
[2023-11-03 13:08:16,127 WARN  L233   ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-11-03 13:08:16,127 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances.
[2023-11-03 13:08:16,140 INFO  L144    ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions.
[2023-11-03 13:08:16,142 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 140 places, 139 transitions, 308 flow
[2023-11-03 13:08:16,171 INFO  L130       PetriNetUnfolder]: 21/465 cut-off events.
[2023-11-03 13:08:16,171 INFO  L131       PetriNetUnfolder]: For 19/19 co-relation queries the response was YES.
[2023-11-03 13:08:16,172 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 493 conditions, 465 events. 21/465 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1345 event pairs, 1 based on Foata normal form. 0/401 useless extension candidates. Maximal degree in co-relation 278. Up to 16 conditions per place. 
[2023-11-03 13:08:16,172 INFO  L82        GeneralOperation]: Start removeDead. Operand has 140 places, 139 transitions, 308 flow
[2023-11-03 13:08:16,173 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 140 places, 139 transitions, 308 flow
[2023-11-03 13:08:16,173 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-11-03 13:08:16,174 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 140 places, 139 transitions, 308 flow
[2023-11-03 13:08:16,174 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 140 places, 139 transitions, 308 flow
[2023-11-03 13:08:16,174 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 140 places, 139 transitions, 308 flow
[2023-11-03 13:08:16,202 INFO  L130       PetriNetUnfolder]: 21/465 cut-off events.
[2023-11-03 13:08:16,202 INFO  L131       PetriNetUnfolder]: For 19/19 co-relation queries the response was YES.
[2023-11-03 13:08:16,203 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 493 conditions, 465 events. 21/465 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1345 event pairs, 1 based on Foata normal form. 0/401 useless extension candidates. Maximal degree in co-relation 278. Up to 16 conditions per place. 
[2023-11-03 13:08:16,208 INFO  L119        LiptonReduction]: Number of co-enabled transitions 6384
[2023-11-03 13:08:19,649 INFO  L134        LiptonReduction]: Checked pairs total: 13211
[2023-11-03 13:08:19,649 INFO  L136        LiptonReduction]: Total number of compositions: 114
[2023-11-03 13:08:19,652 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-03 13:08:19,653 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;@4c36d5a2, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-11-03 13:08:19,654 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 10 error locations.
[2023-11-03 13:08:19,655 INFO  L130       PetriNetUnfolder]: 0/2 cut-off events.
[2023-11-03 13:08:19,655 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-11-03 13:08:19,655 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:08:19,655 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1]
[2023-11-03 13:08:19,656 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-11-03 13:08:19,656 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:08:19,656 INFO  L85        PathProgramCache]: Analyzing trace with hash 28698, now seen corresponding path program 1 times
[2023-11-03 13:08:19,656 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:08:19,657 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237614250]
[2023-11-03 13:08:19,657 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:08:19,657 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:08:19,664 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:08:19,668 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:08:19,668 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:08:19,669 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237614250]
[2023-11-03 13:08:19,669 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237614250] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:08:19,669 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:08:19,669 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2023-11-03 13:08:19,669 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18860705]
[2023-11-03 13:08:19,669 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:08:19,669 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-11-03 13:08:19,669 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:08:19,670 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-11-03 13:08:19,670 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-11-03 13:08:19,670 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 130 out of 253
[2023-11-03 13:08:19,670 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 41 transitions, 112 flow. Second operand  has 2 states, 2 states have (on average 131.0) internal successors, (262), 2 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:08:19,671 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:08:19,671 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 253
[2023-11-03 13:08:19,671 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:08:20,166 INFO  L130       PetriNetUnfolder]: 4046/6932 cut-off events.
[2023-11-03 13:08:20,166 INFO  L131       PetriNetUnfolder]: For 527/527 co-relation queries the response was YES.
[2023-11-03 13:08:20,172 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13310 conditions, 6932 events. 4046/6932 cut-off events. For 527/527 co-relation queries the response was YES. Maximal size of possible extension queue 284. Compared 44954 event pairs, 3989 based on Foata normal form. 0/6326 useless extension candidates. Maximal degree in co-relation 1715. Up to 6005 conditions per place. 
[2023-11-03 13:08:20,193 INFO  L137   encePairwiseOnDemand]: 249/253 looper letters, 28 selfloop transitions, 0 changer transitions 0/37 dead transitions.
[2023-11-03 13:08:20,193 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 37 transitions, 160 flow
[2023-11-03 13:08:20,194 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-11-03 13:08:20,194 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-11-03 13:08:20,195 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 292 transitions.
[2023-11-03 13:08:20,195 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5770750988142292
[2023-11-03 13:08:20,195 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 292 transitions.
[2023-11-03 13:08:20,195 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 292 transitions.
[2023-11-03 13:08:20,195 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:08:20,195 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 292 transitions.
[2023-11-03 13:08:20,196 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 146.0) internal successors, (292), 2 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:08:20,197 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 253.0) internal successors, (759), 3 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:08:20,197 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 253.0) internal successors, (759), 3 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:08:20,197 INFO  L175             Difference]: Start difference. First operand has 45 places, 41 transitions, 112 flow. Second operand 2 states and 292 transitions.
[2023-11-03 13:08:20,197 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 37 transitions, 160 flow
[2023-11-03 13:08:20,198 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 37 transitions, 160 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 13:08:20,198 INFO  L231             Difference]: Finished difference. Result has 42 places, 37 transitions, 104 flow
[2023-11-03 13:08:20,199 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=104, PETRI_PLACES=42, PETRI_TRANSITIONS=37}
[2023-11-03 13:08:20,199 INFO  L288   CegarLoopForPetriNet]: 45 programPoint places, -3 predicate places.
[2023-11-03 13:08:20,200 INFO  L495      AbstractCegarLoop]: Abstraction has has 42 places, 37 transitions, 104 flow
[2023-11-03 13:08:20,200 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 131.0) internal successors, (262), 2 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:08:20,200 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:08:20,200 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1]
[2023-11-03 13:08:20,200 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2023-11-03 13:08:20,200 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-11-03 13:08:20,200 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:08:20,201 INFO  L85        PathProgramCache]: Analyzing trace with hash 27557975, now seen corresponding path program 1 times
[2023-11-03 13:08:20,201 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:08:20,201 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916080206]
[2023-11-03 13:08:20,201 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:08:20,201 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:08:20,208 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:08:20,221 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:08:20,221 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:08:20,221 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916080206]
[2023-11-03 13:08:20,221 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916080206] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:08:20,221 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:08:20,221 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-03 13:08:20,222 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037637931]
[2023-11-03 13:08:20,222 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:08:20,222 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 13:08:20,222 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:08:20,222 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 13:08:20,222 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 13:08:20,241 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 124 out of 253
[2023-11-03 13:08:20,241 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 37 transitions, 104 flow. Second operand  has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:08:20,241 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:08:20,242 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 253
[2023-11-03 13:08:20,242 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:08:20,912 INFO  L130       PetriNetUnfolder]: 7618/11957 cut-off events.
[2023-11-03 13:08:20,912 INFO  L131       PetriNetUnfolder]: For 567/567 co-relation queries the response was YES.
[2023-11-03 13:08:20,923 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23698 conditions, 11957 events. 7618/11957 cut-off events. For 567/567 co-relation queries the response was YES. Maximal size of possible extension queue 407. Compared 74502 event pairs, 4897 based on Foata normal form. 0/11070 useless extension candidates. Maximal degree in co-relation 23692. Up to 8281 conditions per place. 
[2023-11-03 13:08:20,983 INFO  L137   encePairwiseOnDemand]: 247/253 looper letters, 43 selfloop transitions, 5 changer transitions 0/54 dead transitions.
[2023-11-03 13:08:20,983 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 54 transitions, 234 flow
[2023-11-03 13:08:20,984 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 13:08:20,984 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 13:08:20,985 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 421 transitions.
[2023-11-03 13:08:20,985 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5546772068511199
[2023-11-03 13:08:20,985 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 421 transitions.
[2023-11-03 13:08:20,985 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 421 transitions.
[2023-11-03 13:08:20,985 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:08:20,986 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 421 transitions.
[2023-11-03 13:08:20,986 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:08:20,987 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 253.0) internal successors, (1012), 4 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:08:20,988 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 253.0) internal successors, (1012), 4 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:08:20,988 INFO  L175             Difference]: Start difference. First operand has 42 places, 37 transitions, 104 flow. Second operand 3 states and 421 transitions.
[2023-11-03 13:08:20,988 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 54 transitions, 234 flow
[2023-11-03 13:08:20,989 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 54 transitions, 234 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 13:08:20,989 INFO  L231             Difference]: Finished difference. Result has 46 places, 41 transitions, 142 flow
[2023-11-03 13:08:20,990 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=46, PETRI_TRANSITIONS=41}
[2023-11-03 13:08:20,990 INFO  L288   CegarLoopForPetriNet]: 45 programPoint places, 1 predicate places.
[2023-11-03 13:08:20,990 INFO  L495      AbstractCegarLoop]: Abstraction has has 46 places, 41 transitions, 142 flow
[2023-11-03 13:08:20,990 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:08:20,990 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:08:20,990 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:08:20,991 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2023-11-03 13:08:20,991 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-11-03 13:08:20,991 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:08:20,991 INFO  L85        PathProgramCache]: Analyzing trace with hash 1947879644, now seen corresponding path program 1 times
[2023-11-03 13:08:20,991 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:08:20,991 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141062760]
[2023-11-03 13:08:20,991 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:08:20,991 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:08:21,001 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:08:21,015 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:08:21,015 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:08:21,015 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141062760]
[2023-11-03 13:08:21,015 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141062760] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:08:21,015 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:08:21,015 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-03 13:08:21,016 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004364233]
[2023-11-03 13:08:21,016 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:08:21,016 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 13:08:21,016 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:08:21,016 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 13:08:21,016 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 13:08:21,035 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 122 out of 253
[2023-11-03 13:08:21,035 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 41 transitions, 142 flow. Second operand  has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:08:21,035 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:08:21,035 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 253
[2023-11-03 13:08:21,035 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:08:21,885 INFO  L130       PetriNetUnfolder]: 9031/14325 cut-off events.
[2023-11-03 13:08:21,885 INFO  L131       PetriNetUnfolder]: For 3695/3695 co-relation queries the response was YES.
[2023-11-03 13:08:21,902 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 32017 conditions, 14325 events. 9031/14325 cut-off events. For 3695/3695 co-relation queries the response was YES. Maximal size of possible extension queue 600. Compared 96027 event pairs, 5597 based on Foata normal form. 0/13298 useless extension candidates. Maximal degree in co-relation 32009. Up to 10170 conditions per place. 
[2023-11-03 13:08:21,947 INFO  L137   encePairwiseOnDemand]: 246/253 looper letters, 49 selfloop transitions, 9 changer transitions 0/66 dead transitions.
[2023-11-03 13:08:21,948 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 66 transitions, 342 flow
[2023-11-03 13:08:21,948 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 13:08:21,948 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 13:08:21,949 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 420 transitions.
[2023-11-03 13:08:21,950 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5533596837944664
[2023-11-03 13:08:21,950 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 420 transitions.
[2023-11-03 13:08:21,950 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 420 transitions.
[2023-11-03 13:08:21,950 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:08:21,950 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 420 transitions.
[2023-11-03 13:08:21,951 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:08:21,952 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 253.0) internal successors, (1012), 4 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:08:21,952 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 253.0) internal successors, (1012), 4 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:08:21,952 INFO  L175             Difference]: Start difference. First operand has 46 places, 41 transitions, 142 flow. Second operand 3 states and 420 transitions.
[2023-11-03 13:08:21,953 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 66 transitions, 342 flow
[2023-11-03 13:08:21,998 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 66 transitions, 326 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-03 13:08:21,999 INFO  L231             Difference]: Finished difference. Result has 48 places, 48 transitions, 208 flow
[2023-11-03 13:08:21,999 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=208, PETRI_PLACES=48, PETRI_TRANSITIONS=48}
[2023-11-03 13:08:22,000 INFO  L288   CegarLoopForPetriNet]: 45 programPoint places, 3 predicate places.
[2023-11-03 13:08:22,000 INFO  L495      AbstractCegarLoop]: Abstraction has has 48 places, 48 transitions, 208 flow
[2023-11-03 13:08:22,001 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:08:22,001 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:08:22,001 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:08:22,001 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2023-11-03 13:08:22,001 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-11-03 13:08:22,001 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:08:22,001 INFO  L85        PathProgramCache]: Analyzing trace with hash -1731667041, now seen corresponding path program 1 times
[2023-11-03 13:08:22,001 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:08:22,002 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028912144]
[2023-11-03 13:08:22,002 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:08:22,002 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:08:22,012 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:08:22,066 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:08:22,066 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:08:22,066 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028912144]
[2023-11-03 13:08:22,067 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028912144] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-03 13:08:22,067 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2107295024]
[2023-11-03 13:08:22,067 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:08:22,067 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 13:08:22,067 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 13:08:22,068 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-03 13:08:22,069 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2023-11-03 13:08:22,157 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:08:22,160 INFO  L263         TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 4 conjunts are in the unsatisfiable core
[2023-11-03 13:08:22,161 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 13:08:22,200 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:08:22,200 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-03 13:08:22,223 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:08:22,223 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2107295024] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-03 13:08:22,223 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-03 13:08:22,223 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8
[2023-11-03 13:08:22,223 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236900356]
[2023-11-03 13:08:22,223 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-03 13:08:22,223 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2023-11-03 13:08:22,224 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:08:22,224 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2023-11-03 13:08:22,224 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2023-11-03 13:08:22,335 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 120 out of 253
[2023-11-03 13:08:22,336 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 48 transitions, 208 flow. Second operand  has 9 states, 9 states have (on average 121.88888888888889) internal successors, (1097), 9 states have internal predecessors, (1097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:08:22,336 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:08:22,336 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 253
[2023-11-03 13:08:22,336 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:08:23,169 INFO  L130       PetriNetUnfolder]: 4872/8243 cut-off events.
[2023-11-03 13:08:23,169 INFO  L131       PetriNetUnfolder]: For 6426/6669 co-relation queries the response was YES.
[2023-11-03 13:08:23,179 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20601 conditions, 8243 events. 4872/8243 cut-off events. For 6426/6669 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 53604 event pairs, 1866 based on Foata normal form. 388/8214 useless extension candidates. Maximal degree in co-relation 20592. Up to 4469 conditions per place. 
[2023-11-03 13:08:23,199 INFO  L137   encePairwiseOnDemand]: 246/253 looper letters, 74 selfloop transitions, 7 changer transitions 4/98 dead transitions.
[2023-11-03 13:08:23,200 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 98 transitions, 559 flow
[2023-11-03 13:08:23,200 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2023-11-03 13:08:23,200 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2023-11-03 13:08:23,202 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1033 transitions.
[2023-11-03 13:08:23,202 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5103754940711462
[2023-11-03 13:08:23,203 INFO  L72            ComplementDD]: Start complementDD. Operand 8 states and 1033 transitions.
[2023-11-03 13:08:23,203 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 8 states and 1033 transitions.
[2023-11-03 13:08:23,203 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:08:23,203 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1033 transitions.
[2023-11-03 13:08:23,205 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 9 states, 8 states have (on average 129.125) internal successors, (1033), 8 states have internal predecessors, (1033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:08:23,207 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 9 states, 9 states have (on average 253.0) internal successors, (2277), 9 states have internal predecessors, (2277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:08:23,207 INFO  L81            ComplementDD]: Finished complementDD. Result  has 9 states, 9 states have (on average 253.0) internal successors, (2277), 9 states have internal predecessors, (2277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:08:23,208 INFO  L175             Difference]: Start difference. First operand has 48 places, 48 transitions, 208 flow. Second operand 8 states and 1033 transitions.
[2023-11-03 13:08:23,208 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 98 transitions, 559 flow
[2023-11-03 13:08:23,217 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 98 transitions, 521 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-03 13:08:23,218 INFO  L231             Difference]: Finished difference. Result has 57 places, 52 transitions, 235 flow
[2023-11-03 13:08:23,218 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=235, PETRI_PLACES=57, PETRI_TRANSITIONS=52}
[2023-11-03 13:08:23,219 INFO  L288   CegarLoopForPetriNet]: 45 programPoint places, 12 predicate places.
[2023-11-03 13:08:23,219 INFO  L495      AbstractCegarLoop]: Abstraction has has 57 places, 52 transitions, 235 flow
[2023-11-03 13:08:23,219 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 121.88888888888889) internal successors, (1097), 9 states have internal predecessors, (1097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:08:23,219 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:08:23,219 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:08:23,228 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2023-11-03 13:08:23,420 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 13:08:23,421 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-11-03 13:08:23,421 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:08:23,421 INFO  L85        PathProgramCache]: Analyzing trace with hash -430492556, now seen corresponding path program 1 times
[2023-11-03 13:08:23,422 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:08:23,422 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316144168]
[2023-11-03 13:08:23,422 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:08:23,422 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:08:23,436 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:08:23,454 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2023-11-03 13:08:23,454 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:08:23,454 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316144168]
[2023-11-03 13:08:23,454 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316144168] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:08:23,455 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:08:23,455 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-03 13:08:23,455 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812294218]
[2023-11-03 13:08:23,455 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:08:23,455 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 13:08:23,455 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:08:23,455 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 13:08:23,455 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 13:08:23,477 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 122 out of 253
[2023-11-03 13:08:23,477 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 52 transitions, 235 flow. Second operand  has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:08:23,477 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:08:23,477 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 253
[2023-11-03 13:08:23,477 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:08:24,355 INFO  L130       PetriNetUnfolder]: 6319/10299 cut-off events.
[2023-11-03 13:08:24,355 INFO  L131       PetriNetUnfolder]: For 7970/8114 co-relation queries the response was YES.
[2023-11-03 13:08:24,371 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27986 conditions, 10299 events. 6319/10299 cut-off events. For 7970/8114 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 65263 event pairs, 4537 based on Foata normal form. 0/9863 useless extension candidates. Maximal degree in co-relation 27973. Up to 8531 conditions per place. 
[2023-11-03 13:08:24,398 INFO  L137   encePairwiseOnDemand]: 247/253 looper letters, 60 selfloop transitions, 12 changer transitions 0/80 dead transitions.
[2023-11-03 13:08:24,398 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 80 transitions, 508 flow
[2023-11-03 13:08:24,399 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 13:08:24,399 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 13:08:24,400 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 418 transitions.
[2023-11-03 13:08:24,400 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5507246376811594
[2023-11-03 13:08:24,400 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 418 transitions.
[2023-11-03 13:08:24,400 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 418 transitions.
[2023-11-03 13:08:24,400 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:08:24,401 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 418 transitions.
[2023-11-03 13:08:24,401 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:08:24,402 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 253.0) internal successors, (1012), 4 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:08:24,403 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 253.0) internal successors, (1012), 4 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:08:24,403 INFO  L175             Difference]: Start difference. First operand has 57 places, 52 transitions, 235 flow. Second operand 3 states and 418 transitions.
[2023-11-03 13:08:24,403 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 80 transitions, 508 flow
[2023-11-03 13:08:24,411 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 80 transitions, 503 flow, removed 2 selfloop flow, removed 1 redundant places.
[2023-11-03 13:08:24,412 INFO  L231             Difference]: Finished difference. Result has 58 places, 60 transitions, 334 flow
[2023-11-03 13:08:24,412 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=334, PETRI_PLACES=58, PETRI_TRANSITIONS=60}
[2023-11-03 13:08:24,413 INFO  L288   CegarLoopForPetriNet]: 45 programPoint places, 13 predicate places.
[2023-11-03 13:08:24,413 INFO  L495      AbstractCegarLoop]: Abstraction has has 58 places, 60 transitions, 334 flow
[2023-11-03 13:08:24,414 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:08:24,414 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:08:24,414 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:08:24,415 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2023-11-03 13:08:24,415 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-11-03 13:08:24,415 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:08:24,415 INFO  L85        PathProgramCache]: Analyzing trace with hash 585262481, now seen corresponding path program 1 times
[2023-11-03 13:08:24,416 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:08:24,416 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927952071]
[2023-11-03 13:08:24,416 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:08:24,416 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:08:24,430 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:08:24,485 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:08:24,485 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:08:24,485 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927952071]
[2023-11-03 13:08:24,485 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927952071] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:08:24,485 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:08:24,485 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-03 13:08:24,485 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323618006]
[2023-11-03 13:08:24,485 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:08:24,486 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 13:08:24,486 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:08:24,486 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 13:08:24,486 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 13:08:24,507 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 123 out of 253
[2023-11-03 13:08:24,508 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 60 transitions, 334 flow. Second operand  has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:08:24,509 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:08:24,509 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 253
[2023-11-03 13:08:24,509 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:08:24,786 INFO  L130       PetriNetUnfolder]: 857/2028 cut-off events.
[2023-11-03 13:08:24,786 INFO  L131       PetriNetUnfolder]: For 2518/2528 co-relation queries the response was YES.
[2023-11-03 13:08:24,789 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6091 conditions, 2028 events. 857/2028 cut-off events. For 2518/2528 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 13962 event pairs, 171 based on Foata normal form. 412/2388 useless extension candidates. Maximal degree in co-relation 6077. Up to 1380 conditions per place. 
[2023-11-03 13:08:24,793 INFO  L137   encePairwiseOnDemand]: 247/253 looper letters, 47 selfloop transitions, 7 changer transitions 0/65 dead transitions.
[2023-11-03 13:08:24,793 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 65 transitions, 437 flow
[2023-11-03 13:08:24,793 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 13:08:24,794 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 13:08:24,794 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 412 transitions.
[2023-11-03 13:08:24,794 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5428194993412385
[2023-11-03 13:08:24,795 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 412 transitions.
[2023-11-03 13:08:24,795 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 412 transitions.
[2023-11-03 13:08:24,795 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:08:24,795 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 412 transitions.
[2023-11-03 13:08:24,796 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:08:24,797 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 253.0) internal successors, (1012), 4 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:08:24,797 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 253.0) internal successors, (1012), 4 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:08:24,797 INFO  L175             Difference]: Start difference. First operand has 58 places, 60 transitions, 334 flow. Second operand 3 states and 412 transitions.
[2023-11-03 13:08:24,797 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 65 transitions, 437 flow
[2023-11-03 13:08:24,801 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 65 transitions, 429 flow, removed 2 selfloop flow, removed 1 redundant places.
[2023-11-03 13:08:24,802 INFO  L231             Difference]: Finished difference. Result has 59 places, 50 transitions, 252 flow
[2023-11-03 13:08:24,802 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=252, PETRI_PLACES=59, PETRI_TRANSITIONS=50}
[2023-11-03 13:08:24,802 INFO  L288   CegarLoopForPetriNet]: 45 programPoint places, 14 predicate places.
[2023-11-03 13:08:24,802 INFO  L495      AbstractCegarLoop]: Abstraction has has 59 places, 50 transitions, 252 flow
[2023-11-03 13:08:24,803 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:08:24,803 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:08:24,803 INFO  L209   CegarLoopForPetriNet]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1]
[2023-11-03 13:08:24,803 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2023-11-03 13:08:24,803 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-11-03 13:08:24,803 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:08:24,803 INFO  L85        PathProgramCache]: Analyzing trace with hash -1108884398, now seen corresponding path program 1 times
[2023-11-03 13:08:24,803 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:08:24,803 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811451474]
[2023-11-03 13:08:24,804 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:08:24,804 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:08:24,825 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-03 13:08:24,825 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-11-03 13:08:24,836 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-03 13:08:24,841 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-11-03 13:08:24,841 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-11-03 13:08:24,841 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining)
[2023-11-03 13:08:24,841 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining)
[2023-11-03 13:08:24,842 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining)
[2023-11-03 13:08:24,842 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining)
[2023-11-03 13:08:24,842 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining)
[2023-11-03 13:08:24,842 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining)
[2023-11-03 13:08:24,842 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining)
[2023-11-03 13:08:24,842 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining)
[2023-11-03 13:08:24,842 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining)
[2023-11-03 13:08:24,842 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining)
[2023-11-03 13:08:24,842 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2023-11-03 13:08:24,842 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:08:24,843 WARN  L233   ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-11-03 13:08:24,843 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances.
[2023-11-03 13:08:24,861 INFO  L144    ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions.
[2023-11-03 13:08:24,863 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 157 places, 155 transitions, 354 flow
[2023-11-03 13:08:24,930 INFO  L130       PetriNetUnfolder]: 43/824 cut-off events.
[2023-11-03 13:08:24,930 INFO  L131       PetriNetUnfolder]: For 48/48 co-relation queries the response was YES.
[2023-11-03 13:08:24,932 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 879 conditions, 824 events. 43/824 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 3260 event pairs, 6 based on Foata normal form. 0/708 useless extension candidates. Maximal degree in co-relation 485. Up to 32 conditions per place. 
[2023-11-03 13:08:24,932 INFO  L82        GeneralOperation]: Start removeDead. Operand has 157 places, 155 transitions, 354 flow
[2023-11-03 13:08:24,934 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 157 places, 155 transitions, 354 flow
[2023-11-03 13:08:24,934 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-11-03 13:08:24,934 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 157 places, 155 transitions, 354 flow
[2023-11-03 13:08:24,934 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 157 places, 155 transitions, 354 flow
[2023-11-03 13:08:24,934 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 157 places, 155 transitions, 354 flow
[2023-11-03 13:08:24,994 INFO  L130       PetriNetUnfolder]: 43/824 cut-off events.
[2023-11-03 13:08:24,995 INFO  L131       PetriNetUnfolder]: For 48/48 co-relation queries the response was YES.
[2023-11-03 13:08:24,996 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 879 conditions, 824 events. 43/824 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 3260 event pairs, 6 based on Foata normal form. 0/708 useless extension candidates. Maximal degree in co-relation 485. Up to 32 conditions per place. 
[2023-11-03 13:08:25,010 INFO  L119        LiptonReduction]: Number of co-enabled transitions 9464
[2023-11-03 13:08:28,742 INFO  L134        LiptonReduction]: Checked pairs total: 22521
[2023-11-03 13:08:28,742 INFO  L136        LiptonReduction]: Total number of compositions: 122
[2023-11-03 13:08:28,744 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-03 13:08:28,745 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;@4c36d5a2, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-11-03 13:08:28,745 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 11 error locations.
[2023-11-03 13:08:28,746 INFO  L130       PetriNetUnfolder]: 0/3 cut-off events.
[2023-11-03 13:08:28,746 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-11-03 13:08:28,746 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:08:28,747 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1]
[2023-11-03 13:08:28,747 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-11-03 13:08:28,747 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:08:28,747 INFO  L85        PathProgramCache]: Analyzing trace with hash 38078, now seen corresponding path program 1 times
[2023-11-03 13:08:28,747 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:08:28,747 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131575571]
[2023-11-03 13:08:28,747 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:08:28,748 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:08:28,752 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:08:28,755 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:08:28,755 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:08:28,755 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131575571]
[2023-11-03 13:08:28,755 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131575571] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:08:28,755 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:08:28,755 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2023-11-03 13:08:28,756 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502760362]
[2023-11-03 13:08:28,756 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:08:28,756 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-11-03 13:08:28,756 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:08:28,756 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-11-03 13:08:28,756 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-11-03 13:08:28,756 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 144 out of 277
[2023-11-03 13:08:28,757 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 49 transitions, 142 flow. Second operand  has 2 states, 2 states have (on average 145.0) internal successors, (290), 2 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:08:28,757 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:08:28,757 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 277
[2023-11-03 13:08:28,757 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:08:31,717 INFO  L130       PetriNetUnfolder]: 36913/53898 cut-off events.
[2023-11-03 13:08:31,717 INFO  L131       PetriNetUnfolder]: For 5118/5118 co-relation queries the response was YES.
[2023-11-03 13:08:31,776 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 106656 conditions, 53898 events. 36913/53898 cut-off events. For 5118/5118 co-relation queries the response was YES. Maximal size of possible extension queue 1564. Compared 371174 event pairs, 36570 based on Foata normal form. 0/49989 useless extension candidates. Maximal degree in co-relation 15264. Up to 50011 conditions per place. 
[2023-11-03 13:08:31,921 INFO  L137   encePairwiseOnDemand]: 273/277 looper letters, 35 selfloop transitions, 0 changer transitions 0/45 dead transitions.
[2023-11-03 13:08:31,921 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 45 transitions, 204 flow
[2023-11-03 13:08:31,922 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-11-03 13:08:31,922 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-11-03 13:08:31,923 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 327 transitions.
[2023-11-03 13:08:31,923 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5902527075812274
[2023-11-03 13:08:31,923 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 327 transitions.
[2023-11-03 13:08:31,923 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 327 transitions.
[2023-11-03 13:08:31,923 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:08:31,923 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 327 transitions.
[2023-11-03 13:08:31,924 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 163.5) internal successors, (327), 2 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:08:31,924 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 277.0) internal successors, (831), 3 states have internal predecessors, (831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:08:31,925 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 277.0) internal successors, (831), 3 states have internal predecessors, (831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:08:31,925 INFO  L175             Difference]: Start difference. First operand has 54 places, 49 transitions, 142 flow. Second operand 2 states and 327 transitions.
[2023-11-03 13:08:31,925 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 45 transitions, 204 flow
[2023-11-03 13:08:31,926 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 45 transitions, 204 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 13:08:31,927 INFO  L231             Difference]: Finished difference. Result has 51 places, 45 transitions, 134 flow
[2023-11-03 13:08:31,927 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=134, PETRI_PLACES=51, PETRI_TRANSITIONS=45}
[2023-11-03 13:08:31,927 INFO  L288   CegarLoopForPetriNet]: 54 programPoint places, -3 predicate places.
[2023-11-03 13:08:31,927 INFO  L495      AbstractCegarLoop]: Abstraction has has 51 places, 45 transitions, 134 flow
[2023-11-03 13:08:31,928 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 145.0) internal successors, (290), 2 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:08:31,928 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:08:31,928 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1]
[2023-11-03 13:08:31,928 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2023-11-03 13:08:31,928 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-11-03 13:08:31,928 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:08:31,928 INFO  L85        PathProgramCache]: Analyzing trace with hash 36575772, now seen corresponding path program 1 times
[2023-11-03 13:08:31,928 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:08:31,928 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335475087]
[2023-11-03 13:08:31,928 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:08:31,929 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:08:31,934 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:08:31,943 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:08:31,943 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:08:31,943 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335475087]
[2023-11-03 13:08:31,943 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335475087] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:08:31,944 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:08:31,944 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-03 13:08:31,944 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670897488]
[2023-11-03 13:08:31,944 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:08:31,944 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 13:08:31,944 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:08:31,944 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 13:08:31,944 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 13:08:31,959 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 137 out of 277
[2023-11-03 13:08:31,960 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 45 transitions, 134 flow. Second operand  has 3 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:08:31,960 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:08:31,960 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 277
[2023-11-03 13:08:31,960 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:08:37,372 INFO  L130       PetriNetUnfolder]: 73069/103628 cut-off events.
[2023-11-03 13:08:37,373 INFO  L131       PetriNetUnfolder]: For 5920/5920 co-relation queries the response was YES.
[2023-11-03 13:08:37,512 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 206250 conditions, 103628 events. 73069/103628 cut-off events. For 5920/5920 co-relation queries the response was YES. Maximal size of possible extension queue 2410. Compared 706049 event pairs, 48108 based on Foata normal form. 0/97520 useless extension candidates. Maximal degree in co-relation 206243. Up to 73612 conditions per place. 
[2023-11-03 13:08:37,861 INFO  L137   encePairwiseOnDemand]: 270/277 looper letters, 54 selfloop transitions, 6 changer transitions 0/67 dead transitions.
[2023-11-03 13:08:37,862 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 67 transitions, 298 flow
[2023-11-03 13:08:37,862 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 13:08:37,863 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 13:08:37,863 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 472 transitions.
[2023-11-03 13:08:37,864 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5679903730445247
[2023-11-03 13:08:37,864 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 472 transitions.
[2023-11-03 13:08:37,864 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 472 transitions.
[2023-11-03 13:08:37,864 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:08:37,864 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 472 transitions.
[2023-11-03 13:08:37,865 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 157.33333333333334) internal successors, (472), 3 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:08:37,866 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 277.0) internal successors, (1108), 4 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:08:37,866 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 277.0) internal successors, (1108), 4 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:08:37,866 INFO  L175             Difference]: Start difference. First operand has 51 places, 45 transitions, 134 flow. Second operand 3 states and 472 transitions.
[2023-11-03 13:08:37,866 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 67 transitions, 298 flow
[2023-11-03 13:08:37,868 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 67 transitions, 298 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 13:08:37,869 INFO  L231             Difference]: Finished difference. Result has 55 places, 50 transitions, 180 flow
[2023-11-03 13:08:37,869 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=180, PETRI_PLACES=55, PETRI_TRANSITIONS=50}
[2023-11-03 13:08:37,870 INFO  L288   CegarLoopForPetriNet]: 54 programPoint places, 1 predicate places.
[2023-11-03 13:08:37,870 INFO  L495      AbstractCegarLoop]: Abstraction has has 55 places, 50 transitions, 180 flow
[2023-11-03 13:08:37,870 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:08:37,870 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:08:37,870 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:08:37,870 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2023-11-03 13:08:37,871 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-11-03 13:08:37,871 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:08:37,871 INFO  L85        PathProgramCache]: Analyzing trace with hash 176595664, now seen corresponding path program 1 times
[2023-11-03 13:08:37,871 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:08:37,871 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837418369]
[2023-11-03 13:08:37,871 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:08:37,871 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:08:37,879 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:08:37,891 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:08:37,891 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:08:37,891 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837418369]
[2023-11-03 13:08:37,891 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837418369] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:08:37,891 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:08:37,891 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-03 13:08:37,891 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864912470]
[2023-11-03 13:08:37,891 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:08:37,892 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 13:08:37,892 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:08:37,892 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 13:08:37,892 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 13:08:37,913 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 135 out of 277
[2023-11-03 13:08:37,913 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 50 transitions, 180 flow. Second operand  has 3 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:08:37,913 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:08:37,913 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 277
[2023-11-03 13:08:37,913 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:08:45,100 INFO  L130       PetriNetUnfolder]: 89848/128539 cut-off events.
[2023-11-03 13:08:45,101 INFO  L131       PetriNetUnfolder]: For 37185/37185 co-relation queries the response was YES.
[2023-11-03 13:08:45,351 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 289520 conditions, 128539 events. 89848/128539 cut-off events. For 37185/37185 co-relation queries the response was YES. Maximal size of possible extension queue 3583. Compared 938554 event pairs, 58046 based on Foata normal form. 0/120609 useless extension candidates. Maximal degree in co-relation 289511. Up to 95069 conditions per place. 
[2023-11-03 13:08:45,877 INFO  L137   encePairwiseOnDemand]: 269/277 looper letters, 63 selfloop transitions, 11 changer transitions 0/83 dead transitions.
[2023-11-03 13:08:45,878 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 83 transitions, 446 flow
[2023-11-03 13:08:45,891 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 13:08:45,892 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 13:08:45,893 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 473 transitions.
[2023-11-03 13:08:45,894 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5691937424789411
[2023-11-03 13:08:45,894 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 473 transitions.
[2023-11-03 13:08:45,894 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 473 transitions.
[2023-11-03 13:08:45,895 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:08:45,895 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 473 transitions.
[2023-11-03 13:08:45,897 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 157.66666666666666) internal successors, (473), 3 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:08:45,899 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 277.0) internal successors, (1108), 4 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:08:45,899 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 277.0) internal successors, (1108), 4 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:08:45,899 INFO  L175             Difference]: Start difference. First operand has 55 places, 50 transitions, 180 flow. Second operand 3 states and 473 transitions.
[2023-11-03 13:08:45,900 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 83 transitions, 446 flow
[2023-11-03 13:08:48,537 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 83 transitions, 426 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-03 13:08:48,538 INFO  L231             Difference]: Finished difference. Result has 57 places, 59 transitions, 264 flow
[2023-11-03 13:08:48,538 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=264, PETRI_PLACES=57, PETRI_TRANSITIONS=59}
[2023-11-03 13:08:48,538 INFO  L288   CegarLoopForPetriNet]: 54 programPoint places, 3 predicate places.
[2023-11-03 13:08:48,538 INFO  L495      AbstractCegarLoop]: Abstraction has has 57 places, 59 transitions, 264 flow
[2023-11-03 13:08:48,539 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:08:48,539 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:08:48,539 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:08:48,539 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2023-11-03 13:08:48,539 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-11-03 13:08:48,539 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:08:48,539 INFO  L85        PathProgramCache]: Analyzing trace with hash -756770437, now seen corresponding path program 1 times
[2023-11-03 13:08:48,540 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:08:48,540 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868307904]
[2023-11-03 13:08:48,540 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:08:48,540 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:08:48,551 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:08:48,602 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:08:48,603 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:08:48,603 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868307904]
[2023-11-03 13:08:48,603 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868307904] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-03 13:08:48,603 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1459105082]
[2023-11-03 13:08:48,603 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:08:48,603 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 13:08:48,603 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 13:08:48,604 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-03 13:08:48,606 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2023-11-03 13:08:48,681 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:08:48,682 INFO  L263         TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 4 conjunts are in the unsatisfiable core
[2023-11-03 13:08:48,683 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 13:08:48,719 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:08:48,719 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-03 13:08:48,741 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:08:48,741 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1459105082] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-03 13:08:48,741 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-03 13:08:48,741 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8
[2023-11-03 13:08:48,741 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242225620]
[2023-11-03 13:08:48,742 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-03 13:08:48,742 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2023-11-03 13:08:48,742 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:08:48,742 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2023-11-03 13:08:48,742 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2023-11-03 13:08:48,831 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 134 out of 277
[2023-11-03 13:08:48,832 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 59 transitions, 264 flow. Second operand  has 9 states, 9 states have (on average 135.77777777777777) internal successors, (1222), 9 states have internal predecessors, (1222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:08:48,833 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:08:48,833 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 277
[2023-11-03 13:08:48,833 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:08:53,447 INFO  L130       PetriNetUnfolder]: 51304/76067 cut-off events.
[2023-11-03 13:08:53,448 INFO  L131       PetriNetUnfolder]: For 54745/60542 co-relation queries the response was YES.
[2023-11-03 13:08:53,582 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 190830 conditions, 76067 events. 51304/76067 cut-off events. For 54745/60542 co-relation queries the response was YES. Maximal size of possible extension queue 1785. Compared 557804 event pairs, 22175 based on Foata normal form. 4019/76369 useless extension candidates. Maximal degree in co-relation 190820. Up to 45140 conditions per place. 
[2023-11-03 13:08:53,824 INFO  L137   encePairwiseOnDemand]: 270/277 looper letters, 100 selfloop transitions, 7 changer transitions 4/123 dead transitions.
[2023-11-03 13:08:53,824 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 123 transitions, 720 flow
[2023-11-03 13:08:53,825 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2023-11-03 13:08:53,825 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2023-11-03 13:08:53,827 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1162 transitions.
[2023-11-03 13:08:53,827 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5243682310469314
[2023-11-03 13:08:53,828 INFO  L72            ComplementDD]: Start complementDD. Operand 8 states and 1162 transitions.
[2023-11-03 13:08:53,828 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 8 states and 1162 transitions.
[2023-11-03 13:08:53,828 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:08:53,828 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1162 transitions.
[2023-11-03 13:08:53,830 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 9 states, 8 states have (on average 145.25) internal successors, (1162), 8 states have internal predecessors, (1162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:08:53,832 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 9 states, 9 states have (on average 277.0) internal successors, (2493), 9 states have internal predecessors, (2493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:08:53,833 INFO  L81            ComplementDD]: Finished complementDD. Result  has 9 states, 9 states have (on average 277.0) internal successors, (2493), 9 states have internal predecessors, (2493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:08:53,833 INFO  L175             Difference]: Start difference. First operand has 57 places, 59 transitions, 264 flow. Second operand 8 states and 1162 transitions.
[2023-11-03 13:08:53,833 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 123 transitions, 720 flow
[2023-11-03 13:08:53,911 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 123 transitions, 676 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-03 13:08:53,913 INFO  L231             Difference]: Finished difference. Result has 66 places, 63 transitions, 287 flow
[2023-11-03 13:08:53,913 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=287, PETRI_PLACES=66, PETRI_TRANSITIONS=63}
[2023-11-03 13:08:53,913 INFO  L288   CegarLoopForPetriNet]: 54 programPoint places, 12 predicate places.
[2023-11-03 13:08:53,913 INFO  L495      AbstractCegarLoop]: Abstraction has has 66 places, 63 transitions, 287 flow
[2023-11-03 13:08:53,914 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 135.77777777777777) internal successors, (1222), 9 states have internal predecessors, (1222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:08:53,914 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:08:53,914 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:08:53,922 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2023-11-03 13:08:54,115 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 13:08:54,115 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-11-03 13:08:54,116 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:08:54,116 INFO  L85        PathProgramCache]: Analyzing trace with hash 707331847, now seen corresponding path program 1 times
[2023-11-03 13:08:54,116 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:08:54,116 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531191783]
[2023-11-03 13:08:54,117 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:08:54,117 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:08:54,134 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:08:54,153 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2023-11-03 13:08:54,153 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:08:54,153 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531191783]
[2023-11-03 13:08:54,153 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531191783] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:08:54,153 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:08:54,153 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-03 13:08:54,154 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12982191]
[2023-11-03 13:08:54,154 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:08:54,154 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 13:08:54,154 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:08:54,155 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 13:08:54,155 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 13:08:54,187 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 135 out of 277
[2023-11-03 13:08:54,188 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 63 transitions, 287 flow. Second operand  has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:08:54,188 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:08:54,188 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 277
[2023-11-03 13:08:54,188 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:09:00,816 INFO  L130       PetriNetUnfolder]: 70386/102764 cut-off events.
[2023-11-03 13:09:00,817 INFO  L131       PetriNetUnfolder]: For 75691/77037 co-relation queries the response was YES.
[2023-11-03 13:09:01,037 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 272884 conditions, 102764 events. 70386/102764 cut-off events. For 75691/77037 co-relation queries the response was YES. Maximal size of possible extension queue 2248. Compared 743900 event pairs, 51147 based on Foata normal form. 4/98168 useless extension candidates. Maximal degree in co-relation 272870. Up to 86779 conditions per place. 
[2023-11-03 13:09:01,360 INFO  L137   encePairwiseOnDemand]: 270/277 looper letters, 76 selfloop transitions, 17 changer transitions 0/102 dead transitions.
[2023-11-03 13:09:01,361 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 102 transitions, 656 flow
[2023-11-03 13:09:01,362 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 13:09:01,362 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 13:09:01,362 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 471 transitions.
[2023-11-03 13:09:01,363 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5667870036101083
[2023-11-03 13:09:01,363 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 471 transitions.
[2023-11-03 13:09:01,363 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 471 transitions.
[2023-11-03 13:09:01,363 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:09:01,363 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 471 transitions.
[2023-11-03 13:09:01,364 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 157.0) internal successors, (471), 3 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:09:01,365 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 277.0) internal successors, (1108), 4 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:09:01,365 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 277.0) internal successors, (1108), 4 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:09:01,365 INFO  L175             Difference]: Start difference. First operand has 66 places, 63 transitions, 287 flow. Second operand 3 states and 471 transitions.
[2023-11-03 13:09:01,365 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 102 transitions, 656 flow
[2023-11-03 13:09:01,505 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 102 transitions, 651 flow, removed 2 selfloop flow, removed 1 redundant places.
[2023-11-03 13:09:01,506 INFO  L231             Difference]: Finished difference. Result has 67 places, 76 transitions, 441 flow
[2023-11-03 13:09:01,506 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=441, PETRI_PLACES=67, PETRI_TRANSITIONS=76}
[2023-11-03 13:09:01,507 INFO  L288   CegarLoopForPetriNet]: 54 programPoint places, 13 predicate places.
[2023-11-03 13:09:01,507 INFO  L495      AbstractCegarLoop]: Abstraction has has 67 places, 76 transitions, 441 flow
[2023-11-03 13:09:01,507 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:09:01,507 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:09:01,507 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:09:01,507 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2023-11-03 13:09:01,507 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-11-03 13:09:01,507 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:09:01,508 INFO  L85        PathProgramCache]: Analyzing trace with hash -191335336, now seen corresponding path program 1 times
[2023-11-03 13:09:01,508 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:09:01,508 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557909715]
[2023-11-03 13:09:01,508 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:09:01,508 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:09:01,518 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:09:01,556 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:09:01,556 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:09:01,556 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557909715]
[2023-11-03 13:09:01,556 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557909715] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:09:01,556 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:09:01,556 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-03 13:09:01,556 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486290574]
[2023-11-03 13:09:01,556 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:09:01,557 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 13:09:01,557 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:09:01,557 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 13:09:01,557 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 13:09:01,581 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 135 out of 277
[2023-11-03 13:09:01,581 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 76 transitions, 441 flow. Second operand  has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:09:01,581 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:09:01,581 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 277
[2023-11-03 13:09:01,581 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:09:02,287 INFO  L130       PetriNetUnfolder]: 3849/8671 cut-off events.
[2023-11-03 13:09:02,287 INFO  L131       PetriNetUnfolder]: For 11095/11133 co-relation queries the response was YES.
[2023-11-03 13:09:02,302 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25393 conditions, 8671 events. 3849/8671 cut-off events. For 11095/11133 co-relation queries the response was YES. Maximal size of possible extension queue 368. Compared 76338 event pairs, 761 based on Foata normal form. 2851/11218 useless extension candidates. Maximal degree in co-relation 25378. Up to 6051 conditions per place. 
[2023-11-03 13:09:02,319 INFO  L137   encePairwiseOnDemand]: 269/277 looper letters, 55 selfloop transitions, 9 changer transitions 0/76 dead transitions.
[2023-11-03 13:09:02,319 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 76 transitions, 517 flow
[2023-11-03 13:09:02,320 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 13:09:02,320 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 13:09:02,320 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 458 transitions.
[2023-11-03 13:09:02,320 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5511432009626955
[2023-11-03 13:09:02,321 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 458 transitions.
[2023-11-03 13:09:02,321 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 458 transitions.
[2023-11-03 13:09:02,321 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:09:02,321 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 458 transitions.
[2023-11-03 13:09:02,322 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:09:02,323 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 277.0) internal successors, (1108), 4 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:09:02,323 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 277.0) internal successors, (1108), 4 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:09:02,323 INFO  L175             Difference]: Start difference. First operand has 67 places, 76 transitions, 441 flow. Second operand 3 states and 458 transitions.
[2023-11-03 13:09:02,323 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 76 transitions, 517 flow
[2023-11-03 13:09:02,339 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 76 transitions, 509 flow, removed 2 selfloop flow, removed 1 redundant places.
[2023-11-03 13:09:02,340 INFO  L231             Difference]: Finished difference. Result has 68 places, 59 transitions, 300 flow
[2023-11-03 13:09:02,340 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=300, PETRI_PLACES=68, PETRI_TRANSITIONS=59}
[2023-11-03 13:09:02,340 INFO  L288   CegarLoopForPetriNet]: 54 programPoint places, 14 predicate places.
[2023-11-03 13:09:02,340 INFO  L495      AbstractCegarLoop]: Abstraction has has 68 places, 59 transitions, 300 flow
[2023-11-03 13:09:02,341 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:09:02,341 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:09:02,341 INFO  L209   CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:09:02,341 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2023-11-03 13:09:02,341 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-11-03 13:09:02,341 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:09:02,341 INFO  L85        PathProgramCache]: Analyzing trace with hash 266652888, now seen corresponding path program 1 times
[2023-11-03 13:09:02,341 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:09:02,341 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981600012]
[2023-11-03 13:09:02,341 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:09:02,342 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:09:02,353 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:09:02,369 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2023-11-03 13:09:02,370 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:09:02,370 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981600012]
[2023-11-03 13:09:02,371 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981600012] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:09:02,371 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:09:02,371 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-03 13:09:02,372 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840393573]
[2023-11-03 13:09:02,372 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:09:02,372 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 13:09:02,372 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:09:02,373 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 13:09:02,373 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 13:09:02,395 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 135 out of 277
[2023-11-03 13:09:02,396 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 59 transitions, 300 flow. Second operand  has 3 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:09:02,396 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:09:02,396 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 277
[2023-11-03 13:09:02,396 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:09:03,172 INFO  L130       PetriNetUnfolder]: 4013/9119 cut-off events.
[2023-11-03 13:09:03,172 INFO  L131       PetriNetUnfolder]: For 11263/11301 co-relation queries the response was YES.
[2023-11-03 13:09:03,191 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28141 conditions, 9119 events. 4013/9119 cut-off events. For 11263/11301 co-relation queries the response was YES. Maximal size of possible extension queue 375. Compared 79138 event pairs, 3200 based on Foata normal form. 0/8895 useless extension candidates. Maximal degree in co-relation 28126. Up to 7676 conditions per place. 
[2023-11-03 13:09:03,209 INFO  L137   encePairwiseOnDemand]: 273/277 looper letters, 60 selfloop transitions, 4 changer transitions 0/73 dead transitions.
[2023-11-03 13:09:03,209 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 73 transitions, 502 flow
[2023-11-03 13:09:03,209 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 13:09:03,209 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 13:09:03,210 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 455 transitions.
[2023-11-03 13:09:03,210 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5475330926594465
[2023-11-03 13:09:03,210 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 455 transitions.
[2023-11-03 13:09:03,210 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 455 transitions.
[2023-11-03 13:09:03,211 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:09:03,211 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 455 transitions.
[2023-11-03 13:09:03,211 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:09:03,212 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 277.0) internal successors, (1108), 4 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:09:03,213 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 277.0) internal successors, (1108), 4 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:09:03,213 INFO  L175             Difference]: Start difference. First operand has 68 places, 59 transitions, 300 flow. Second operand 3 states and 455 transitions.
[2023-11-03 13:09:03,213 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 73 transitions, 502 flow
[2023-11-03 13:09:03,223 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 73 transitions, 493 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-11-03 13:09:03,224 INFO  L231             Difference]: Finished difference. Result has 70 places, 61 transitions, 321 flow
[2023-11-03 13:09:03,224 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=291, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=321, PETRI_PLACES=70, PETRI_TRANSITIONS=61}
[2023-11-03 13:09:03,224 INFO  L288   CegarLoopForPetriNet]: 54 programPoint places, 16 predicate places.
[2023-11-03 13:09:03,224 INFO  L495      AbstractCegarLoop]: Abstraction has has 70 places, 61 transitions, 321 flow
[2023-11-03 13:09:03,225 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:09:03,225 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:09:03,225 INFO  L209   CegarLoopForPetriNet]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:09:03,225 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2023-11-03 13:09:03,225 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-11-03 13:09:03,225 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:09:03,225 INFO  L85        PathProgramCache]: Analyzing trace with hash -578019697, now seen corresponding path program 1 times
[2023-11-03 13:09:03,225 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:09:03,225 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335278336]
[2023-11-03 13:09:03,226 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:09:03,226 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:09:03,250 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-03 13:09:03,251 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-11-03 13:09:03,262 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-03 13:09:03,268 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-11-03 13:09:03,269 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-11-03 13:09:03,269 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining)
[2023-11-03 13:09:03,269 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining)
[2023-11-03 13:09:03,269 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining)
[2023-11-03 13:09:03,269 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining)
[2023-11-03 13:09:03,269 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining)
[2023-11-03 13:09:03,269 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining)
[2023-11-03 13:09:03,269 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining)
[2023-11-03 13:09:03,270 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining)
[2023-11-03 13:09:03,270 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining)
[2023-11-03 13:09:03,270 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining)
[2023-11-03 13:09:03,270 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining)
[2023-11-03 13:09:03,270 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2023-11-03 13:09:03,270 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:09:03,270 WARN  L233   ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-11-03 13:09:03,270 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances.
[2023-11-03 13:09:03,289 INFO  L144    ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions.
[2023-11-03 13:09:03,290 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 174 places, 171 transitions, 402 flow
[2023-11-03 13:09:03,459 INFO  L130       PetriNetUnfolder]: 93/1515 cut-off events.
[2023-11-03 13:09:03,459 INFO  L131       PetriNetUnfolder]: For 110/110 co-relation queries the response was YES.
[2023-11-03 13:09:03,462 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1626 conditions, 1515 events. 93/1515 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 7801 event pairs, 23 based on Foata normal form. 0/1299 useless extension candidates. Maximal degree in co-relation 869. Up to 80 conditions per place. 
[2023-11-03 13:09:03,463 INFO  L82        GeneralOperation]: Start removeDead. Operand has 174 places, 171 transitions, 402 flow
[2023-11-03 13:09:03,466 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 174 places, 171 transitions, 402 flow
[2023-11-03 13:09:03,466 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-11-03 13:09:03,466 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 171 transitions, 402 flow
[2023-11-03 13:09:03,466 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 174 places, 171 transitions, 402 flow
[2023-11-03 13:09:03,466 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 174 places, 171 transitions, 402 flow
[2023-11-03 13:09:03,594 INFO  L130       PetriNetUnfolder]: 93/1515 cut-off events.
[2023-11-03 13:09:03,594 INFO  L131       PetriNetUnfolder]: For 110/110 co-relation queries the response was YES.
[2023-11-03 13:09:03,599 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1626 conditions, 1515 events. 93/1515 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 7801 event pairs, 23 based on Foata normal form. 0/1299 useless extension candidates. Maximal degree in co-relation 869. Up to 80 conditions per place. 
[2023-11-03 13:09:03,614 INFO  L119        LiptonReduction]: Number of co-enabled transitions 13020
[2023-11-03 13:09:08,059 INFO  L134        LiptonReduction]: Checked pairs total: 31156
[2023-11-03 13:09:08,059 INFO  L136        LiptonReduction]: Total number of compositions: 130
[2023-11-03 13:09:08,060 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-03 13:09:08,061 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;@4c36d5a2, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-11-03 13:09:08,061 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 12 error locations.
[2023-11-03 13:09:08,062 INFO  L130       PetriNetUnfolder]: 0/2 cut-off events.
[2023-11-03 13:09:08,062 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-11-03 13:09:08,063 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:09:08,063 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1]
[2023-11-03 13:09:08,063 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 9 more)] ===
[2023-11-03 13:09:08,063 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:09:08,063 INFO  L85        PathProgramCache]: Analyzing trace with hash 48217, now seen corresponding path program 1 times
[2023-11-03 13:09:08,063 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:09:08,063 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628627105]
[2023-11-03 13:09:08,063 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:09:08,063 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:09:08,067 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:09:08,070 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:09:08,070 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:09:08,070 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628627105]
[2023-11-03 13:09:08,070 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628627105] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:09:08,070 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:09:08,070 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2023-11-03 13:09:08,070 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570184756]
[2023-11-03 13:09:08,070 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:09:08,070 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-11-03 13:09:08,071 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:09:08,071 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-11-03 13:09:08,071 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-11-03 13:09:08,071 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 158 out of 301
[2023-11-03 13:09:08,071 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 57 transitions, 174 flow. Second operand  has 2 states, 2 states have (on average 159.0) internal successors, (318), 2 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:09:08,072 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:09:08,072 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 301
[2023-11-03 13:09:08,072 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:09:23,651 INFO  L130       PetriNetUnfolder]: 191348/272230 cut-off events.
[2023-11-03 13:09:23,652 INFO  L131       PetriNetUnfolder]: For 32242/32242 co-relation queries the response was YES.
[2023-11-03 13:09:24,077 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 534983 conditions, 272230 events. 191348/272230 cut-off events. For 32242/32242 co-relation queries the response was YES. Maximal size of possible extension queue 7005. Compared 2163212 event pairs, 189535 based on Foata normal form. 0/253731 useless extension candidates. Maximal degree in co-relation 78792. Up to 247016 conditions per place. 
[2023-11-03 13:09:25,067 INFO  L137   encePairwiseOnDemand]: 297/301 looper letters, 39 selfloop transitions, 0 changer transitions 0/53 dead transitions.
[2023-11-03 13:09:25,068 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 53 transitions, 244 flow
[2023-11-03 13:09:25,068 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-11-03 13:09:25,069 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-11-03 13:09:25,069 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 359 transitions.
[2023-11-03 13:09:25,069 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5963455149501661
[2023-11-03 13:09:25,069 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 359 transitions.
[2023-11-03 13:09:25,069 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 359 transitions.
[2023-11-03 13:09:25,070 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:09:25,070 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 359 transitions.
[2023-11-03 13:09:25,070 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 179.5) internal successors, (359), 2 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:09:25,071 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 301.0) internal successors, (903), 3 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:09:25,071 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 301.0) internal successors, (903), 3 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:09:25,071 INFO  L175             Difference]: Start difference. First operand has 63 places, 57 transitions, 174 flow. Second operand 2 states and 359 transitions.
[2023-11-03 13:09:25,071 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 53 transitions, 244 flow
[2023-11-03 13:09:25,074 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 53 transitions, 244 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 13:09:25,075 INFO  L231             Difference]: Finished difference. Result has 60 places, 53 transitions, 166 flow
[2023-11-03 13:09:25,075 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=166, PETRI_PLACES=60, PETRI_TRANSITIONS=53}
[2023-11-03 13:09:25,075 INFO  L288   CegarLoopForPetriNet]: 63 programPoint places, -3 predicate places.
[2023-11-03 13:09:25,075 INFO  L495      AbstractCegarLoop]: Abstraction has has 60 places, 53 transitions, 166 flow
[2023-11-03 13:09:25,075 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 159.0) internal successors, (318), 2 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:09:25,076 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:09:25,076 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1]
[2023-11-03 13:09:25,076 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2023-11-03 13:09:25,076 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 9 more)] ===
[2023-11-03 13:09:25,076 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:09:25,076 INFO  L85        PathProgramCache]: Analyzing trace with hash 46331455, now seen corresponding path program 1 times
[2023-11-03 13:09:25,076 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:09:25,076 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478187050]
[2023-11-03 13:09:25,076 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:09:25,076 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:09:25,082 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:09:25,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-11-03 13:09:25,092 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:09:25,092 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478187050]
[2023-11-03 13:09:25,092 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478187050] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:09:25,092 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:09:25,093 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-03 13:09:25,093 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268871078]
[2023-11-03 13:09:25,093 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:09:25,093 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 13:09:25,093 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:09:25,093 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 13:09:25,093 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 13:09:25,118 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 150 out of 301
[2023-11-03 13:09:25,119 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 53 transitions, 166 flow. Second operand  has 3 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:09:25,119 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:09:25,119 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 301
[2023-11-03 13:09:25,119 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:10:01,453 INFO  L130       PetriNetUnfolder]: 464032/631928 cut-off events.
[2023-11-03 13:10:01,454 INFO  L131       PetriNetUnfolder]: For 43112/43112 co-relation queries the response was YES.
[2023-11-03 13:10:02,548 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1252356 conditions, 631928 events. 464032/631928 cut-off events. For 43112/43112 co-relation queries the response was YES. Maximal size of possible extension queue 12630. Compared 4816384 event pairs, 308655 based on Foata normal form. 0/598772 useless extension candidates. Maximal degree in co-relation 1252348. Up to 450532 conditions per place. 
[2023-11-03 13:10:05,170 INFO  L137   encePairwiseOnDemand]: 293/301 looper letters, 61 selfloop transitions, 7 changer transitions 0/78 dead transitions.
[2023-11-03 13:10:05,170 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 78 transitions, 352 flow
[2023-11-03 13:10:05,171 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 13:10:05,171 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 13:10:05,172 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 519 transitions.
[2023-11-03 13:10:05,172 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.574750830564784
[2023-11-03 13:10:05,172 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 519 transitions.
[2023-11-03 13:10:05,172 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 519 transitions.
[2023-11-03 13:10:05,172 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:10:05,172 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 519 transitions.
[2023-11-03 13:10:05,173 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 173.0) internal successors, (519), 3 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:10:05,174 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:10:05,174 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:10:05,175 INFO  L175             Difference]: Start difference. First operand has 60 places, 53 transitions, 166 flow. Second operand 3 states and 519 transitions.
[2023-11-03 13:10:05,175 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 78 transitions, 352 flow
[2023-11-03 13:10:05,177 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 78 transitions, 352 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 13:10:05,178 INFO  L231             Difference]: Finished difference. Result has 64 places, 59 transitions, 220 flow
[2023-11-03 13:10:05,178 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=220, PETRI_PLACES=64, PETRI_TRANSITIONS=59}
[2023-11-03 13:10:05,179 INFO  L288   CegarLoopForPetriNet]: 63 programPoint places, 1 predicate places.
[2023-11-03 13:10:05,179 INFO  L495      AbstractCegarLoop]: Abstraction has has 64 places, 59 transitions, 220 flow
[2023-11-03 13:10:05,179 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:10:05,179 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:10:05,179 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:10:05,179 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2023-11-03 13:10:05,180 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 9 more)] ===
[2023-11-03 13:10:05,180 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:10:05,180 INFO  L85        PathProgramCache]: Analyzing trace with hash -1316280505, now seen corresponding path program 1 times
[2023-11-03 13:10:05,180 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:10:05,180 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576071402]
[2023-11-03 13:10:05,180 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:10:05,180 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:10:05,188 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:10:05,199 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:10:05,200 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:10:05,200 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576071402]
[2023-11-03 13:10:05,200 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576071402] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:10:05,200 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:10:05,200 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-03 13:10:05,200 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263866403]
[2023-11-03 13:10:05,200 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:10:05,201 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 13:10:05,201 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:10:05,201 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 13:10:05,201 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 13:10:05,235 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 148 out of 301
[2023-11-03 13:10:05,236 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 59 transitions, 220 flow. Second operand  has 3 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:10:05,236 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:10:05,236 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 301
[2023-11-03 13:10:05,236 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:10:59,304 INFO  L130       PetriNetUnfolder]: 616853/841972 cut-off events.
[2023-11-03 13:10:59,304 INFO  L131       PetriNetUnfolder]: For 291438/291438 co-relation queries the response was YES.
[2023-11-03 13:11:01,186 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1906424 conditions, 841972 events. 616853/841972 cut-off events. For 291438/291438 co-relation queries the response was YES. Maximal size of possible extension queue 19316. Compared 6669478 event pairs, 388264 based on Foata normal form. 0/790581 useless extension candidates. Maximal degree in co-relation 1906414. Up to 613729 conditions per place. 
[2023-11-03 13:11:05,286 INFO  L137   encePairwiseOnDemand]: 292/301 looper letters, 74 selfloop transitions, 13 changer transitions 0/99 dead transitions.
[2023-11-03 13:11:05,287 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 99 transitions, 546 flow
[2023-11-03 13:11:05,287 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 13:11:05,288 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 13:11:05,288 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 523 transitions.
[2023-11-03 13:11:05,289 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5791805094130675
[2023-11-03 13:11:05,289 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 523 transitions.
[2023-11-03 13:11:05,289 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 523 transitions.
[2023-11-03 13:11:05,289 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:11:05,289 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 523 transitions.
[2023-11-03 13:11:05,290 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 174.33333333333334) internal successors, (523), 3 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:11:05,291 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:11:05,291 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:11:05,291 INFO  L175             Difference]: Start difference. First operand has 64 places, 59 transitions, 220 flow. Second operand 3 states and 523 transitions.
[2023-11-03 13:11:05,291 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 99 transitions, 546 flow
[2023-11-03 13:14:07,989 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 99 transitions, 522 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-03 13:14:07,990 INFO  L231             Difference]: Finished difference. Result has 66 places, 70 transitions, 322 flow
[2023-11-03 13:14:07,990 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=322, PETRI_PLACES=66, PETRI_TRANSITIONS=70}
[2023-11-03 13:14:07,991 INFO  L288   CegarLoopForPetriNet]: 63 programPoint places, 3 predicate places.
[2023-11-03 13:14:07,991 INFO  L495      AbstractCegarLoop]: Abstraction has has 66 places, 70 transitions, 322 flow
[2023-11-03 13:14:07,991 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:14:07,991 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:14:07,991 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:14:07,991 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2023-11-03 13:14:07,991 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 9 more)] ===
[2023-11-03 13:14:07,992 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:14:07,992 INFO  L85        PathProgramCache]: Analyzing trace with hash -1287319553, now seen corresponding path program 1 times
[2023-11-03 13:14:07,992 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:14:07,992 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523291876]
[2023-11-03 13:14:07,992 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:14:07,992 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:14:08,001 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:14:08,046 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:14:08,046 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:14:08,046 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523291876]
[2023-11-03 13:14:08,046 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523291876] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-03 13:14:08,046 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1076612347]
[2023-11-03 13:14:08,046 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:14:08,047 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 13:14:08,047 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 13:14:08,048 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-03 13:14:08,050 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2023-11-03 13:14:08,160 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:14:08,161 INFO  L263         TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 4 conjunts are in the unsatisfiable core
[2023-11-03 13:14:08,162 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 13:14:08,200 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:14:08,200 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-03 13:14:08,231 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:14:08,231 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1076612347] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-03 13:14:08,231 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-03 13:14:08,231 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8
[2023-11-03 13:14:08,231 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233459571]
[2023-11-03 13:14:08,232 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-03 13:14:08,232 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2023-11-03 13:14:08,232 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:14:08,232 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2023-11-03 13:14:08,232 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2023-11-03 13:14:08,352 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 148 out of 301
[2023-11-03 13:14:08,353 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 70 transitions, 322 flow. Second operand  has 9 states, 9 states have (on average 149.77777777777777) internal successors, (1348), 9 states have internal predecessors, (1348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:14:08,353 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:14:08,353 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 301
[2023-11-03 13:14:08,353 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:14:20,253 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1398] L1017-2-->L1017-4: Formula: (= |v_threadThread5of5ForFork0_#t~nondet5_15| |v_#race~data~0_83|)  InVars {}  OutVars{threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_83|}  AuxVars[]  AssignedVars[threadThread5of5ForFork0_#t~nondet5, #race~data~0][82], [29#L1018true, threadThread1of5ForFork0InUse, threadThread2of5ForFork0InUse, 186#true, threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 177#true, 25#L1017-4true, 74#L1026-10true, 143#L1017-4true, Black: 182#(= |#race~data~0| 0), 76#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 264#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), 23#L1017-4true, Black: 188#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|)])
[2023-11-03 13:14:20,253 INFO  L383   tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event
[2023-11-03 13:14:20,253 INFO  L386   tUnfolder$Statistics]:   existing Event has 36 ancestors and is cut-off event
[2023-11-03 13:14:20,253 INFO  L386   tUnfolder$Statistics]:   existing Event has 36 ancestors and is cut-off event
[2023-11-03 13:14:20,253 INFO  L386   tUnfolder$Statistics]:   existing Event has 36 ancestors and is cut-off event
[2023-11-03 13:14:22,443 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1398] L1017-2-->L1017-4: Formula: (= |v_threadThread5of5ForFork0_#t~nondet5_15| |v_#race~data~0_83|)  InVars {}  OutVars{threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_83|}  AuxVars[]  AssignedVars[threadThread5of5ForFork0_#t~nondet5, #race~data~0][82], [threadThread1of5ForFork0InUse, threadThread2of5ForFork0InUse, 186#true, threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 177#true, 25#L1017-4true, 74#L1026-10true, 143#L1017-4true, Black: 182#(= |#race~data~0| 0), 76#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 127#threadEXITtrue, 264#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), 23#L1017-4true, Black: 188#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|)])
[2023-11-03 13:14:22,443 INFO  L383   tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event
[2023-11-03 13:14:22,443 INFO  L386   tUnfolder$Statistics]:   existing Event has 37 ancestors and is cut-off event
[2023-11-03 13:14:22,444 INFO  L386   tUnfolder$Statistics]:   existing Event has 37 ancestors and is cut-off event
[2023-11-03 13:14:22,444 INFO  L386   tUnfolder$Statistics]:   existing Event has 37 ancestors and is cut-off event
[2023-11-03 13:14:23,717 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1398] L1017-2-->L1017-4: Formula: (= |v_threadThread5of5ForFork0_#t~nondet5_15| |v_#race~data~0_83|)  InVars {}  OutVars{threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_83|}  AuxVars[]  AssignedVars[threadThread5of5ForFork0_#t~nondet5, #race~data~0][82], [29#L1018true, 122#L1025-6true, threadThread1of5ForFork0InUse, threadThread2of5ForFork0InUse, 186#true, threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 177#true, 25#L1017-4true, 143#L1017-4true, Black: 182#(= |#race~data~0| 0), 76#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 264#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), 23#L1017-4true, Black: 188#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|)])
[2023-11-03 13:14:23,718 INFO  L383   tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event
[2023-11-03 13:14:23,718 INFO  L386   tUnfolder$Statistics]:   existing Event has 38 ancestors and is cut-off event
[2023-11-03 13:14:23,718 INFO  L386   tUnfolder$Statistics]:   existing Event has 38 ancestors and is cut-off event
[2023-11-03 13:14:23,718 INFO  L386   tUnfolder$Statistics]:   existing Event has 38 ancestors and is cut-off event
[2023-11-03 13:14:25,220 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1398] L1017-2-->L1017-4: Formula: (= |v_threadThread5of5ForFork0_#t~nondet5_15| |v_#race~data~0_83|)  InVars {}  OutVars{threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_83|}  AuxVars[]  AssignedVars[threadThread5of5ForFork0_#t~nondet5, #race~data~0][94], [29#L1018true, threadThread1of5ForFork0InUse, threadThread2of5ForFork0InUse, 186#true, 266#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 177#true, 25#L1017-4true, 143#L1017-4true, Black: 182#(= |#race~data~0| 0), 76#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 93#L1028-3true, 23#L1017-4true, Black: 188#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|)])
[2023-11-03 13:14:25,221 INFO  L383   tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event
[2023-11-03 13:14:25,221 INFO  L386   tUnfolder$Statistics]:   existing Event has 39 ancestors and is cut-off event
[2023-11-03 13:14:25,221 INFO  L386   tUnfolder$Statistics]:   existing Event has 39 ancestors and is cut-off event
[2023-11-03 13:14:25,221 INFO  L386   tUnfolder$Statistics]:   existing Event has 39 ancestors and is cut-off event
[2023-11-03 13:14:25,504 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1398] L1017-2-->L1017-4: Formula: (= |v_threadThread5of5ForFork0_#t~nondet5_15| |v_#race~data~0_83|)  InVars {}  OutVars{threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_83|}  AuxVars[]  AssignedVars[threadThread5of5ForFork0_#t~nondet5, #race~data~0][82], [29#L1018true, threadThread1of5ForFork0InUse, threadThread2of5ForFork0InUse, 186#true, threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 177#true, 115#L1026-9true, 25#L1017-4true, 143#L1017-4true, Black: 182#(= |#race~data~0| 0), 76#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 264#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), 23#L1017-4true, Black: 188#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|)])
[2023-11-03 13:14:25,504 INFO  L383   tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event
[2023-11-03 13:14:25,504 INFO  L386   tUnfolder$Statistics]:   existing Event has 39 ancestors and is cut-off event
[2023-11-03 13:14:25,504 INFO  L386   tUnfolder$Statistics]:   existing Event has 39 ancestors and is cut-off event
[2023-11-03 13:14:25,504 INFO  L386   tUnfolder$Statistics]:   existing Event has 39 ancestors and is cut-off event
[2023-11-03 13:14:25,816 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1398] L1017-2-->L1017-4: Formula: (= |v_threadThread5of5ForFork0_#t~nondet5_15| |v_#race~data~0_83|)  InVars {}  OutVars{threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_83|}  AuxVars[]  AssignedVars[threadThread5of5ForFork0_#t~nondet5, #race~data~0][82], [threadThread1of5ForFork0InUse, 122#L1025-6true, threadThread2of5ForFork0InUse, 186#true, threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 177#true, 25#L1017-4true, 143#L1017-4true, Black: 182#(= |#race~data~0| 0), 76#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 127#threadEXITtrue, 264#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), 23#L1017-4true, Black: 188#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|)])
[2023-11-03 13:14:25,816 INFO  L383   tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event
[2023-11-03 13:14:25,816 INFO  L386   tUnfolder$Statistics]:   existing Event has 39 ancestors and is cut-off event
[2023-11-03 13:14:25,816 INFO  L386   tUnfolder$Statistics]:   existing Event has 39 ancestors and is cut-off event
[2023-11-03 13:14:25,816 INFO  L386   tUnfolder$Statistics]:   existing Event has 39 ancestors and is cut-off event
[2023-11-03 13:14:27,529 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1398] L1017-2-->L1017-4: Formula: (= |v_threadThread5of5ForFork0_#t~nondet5_15| |v_#race~data~0_83|)  InVars {}  OutVars{threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_83|}  AuxVars[]  AssignedVars[threadThread5of5ForFork0_#t~nondet5, #race~data~0][94], [132#L1029-12true, 29#L1018true, threadThread1of5ForFork0InUse, threadThread2of5ForFork0InUse, 186#true, threadThread3of5ForFork0InUse, 266#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 177#true, 25#L1017-4true, 143#L1017-4true, Black: 182#(= |#race~data~0| 0), 76#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 23#L1017-4true, Black: 188#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|)])
[2023-11-03 13:14:27,530 INFO  L383   tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event
[2023-11-03 13:14:27,530 INFO  L386   tUnfolder$Statistics]:   existing Event has 40 ancestors and is cut-off event
[2023-11-03 13:14:27,530 INFO  L386   tUnfolder$Statistics]:   existing Event has 40 ancestors and is cut-off event
[2023-11-03 13:14:27,530 INFO  L386   tUnfolder$Statistics]:   existing Event has 40 ancestors and is cut-off event
[2023-11-03 13:14:27,876 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1398] L1017-2-->L1017-4: Formula: (= |v_threadThread5of5ForFork0_#t~nondet5_15| |v_#race~data~0_83|)  InVars {}  OutVars{threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_83|}  AuxVars[]  AssignedVars[threadThread5of5ForFork0_#t~nondet5, #race~data~0][94], [threadThread1of5ForFork0InUse, threadThread2of5ForFork0InUse, 186#true, 266#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 177#true, 25#L1017-4true, 143#L1017-4true, Black: 182#(= |#race~data~0| 0), 76#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 93#L1028-3true, 127#threadEXITtrue, Black: 188#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|), 23#L1017-4true])
[2023-11-03 13:14:27,876 INFO  L383   tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event
[2023-11-03 13:14:27,876 INFO  L386   tUnfolder$Statistics]:   existing Event has 40 ancestors and is cut-off event
[2023-11-03 13:14:27,876 INFO  L386   tUnfolder$Statistics]:   existing Event has 40 ancestors and is cut-off event
[2023-11-03 13:14:27,876 INFO  L386   tUnfolder$Statistics]:   existing Event has 40 ancestors and is cut-off event
[2023-11-03 13:14:28,152 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1398] L1017-2-->L1017-4: Formula: (= |v_threadThread5of5ForFork0_#t~nondet5_15| |v_#race~data~0_83|)  InVars {}  OutVars{threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_83|}  AuxVars[]  AssignedVars[threadThread5of5ForFork0_#t~nondet5, #race~data~0][82], [threadThread1of5ForFork0InUse, threadThread2of5ForFork0InUse, 186#true, threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 177#true, 115#L1026-9true, 25#L1017-4true, 143#L1017-4true, Black: 182#(= |#race~data~0| 0), 76#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 127#threadEXITtrue, 264#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), 23#L1017-4true, Black: 188#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|)])
[2023-11-03 13:14:28,152 INFO  L383   tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event
[2023-11-03 13:14:28,152 INFO  L386   tUnfolder$Statistics]:   existing Event has 40 ancestors and is cut-off event
[2023-11-03 13:14:28,152 INFO  L386   tUnfolder$Statistics]:   existing Event has 40 ancestors and is cut-off event
[2023-11-03 13:14:28,152 INFO  L386   tUnfolder$Statistics]:   existing Event has 40 ancestors and is cut-off event
[2023-11-03 13:14:29,732 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1398] L1017-2-->L1017-4: Formula: (= |v_threadThread5of5ForFork0_#t~nondet5_15| |v_#race~data~0_83|)  InVars {}  OutVars{threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_83|}  AuxVars[]  AssignedVars[threadThread5of5ForFork0_#t~nondet5, #race~data~0][94], [132#L1029-12true, threadThread1of5ForFork0InUse, threadThread2of5ForFork0InUse, 186#true, threadThread3of5ForFork0InUse, 266#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 177#true, 25#L1017-4true, 143#L1017-4true, Black: 182#(= |#race~data~0| 0), 76#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 127#threadEXITtrue, 23#L1017-4true, Black: 188#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|)])
[2023-11-03 13:14:29,732 INFO  L383   tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event
[2023-11-03 13:14:29,732 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2023-11-03 13:14:29,732 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2023-11-03 13:14:29,732 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2023-11-03 13:14:30,153 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1365] L1017-4-->L1017-6: Formula: (= |v_threadThread4of5ForFork0_#t~nondet5_13| |v_#race~data~0_73|)  InVars {threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_13|, #race~data~0=|v_#race~data~0_73|}  OutVars{threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_13|, threadThread4of5ForFork0_#t~nondet4=|v_threadThread4of5ForFork0_#t~nondet4_9|, #race~data~0=|v_#race~data~0_73|}  AuxVars[]  AssignedVars[threadThread4of5ForFork0_#t~nondet4][77], [72#threadEXITtrue, 114#L1017-6true, threadThread1of5ForFork0InUse, threadThread2of5ForFork0InUse, 186#true, 266#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 177#true, 25#L1017-4true, 101#L1017-4true, Black: 182#(= |#race~data~0| 0), 76#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 93#L1028-3true, Black: 188#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|)])
[2023-11-03 13:14:30,153 INFO  L383   tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event
[2023-11-03 13:14:30,153 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2023-11-03 13:14:30,153 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2023-11-03 13:14:30,153 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2023-11-03 13:14:31,984 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1398] L1017-2-->L1017-4: Formula: (= |v_threadThread5of5ForFork0_#t~nondet5_15| |v_#race~data~0_83|)  InVars {}  OutVars{threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_83|}  AuxVars[]  AssignedVars[threadThread5of5ForFork0_#t~nondet5, #race~data~0][94], [threadThread1of5ForFork0InUse, threadThread2of5ForFork0NotInUse, 186#true, threadThread3of5ForFork0InUse, 266#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 177#true, 25#L1017-4true, 143#L1017-4true, Black: 182#(= |#race~data~0| 0), 76#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 144#L1029-13true, 23#L1017-4true, Black: 188#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|)])
[2023-11-03 13:14:31,985 INFO  L383   tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event
[2023-11-03 13:14:31,985 INFO  L386   tUnfolder$Statistics]:   existing Event has 42 ancestors and is cut-off event
[2023-11-03 13:14:31,985 INFO  L386   tUnfolder$Statistics]:   existing Event has 42 ancestors and is cut-off event
[2023-11-03 13:14:31,985 INFO  L386   tUnfolder$Statistics]:   existing Event has 42 ancestors and is cut-off event
[2023-11-03 13:14:32,200 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1471] L1028-3-->L1032-1: Formula: (and (= |v_#race~data~0_91| 0) (= (store |v_#valid_313| (select (select |v_#memory_$Pointer$.base_234| |v_ULTIMATE.start_main_~#tids~0#1.base_525|) |v_ULTIMATE.start_main_~#tids~0#1.offset_497|) 0) |v_#valid_312|) (not (< |v_ULTIMATE.start_main_~i~1#1_299| |v_ULTIMATE.start_main_~threads_total~0#1_301|)) (= (store |v_#race_896| |v_ULTIMATE.start_main_~#tids~0#1.base_525| (store (store (store (store (select |v_#race_896| |v_ULTIMATE.start_main_~#tids~0#1.base_525|) |v_ULTIMATE.start_main_~#tids~0#1.offset_497| 0) (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_497| 1) 0) (+ 2 |v_ULTIMATE.start_main_~#tids~0#1.offset_497|) 0) (+ 3 |v_ULTIMATE.start_main_~#tids~0#1.offset_497|) 0)) |v_#race_895|))  InVars {#race=|v_#race_896|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_497|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_299|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_234|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_525|, #valid=|v_#valid_313|, ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_301|}  OutVars{#race=|v_#race_895|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_497|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_299|, ULTIMATE.start_main_#t~mem14#1.base=|v_ULTIMATE.start_main_#t~mem14#1.base_174|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_234|, #race~data~0=|v_#race~data~0_91|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_525|, #valid=|v_#valid_312|, ULTIMATE.start_main_#t~mem14#1.offset=|v_ULTIMATE.start_main_#t~mem14#1.offset_148|, ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_301|}  AuxVars[]  AssignedVars[#race, ULTIMATE.start_main_#t~mem14#1.base, #race~data~0, #valid, ULTIMATE.start_main_#t~mem14#1.offset][58], [threadThread1of5ForFork0InUse, threadThread2of5ForFork0NotInUse, 186#true, threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 177#true, 25#L1017-4true, 78#L1032-1true, 138#$Ultimate##0true, Black: 180#true, 76#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 264#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 188#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|), 23#L1017-4true])
[2023-11-03 13:14:32,201 INFO  L383   tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event
[2023-11-03 13:14:32,201 INFO  L386   tUnfolder$Statistics]:   existing Event has 42 ancestors and is cut-off event
[2023-11-03 13:14:32,201 INFO  L386   tUnfolder$Statistics]:   existing Event has 42 ancestors and is cut-off event
[2023-11-03 13:14:32,201 INFO  L386   tUnfolder$Statistics]:   existing Event has 42 ancestors and is cut-off event
[2023-11-03 13:14:32,201 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1365] L1017-4-->L1017-6: Formula: (= |v_threadThread4of5ForFork0_#t~nondet5_13| |v_#race~data~0_73|)  InVars {threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_13|, #race~data~0=|v_#race~data~0_73|}  OutVars{threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_13|, threadThread4of5ForFork0_#t~nondet4=|v_threadThread4of5ForFork0_#t~nondet4_9|, #race~data~0=|v_#race~data~0_73|}  AuxVars[]  AssignedVars[threadThread4of5ForFork0_#t~nondet4][77], [72#threadEXITtrue, 132#L1029-12true, 114#L1017-6true, threadThread1of5ForFork0InUse, threadThread2of5ForFork0InUse, 186#true, 266#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 177#true, 25#L1017-4true, 101#L1017-4true, Black: 182#(= |#race~data~0| 0), 76#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 188#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|)])
[2023-11-03 13:14:32,201 INFO  L383   tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event
[2023-11-03 13:14:32,201 INFO  L386   tUnfolder$Statistics]:   existing Event has 42 ancestors and is cut-off event
[2023-11-03 13:14:32,201 INFO  L386   tUnfolder$Statistics]:   existing Event has 42 ancestors and is cut-off event
[2023-11-03 13:14:32,201 INFO  L386   tUnfolder$Statistics]:   existing Event has 42 ancestors and is cut-off event
[2023-11-03 13:14:32,437 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1365] L1017-4-->L1017-6: Formula: (= |v_threadThread4of5ForFork0_#t~nondet5_13| |v_#race~data~0_73|)  InVars {threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_13|, #race~data~0=|v_#race~data~0_73|}  OutVars{threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_13|, threadThread4of5ForFork0_#t~nondet4=|v_threadThread4of5ForFork0_#t~nondet4_9|, #race~data~0=|v_#race~data~0_73|}  AuxVars[]  AssignedVars[threadThread4of5ForFork0_#t~nondet4][77], [72#threadEXITtrue, 114#L1017-6true, 29#L1018true, threadThread1of5ForFork0InUse, threadThread2of5ForFork0InUse, 186#true, 266#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 177#true, 25#L1017-4true, Black: 182#(= |#race~data~0| 0), 76#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 93#L1028-3true, Black: 188#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|)])
[2023-11-03 13:14:32,437 INFO  L383   tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event
[2023-11-03 13:14:32,437 INFO  L386   tUnfolder$Statistics]:   existing Event has 42 ancestors and is cut-off event
[2023-11-03 13:14:32,437 INFO  L386   tUnfolder$Statistics]:   existing Event has 42 ancestors and is cut-off event
[2023-11-03 13:14:32,437 INFO  L386   tUnfolder$Statistics]:   existing Event has 42 ancestors and is cut-off event
[2023-11-03 13:14:34,663 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1365] L1017-4-->L1017-6: Formula: (= |v_threadThread4of5ForFork0_#t~nondet5_13| |v_#race~data~0_73|)  InVars {threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_13|, #race~data~0=|v_#race~data~0_73|}  OutVars{threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_13|, threadThread4of5ForFork0_#t~nondet4=|v_threadThread4of5ForFork0_#t~nondet4_9|, #race~data~0=|v_#race~data~0_73|}  AuxVars[]  AssignedVars[threadThread4of5ForFork0_#t~nondet4][77], [72#threadEXITtrue, 132#L1029-12true, 114#L1017-6true, 29#L1018true, threadThread1of5ForFork0InUse, threadThread2of5ForFork0InUse, 186#true, 266#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 177#true, 25#L1017-4true, Black: 182#(= |#race~data~0| 0), 76#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 188#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|)])
[2023-11-03 13:14:34,663 INFO  L383   tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event
[2023-11-03 13:14:34,663 INFO  L386   tUnfolder$Statistics]:   existing Event has 43 ancestors and is cut-off event
[2023-11-03 13:14:34,663 INFO  L386   tUnfolder$Statistics]:   existing Event has 43 ancestors and is cut-off event
[2023-11-03 13:14:34,663 INFO  L386   tUnfolder$Statistics]:   existing Event has 43 ancestors and is cut-off event
[2023-11-03 13:14:34,663 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1365] L1017-4-->L1017-6: Formula: (= |v_threadThread4of5ForFork0_#t~nondet5_13| |v_#race~data~0_73|)  InVars {threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_13|, #race~data~0=|v_#race~data~0_73|}  OutVars{threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_13|, threadThread4of5ForFork0_#t~nondet4=|v_threadThread4of5ForFork0_#t~nondet4_9|, #race~data~0=|v_#race~data~0_73|}  AuxVars[]  AssignedVars[threadThread4of5ForFork0_#t~nondet4][77], [114#L1017-6true, threadThread1of5ForFork0InUse, threadThread2of5ForFork0InUse, 186#true, 266#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0NotInUse, 177#true, 25#L1017-4true, 101#L1017-4true, Black: 182#(= |#race~data~0| 0), 76#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 144#L1029-13true, Black: 188#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|)])
[2023-11-03 13:14:34,663 INFO  L383   tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event
[2023-11-03 13:14:34,663 INFO  L386   tUnfolder$Statistics]:   existing Event has 43 ancestors and is cut-off event
[2023-11-03 13:14:34,663 INFO  L386   tUnfolder$Statistics]:   existing Event has 43 ancestors and is cut-off event
[2023-11-03 13:14:34,663 INFO  L386   tUnfolder$Statistics]:   existing Event has 43 ancestors and is cut-off event
[2023-11-03 13:14:34,889 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1365] L1017-4-->L1017-6: Formula: (= |v_threadThread4of5ForFork0_#t~nondet5_13| |v_#race~data~0_73|)  InVars {threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_13|, #race~data~0=|v_#race~data~0_73|}  OutVars{threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_13|, threadThread4of5ForFork0_#t~nondet4=|v_threadThread4of5ForFork0_#t~nondet4_9|, #race~data~0=|v_#race~data~0_73|}  AuxVars[]  AssignedVars[threadThread4of5ForFork0_#t~nondet4][77], [72#threadEXITtrue, 114#L1017-6true, threadThread1of5ForFork0InUse, threadThread2of5ForFork0InUse, 186#true, 266#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 177#true, 25#L1017-4true, Black: 182#(= |#race~data~0| 0), 76#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 93#L1028-3true, 127#threadEXITtrue, Black: 188#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|)])
[2023-11-03 13:14:34,890 INFO  L383   tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event
[2023-11-03 13:14:34,890 INFO  L386   tUnfolder$Statistics]:   existing Event has 43 ancestors and is cut-off event
[2023-11-03 13:14:34,890 INFO  L386   tUnfolder$Statistics]:   existing Event has 43 ancestors and is cut-off event
[2023-11-03 13:14:34,890 INFO  L386   tUnfolder$Statistics]:   existing Event has 43 ancestors and is cut-off event
[2023-11-03 13:14:36,717 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1471] L1028-3-->L1032-1: Formula: (and (= |v_#race~data~0_91| 0) (= (store |v_#valid_313| (select (select |v_#memory_$Pointer$.base_234| |v_ULTIMATE.start_main_~#tids~0#1.base_525|) |v_ULTIMATE.start_main_~#tids~0#1.offset_497|) 0) |v_#valid_312|) (not (< |v_ULTIMATE.start_main_~i~1#1_299| |v_ULTIMATE.start_main_~threads_total~0#1_301|)) (= (store |v_#race_896| |v_ULTIMATE.start_main_~#tids~0#1.base_525| (store (store (store (store (select |v_#race_896| |v_ULTIMATE.start_main_~#tids~0#1.base_525|) |v_ULTIMATE.start_main_~#tids~0#1.offset_497| 0) (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_497| 1) 0) (+ 2 |v_ULTIMATE.start_main_~#tids~0#1.offset_497|) 0) (+ 3 |v_ULTIMATE.start_main_~#tids~0#1.offset_497|) 0)) |v_#race_895|))  InVars {#race=|v_#race_896|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_497|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_299|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_234|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_525|, #valid=|v_#valid_313|, ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_301|}  OutVars{#race=|v_#race_895|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_497|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_299|, ULTIMATE.start_main_#t~mem14#1.base=|v_ULTIMATE.start_main_#t~mem14#1.base_174|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_234|, #race~data~0=|v_#race~data~0_91|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_525|, #valid=|v_#valid_312|, ULTIMATE.start_main_#t~mem14#1.offset=|v_ULTIMATE.start_main_#t~mem14#1.offset_148|, ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_301|}  AuxVars[]  AssignedVars[#race, ULTIMATE.start_main_#t~mem14#1.base, #race~data~0, #valid, ULTIMATE.start_main_#t~mem14#1.offset][58], [threadThread1of5ForFork0InUse, threadThread2of5ForFork0NotInUse, 186#true, threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 177#true, 25#L1017-4true, 106#L1017-1true, 78#L1032-1true, Black: 180#true, 76#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 264#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 188#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|), 23#L1017-4true])
[2023-11-03 13:14:36,717 INFO  L383   tUnfolder$Statistics]: this new event has 43 ancestors and is not cut-off event
[2023-11-03 13:14:36,717 INFO  L386   tUnfolder$Statistics]:   existing Event has 43 ancestors and is not cut-off event
[2023-11-03 13:14:36,717 INFO  L386   tUnfolder$Statistics]:   existing Event has 43 ancestors and is not cut-off event
[2023-11-03 13:14:36,717 INFO  L386   tUnfolder$Statistics]:   existing Event has 43 ancestors and is not cut-off event
[2023-11-03 13:14:36,736 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1398] L1017-2-->L1017-4: Formula: (= |v_threadThread5of5ForFork0_#t~nondet5_15| |v_#race~data~0_83|)  InVars {}  OutVars{threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_83|}  AuxVars[]  AssignedVars[threadThread5of5ForFork0_#t~nondet5, #race~data~0][82], [threadThread1of5ForFork0InUse, threadThread2of5ForFork0NotInUse, 186#true, threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 177#true, 25#L1017-4true, 143#L1017-4true, Black: 182#(= |#race~data~0| 0), 76#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 93#L1028-3true, 264#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 188#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|), 23#L1017-4true])
[2023-11-03 13:14:36,736 INFO  L383   tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event
[2023-11-03 13:14:36,736 INFO  L386   tUnfolder$Statistics]:   existing Event has 44 ancestors and is cut-off event
[2023-11-03 13:14:36,736 INFO  L386   tUnfolder$Statistics]:   existing Event has 44 ancestors and is cut-off event
[2023-11-03 13:14:36,736 INFO  L386   tUnfolder$Statistics]:   existing Event has 44 ancestors and is cut-off event
[2023-11-03 13:14:36,971 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1365] L1017-4-->L1017-6: Formula: (= |v_threadThread4of5ForFork0_#t~nondet5_13| |v_#race~data~0_73|)  InVars {threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_13|, #race~data~0=|v_#race~data~0_73|}  OutVars{threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_13|, threadThread4of5ForFork0_#t~nondet4=|v_threadThread4of5ForFork0_#t~nondet4_9|, #race~data~0=|v_#race~data~0_73|}  AuxVars[]  AssignedVars[threadThread4of5ForFork0_#t~nondet4][77], [72#threadEXITtrue, 132#L1029-12true, 114#L1017-6true, threadThread1of5ForFork0InUse, threadThread2of5ForFork0InUse, 186#true, 266#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 177#true, 25#L1017-4true, Black: 182#(= |#race~data~0| 0), 76#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 127#threadEXITtrue, Black: 188#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|)])
[2023-11-03 13:14:36,971 INFO  L383   tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event
[2023-11-03 13:14:36,971 INFO  L386   tUnfolder$Statistics]:   existing Event has 44 ancestors and is cut-off event
[2023-11-03 13:14:36,971 INFO  L386   tUnfolder$Statistics]:   existing Event has 44 ancestors and is cut-off event
[2023-11-03 13:14:36,971 INFO  L386   tUnfolder$Statistics]:   existing Event has 44 ancestors and is cut-off event
[2023-11-03 13:14:36,972 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1365] L1017-4-->L1017-6: Formula: (= |v_threadThread4of5ForFork0_#t~nondet5_13| |v_#race~data~0_73|)  InVars {threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_13|, #race~data~0=|v_#race~data~0_73|}  OutVars{threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_13|, threadThread4of5ForFork0_#t~nondet4=|v_threadThread4of5ForFork0_#t~nondet4_9|, #race~data~0=|v_#race~data~0_73|}  AuxVars[]  AssignedVars[threadThread4of5ForFork0_#t~nondet4][77], [114#L1017-6true, 29#L1018true, threadThread1of5ForFork0InUse, threadThread2of5ForFork0InUse, 186#true, 266#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0NotInUse, 177#true, 25#L1017-4true, Black: 182#(= |#race~data~0| 0), 76#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 144#L1029-13true, Black: 188#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|)])
[2023-11-03 13:14:36,972 INFO  L383   tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event
[2023-11-03 13:14:36,972 INFO  L386   tUnfolder$Statistics]:   existing Event has 44 ancestors and is cut-off event
[2023-11-03 13:14:36,972 INFO  L386   tUnfolder$Statistics]:   existing Event has 44 ancestors and is cut-off event
[2023-11-03 13:14:36,972 INFO  L386   tUnfolder$Statistics]:   existing Event has 44 ancestors and is cut-off event
[2023-11-03 13:14:38,791 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1398] L1017-2-->L1017-4: Formula: (= |v_threadThread5of5ForFork0_#t~nondet5_15| |v_#race~data~0_83|)  InVars {}  OutVars{threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_83|}  AuxVars[]  AssignedVars[threadThread5of5ForFork0_#t~nondet5, #race~data~0][128], [132#L1029-12true, threadThread1of5ForFork0InUse, threadThread2of5ForFork0NotInUse, 186#true, threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 177#true, 25#L1017-4true, 268#(and (< |ULTIMATE.start_main_~i~1#1| |ULTIMATE.start_main_~threads_total~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), 143#L1017-4true, Black: 182#(= |#race~data~0| 0), 76#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 23#L1017-4true, Black: 188#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|)])
[2023-11-03 13:14:38,791 INFO  L383   tUnfolder$Statistics]: this new event has 45 ancestors and is cut-off event
[2023-11-03 13:14:38,792 INFO  L386   tUnfolder$Statistics]:   existing Event has 45 ancestors and is cut-off event
[2023-11-03 13:14:38,792 INFO  L386   tUnfolder$Statistics]:   existing Event has 45 ancestors and is cut-off event
[2023-11-03 13:14:38,792 INFO  L386   tUnfolder$Statistics]:   existing Event has 45 ancestors and is cut-off event
[2023-11-03 13:14:39,016 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1365] L1017-4-->L1017-6: Formula: (= |v_threadThread4of5ForFork0_#t~nondet5_13| |v_#race~data~0_73|)  InVars {threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_13|, #race~data~0=|v_#race~data~0_73|}  OutVars{threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_13|, threadThread4of5ForFork0_#t~nondet4=|v_threadThread4of5ForFork0_#t~nondet4_9|, #race~data~0=|v_#race~data~0_73|}  AuxVars[]  AssignedVars[threadThread4of5ForFork0_#t~nondet4][77], [72#threadEXITtrue, 114#L1017-6true, threadThread1of5ForFork0InUse, threadThread2of5ForFork0NotInUse, 186#true, 266#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 177#true, 25#L1017-4true, Black: 182#(= |#race~data~0| 0), 76#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 144#L1029-13true, Black: 188#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|)])
[2023-11-03 13:14:39,016 INFO  L383   tUnfolder$Statistics]: this new event has 45 ancestors and is cut-off event
[2023-11-03 13:14:39,016 INFO  L386   tUnfolder$Statistics]:   existing Event has 45 ancestors and is cut-off event
[2023-11-03 13:14:39,016 INFO  L386   tUnfolder$Statistics]:   existing Event has 45 ancestors and is cut-off event
[2023-11-03 13:14:39,016 INFO  L386   tUnfolder$Statistics]:   existing Event has 45 ancestors and is cut-off event
[2023-11-03 13:14:39,016 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1365] L1017-4-->L1017-6: Formula: (= |v_threadThread4of5ForFork0_#t~nondet5_13| |v_#race~data~0_73|)  InVars {threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_13|, #race~data~0=|v_#race~data~0_73|}  OutVars{threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_13|, threadThread4of5ForFork0_#t~nondet4=|v_threadThread4of5ForFork0_#t~nondet4_9|, #race~data~0=|v_#race~data~0_73|}  AuxVars[]  AssignedVars[threadThread4of5ForFork0_#t~nondet4][77], [114#L1017-6true, threadThread1of5ForFork0InUse, threadThread2of5ForFork0InUse, 186#true, 266#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0NotInUse, 177#true, 25#L1017-4true, Black: 182#(= |#race~data~0| 0), 76#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 127#threadEXITtrue, 144#L1029-13true, Black: 188#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|)])
[2023-11-03 13:14:39,017 INFO  L383   tUnfolder$Statistics]: this new event has 45 ancestors and is cut-off event
[2023-11-03 13:14:39,017 INFO  L386   tUnfolder$Statistics]:   existing Event has 45 ancestors and is cut-off event
[2023-11-03 13:14:39,017 INFO  L386   tUnfolder$Statistics]:   existing Event has 45 ancestors and is cut-off event
[2023-11-03 13:14:39,017 INFO  L386   tUnfolder$Statistics]:   existing Event has 45 ancestors and is cut-off event
[2023-11-03 13:14:39,766 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1398] L1017-2-->L1017-4: Formula: (= |v_threadThread5of5ForFork0_#t~nondet5_15| |v_#race~data~0_83|)  InVars {}  OutVars{threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_83|}  AuxVars[]  AssignedVars[threadThread5of5ForFork0_#t~nondet5, #race~data~0][82], [threadThread1of5ForFork0InUse, 3#ULTIMATE.startEXITtrue, threadThread2of5ForFork0InUse, 186#true, threadThread3of5ForFork0NotInUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 177#true, 101#L1017-4true, 143#L1017-4true, Black: 182#(= |#race~data~0| 0), 76#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 264#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 188#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|), 23#L1017-4true])
[2023-11-03 13:14:39,766 INFO  L383   tUnfolder$Statistics]: this new event has 47 ancestors and is cut-off event
[2023-11-03 13:14:39,766 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is cut-off event
[2023-11-03 13:14:39,766 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is cut-off event
[2023-11-03 13:14:39,766 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is cut-off event
[2023-11-03 13:14:40,864 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1365] L1017-4-->L1017-6: Formula: (= |v_threadThread4of5ForFork0_#t~nondet5_13| |v_#race~data~0_73|)  InVars {threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_13|, #race~data~0=|v_#race~data~0_73|}  OutVars{threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_13|, threadThread4of5ForFork0_#t~nondet4=|v_threadThread4of5ForFork0_#t~nondet4_9|, #race~data~0=|v_#race~data~0_73|}  AuxVars[]  AssignedVars[threadThread4of5ForFork0_#t~nondet4][72], [114#L1017-6true, 29#L1018true, threadThread1of5ForFork0InUse, threadThread2of5ForFork0InUse, 186#true, threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0NotInUse, 177#true, 25#L1017-4true, Black: 182#(= |#race~data~0| 0), 76#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 93#L1028-3true, 264#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 188#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|)])
[2023-11-03 13:14:40,865 INFO  L383   tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event
[2023-11-03 13:14:40,865 INFO  L386   tUnfolder$Statistics]:   existing Event has 46 ancestors and is cut-off event
[2023-11-03 13:14:40,865 INFO  L386   tUnfolder$Statistics]:   existing Event has 46 ancestors and is cut-off event
[2023-11-03 13:14:40,865 INFO  L386   tUnfolder$Statistics]:   existing Event has 46 ancestors and is cut-off event
[2023-11-03 13:14:40,884 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1365] L1017-4-->L1017-6: Formula: (= |v_threadThread4of5ForFork0_#t~nondet5_13| |v_#race~data~0_73|)  InVars {threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_13|, #race~data~0=|v_#race~data~0_73|}  OutVars{threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_13|, threadThread4of5ForFork0_#t~nondet4=|v_threadThread4of5ForFork0_#t~nondet4_9|, #race~data~0=|v_#race~data~0_73|}  AuxVars[]  AssignedVars[threadThread4of5ForFork0_#t~nondet4][123], [114#L1017-6true, 132#L1029-12true, threadThread1of5ForFork0InUse, threadThread2of5ForFork0InUse, 186#true, threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0NotInUse, 177#true, 25#L1017-4true, 101#L1017-4true, 268#(and (< |ULTIMATE.start_main_~i~1#1| |ULTIMATE.start_main_~threads_total~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 182#(= |#race~data~0| 0), 76#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 188#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|)])
[2023-11-03 13:14:40,884 INFO  L383   tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event
[2023-11-03 13:14:40,884 INFO  L386   tUnfolder$Statistics]:   existing Event has 46 ancestors and is cut-off event
[2023-11-03 13:14:40,884 INFO  L386   tUnfolder$Statistics]:   existing Event has 46 ancestors and is cut-off event
[2023-11-03 13:14:40,884 INFO  L386   tUnfolder$Statistics]:   existing Event has 46 ancestors and is cut-off event
[2023-11-03 13:14:41,505 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1398] L1017-2-->L1017-4: Formula: (= |v_threadThread5of5ForFork0_#t~nondet5_15| |v_#race~data~0_83|)  InVars {}  OutVars{threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_83|}  AuxVars[]  AssignedVars[threadThread5of5ForFork0_#t~nondet5, #race~data~0][82], [29#L1018true, threadThread1of5ForFork0InUse, 3#ULTIMATE.startEXITtrue, threadThread2of5ForFork0InUse, 186#true, threadThread3of5ForFork0NotInUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 177#true, 143#L1017-4true, Black: 182#(= |#race~data~0| 0), 76#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 264#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), 23#L1017-4true, Black: 188#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|)])
[2023-11-03 13:14:41,505 INFO  L383   tUnfolder$Statistics]: this new event has 48 ancestors and is cut-off event
[2023-11-03 13:14:41,505 INFO  L386   tUnfolder$Statistics]:   existing Event has 48 ancestors and is cut-off event
[2023-11-03 13:14:41,505 INFO  L386   tUnfolder$Statistics]:   existing Event has 48 ancestors and is cut-off event
[2023-11-03 13:14:41,505 INFO  L386   tUnfolder$Statistics]:   existing Event has 48 ancestors and is cut-off event
[2023-11-03 13:14:42,232 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1471] L1028-3-->L1032-1: Formula: (and (= |v_#race~data~0_91| 0) (= (store |v_#valid_313| (select (select |v_#memory_$Pointer$.base_234| |v_ULTIMATE.start_main_~#tids~0#1.base_525|) |v_ULTIMATE.start_main_~#tids~0#1.offset_497|) 0) |v_#valid_312|) (not (< |v_ULTIMATE.start_main_~i~1#1_299| |v_ULTIMATE.start_main_~threads_total~0#1_301|)) (= (store |v_#race_896| |v_ULTIMATE.start_main_~#tids~0#1.base_525| (store (store (store (store (select |v_#race_896| |v_ULTIMATE.start_main_~#tids~0#1.base_525|) |v_ULTIMATE.start_main_~#tids~0#1.offset_497| 0) (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_497| 1) 0) (+ 2 |v_ULTIMATE.start_main_~#tids~0#1.offset_497|) 0) (+ 3 |v_ULTIMATE.start_main_~#tids~0#1.offset_497|) 0)) |v_#race_895|))  InVars {#race=|v_#race_896|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_497|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_299|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_234|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_525|, #valid=|v_#valid_313|, ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_301|}  OutVars{#race=|v_#race_895|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_497|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_299|, ULTIMATE.start_main_#t~mem14#1.base=|v_ULTIMATE.start_main_#t~mem14#1.base_174|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_234|, #race~data~0=|v_#race~data~0_91|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_525|, #valid=|v_#valid_312|, ULTIMATE.start_main_#t~mem14#1.offset=|v_ULTIMATE.start_main_#t~mem14#1.offset_148|, ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_301|}  AuxVars[]  AssignedVars[#race, ULTIMATE.start_main_#t~mem14#1.base, #race~data~0, #valid, ULTIMATE.start_main_#t~mem14#1.offset][58], [29#L1018true, threadThread1of5ForFork0InUse, threadThread2of5ForFork0InUse, 186#true, threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0NotInUse, 177#true, 25#L1017-4true, 78#L1032-1true, 76#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 180#true, 264#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), 23#L1017-4true, Black: 188#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|)])
[2023-11-03 13:14:42,232 INFO  L383   tUnfolder$Statistics]: this new event has 46 ancestors and is not cut-off event
[2023-11-03 13:14:42,232 INFO  L386   tUnfolder$Statistics]:   existing Event has 46 ancestors and is not cut-off event
[2023-11-03 13:14:42,232 INFO  L386   tUnfolder$Statistics]:   existing Event has 46 ancestors and is not cut-off event
[2023-11-03 13:14:42,232 INFO  L386   tUnfolder$Statistics]:   existing Event has 46 ancestors and is not cut-off event
[2023-11-03 13:14:42,321 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1365] L1017-4-->L1017-6: Formula: (= |v_threadThread4of5ForFork0_#t~nondet5_13| |v_#race~data~0_73|)  InVars {threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_13|, #race~data~0=|v_#race~data~0_73|}  OutVars{threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_13|, threadThread4of5ForFork0_#t~nondet4=|v_threadThread4of5ForFork0_#t~nondet4_9|, #race~data~0=|v_#race~data~0_73|}  AuxVars[]  AssignedVars[threadThread4of5ForFork0_#t~nondet4][72], [114#L1017-6true, threadThread1of5ForFork0InUse, threadThread2of5ForFork0InUse, 186#true, threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0NotInUse, 177#true, 25#L1017-4true, Black: 182#(= |#race~data~0| 0), 76#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 93#L1028-3true, 127#threadEXITtrue, 264#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 188#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|)])
[2023-11-03 13:14:42,321 INFO  L383   tUnfolder$Statistics]: this new event has 47 ancestors and is cut-off event
[2023-11-03 13:14:42,321 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is cut-off event
[2023-11-03 13:14:42,321 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is cut-off event
[2023-11-03 13:14:42,321 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is cut-off event
[2023-11-03 13:14:42,322 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1471] L1028-3-->L1032-1: Formula: (and (= |v_#race~data~0_91| 0) (= (store |v_#valid_313| (select (select |v_#memory_$Pointer$.base_234| |v_ULTIMATE.start_main_~#tids~0#1.base_525|) |v_ULTIMATE.start_main_~#tids~0#1.offset_497|) 0) |v_#valid_312|) (not (< |v_ULTIMATE.start_main_~i~1#1_299| |v_ULTIMATE.start_main_~threads_total~0#1_301|)) (= (store |v_#race_896| |v_ULTIMATE.start_main_~#tids~0#1.base_525| (store (store (store (store (select |v_#race_896| |v_ULTIMATE.start_main_~#tids~0#1.base_525|) |v_ULTIMATE.start_main_~#tids~0#1.offset_497| 0) (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_497| 1) 0) (+ 2 |v_ULTIMATE.start_main_~#tids~0#1.offset_497|) 0) (+ 3 |v_ULTIMATE.start_main_~#tids~0#1.offset_497|) 0)) |v_#race_895|))  InVars {#race=|v_#race_896|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_497|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_299|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_234|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_525|, #valid=|v_#valid_313|, ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_301|}  OutVars{#race=|v_#race_895|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_497|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_299|, ULTIMATE.start_main_#t~mem14#1.base=|v_ULTIMATE.start_main_#t~mem14#1.base_174|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_234|, #race~data~0=|v_#race~data~0_91|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_525|, #valid=|v_#valid_312|, ULTIMATE.start_main_#t~mem14#1.offset=|v_ULTIMATE.start_main_#t~mem14#1.offset_148|, ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_301|}  AuxVars[]  AssignedVars[#race, ULTIMATE.start_main_#t~mem14#1.base, #race~data~0, #valid, ULTIMATE.start_main_#t~mem14#1.offset][58], [72#threadEXITtrue, threadThread1of5ForFork0InUse, threadThread2of5ForFork0NotInUse, 186#true, threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 177#true, 25#L1017-4true, 78#L1032-1true, Black: 180#true, 76#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 264#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 188#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|), 23#L1017-4true])
[2023-11-03 13:14:42,322 INFO  L383   tUnfolder$Statistics]: this new event has 47 ancestors and is cut-off event
[2023-11-03 13:14:42,322 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is cut-off event
[2023-11-03 13:14:42,322 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is cut-off event
[2023-11-03 13:14:42,322 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is cut-off event
[2023-11-03 13:14:42,322 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1365] L1017-4-->L1017-6: Formula: (= |v_threadThread4of5ForFork0_#t~nondet5_13| |v_#race~data~0_73|)  InVars {threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_13|, #race~data~0=|v_#race~data~0_73|}  OutVars{threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_13|, threadThread4of5ForFork0_#t~nondet4=|v_threadThread4of5ForFork0_#t~nondet4_9|, #race~data~0=|v_#race~data~0_73|}  AuxVars[]  AssignedVars[threadThread4of5ForFork0_#t~nondet4][72], [72#threadEXITtrue, 114#L1017-6true, threadThread1of5ForFork0InUse, threadThread2of5ForFork0NotInUse, 186#true, threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 177#true, 25#L1017-4true, Black: 182#(= |#race~data~0| 0), 76#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 93#L1028-3true, 264#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 188#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|)])
[2023-11-03 13:14:42,322 INFO  L383   tUnfolder$Statistics]: this new event has 47 ancestors and is cut-off event
[2023-11-03 13:14:42,323 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is cut-off event
[2023-11-03 13:14:42,323 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is cut-off event
[2023-11-03 13:14:42,323 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is cut-off event
[2023-11-03 13:14:42,323 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1365] L1017-4-->L1017-6: Formula: (= |v_threadThread4of5ForFork0_#t~nondet5_13| |v_#race~data~0_73|)  InVars {threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_13|, #race~data~0=|v_#race~data~0_73|}  OutVars{threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_13|, threadThread4of5ForFork0_#t~nondet4=|v_threadThread4of5ForFork0_#t~nondet4_9|, #race~data~0=|v_#race~data~0_73|}  AuxVars[]  AssignedVars[threadThread4of5ForFork0_#t~nondet4][123], [114#L1017-6true, 132#L1029-12true, 29#L1018true, threadThread1of5ForFork0InUse, threadThread2of5ForFork0InUse, 186#true, threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0NotInUse, 177#true, 25#L1017-4true, 268#(and (< |ULTIMATE.start_main_~i~1#1| |ULTIMATE.start_main_~threads_total~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 182#(= |#race~data~0| 0), 76#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 188#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|)])
[2023-11-03 13:14:42,323 INFO  L383   tUnfolder$Statistics]: this new event has 47 ancestors and is cut-off event
[2023-11-03 13:14:42,323 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is cut-off event
[2023-11-03 13:14:42,323 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is cut-off event
[2023-11-03 13:14:42,323 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is cut-off event
[2023-11-03 13:14:42,827 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1398] L1017-2-->L1017-4: Formula: (= |v_threadThread5of5ForFork0_#t~nondet5_15| |v_#race~data~0_83|)  InVars {}  OutVars{threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_83|}  AuxVars[]  AssignedVars[threadThread5of5ForFork0_#t~nondet5, #race~data~0][82], [threadThread1of5ForFork0InUse, 3#ULTIMATE.startEXITtrue, threadThread2of5ForFork0InUse, 186#true, threadThread3of5ForFork0NotInUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 177#true, 143#L1017-4true, Black: 182#(= |#race~data~0| 0), 76#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 127#threadEXITtrue, 264#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), 23#L1017-4true, Black: 188#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|)])
[2023-11-03 13:14:42,828 INFO  L383   tUnfolder$Statistics]: this new event has 49 ancestors and is cut-off event
[2023-11-03 13:14:42,828 INFO  L386   tUnfolder$Statistics]:   existing Event has 49 ancestors and is cut-off event
[2023-11-03 13:14:42,828 INFO  L386   tUnfolder$Statistics]:   existing Event has 49 ancestors and is cut-off event
[2023-11-03 13:14:42,828 INFO  L386   tUnfolder$Statistics]:   existing Event has 49 ancestors and is cut-off event
[2023-11-03 13:14:43,269 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1398] L1017-2-->L1017-4: Formula: (= |v_threadThread5of5ForFork0_#t~nondet5_15| |v_#race~data~0_83|)  InVars {}  OutVars{threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_83|}  AuxVars[]  AssignedVars[threadThread5of5ForFork0_#t~nondet5, #race~data~0][82], [114#L1017-6true, threadThread1of5ForFork0InUse, threadThread2of5ForFork0NotInUse, 41#ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACEtrue, 186#true, threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 177#true, 25#L1017-4true, 143#L1017-4true, Black: 182#(= |#race~data~0| 0), 64#threadEXITtrue, 264#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 188#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|)])
[2023-11-03 13:14:43,269 INFO  L383   tUnfolder$Statistics]: this new event has 48 ancestors and is cut-off event
[2023-11-03 13:14:43,269 INFO  L386   tUnfolder$Statistics]:   existing Event has 48 ancestors and is cut-off event
[2023-11-03 13:14:43,269 INFO  L386   tUnfolder$Statistics]:   existing Event has 48 ancestors and is cut-off event
[2023-11-03 13:14:43,269 INFO  L386   tUnfolder$Statistics]:   existing Event has 48 ancestors and is cut-off event
[2023-11-03 13:14:43,647 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1471] L1028-3-->L1032-1: Formula: (and (= |v_#race~data~0_91| 0) (= (store |v_#valid_313| (select (select |v_#memory_$Pointer$.base_234| |v_ULTIMATE.start_main_~#tids~0#1.base_525|) |v_ULTIMATE.start_main_~#tids~0#1.offset_497|) 0) |v_#valid_312|) (not (< |v_ULTIMATE.start_main_~i~1#1_299| |v_ULTIMATE.start_main_~threads_total~0#1_301|)) (= (store |v_#race_896| |v_ULTIMATE.start_main_~#tids~0#1.base_525| (store (store (store (store (select |v_#race_896| |v_ULTIMATE.start_main_~#tids~0#1.base_525|) |v_ULTIMATE.start_main_~#tids~0#1.offset_497| 0) (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_497| 1) 0) (+ 2 |v_ULTIMATE.start_main_~#tids~0#1.offset_497|) 0) (+ 3 |v_ULTIMATE.start_main_~#tids~0#1.offset_497|) 0)) |v_#race_895|))  InVars {#race=|v_#race_896|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_497|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_299|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_234|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_525|, #valid=|v_#valid_313|, ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_301|}  OutVars{#race=|v_#race_895|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_497|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_299|, ULTIMATE.start_main_#t~mem14#1.base=|v_ULTIMATE.start_main_#t~mem14#1.base_174|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_234|, #race~data~0=|v_#race~data~0_91|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_525|, #valid=|v_#valid_312|, ULTIMATE.start_main_#t~mem14#1.offset=|v_ULTIMATE.start_main_#t~mem14#1.offset_148|, ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_301|}  AuxVars[]  AssignedVars[#race, ULTIMATE.start_main_#t~mem14#1.base, #race~data~0, #valid, ULTIMATE.start_main_#t~mem14#1.offset][58], [threadThread1of5ForFork0InUse, threadThread2of5ForFork0InUse, 186#true, threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0NotInUse, 177#true, 25#L1017-4true, 78#L1032-1true, 76#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 180#true, 127#threadEXITtrue, 264#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), 23#L1017-4true, Black: 188#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|)])
[2023-11-03 13:14:43,647 INFO  L383   tUnfolder$Statistics]: this new event has 47 ancestors and is not cut-off event
[2023-11-03 13:14:43,647 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is not cut-off event
[2023-11-03 13:14:43,647 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is not cut-off event
[2023-11-03 13:14:43,647 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is not cut-off event
[2023-11-03 13:14:43,826 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1365] L1017-4-->L1017-6: Formula: (= |v_threadThread4of5ForFork0_#t~nondet5_13| |v_#race~data~0_73|)  InVars {threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_13|, #race~data~0=|v_#race~data~0_73|}  OutVars{threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_13|, threadThread4of5ForFork0_#t~nondet4=|v_threadThread4of5ForFork0_#t~nondet4_9|, #race~data~0=|v_#race~data~0_73|}  AuxVars[]  AssignedVars[threadThread4of5ForFork0_#t~nondet4][123], [132#L1029-12true, 114#L1017-6true, threadThread1of5ForFork0InUse, threadThread2of5ForFork0InUse, 186#true, threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0NotInUse, 177#true, 25#L1017-4true, 268#(and (< |ULTIMATE.start_main_~i~1#1| |ULTIMATE.start_main_~threads_total~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 182#(= |#race~data~0| 0), 76#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 127#threadEXITtrue, Black: 188#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|)])
[2023-11-03 13:14:43,826 INFO  L383   tUnfolder$Statistics]: this new event has 48 ancestors and is cut-off event
[2023-11-03 13:14:43,826 INFO  L386   tUnfolder$Statistics]:   existing Event has 48 ancestors and is cut-off event
[2023-11-03 13:14:43,826 INFO  L386   tUnfolder$Statistics]:   existing Event has 48 ancestors and is cut-off event
[2023-11-03 13:14:43,827 INFO  L386   tUnfolder$Statistics]:   existing Event has 48 ancestors and is cut-off event
[2023-11-03 13:14:43,827 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1365] L1017-4-->L1017-6: Formula: (= |v_threadThread4of5ForFork0_#t~nondet5_13| |v_#race~data~0_73|)  InVars {threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_13|, #race~data~0=|v_#race~data~0_73|}  OutVars{threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_13|, threadThread4of5ForFork0_#t~nondet4=|v_threadThread4of5ForFork0_#t~nondet4_9|, #race~data~0=|v_#race~data~0_73|}  AuxVars[]  AssignedVars[threadThread4of5ForFork0_#t~nondet4][123], [72#threadEXITtrue, 132#L1029-12true, 114#L1017-6true, threadThread1of5ForFork0InUse, threadThread2of5ForFork0NotInUse, 186#true, threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 177#true, 25#L1017-4true, 268#(and (< |ULTIMATE.start_main_~i~1#1| |ULTIMATE.start_main_~threads_total~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 182#(= |#race~data~0| 0), 76#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 188#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|)])
[2023-11-03 13:14:43,827 INFO  L383   tUnfolder$Statistics]: this new event has 48 ancestors and is cut-off event
[2023-11-03 13:14:43,827 INFO  L386   tUnfolder$Statistics]:   existing Event has 48 ancestors and is cut-off event
[2023-11-03 13:14:43,827 INFO  L386   tUnfolder$Statistics]:   existing Event has 48 ancestors and is cut-off event
[2023-11-03 13:14:43,827 INFO  L386   tUnfolder$Statistics]:   existing Event has 48 ancestors and is cut-off event
[2023-11-03 13:14:44,480 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1398] L1017-2-->L1017-4: Formula: (= |v_threadThread5of5ForFork0_#t~nondet5_15| |v_#race~data~0_83|)  InVars {}  OutVars{threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_83|}  AuxVars[]  AssignedVars[threadThread5of5ForFork0_#t~nondet5, #race~data~0][82], [threadThread1of5ForFork0InUse, threadThread2of5ForFork0NotInUse, 41#ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACEtrue, 186#true, threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 177#true, 25#L1017-4true, 143#L1017-4true, Black: 182#(= |#race~data~0| 0), 98#threadEXITtrue, 64#threadEXITtrue, 264#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 188#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|)])
[2023-11-03 13:14:44,480 INFO  L383   tUnfolder$Statistics]: this new event has 49 ancestors and is cut-off event
[2023-11-03 13:14:44,480 INFO  L386   tUnfolder$Statistics]:   existing Event has 49 ancestors and is cut-off event
[2023-11-03 13:14:44,480 INFO  L386   tUnfolder$Statistics]:   existing Event has 49 ancestors and is cut-off event
[2023-11-03 13:14:44,480 INFO  L386   tUnfolder$Statistics]:   existing Event has 49 ancestors and is cut-off event
[2023-11-03 13:14:44,829 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1365] L1017-4-->L1017-6: Formula: (= |v_threadThread4of5ForFork0_#t~nondet5_13| |v_#race~data~0_73|)  InVars {threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_13|, #race~data~0=|v_#race~data~0_73|}  OutVars{threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_13|, threadThread4of5ForFork0_#t~nondet4=|v_threadThread4of5ForFork0_#t~nondet4_9|, #race~data~0=|v_#race~data~0_73|}  AuxVars[]  AssignedVars[threadThread4of5ForFork0_#t~nondet4][123], [114#L1017-6true, threadThread1of5ForFork0InUse, threadThread2of5ForFork0NotInUse, 186#true, threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0NotInUse, 177#true, 25#L1017-4true, 268#(and (< |ULTIMATE.start_main_~i~1#1| |ULTIMATE.start_main_~threads_total~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 182#(= |#race~data~0| 0), 76#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 144#L1029-13true, Black: 188#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|)])
[2023-11-03 13:14:44,829 INFO  L383   tUnfolder$Statistics]: this new event has 49 ancestors and is cut-off event
[2023-11-03 13:14:44,829 INFO  L386   tUnfolder$Statistics]:   existing Event has 49 ancestors and is cut-off event
[2023-11-03 13:14:44,829 INFO  L386   tUnfolder$Statistics]:   existing Event has 49 ancestors and is cut-off event
[2023-11-03 13:14:44,829 INFO  L386   tUnfolder$Statistics]:   existing Event has 49 ancestors and is cut-off event
[2023-11-03 13:14:47,314 INFO  L130       PetriNetUnfolder]: 398441/561241 cut-off events.
[2023-11-03 13:14:47,314 INFO  L131       PetriNetUnfolder]: For 471561/511562 co-relation queries the response was YES.
[2023-11-03 13:14:48,669 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1407325 conditions, 561241 events. 398441/561241 cut-off events. For 471561/511562 co-relation queries the response was YES. Maximal size of possible extension queue 13653. Compared 4699116 event pairs, 193328 based on Foata normal form. 11029/534592 useless extension candidates. Maximal degree in co-relation 1407314. Up to 331432 conditions per place. 
[2023-11-03 13:14:51,141 INFO  L137   encePairwiseOnDemand]: 294/301 looper letters, 105 selfloop transitions, 7 changer transitions 4/137 dead transitions.
[2023-11-03 13:14:51,141 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 137 transitions, 795 flow
[2023-11-03 13:14:51,142 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2023-11-03 13:14:51,143 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2023-11-03 13:14:51,144 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1283 transitions.
[2023-11-03 13:14:51,144 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5328073089700996
[2023-11-03 13:14:51,145 INFO  L72            ComplementDD]: Start complementDD. Operand 8 states and 1283 transitions.
[2023-11-03 13:14:51,145 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 8 states and 1283 transitions.
[2023-11-03 13:14:51,145 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:14:51,145 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1283 transitions.
[2023-11-03 13:14:51,147 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 9 states, 8 states have (on average 160.375) internal successors, (1283), 8 states have internal predecessors, (1283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:14:51,149 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 9 states, 9 states have (on average 301.0) internal successors, (2709), 9 states have internal predecessors, (2709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:14:51,149 INFO  L81            ComplementDD]: Finished complementDD. Result  has 9 states, 9 states have (on average 301.0) internal successors, (2709), 9 states have internal predecessors, (2709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:14:51,149 INFO  L175             Difference]: Start difference. First operand has 66 places, 70 transitions, 322 flow. Second operand 8 states and 1283 transitions.
[2023-11-03 13:14:51,149 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 137 transitions, 795 flow
[2023-11-03 13:15:31,118 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 137 transitions, 745 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-03 13:15:31,119 INFO  L231             Difference]: Finished difference. Result has 75 places, 74 transitions, 341 flow
[2023-11-03 13:15:31,119 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=341, PETRI_PLACES=75, PETRI_TRANSITIONS=74}
[2023-11-03 13:15:31,120 INFO  L288   CegarLoopForPetriNet]: 63 programPoint places, 12 predicate places.
[2023-11-03 13:15:31,120 INFO  L495      AbstractCegarLoop]: Abstraction has has 75 places, 74 transitions, 341 flow
[2023-11-03 13:15:31,120 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 149.77777777777777) internal successors, (1348), 9 states have internal predecessors, (1348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:15:31,120 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:15:31,120 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:15:31,128 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-11-03 13:15:31,321 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,5 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 13:15:31,321 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 9 more)] ===
[2023-11-03 13:15:31,322 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:15:31,322 INFO  L85        PathProgramCache]: Analyzing trace with hash 107845692, now seen corresponding path program 1 times
[2023-11-03 13:15:31,323 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:15:31,323 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546543766]
[2023-11-03 13:15:31,323 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:15:31,323 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:15:31,341 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:15:31,354 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2023-11-03 13:15:31,354 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:15:31,354 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546543766]
[2023-11-03 13:15:31,354 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546543766] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:15:31,354 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:15:31,354 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-03 13:15:31,354 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663176667]
[2023-11-03 13:15:31,355 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:15:31,355 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 13:15:31,355 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:15:31,355 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 13:15:31,355 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 13:15:31,384 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 148 out of 301
[2023-11-03 13:15:31,384 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 74 transitions, 341 flow. Second operand  has 3 states, 3 states have (on average 151.0) internal successors, (453), 3 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:15:31,384 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:15:31,384 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 301
[2023-11-03 13:15:31,384 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:16:23,747 INFO  L130       PetriNetUnfolder]: 534677/740459 cut-off events.
[2023-11-03 13:16:23,748 INFO  L131       PetriNetUnfolder]: For 589460/602485 co-relation queries the response was YES.
[2023-11-03 13:16:26,075 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1955479 conditions, 740459 events. 534677/740459 cut-off events. For 589460/602485 co-relation queries the response was YES. Maximal size of possible extension queue 14966. Compared 5982294 event pairs, 385520 based on Foata normal form. 218/704116 useless extension candidates. Maximal degree in co-relation 1955464. Up to 628114 conditions per place. 
[2023-11-03 13:16:29,840 INFO  L137   encePairwiseOnDemand]: 293/301 looper letters, 88 selfloop transitions, 21 changer transitions 0/121 dead transitions.
[2023-11-03 13:16:29,840 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 121 transitions, 788 flow
[2023-11-03 13:16:29,841 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 13:16:29,841 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 13:16:29,842 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 520 transitions.
[2023-11-03 13:16:29,842 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5758582502768549
[2023-11-03 13:16:29,842 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 520 transitions.
[2023-11-03 13:16:29,842 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 520 transitions.
[2023-11-03 13:16:29,843 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:16:29,843 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 520 transitions.
[2023-11-03 13:16:29,843 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:16:29,844 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:16:29,845 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:16:29,845 INFO  L175             Difference]: Start difference. First operand has 75 places, 74 transitions, 341 flow. Second operand 3 states and 520 transitions.
[2023-11-03 13:16:29,845 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 121 transitions, 788 flow
Killed by 15
