./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-01 17:51:09,861 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2023-11-01 17:51:09,863 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2023-11-01 17:51:09,885 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2023-11-01 17:51:09,885 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2023-11-01 17:51:09,886 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2023-11-01 17:51:09,887 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2023-11-01 17:51:09,888 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2023-11-01 17:51:09,889 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2023-11-01 17:51:09,890 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2023-11-01 17:51:09,891 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2023-11-01 17:51:09,891 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2023-11-01 17:51:09,892 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2023-11-01 17:51:09,893 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2023-11-01 17:51:09,893 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2023-11-01 17:51:09,894 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2023-11-01 17:51:09,895 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2023-11-01 17:51:09,896 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2023-11-01 17:51:09,897 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2023-11-01 17:51:09,898 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2023-11-01 17:51:09,899 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2023-11-01 17:51:09,901 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2023-11-01 17:51:09,902 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2023-11-01 17:51:09,902 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2023-11-01 17:51:09,905 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2023-11-01 17:51:09,905 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2023-11-01 17:51:09,905 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2023-11-01 17:51:09,906 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2023-11-01 17:51:09,906 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2023-11-01 17:51:09,907 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2023-11-01 17:51:09,907 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2023-11-01 17:51:09,908 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2023-11-01 17:51:09,908 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2023-11-01 17:51:09,909 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2023-11-01 17:51:09,909 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2023-11-01 17:51:09,910 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2023-11-01 17:51:09,910 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2023-11-01 17:51:09,910 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2023-11-01 17:51:09,910 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2023-11-01 17:51:09,911 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2023-11-01 17:51:09,911 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2023-11-01 17:51:09,913 INFO  L101        SettingsManager]: Beginning loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2023-11-01 17:51:09,929 INFO  L113        SettingsManager]: Loading preferences was successful
[2023-11-01 17:51:09,930 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2023-11-01 17:51:09,930 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-11-01 17:51:09,930 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-11-01 17:51:09,946 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-11-01 17:51:09,947 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-11-01 17:51:09,948 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-11-01 17:51:09,948 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2023-11-01 17:51:09,948 INFO  L138        SettingsManager]:  * Use SBE=true
[2023-11-01 17:51:09,949 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-11-01 17:51:09,949 INFO  L138        SettingsManager]:  * sizeof long=4
[2023-11-01 17:51:09,949 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2023-11-01 17:51:09,950 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2023-11-01 17:51:09,950 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2023-11-01 17:51:09,950 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2023-11-01 17:51:09,950 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2023-11-01 17:51:09,951 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-11-01 17:51:09,951 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2023-11-01 17:51:09,951 INFO  L138        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2023-11-01 17:51:09,952 INFO  L138        SettingsManager]:  * sizeof long double=12
[2023-11-01 17:51:09,952 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2023-11-01 17:51:09,952 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2023-11-01 17:51:09,952 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2023-11-01 17:51:09,953 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-11-01 17:51:09,953 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2023-11-01 17:51:09,953 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2023-11-01 17:51:09,954 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-01 17:51:09,954 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-11-01 17:51:09,955 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2023-11-01 17:51:09,955 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2023-11-01 17:51:09,955 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2023-11-01 17:51:09,955 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-11-01 17:51:09,955 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2023-11-01 17:51:09,955 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-11-01 17:51:09,956 INFO  L138        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2023-11-01 17:51:09,956 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2023-11-01 17:51:09,956 INFO  L138        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2023-11-01 17:51:09,956 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-01 17:51:10,147 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2023-11-01 17:51:10,177 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-11-01 17:51:10,179 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-11-01 17:51:10,180 INFO  L271        PluginConnector]: Initializing CDTParser...
[2023-11-01 17:51:10,180 INFO  L275        PluginConnector]: CDTParser initialized
[2023-11-01 17:51:10,181 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-01 17:51:11,270 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2023-11-01 17:51:11,450 INFO  L351              CDTParser]: Found 1 translation units.
[2023-11-01 17:51:11,451 INFO  L172              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/thread-join-array-dynamic-race-2.i
[2023-11-01 17:51:11,462 INFO  L394              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/f17f0adf0/6749ef37884b478e8caa4d6f78210e52/FLAG4acc6ad3b
[2023-11-01 17:51:11,823 INFO  L402              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/f17f0adf0/6749ef37884b478e8caa4d6f78210e52
[2023-11-01 17:51:11,825 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-11-01 17:51:11,827 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2023-11-01 17:51:11,828 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-11-01 17:51:11,828 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-11-01 17:51:11,831 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2023-11-01 17:51:11,831 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.11 05:51:11" (1/1) ...
[2023-11-01 17:51:11,832 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@444116ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 05:51:11, skipping insertion in model container
[2023-11-01 17:51:11,832 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.11 05:51:11" (1/1) ...
[2023-11-01 17:51:11,838 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2023-11-01 17:51:11,874 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2023-11-01 17:51:11,995 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2023-11-01 17:51:12,135 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-11-01 17:51:12,144 INFO  L203         MainTranslator]: Completed pre-run
[2023-11-01 17:51:12,154 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2023-11-01 17:51:12,180 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-11-01 17:51:12,220 INFO  L208         MainTranslator]: Completed translation
[2023-11-01 17:51:12,221 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 05:51:12 WrapperNode
[2023-11-01 17:51:12,221 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-11-01 17:51:12,222 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-11-01 17:51:12,222 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-11-01 17:51:12,222 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2023-11-01 17:51:12,227 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 05:51:12" (1/1) ...
[2023-11-01 17:51:12,243 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 05:51:12" (1/1) ...
[2023-11-01 17:51:12,262 INFO  L138                Inliner]: procedures = 269, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 82
[2023-11-01 17:51:12,263 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-11-01 17:51:12,263 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-11-01 17:51:12,263 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2023-11-01 17:51:12,264 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2023-11-01 17:51:12,271 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 05:51:12" (1/1) ...
[2023-11-01 17:51:12,272 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 05:51:12" (1/1) ...
[2023-11-01 17:51:12,276 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 05:51:12" (1/1) ...
[2023-11-01 17:51:12,276 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 05:51:12" (1/1) ...
[2023-11-01 17:51:12,282 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 05:51:12" (1/1) ...
[2023-11-01 17:51:12,285 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 05:51:12" (1/1) ...
[2023-11-01 17:51:12,287 INFO  L185        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 05:51:12" (1/1) ...
[2023-11-01 17:51:12,288 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 05:51:12" (1/1) ...
[2023-11-01 17:51:12,291 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-11-01 17:51:12,291 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-11-01 17:51:12,292 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2023-11-01 17:51:12,292 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2023-11-01 17:51:12,293 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 05:51:12" (1/1) ...
[2023-11-01 17:51:12,298 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-01 17:51:12,306 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-01 17:51:12,320 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-01 17:51:12,323 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-01 17:51:12,345 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2023-11-01 17:51:12,345 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2023-11-01 17:51:12,345 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-11-01 17:51:12,345 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2023-11-01 17:51:12,346 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2023-11-01 17:51:12,346 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2023-11-01 17:51:12,346 INFO  L130     BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock
[2023-11-01 17:51:12,346 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2023-11-01 17:51:12,346 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2023-11-01 17:51:12,346 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2023-11-01 17:51:12,347 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2023-11-01 17:51:12,347 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2023-11-01 17:51:12,347 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-11-01 17:51:12,347 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-11-01 17:51:12,348 WARN  L209             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2023-11-01 17:51:12,462 INFO  L235             CfgBuilder]: Building ICFG
[2023-11-01 17:51:12,464 INFO  L261             CfgBuilder]: Building CFG for each procedure with an implementation
[2023-11-01 17:51:12,674 INFO  L276             CfgBuilder]: Performing block encoding
[2023-11-01 17:51:12,681 INFO  L295             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-11-01 17:51:12,681 INFO  L300             CfgBuilder]: Removed 2 assume(true) statements.
[2023-11-01 17:51:12,683 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.11 05:51:12 BoogieIcfgContainer
[2023-11-01 17:51:12,683 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-11-01 17:51:12,685 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-11-01 17:51:12,685 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2023-11-01 17:51:12,689 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2023-11-01 17:51:12,689 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.11 05:51:11" (1/3) ...
[2023-11-01 17:51:12,690 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5946d48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.11 05:51:12, skipping insertion in model container
[2023-11-01 17:51:12,690 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 05:51:12" (2/3) ...
[2023-11-01 17:51:12,691 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5946d48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.11 05:51:12, skipping insertion in model container
[2023-11-01 17:51:12,691 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.11 05:51:12" (3/3) ...
[2023-11-01 17:51:12,692 INFO  L112   eAbstractionObserver]: Analyzing ICFG thread-join-array-dynamic-race-2.i
[2023-11-01 17:51:12,701 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2023-11-01 17:51:12,712 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-11-01 17:51:12,712 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations.
[2023-11-01 17:51:12,713 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2023-11-01 17:51:12,754 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2023-11-01 17:51:12,781 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 106 places, 107 transitions, 222 flow
[2023-11-01 17:51:12,851 INFO  L130       PetriNetUnfolder]: 6/156 cut-off events.
[2023-11-01 17:51:12,851 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-11-01 17:51:12,855 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-01 17:51:12,855 INFO  L82        GeneralOperation]: Start removeDead. Operand has 106 places, 107 transitions, 222 flow
[2023-11-01 17:51:12,876 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 106 places, 107 transitions, 222 flow
[2023-11-01 17:51:12,880 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-11-01 17:51:12,891 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 107 transitions, 222 flow
[2023-11-01 17:51:12,894 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 107 transitions, 222 flow
[2023-11-01 17:51:12,895 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 106 places, 107 transitions, 222 flow
[2023-11-01 17:51:12,928 INFO  L130       PetriNetUnfolder]: 6/156 cut-off events.
[2023-11-01 17:51:12,929 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-11-01 17:51:12,929 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-01 17:51:12,932 INFO  L119        LiptonReduction]: Number of co-enabled transitions 1568
[2023-11-01 17:51:16,987 INFO  L134        LiptonReduction]: Checked pairs total: 2097
[2023-11-01 17:51:16,987 INFO  L136        LiptonReduction]: Total number of compositions: 101
[2023-11-01 17:51:17,001 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-01 17:51:17,007 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;@7abce646, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-11-01 17:51:17,007 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 8 error locations.
[2023-11-01 17:51:17,009 INFO  L130       PetriNetUnfolder]: 0/2 cut-off events.
[2023-11-01 17:51:17,009 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-11-01 17:51:17,009 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 17:51:17,009 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1]
[2023-11-01 17:51:17,010 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-01 17:51:17,013 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 17:51:17,013 INFO  L85        PathProgramCache]: Analyzing trace with hash 12251, now seen corresponding path program 1 times
[2023-11-01 17:51:17,020 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 17:51:17,020 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456504321]
[2023-11-01 17:51:17,020 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:51:17,021 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 17:51:17,095 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 17:51:17,136 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-01 17:51:17,137 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 17:51:17,137 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456504321]
[2023-11-01 17:51:17,138 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456504321] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-01 17:51:17,138 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-01 17:51:17,138 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2023-11-01 17:51:17,139 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897733387]
[2023-11-01 17:51:17,140 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-01 17:51:17,145 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-11-01 17:51:17,146 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 17:51:17,160 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-11-01 17:51:17,161 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-11-01 17:51:17,162 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 102 out of 208
[2023-11-01 17:51:17,164 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-01 17:51:17,164 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 17:51:17,164 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 208
[2023-11-01 17:51:17,165 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 17:51:17,214 INFO  L130       PetriNetUnfolder]: 19/66 cut-off events.
[2023-11-01 17:51:17,214 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-11-01 17:51:17,214 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-01 17:51:17,215 INFO  L137   encePairwiseOnDemand]: 204/208 looper letters, 13 selfloop transitions, 0 changer transitions 0/17 dead transitions.
[2023-11-01 17:51:17,216 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 20 places, 17 transitions, 68 flow
[2023-11-01 17:51:17,217 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-11-01 17:51:17,219 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-11-01 17:51:17,225 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 221 transitions.
[2023-11-01 17:51:17,226 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.53125
[2023-11-01 17:51:17,227 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 221 transitions.
[2023-11-01 17:51:17,227 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 221 transitions.
[2023-11-01 17:51:17,228 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 17:51:17,230 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 221 transitions.
[2023-11-01 17:51:17,232 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-01 17:51:17,236 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-01 17:51:17,237 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-01 17:51:17,238 INFO  L175             Difference]: Start difference. First operand has 23 places, 21 transitions, 50 flow. Second operand 2 states and 221 transitions.
[2023-11-01 17:51:17,239 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 20 places, 17 transitions, 68 flow
[2023-11-01 17:51:17,241 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 17 transitions, 68 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-01 17:51:17,242 INFO  L231             Difference]: Finished difference. Result has 20 places, 17 transitions, 42 flow
[2023-11-01 17:51:17,243 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-01 17:51:17,246 INFO  L288   CegarLoopForPetriNet]: 23 programPoint places, -3 predicate places.
[2023-11-01 17:51:17,246 INFO  L495      AbstractCegarLoop]: Abstraction has has 20 places, 17 transitions, 42 flow
[2023-11-01 17:51:17,246 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-01 17:51:17,247 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 17:51:17,247 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1]
[2023-11-01 17:51:17,247 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-11-01 17:51:17,247 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-01 17:51:17,248 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 17:51:17,248 INFO  L85        PathProgramCache]: Analyzing trace with hash 11737896, now seen corresponding path program 1 times
[2023-11-01 17:51:17,248 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 17:51:17,248 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480890057]
[2023-11-01 17:51:17,248 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:51:17,249 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 17:51:17,268 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 17:51:17,311 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-01 17:51:17,312 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 17:51:17,312 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480890057]
[2023-11-01 17:51:17,312 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480890057] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-01 17:51:17,312 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-01 17:51:17,312 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-01 17:51:17,313 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627453435]
[2023-11-01 17:51:17,313 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-01 17:51:17,314 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-01 17:51:17,314 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 17:51:17,314 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-01 17:51:17,315 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-01 17:51:17,329 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 98 out of 208
[2023-11-01 17:51:17,330 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-01 17:51:17,330 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 17:51:17,330 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 208
[2023-11-01 17:51:17,330 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 17:51:17,385 INFO  L130       PetriNetUnfolder]: 24/81 cut-off events.
[2023-11-01 17:51:17,386 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-11-01 17:51:17,386 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-01 17:51:17,387 INFO  L137   encePairwiseOnDemand]: 204/208 looper letters, 14 selfloop transitions, 3 changer transitions 3/22 dead transitions.
[2023-11-01 17:51:17,387 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 22 transitions, 92 flow
[2023-11-01 17:51:17,387 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-01 17:51:17,388 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-01 17:51:17,389 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 315 transitions.
[2023-11-01 17:51:17,390 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5048076923076923
[2023-11-01 17:51:17,390 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 315 transitions.
[2023-11-01 17:51:17,390 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 315 transitions.
[2023-11-01 17:51:17,391 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 17:51:17,391 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 315 transitions.
[2023-11-01 17:51:17,393 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-01 17:51:17,394 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-01 17:51:17,395 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-01 17:51:17,395 INFO  L175             Difference]: Start difference. First operand has 20 places, 17 transitions, 42 flow. Second operand 3 states and 315 transitions.
[2023-11-01 17:51:17,395 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 22 transitions, 92 flow
[2023-11-01 17:51:17,396 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 22 transitions, 92 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-01 17:51:17,396 INFO  L231             Difference]: Finished difference. Result has 24 places, 17 transitions, 57 flow
[2023-11-01 17:51:17,396 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-01 17:51:17,397 INFO  L288   CegarLoopForPetriNet]: 23 programPoint places, 1 predicate places.
[2023-11-01 17:51:17,397 INFO  L495      AbstractCegarLoop]: Abstraction has has 24 places, 17 transitions, 57 flow
[2023-11-01 17:51:17,398 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-01 17:51:17,398 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 17:51:17,398 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1]
[2023-11-01 17:51:17,398 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-11-01 17:51:17,399 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-01 17:51:17,399 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 17:51:17,399 INFO  L85        PathProgramCache]: Analyzing trace with hash -1562108238, now seen corresponding path program 1 times
[2023-11-01 17:51:17,399 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 17:51:17,400 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577134005]
[2023-11-01 17:51:17,400 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:51:17,400 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 17:51:17,437 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-01 17:51:17,437 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-11-01 17:51:17,466 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-01 17:51:17,482 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-11-01 17:51:17,483 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-11-01 17:51:17,483 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining)
[2023-11-01 17:51:17,485 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 8 remaining)
[2023-11-01 17:51:17,485 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 8 remaining)
[2023-11-01 17:51:17,486 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (4 of 8 remaining)
[2023-11-01 17:51:17,486 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (3 of 8 remaining)
[2023-11-01 17:51:17,486 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (2 of 8 remaining)
[2023-11-01 17:51:17,486 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 8 remaining)
[2023-11-01 17:51:17,486 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 8 remaining)
[2023-11-01 17:51:17,487 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-11-01 17:51:17,487 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1]
[2023-11-01 17:51:17,489 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-11-01 17:51:17,489 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2023-11-01 17:51:17,502 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2023-11-01 17:51:17,504 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 123 places, 123 transitions, 264 flow
[2023-11-01 17:51:17,527 INFO  L130       PetriNetUnfolder]: 11/270 cut-off events.
[2023-11-01 17:51:17,527 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2023-11-01 17:51:17,528 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-01 17:51:17,528 INFO  L82        GeneralOperation]: Start removeDead. Operand has 123 places, 123 transitions, 264 flow
[2023-11-01 17:51:17,530 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 123 places, 123 transitions, 264 flow
[2023-11-01 17:51:17,530 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-11-01 17:51:17,530 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 123 transitions, 264 flow
[2023-11-01 17:51:17,530 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 123 transitions, 264 flow
[2023-11-01 17:51:17,531 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 123 places, 123 transitions, 264 flow
[2023-11-01 17:51:17,548 INFO  L130       PetriNetUnfolder]: 11/270 cut-off events.
[2023-11-01 17:51:17,549 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2023-11-01 17:51:17,549 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-01 17:51:17,552 INFO  L119        LiptonReduction]: Number of co-enabled transitions 3780
[2023-11-01 17:51:21,633 INFO  L134        LiptonReduction]: Checked pairs total: 7172
[2023-11-01 17:51:21,633 INFO  L136        LiptonReduction]: Total number of compositions: 106
[2023-11-01 17:51:21,636 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-01 17:51:21,638 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;@7abce646, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-11-01 17:51:21,638 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 9 error locations.
[2023-11-01 17:51:21,640 INFO  L130       PetriNetUnfolder]: 0/2 cut-off events.
[2023-11-01 17:51:21,640 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-11-01 17:51:21,640 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 17:51:21,640 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1]
[2023-11-01 17:51:21,640 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-01 17:51:21,641 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 17:51:21,641 INFO  L85        PathProgramCache]: Analyzing trace with hash 20088, now seen corresponding path program 1 times
[2023-11-01 17:51:21,641 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 17:51:21,641 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255844294]
[2023-11-01 17:51:21,642 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:51:21,642 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 17:51:21,651 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 17:51:21,658 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-01 17:51:21,659 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 17:51:21,659 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255844294]
[2023-11-01 17:51:21,659 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255844294] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-01 17:51:21,659 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-01 17:51:21,660 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2023-11-01 17:51:21,660 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907449593]
[2023-11-01 17:51:21,660 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-01 17:51:21,660 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-11-01 17:51:21,660 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 17:51:21,661 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-11-01 17:51:21,661 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-11-01 17:51:21,662 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 116 out of 229
[2023-11-01 17:51:21,662 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-01 17:51:21,662 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 17:51:21,662 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 229
[2023-11-01 17:51:21,662 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 17:51:21,759 INFO  L130       PetriNetUnfolder]: 378/759 cut-off events.
[2023-11-01 17:51:21,759 INFO  L131       PetriNetUnfolder]: For 38/38 co-relation queries the response was YES.
[2023-11-01 17:51:21,761 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-01 17:51:21,764 INFO  L137   encePairwiseOnDemand]: 225/229 looper letters, 21 selfloop transitions, 0 changer transitions 0/29 dead transitions.
[2023-11-01 17:51:21,764 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 29 transitions, 118 flow
[2023-11-01 17:51:21,765 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-11-01 17:51:21,765 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-11-01 17:51:21,766 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 257 transitions.
[2023-11-01 17:51:21,767 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5611353711790393
[2023-11-01 17:51:21,767 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 257 transitions.
[2023-11-01 17:51:21,767 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 257 transitions.
[2023-11-01 17:51:21,767 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 17:51:21,767 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 257 transitions.
[2023-11-01 17:51:21,768 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-01 17:51:21,770 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-01 17:51:21,770 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-01 17:51:21,771 INFO  L175             Difference]: Start difference. First operand has 36 places, 33 transitions, 84 flow. Second operand 2 states and 257 transitions.
[2023-11-01 17:51:21,771 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 29 transitions, 118 flow
[2023-11-01 17:51:21,772 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 29 transitions, 118 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-01 17:51:21,772 INFO  L231             Difference]: Finished difference. Result has 33 places, 29 transitions, 76 flow
[2023-11-01 17:51:21,772 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-01 17:51:21,773 INFO  L288   CegarLoopForPetriNet]: 36 programPoint places, -3 predicate places.
[2023-11-01 17:51:21,773 INFO  L495      AbstractCegarLoop]: Abstraction has has 33 places, 29 transitions, 76 flow
[2023-11-01 17:51:21,774 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-01 17:51:21,774 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 17:51:21,774 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1]
[2023-11-01 17:51:21,774 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2023-11-01 17:51:21,774 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-01 17:51:21,775 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 17:51:21,775 INFO  L85        PathProgramCache]: Analyzing trace with hash 19281939, now seen corresponding path program 1 times
[2023-11-01 17:51:21,775 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 17:51:21,775 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685174196]
[2023-11-01 17:51:21,775 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:51:21,776 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 17:51:21,785 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 17:51:21,805 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-01 17:51:21,805 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 17:51:21,806 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685174196]
[2023-11-01 17:51:21,806 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685174196] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-01 17:51:21,806 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-01 17:51:21,806 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-01 17:51:21,807 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862781550]
[2023-11-01 17:51:21,807 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-01 17:51:21,807 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-01 17:51:21,808 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 17:51:21,808 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-01 17:51:21,809 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-01 17:51:21,825 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 111 out of 229
[2023-11-01 17:51:21,825 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-01 17:51:21,826 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 17:51:21,826 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 229
[2023-11-01 17:51:21,826 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 17:51:22,026 INFO  L130       PetriNetUnfolder]: 679/1281 cut-off events.
[2023-11-01 17:51:22,027 INFO  L131       PetriNetUnfolder]: For 42/42 co-relation queries the response was YES.
[2023-11-01 17:51:22,029 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-01 17:51:22,033 INFO  L137   encePairwiseOnDemand]: 224/229 looper letters, 32 selfloop transitions, 4 changer transitions 0/41 dead transitions.
[2023-11-01 17:51:22,033 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 41 transitions, 172 flow
[2023-11-01 17:51:22,034 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-01 17:51:22,034 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-01 17:51:22,035 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 370 transitions.
[2023-11-01 17:51:22,035 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5385735080058224
[2023-11-01 17:51:22,035 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 370 transitions.
[2023-11-01 17:51:22,036 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 370 transitions.
[2023-11-01 17:51:22,036 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 17:51:22,036 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 370 transitions.
[2023-11-01 17:51:22,037 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-01 17:51:22,039 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-01 17:51:22,039 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-01 17:51:22,040 INFO  L175             Difference]: Start difference. First operand has 33 places, 29 transitions, 76 flow. Second operand 3 states and 370 transitions.
[2023-11-01 17:51:22,040 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 41 transitions, 172 flow
[2023-11-01 17:51:22,041 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 41 transitions, 172 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-01 17:51:22,041 INFO  L231             Difference]: Finished difference. Result has 37 places, 32 transitions, 106 flow
[2023-11-01 17:51:22,042 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-01 17:51:22,042 INFO  L288   CegarLoopForPetriNet]: 36 programPoint places, 1 predicate places.
[2023-11-01 17:51:22,042 INFO  L495      AbstractCegarLoop]: Abstraction has has 37 places, 32 transitions, 106 flow
[2023-11-01 17:51:22,043 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-01 17:51:22,043 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 17:51:22,043 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-11-01 17:51:22,043 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2023-11-01 17:51:22,044 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-01 17:51:22,044 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 17:51:22,044 INFO  L85        PathProgramCache]: Analyzing trace with hash 15874969, now seen corresponding path program 1 times
[2023-11-01 17:51:22,044 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 17:51:22,045 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008257754]
[2023-11-01 17:51:22,045 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:51:22,045 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 17:51:22,059 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 17:51:22,082 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-01 17:51:22,082 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 17:51:22,083 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008257754]
[2023-11-01 17:51:22,083 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008257754] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-01 17:51:22,083 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-01 17:51:22,083 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-01 17:51:22,084 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155707617]
[2023-11-01 17:51:22,084 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-01 17:51:22,084 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-01 17:51:22,084 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 17:51:22,085 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-01 17:51:22,085 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-01 17:51:22,103 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 109 out of 229
[2023-11-01 17:51:22,104 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-01 17:51:22,104 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 17:51:22,104 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 229
[2023-11-01 17:51:22,104 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 17:51:22,288 INFO  L130       PetriNetUnfolder]: 739/1420 cut-off events.
[2023-11-01 17:51:22,288 INFO  L131       PetriNetUnfolder]: For 333/333 co-relation queries the response was YES.
[2023-11-01 17:51:22,290 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-01 17:51:22,295 INFO  L137   encePairwiseOnDemand]: 223/229 looper letters, 35 selfloop transitions, 7 changer transitions 0/49 dead transitions.
[2023-11-01 17:51:22,295 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 49 transitions, 242 flow
[2023-11-01 17:51:22,296 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-01 17:51:22,296 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-01 17:51:22,297 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 367 transitions.
[2023-11-01 17:51:22,297 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5342066957787481
[2023-11-01 17:51:22,297 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 367 transitions.
[2023-11-01 17:51:22,298 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 367 transitions.
[2023-11-01 17:51:22,298 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 17:51:22,298 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 367 transitions.
[2023-11-01 17:51:22,299 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-01 17:51:22,300 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-01 17:51:22,301 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-01 17:51:22,301 INFO  L175             Difference]: Start difference. First operand has 37 places, 32 transitions, 106 flow. Second operand 3 states and 367 transitions.
[2023-11-01 17:51:22,301 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 49 transitions, 242 flow
[2023-11-01 17:51:22,305 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 49 transitions, 230 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-01 17:51:22,306 INFO  L231             Difference]: Finished difference. Result has 39 places, 37 transitions, 154 flow
[2023-11-01 17:51:22,306 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-01 17:51:22,307 INFO  L288   CegarLoopForPetriNet]: 36 programPoint places, 3 predicate places.
[2023-11-01 17:51:22,307 INFO  L495      AbstractCegarLoop]: Abstraction has has 39 places, 37 transitions, 154 flow
[2023-11-01 17:51:22,307 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-01 17:51:22,307 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 17:51:22,308 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-01 17:51:22,308 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2023-11-01 17:51:22,308 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-01 17:51:22,308 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 17:51:22,309 INFO  L85        PathProgramCache]: Analyzing trace with hash -1219947716, now seen corresponding path program 1 times
[2023-11-01 17:51:22,309 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 17:51:22,309 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925105117]
[2023-11-01 17:51:22,309 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:51:22,310 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 17:51:22,322 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 17:51:22,403 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-01 17:51:22,404 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 17:51:22,404 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925105117]
[2023-11-01 17:51:22,404 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925105117] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-01 17:51:22,404 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1409983379]
[2023-11-01 17:51:22,405 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:51:22,405 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-01 17:51:22,405 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-01 17:51:22,407 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-01 17:51:22,408 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-01 17:51:22,494 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 17:51:22,497 INFO  L263         TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 4 conjunts are in the unsatisfiable core
[2023-11-01 17:51:22,499 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-01 17:51:22,562 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-01 17:51:22,563 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-01 17:51:22,597 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-01 17:51:22,597 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1409983379] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-01 17:51:22,597 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-01 17:51:22,597 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8
[2023-11-01 17:51:22,598 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565016256]
[2023-11-01 17:51:22,598 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-01 17:51:22,598 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2023-11-01 17:51:22,598 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 17:51:22,599 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2023-11-01 17:51:22,599 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2023-11-01 17:51:22,711 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 106 out of 229
[2023-11-01 17:51:22,712 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-01 17:51:22,712 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 17:51:22,712 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 229
[2023-11-01 17:51:22,712 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 17:51:23,017 INFO  L130       PetriNetUnfolder]: 349/722 cut-off events.
[2023-11-01 17:51:23,018 INFO  L131       PetriNetUnfolder]: For 490/564 co-relation queries the response was YES.
[2023-11-01 17:51:23,019 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-01 17:51:23,022 INFO  L137   encePairwiseOnDemand]: 222/229 looper letters, 42 selfloop transitions, 6 changer transitions 15/73 dead transitions.
[2023-11-01 17:51:23,022 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 73 transitions, 400 flow
[2023-11-01 17:51:23,023 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2023-11-01 17:51:23,023 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2023-11-01 17:51:23,026 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 902 transitions.
[2023-11-01 17:51:23,027 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.4923580786026201
[2023-11-01 17:51:23,027 INFO  L72            ComplementDD]: Start complementDD. Operand 8 states and 902 transitions.
[2023-11-01 17:51:23,027 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 8 states and 902 transitions.
[2023-11-01 17:51:23,028 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 17:51:23,028 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 902 transitions.
[2023-11-01 17:51:23,031 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-01 17:51:23,034 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-01 17:51:23,035 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-01 17:51:23,035 INFO  L175             Difference]: Start difference. First operand has 39 places, 37 transitions, 154 flow. Second operand 8 states and 902 transitions.
[2023-11-01 17:51:23,035 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 73 transitions, 400 flow
[2023-11-01 17:51:23,037 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 73 transitions, 376 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-01 17:51:23,038 INFO  L231             Difference]: Finished difference. Result has 48 places, 39 transitions, 174 flow
[2023-11-01 17:51:23,038 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-01 17:51:23,038 INFO  L288   CegarLoopForPetriNet]: 36 programPoint places, 12 predicate places.
[2023-11-01 17:51:23,039 INFO  L495      AbstractCegarLoop]: Abstraction has has 48 places, 39 transitions, 174 flow
[2023-11-01 17:51:23,039 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-01 17:51:23,039 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 17:51:23,039 INFO  L209   CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1]
[2023-11-01 17:51:23,048 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2023-11-01 17:51:23,240 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-01 17:51:23,241 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-01 17:51:23,242 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 17:51:23,242 INFO  L85        PathProgramCache]: Analyzing trace with hash -113454216, now seen corresponding path program 1 times
[2023-11-01 17:51:23,243 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 17:51:23,243 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451243344]
[2023-11-01 17:51:23,243 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:51:23,244 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 17:51:23,275 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-01 17:51:23,275 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-11-01 17:51:23,287 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-01 17:51:23,292 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-11-01 17:51:23,292 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-11-01 17:51:23,293 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining)
[2023-11-01 17:51:23,293 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining)
[2023-11-01 17:51:23,293 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining)
[2023-11-01 17:51:23,293 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining)
[2023-11-01 17:51:23,293 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining)
[2023-11-01 17:51:23,294 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining)
[2023-11-01 17:51:23,294 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining)
[2023-11-01 17:51:23,294 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining)
[2023-11-01 17:51:23,294 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining)
[2023-11-01 17:51:23,294 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2023-11-01 17:51:23,295 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1]
[2023-11-01 17:51:23,295 WARN  L233   ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-11-01 17:51:23,295 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances.
[2023-11-01 17:51:23,310 INFO  L144    ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions.
[2023-11-01 17:51:23,312 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 140 places, 139 transitions, 308 flow
[2023-11-01 17:51:23,341 INFO  L130       PetriNetUnfolder]: 21/465 cut-off events.
[2023-11-01 17:51:23,342 INFO  L131       PetriNetUnfolder]: For 19/19 co-relation queries the response was YES.
[2023-11-01 17:51:23,342 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-01 17:51:23,343 INFO  L82        GeneralOperation]: Start removeDead. Operand has 140 places, 139 transitions, 308 flow
[2023-11-01 17:51:23,344 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 140 places, 139 transitions, 308 flow
[2023-11-01 17:51:23,344 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-11-01 17:51:23,344 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 140 places, 139 transitions, 308 flow
[2023-11-01 17:51:23,345 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 140 places, 139 transitions, 308 flow
[2023-11-01 17:51:23,345 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 140 places, 139 transitions, 308 flow
[2023-11-01 17:51:23,375 INFO  L130       PetriNetUnfolder]: 21/465 cut-off events.
[2023-11-01 17:51:23,375 INFO  L131       PetriNetUnfolder]: For 19/19 co-relation queries the response was YES.
[2023-11-01 17:51:23,376 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-01 17:51:23,382 INFO  L119        LiptonReduction]: Number of co-enabled transitions 6384
[2023-11-01 17:51:27,308 INFO  L134        LiptonReduction]: Checked pairs total: 13211
[2023-11-01 17:51:27,308 INFO  L136        LiptonReduction]: Total number of compositions: 114
[2023-11-01 17:51:27,311 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-01 17:51:27,312 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;@7abce646, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-11-01 17:51:27,312 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 10 error locations.
[2023-11-01 17:51:27,314 INFO  L130       PetriNetUnfolder]: 0/2 cut-off events.
[2023-11-01 17:51:27,314 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-11-01 17:51:27,314 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 17:51:27,314 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1]
[2023-11-01 17:51:27,315 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-01 17:51:27,315 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 17:51:27,315 INFO  L85        PathProgramCache]: Analyzing trace with hash 28698, now seen corresponding path program 1 times
[2023-11-01 17:51:27,315 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 17:51:27,316 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749099824]
[2023-11-01 17:51:27,316 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:51:27,316 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 17:51:27,321 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 17:51:27,325 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-01 17:51:27,326 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 17:51:27,326 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749099824]
[2023-11-01 17:51:27,326 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749099824] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-01 17:51:27,326 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-01 17:51:27,326 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2023-11-01 17:51:27,326 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764554157]
[2023-11-01 17:51:27,327 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-01 17:51:27,327 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-11-01 17:51:27,327 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 17:51:27,327 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-11-01 17:51:27,327 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-11-01 17:51:27,328 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 130 out of 253
[2023-11-01 17:51:27,328 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-01 17:51:27,328 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 17:51:27,328 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 253
[2023-11-01 17:51:27,328 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 17:51:27,747 INFO  L130       PetriNetUnfolder]: 4046/6932 cut-off events.
[2023-11-01 17:51:27,747 INFO  L131       PetriNetUnfolder]: For 527/527 co-relation queries the response was YES.
[2023-11-01 17:51:27,753 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-01 17:51:27,773 INFO  L137   encePairwiseOnDemand]: 249/253 looper letters, 28 selfloop transitions, 0 changer transitions 0/37 dead transitions.
[2023-11-01 17:51:27,774 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 37 transitions, 160 flow
[2023-11-01 17:51:27,775 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-11-01 17:51:27,775 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-11-01 17:51:27,775 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 292 transitions.
[2023-11-01 17:51:27,776 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5770750988142292
[2023-11-01 17:51:27,776 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 292 transitions.
[2023-11-01 17:51:27,776 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 292 transitions.
[2023-11-01 17:51:27,776 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 17:51:27,776 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 292 transitions.
[2023-11-01 17:51:27,777 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-01 17:51:27,778 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-01 17:51:27,778 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-01 17:51:27,778 INFO  L175             Difference]: Start difference. First operand has 45 places, 41 transitions, 112 flow. Second operand 2 states and 292 transitions.
[2023-11-01 17:51:27,778 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 37 transitions, 160 flow
[2023-11-01 17:51:27,779 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 37 transitions, 160 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-01 17:51:27,780 INFO  L231             Difference]: Finished difference. Result has 42 places, 37 transitions, 104 flow
[2023-11-01 17:51:27,780 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-01 17:51:27,780 INFO  L288   CegarLoopForPetriNet]: 45 programPoint places, -3 predicate places.
[2023-11-01 17:51:27,781 INFO  L495      AbstractCegarLoop]: Abstraction has has 42 places, 37 transitions, 104 flow
[2023-11-01 17:51:27,781 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-01 17:51:27,781 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 17:51:27,781 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1]
[2023-11-01 17:51:27,781 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2023-11-01 17:51:27,782 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-01 17:51:27,782 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 17:51:27,782 INFO  L85        PathProgramCache]: Analyzing trace with hash 27557975, now seen corresponding path program 1 times
[2023-11-01 17:51:27,782 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 17:51:27,782 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36318182]
[2023-11-01 17:51:27,783 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:51:27,783 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 17:51:27,790 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 17:51:27,802 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-01 17:51:27,802 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 17:51:27,803 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36318182]
[2023-11-01 17:51:27,803 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36318182] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-01 17:51:27,803 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-01 17:51:27,803 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-01 17:51:27,803 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683905808]
[2023-11-01 17:51:27,803 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-01 17:51:27,804 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-01 17:51:27,804 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 17:51:27,804 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-01 17:51:27,804 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-01 17:51:27,819 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 124 out of 253
[2023-11-01 17:51:27,819 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-01 17:51:27,819 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 17:51:27,819 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 253
[2023-11-01 17:51:27,819 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 17:51:28,454 INFO  L130       PetriNetUnfolder]: 7618/11957 cut-off events.
[2023-11-01 17:51:28,454 INFO  L131       PetriNetUnfolder]: For 567/567 co-relation queries the response was YES.
[2023-11-01 17:51:28,465 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-01 17:51:28,503 INFO  L137   encePairwiseOnDemand]: 247/253 looper letters, 43 selfloop transitions, 5 changer transitions 0/54 dead transitions.
[2023-11-01 17:51:28,503 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 54 transitions, 234 flow
[2023-11-01 17:51:28,504 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-01 17:51:28,504 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-01 17:51:28,505 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 421 transitions.
[2023-11-01 17:51:28,506 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5546772068511199
[2023-11-01 17:51:28,506 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 421 transitions.
[2023-11-01 17:51:28,506 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 421 transitions.
[2023-11-01 17:51:28,506 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 17:51:28,506 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 421 transitions.
[2023-11-01 17:51:28,507 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-01 17:51:28,508 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-01 17:51:28,508 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-01 17:51:28,509 INFO  L175             Difference]: Start difference. First operand has 42 places, 37 transitions, 104 flow. Second operand 3 states and 421 transitions.
[2023-11-01 17:51:28,509 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 54 transitions, 234 flow
[2023-11-01 17:51:28,510 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 54 transitions, 234 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-01 17:51:28,511 INFO  L231             Difference]: Finished difference. Result has 46 places, 41 transitions, 142 flow
[2023-11-01 17:51:28,511 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-01 17:51:28,511 INFO  L288   CegarLoopForPetriNet]: 45 programPoint places, 1 predicate places.
[2023-11-01 17:51:28,511 INFO  L495      AbstractCegarLoop]: Abstraction has has 46 places, 41 transitions, 142 flow
[2023-11-01 17:51:28,512 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-01 17:51:28,512 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 17:51:28,512 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-11-01 17:51:28,512 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2023-11-01 17:51:28,512 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-01 17:51:28,513 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 17:51:28,513 INFO  L85        PathProgramCache]: Analyzing trace with hash 1947879644, now seen corresponding path program 1 times
[2023-11-01 17:51:28,513 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 17:51:28,513 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98951266]
[2023-11-01 17:51:28,513 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:51:28,513 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 17:51:28,521 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 17:51:28,536 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-01 17:51:28,537 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 17:51:28,537 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98951266]
[2023-11-01 17:51:28,537 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98951266] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-01 17:51:28,538 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-01 17:51:28,538 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-01 17:51:28,538 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991210974]
[2023-11-01 17:51:28,538 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-01 17:51:28,539 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-01 17:51:28,539 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 17:51:28,540 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-01 17:51:28,540 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-01 17:51:28,557 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 122 out of 253
[2023-11-01 17:51:28,558 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-01 17:51:28,558 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 17:51:28,558 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 253
[2023-11-01 17:51:28,558 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 17:51:29,417 INFO  L130       PetriNetUnfolder]: 9031/14325 cut-off events.
[2023-11-01 17:51:29,418 INFO  L131       PetriNetUnfolder]: For 3695/3695 co-relation queries the response was YES.
[2023-11-01 17:51:29,433 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-01 17:51:29,472 INFO  L137   encePairwiseOnDemand]: 246/253 looper letters, 49 selfloop transitions, 9 changer transitions 0/66 dead transitions.
[2023-11-01 17:51:29,472 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 66 transitions, 342 flow
[2023-11-01 17:51:29,473 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-01 17:51:29,473 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-01 17:51:29,474 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 420 transitions.
[2023-11-01 17:51:29,475 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5533596837944664
[2023-11-01 17:51:29,475 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 420 transitions.
[2023-11-01 17:51:29,475 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 420 transitions.
[2023-11-01 17:51:29,475 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 17:51:29,475 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 420 transitions.
[2023-11-01 17:51:29,476 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-01 17:51:29,477 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-01 17:51:29,478 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-01 17:51:29,478 INFO  L175             Difference]: Start difference. First operand has 46 places, 41 transitions, 142 flow. Second operand 3 states and 420 transitions.
[2023-11-01 17:51:29,478 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 66 transitions, 342 flow
[2023-11-01 17:51:29,525 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 66 transitions, 326 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-01 17:51:29,526 INFO  L231             Difference]: Finished difference. Result has 48 places, 48 transitions, 208 flow
[2023-11-01 17:51:29,526 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-01 17:51:29,527 INFO  L288   CegarLoopForPetriNet]: 45 programPoint places, 3 predicate places.
[2023-11-01 17:51:29,527 INFO  L495      AbstractCegarLoop]: Abstraction has has 48 places, 48 transitions, 208 flow
[2023-11-01 17:51:29,528 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-01 17:51:29,528 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 17:51:29,528 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-01 17:51:29,528 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2023-11-01 17:51:29,528 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-01 17:51:29,529 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 17:51:29,529 INFO  L85        PathProgramCache]: Analyzing trace with hash -1731667041, now seen corresponding path program 1 times
[2023-11-01 17:51:29,529 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 17:51:29,529 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320867626]
[2023-11-01 17:51:29,529 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:51:29,529 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 17:51:29,540 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 17:51:29,599 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-01 17:51:29,600 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 17:51:29,600 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320867626]
[2023-11-01 17:51:29,600 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320867626] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-01 17:51:29,600 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302934332]
[2023-11-01 17:51:29,600 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:51:29,601 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-01 17:51:29,601 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-01 17:51:29,602 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-01 17:51:29,603 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-01 17:51:29,686 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 17:51:29,687 INFO  L263         TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 4 conjunts are in the unsatisfiable core
[2023-11-01 17:51:29,688 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-01 17:51:29,718 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-01 17:51:29,719 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-01 17:51:29,753 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-01 17:51:29,753 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1302934332] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-01 17:51:29,754 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-01 17:51:29,754 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8
[2023-11-01 17:51:29,754 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726044344]
[2023-11-01 17:51:29,754 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-01 17:51:29,755 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2023-11-01 17:51:29,755 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 17:51:29,756 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2023-11-01 17:51:29,756 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2023-11-01 17:51:29,849 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 120 out of 253
[2023-11-01 17:51:29,850 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-01 17:51:29,850 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 17:51:29,850 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 253
[2023-11-01 17:51:29,850 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 17:51:30,598 INFO  L130       PetriNetUnfolder]: 4872/8243 cut-off events.
[2023-11-01 17:51:30,599 INFO  L131       PetriNetUnfolder]: For 6426/6669 co-relation queries the response was YES.
[2023-11-01 17:51:30,607 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-01 17:51:30,625 INFO  L137   encePairwiseOnDemand]: 246/253 looper letters, 74 selfloop transitions, 7 changer transitions 4/98 dead transitions.
[2023-11-01 17:51:30,625 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 98 transitions, 559 flow
[2023-11-01 17:51:30,626 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2023-11-01 17:51:30,626 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2023-11-01 17:51:30,627 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1033 transitions.
[2023-11-01 17:51:30,628 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5103754940711462
[2023-11-01 17:51:30,628 INFO  L72            ComplementDD]: Start complementDD. Operand 8 states and 1033 transitions.
[2023-11-01 17:51:30,628 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 8 states and 1033 transitions.
[2023-11-01 17:51:30,629 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 17:51:30,629 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1033 transitions.
[2023-11-01 17:51:30,631 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-01 17:51:30,633 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-01 17:51:30,633 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-01 17:51:30,633 INFO  L175             Difference]: Start difference. First operand has 48 places, 48 transitions, 208 flow. Second operand 8 states and 1033 transitions.
[2023-11-01 17:51:30,633 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 98 transitions, 559 flow
[2023-11-01 17:51:30,642 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 98 transitions, 521 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-01 17:51:30,643 INFO  L231             Difference]: Finished difference. Result has 57 places, 52 transitions, 235 flow
[2023-11-01 17:51:30,643 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-01 17:51:30,643 INFO  L288   CegarLoopForPetriNet]: 45 programPoint places, 12 predicate places.
[2023-11-01 17:51:30,644 INFO  L495      AbstractCegarLoop]: Abstraction has has 57 places, 52 transitions, 235 flow
[2023-11-01 17:51:30,644 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-01 17:51:30,644 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 17:51:30,644 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-01 17:51:30,651 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2023-11-01 17:51:30,845 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-01 17:51:30,846 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-01 17:51:30,846 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 17:51:30,847 INFO  L85        PathProgramCache]: Analyzing trace with hash -430492556, now seen corresponding path program 1 times
[2023-11-01 17:51:30,847 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 17:51:30,847 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823085175]
[2023-11-01 17:51:30,848 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:51:30,848 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 17:51:30,863 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 17:51:30,881 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-01 17:51:30,881 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 17:51:30,881 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823085175]
[2023-11-01 17:51:30,882 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823085175] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-01 17:51:30,882 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-01 17:51:30,882 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-01 17:51:30,882 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947241903]
[2023-11-01 17:51:30,883 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-01 17:51:30,883 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-01 17:51:30,883 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 17:51:30,884 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-01 17:51:30,884 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-01 17:51:30,899 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 122 out of 253
[2023-11-01 17:51:30,900 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-01 17:51:30,900 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 17:51:30,900 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 253
[2023-11-01 17:51:30,900 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 17:51:31,701 INFO  L130       PetriNetUnfolder]: 6319/10299 cut-off events.
[2023-11-01 17:51:31,701 INFO  L131       PetriNetUnfolder]: For 7970/8114 co-relation queries the response was YES.
[2023-11-01 17:51:31,712 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-01 17:51:31,732 INFO  L137   encePairwiseOnDemand]: 247/253 looper letters, 60 selfloop transitions, 12 changer transitions 0/80 dead transitions.
[2023-11-01 17:51:31,732 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 80 transitions, 508 flow
[2023-11-01 17:51:31,733 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-01 17:51:31,733 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-01 17:51:31,734 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 418 transitions.
[2023-11-01 17:51:31,734 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5507246376811594
[2023-11-01 17:51:31,734 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 418 transitions.
[2023-11-01 17:51:31,734 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 418 transitions.
[2023-11-01 17:51:31,734 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 17:51:31,735 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 418 transitions.
[2023-11-01 17:51:31,735 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-01 17:51:31,736 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-01 17:51:31,737 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-01 17:51:31,737 INFO  L175             Difference]: Start difference. First operand has 57 places, 52 transitions, 235 flow. Second operand 3 states and 418 transitions.
[2023-11-01 17:51:31,737 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 80 transitions, 508 flow
[2023-11-01 17:51:31,744 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 80 transitions, 503 flow, removed 2 selfloop flow, removed 1 redundant places.
[2023-11-01 17:51:31,745 INFO  L231             Difference]: Finished difference. Result has 58 places, 60 transitions, 334 flow
[2023-11-01 17:51:31,745 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-01 17:51:31,746 INFO  L288   CegarLoopForPetriNet]: 45 programPoint places, 13 predicate places.
[2023-11-01 17:51:31,746 INFO  L495      AbstractCegarLoop]: Abstraction has has 58 places, 60 transitions, 334 flow
[2023-11-01 17:51:31,746 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-01 17:51:31,746 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 17:51:31,746 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-01 17:51:31,746 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2023-11-01 17:51:31,747 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-01 17:51:31,747 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 17:51:31,747 INFO  L85        PathProgramCache]: Analyzing trace with hash 585262481, now seen corresponding path program 1 times
[2023-11-01 17:51:31,747 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 17:51:31,747 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993037535]
[2023-11-01 17:51:31,747 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:51:31,748 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 17:51:31,758 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 17:51:31,807 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-01 17:51:31,807 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 17:51:31,808 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993037535]
[2023-11-01 17:51:31,808 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993037535] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-01 17:51:31,808 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-01 17:51:31,808 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-01 17:51:31,808 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158395977]
[2023-11-01 17:51:31,808 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-01 17:51:31,809 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-01 17:51:31,809 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 17:51:31,809 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-01 17:51:31,809 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-01 17:51:31,824 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 123 out of 253
[2023-11-01 17:51:31,825 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-01 17:51:31,825 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 17:51:31,825 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 253
[2023-11-01 17:51:31,825 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 17:51:32,048 INFO  L130       PetriNetUnfolder]: 857/2028 cut-off events.
[2023-11-01 17:51:32,049 INFO  L131       PetriNetUnfolder]: For 2518/2528 co-relation queries the response was YES.
[2023-11-01 17:51:32,052 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-01 17:51:32,055 INFO  L137   encePairwiseOnDemand]: 247/253 looper letters, 47 selfloop transitions, 7 changer transitions 0/65 dead transitions.
[2023-11-01 17:51:32,055 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 65 transitions, 437 flow
[2023-11-01 17:51:32,056 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-01 17:51:32,056 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-01 17:51:32,057 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 412 transitions.
[2023-11-01 17:51:32,057 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5428194993412385
[2023-11-01 17:51:32,057 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 412 transitions.
[2023-11-01 17:51:32,057 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 412 transitions.
[2023-11-01 17:51:32,058 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 17:51:32,058 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 412 transitions.
[2023-11-01 17:51:32,059 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-01 17:51:32,060 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-01 17:51:32,060 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-01 17:51:32,061 INFO  L175             Difference]: Start difference. First operand has 58 places, 60 transitions, 334 flow. Second operand 3 states and 412 transitions.
[2023-11-01 17:51:32,061 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 65 transitions, 437 flow
[2023-11-01 17:51:32,064 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 65 transitions, 429 flow, removed 2 selfloop flow, removed 1 redundant places.
[2023-11-01 17:51:32,065 INFO  L231             Difference]: Finished difference. Result has 59 places, 50 transitions, 252 flow
[2023-11-01 17:51:32,065 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-01 17:51:32,066 INFO  L288   CegarLoopForPetriNet]: 45 programPoint places, 14 predicate places.
[2023-11-01 17:51:32,066 INFO  L495      AbstractCegarLoop]: Abstraction has has 59 places, 50 transitions, 252 flow
[2023-11-01 17:51:32,066 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-01 17:51:32,066 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 17:51:32,067 INFO  L209   CegarLoopForPetriNet]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1]
[2023-11-01 17:51:32,067 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2023-11-01 17:51:32,067 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-01 17:51:32,067 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 17:51:32,067 INFO  L85        PathProgramCache]: Analyzing trace with hash -1108884398, now seen corresponding path program 1 times
[2023-11-01 17:51:32,067 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 17:51:32,068 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520204591]
[2023-11-01 17:51:32,068 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:51:32,068 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 17:51:32,089 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-01 17:51:32,090 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-11-01 17:51:32,100 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-01 17:51:32,104 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-11-01 17:51:32,105 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-11-01 17:51:32,105 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining)
[2023-11-01 17:51:32,105 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining)
[2023-11-01 17:51:32,105 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining)
[2023-11-01 17:51:32,105 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining)
[2023-11-01 17:51:32,106 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining)
[2023-11-01 17:51:32,106 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining)
[2023-11-01 17:51:32,106 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining)
[2023-11-01 17:51:32,106 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining)
[2023-11-01 17:51:32,106 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining)
[2023-11-01 17:51:32,106 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining)
[2023-11-01 17:51:32,107 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2023-11-01 17:51:32,107 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1]
[2023-11-01 17:51:32,107 WARN  L233   ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-11-01 17:51:32,107 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances.
[2023-11-01 17:51:32,121 INFO  L144    ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions.
[2023-11-01 17:51:32,123 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 157 places, 155 transitions, 354 flow
[2023-11-01 17:51:32,183 INFO  L130       PetriNetUnfolder]: 43/824 cut-off events.
[2023-11-01 17:51:32,184 INFO  L131       PetriNetUnfolder]: For 48/48 co-relation queries the response was YES.
[2023-11-01 17:51:32,185 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-01 17:51:32,186 INFO  L82        GeneralOperation]: Start removeDead. Operand has 157 places, 155 transitions, 354 flow
[2023-11-01 17:51:32,188 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 157 places, 155 transitions, 354 flow
[2023-11-01 17:51:32,188 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-11-01 17:51:32,188 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 157 places, 155 transitions, 354 flow
[2023-11-01 17:51:32,188 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 157 places, 155 transitions, 354 flow
[2023-11-01 17:51:32,188 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 157 places, 155 transitions, 354 flow
[2023-11-01 17:51:32,274 INFO  L130       PetriNetUnfolder]: 43/824 cut-off events.
[2023-11-01 17:51:32,274 INFO  L131       PetriNetUnfolder]: For 48/48 co-relation queries the response was YES.
[2023-11-01 17:51:32,276 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-01 17:51:32,289 INFO  L119        LiptonReduction]: Number of co-enabled transitions 9464
[2023-11-01 17:51:36,161 INFO  L134        LiptonReduction]: Checked pairs total: 22521
[2023-11-01 17:51:36,162 INFO  L136        LiptonReduction]: Total number of compositions: 122
[2023-11-01 17:51:36,164 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-01 17:51:36,165 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;@7abce646, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-11-01 17:51:36,166 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 11 error locations.
[2023-11-01 17:51:36,167 INFO  L130       PetriNetUnfolder]: 0/3 cut-off events.
[2023-11-01 17:51:36,167 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-11-01 17:51:36,167 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 17:51:36,168 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1]
[2023-11-01 17:51:36,168 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-01 17:51:36,168 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 17:51:36,168 INFO  L85        PathProgramCache]: Analyzing trace with hash 38078, now seen corresponding path program 1 times
[2023-11-01 17:51:36,168 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 17:51:36,169 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389703334]
[2023-11-01 17:51:36,169 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:51:36,169 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 17:51:36,173 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 17:51:36,176 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-01 17:51:36,176 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 17:51:36,177 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389703334]
[2023-11-01 17:51:36,177 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389703334] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-01 17:51:36,177 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-01 17:51:36,177 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2023-11-01 17:51:36,177 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747688143]
[2023-11-01 17:51:36,177 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-01 17:51:36,178 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-11-01 17:51:36,178 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 17:51:36,178 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-11-01 17:51:36,178 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-11-01 17:51:36,179 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 144 out of 277
[2023-11-01 17:51:36,179 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-01 17:51:36,179 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 17:51:36,179 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 277
[2023-11-01 17:51:36,179 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 17:51:39,208 INFO  L130       PetriNetUnfolder]: 36913/53898 cut-off events.
[2023-11-01 17:51:39,208 INFO  L131       PetriNetUnfolder]: For 5118/5118 co-relation queries the response was YES.
[2023-11-01 17:51:39,272 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-01 17:51:39,444 INFO  L137   encePairwiseOnDemand]: 273/277 looper letters, 35 selfloop transitions, 0 changer transitions 0/45 dead transitions.
[2023-11-01 17:51:39,445 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 45 transitions, 204 flow
[2023-11-01 17:51:39,446 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-11-01 17:51:39,446 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-11-01 17:51:39,447 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 327 transitions.
[2023-11-01 17:51:39,447 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5902527075812274
[2023-11-01 17:51:39,447 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 327 transitions.
[2023-11-01 17:51:39,447 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 327 transitions.
[2023-11-01 17:51:39,448 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 17:51:39,448 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 327 transitions.
[2023-11-01 17:51:39,448 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-01 17:51:39,449 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-01 17:51:39,450 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-01 17:51:39,450 INFO  L175             Difference]: Start difference. First operand has 54 places, 49 transitions, 142 flow. Second operand 2 states and 327 transitions.
[2023-11-01 17:51:39,450 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 45 transitions, 204 flow
[2023-11-01 17:51:39,452 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 45 transitions, 204 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-01 17:51:39,452 INFO  L231             Difference]: Finished difference. Result has 51 places, 45 transitions, 134 flow
[2023-11-01 17:51:39,453 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-01 17:51:39,453 INFO  L288   CegarLoopForPetriNet]: 54 programPoint places, -3 predicate places.
[2023-11-01 17:51:39,453 INFO  L495      AbstractCegarLoop]: Abstraction has has 51 places, 45 transitions, 134 flow
[2023-11-01 17:51:39,454 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-01 17:51:39,454 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 17:51:39,454 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1]
[2023-11-01 17:51:39,454 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2023-11-01 17:51:39,454 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-01 17:51:39,455 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 17:51:39,455 INFO  L85        PathProgramCache]: Analyzing trace with hash 36575772, now seen corresponding path program 1 times
[2023-11-01 17:51:39,455 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 17:51:39,455 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505979757]
[2023-11-01 17:51:39,455 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:51:39,455 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 17:51:39,462 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 17:51:39,475 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-01 17:51:39,475 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 17:51:39,475 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505979757]
[2023-11-01 17:51:39,475 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505979757] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-01 17:51:39,476 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-01 17:51:39,476 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-01 17:51:39,476 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746557693]
[2023-11-01 17:51:39,476 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-01 17:51:39,476 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-01 17:51:39,477 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 17:51:39,477 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-01 17:51:39,477 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-01 17:51:39,501 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 137 out of 277
[2023-11-01 17:51:39,502 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-01 17:51:39,502 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 17:51:39,502 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 277
[2023-11-01 17:51:39,502 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 17:51:44,803 INFO  L130       PetriNetUnfolder]: 73069/103628 cut-off events.
[2023-11-01 17:51:44,803 INFO  L131       PetriNetUnfolder]: For 5920/5920 co-relation queries the response was YES.
[2023-11-01 17:51:44,930 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-01 17:51:45,221 INFO  L137   encePairwiseOnDemand]: 270/277 looper letters, 54 selfloop transitions, 6 changer transitions 0/67 dead transitions.
[2023-11-01 17:51:45,221 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 67 transitions, 298 flow
[2023-11-01 17:51:45,222 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-01 17:51:45,222 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-01 17:51:45,223 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 472 transitions.
[2023-11-01 17:51:45,223 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5679903730445247
[2023-11-01 17:51:45,223 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 472 transitions.
[2023-11-01 17:51:45,224 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 472 transitions.
[2023-11-01 17:51:45,224 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 17:51:45,224 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 472 transitions.
[2023-11-01 17:51:45,225 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-01 17:51:45,226 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-01 17:51:45,226 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-01 17:51:45,226 INFO  L175             Difference]: Start difference. First operand has 51 places, 45 transitions, 134 flow. Second operand 3 states and 472 transitions.
[2023-11-01 17:51:45,227 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 67 transitions, 298 flow
[2023-11-01 17:51:45,228 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 67 transitions, 298 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-01 17:51:45,229 INFO  L231             Difference]: Finished difference. Result has 55 places, 50 transitions, 180 flow
[2023-11-01 17:51:45,229 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-01 17:51:45,230 INFO  L288   CegarLoopForPetriNet]: 54 programPoint places, 1 predicate places.
[2023-11-01 17:51:45,230 INFO  L495      AbstractCegarLoop]: Abstraction has has 55 places, 50 transitions, 180 flow
[2023-11-01 17:51:45,230 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-01 17:51:45,230 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 17:51:45,231 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-11-01 17:51:45,231 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2023-11-01 17:51:45,231 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-01 17:51:45,231 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 17:51:45,231 INFO  L85        PathProgramCache]: Analyzing trace with hash 176595664, now seen corresponding path program 1 times
[2023-11-01 17:51:45,231 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 17:51:45,232 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228944606]
[2023-11-01 17:51:45,232 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:51:45,232 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 17:51:45,244 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 17:51:45,262 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-01 17:51:45,262 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 17:51:45,262 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228944606]
[2023-11-01 17:51:45,263 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228944606] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-01 17:51:45,263 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-01 17:51:45,263 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-01 17:51:45,264 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51734009]
[2023-11-01 17:51:45,264 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-01 17:51:45,264 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-01 17:51:45,265 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 17:51:45,265 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-01 17:51:45,266 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-01 17:51:45,287 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 135 out of 277
[2023-11-01 17:51:45,288 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-01 17:51:45,289 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 17:51:45,289 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 277
[2023-11-01 17:51:45,289 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 17:51:52,653 INFO  L130       PetriNetUnfolder]: 89848/128539 cut-off events.
[2023-11-01 17:51:52,653 INFO  L131       PetriNetUnfolder]: For 37185/37185 co-relation queries the response was YES.
[2023-11-01 17:51:52,859 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-01 17:51:53,296 INFO  L137   encePairwiseOnDemand]: 269/277 looper letters, 63 selfloop transitions, 11 changer transitions 0/83 dead transitions.
[2023-11-01 17:51:53,296 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 83 transitions, 446 flow
[2023-11-01 17:51:53,297 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-01 17:51:53,297 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-01 17:51:53,298 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 473 transitions.
[2023-11-01 17:51:53,299 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5691937424789411
[2023-11-01 17:51:53,299 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 473 transitions.
[2023-11-01 17:51:53,299 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 473 transitions.
[2023-11-01 17:51:53,299 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 17:51:53,299 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 473 transitions.
[2023-11-01 17:51:53,300 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-01 17:51:53,301 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-01 17:51:53,302 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-01 17:51:53,302 INFO  L175             Difference]: Start difference. First operand has 55 places, 50 transitions, 180 flow. Second operand 3 states and 473 transitions.
[2023-11-01 17:51:53,302 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 83 transitions, 446 flow
[2023-11-01 17:51:56,058 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 83 transitions, 426 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-01 17:51:56,060 INFO  L231             Difference]: Finished difference. Result has 57 places, 59 transitions, 264 flow
[2023-11-01 17:51:56,060 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-01 17:51:56,060 INFO  L288   CegarLoopForPetriNet]: 54 programPoint places, 3 predicate places.
[2023-11-01 17:51:56,061 INFO  L495      AbstractCegarLoop]: Abstraction has has 57 places, 59 transitions, 264 flow
[2023-11-01 17:51:56,061 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-01 17:51:56,061 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 17:51:56,061 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-01 17:51:56,061 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2023-11-01 17:51:56,062 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-01 17:51:56,062 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 17:51:56,062 INFO  L85        PathProgramCache]: Analyzing trace with hash -756770437, now seen corresponding path program 1 times
[2023-11-01 17:51:56,062 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 17:51:56,063 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017081073]
[2023-11-01 17:51:56,063 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:51:56,063 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 17:51:56,075 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 17:51:56,130 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-01 17:51:56,130 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 17:51:56,130 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017081073]
[2023-11-01 17:51:56,131 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017081073] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-01 17:51:56,131 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [282413922]
[2023-11-01 17:51:56,131 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:51:56,131 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-01 17:51:56,131 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-01 17:51:56,132 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-01 17:51:56,134 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-01 17:51:56,244 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 17:51:56,246 INFO  L263         TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 4 conjunts are in the unsatisfiable core
[2023-11-01 17:51:56,248 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-01 17:51:56,294 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-01 17:51:56,294 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-01 17:51:56,336 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-01 17:51:56,337 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [282413922] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-01 17:51:56,337 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-01 17:51:56,337 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8
[2023-11-01 17:51:56,337 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939658062]
[2023-11-01 17:51:56,338 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-01 17:51:56,338 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2023-11-01 17:51:56,339 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 17:51:56,339 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2023-11-01 17:51:56,340 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2023-11-01 17:51:56,437 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 134 out of 277
[2023-11-01 17:51:56,438 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-01 17:51:56,438 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 17:51:56,438 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 277
[2023-11-01 17:51:56,438 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 17:52:01,197 INFO  L130       PetriNetUnfolder]: 51304/76067 cut-off events.
[2023-11-01 17:52:01,197 INFO  L131       PetriNetUnfolder]: For 54745/60542 co-relation queries the response was YES.
[2023-11-01 17:52:01,324 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-01 17:52:01,563 INFO  L137   encePairwiseOnDemand]: 270/277 looper letters, 100 selfloop transitions, 7 changer transitions 4/123 dead transitions.
[2023-11-01 17:52:01,563 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 123 transitions, 720 flow
[2023-11-01 17:52:01,564 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2023-11-01 17:52:01,564 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2023-11-01 17:52:01,566 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1162 transitions.
[2023-11-01 17:52:01,566 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5243682310469314
[2023-11-01 17:52:01,566 INFO  L72            ComplementDD]: Start complementDD. Operand 8 states and 1162 transitions.
[2023-11-01 17:52:01,567 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 8 states and 1162 transitions.
[2023-11-01 17:52:01,567 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 17:52:01,567 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1162 transitions.
[2023-11-01 17:52:01,569 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-01 17:52:01,571 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-01 17:52:01,572 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-01 17:52:01,572 INFO  L175             Difference]: Start difference. First operand has 57 places, 59 transitions, 264 flow. Second operand 8 states and 1162 transitions.
[2023-11-01 17:52:01,572 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 123 transitions, 720 flow
[2023-11-01 17:52:01,647 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 123 transitions, 676 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-01 17:52:01,648 INFO  L231             Difference]: Finished difference. Result has 66 places, 63 transitions, 287 flow
[2023-11-01 17:52:01,648 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-01 17:52:01,649 INFO  L288   CegarLoopForPetriNet]: 54 programPoint places, 12 predicate places.
[2023-11-01 17:52:01,649 INFO  L495      AbstractCegarLoop]: Abstraction has has 66 places, 63 transitions, 287 flow
[2023-11-01 17:52:01,650 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-01 17:52:01,650 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 17:52:01,650 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-01 17:52:01,657 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-01 17:52:01,850 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-01 17:52:01,851 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-01 17:52:01,851 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 17:52:01,851 INFO  L85        PathProgramCache]: Analyzing trace with hash 707331847, now seen corresponding path program 1 times
[2023-11-01 17:52:01,852 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 17:52:01,852 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734150221]
[2023-11-01 17:52:01,852 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:52:01,852 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 17:52:01,866 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 17:52:01,885 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-01 17:52:01,886 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 17:52:01,886 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734150221]
[2023-11-01 17:52:01,886 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734150221] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-01 17:52:01,886 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-01 17:52:01,886 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-01 17:52:01,886 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352936669]
[2023-11-01 17:52:01,887 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-01 17:52:01,887 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-01 17:52:01,887 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 17:52:01,887 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-01 17:52:01,887 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-01 17:52:01,914 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 135 out of 277
[2023-11-01 17:52:01,915 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-01 17:52:01,915 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 17:52:01,915 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 277
[2023-11-01 17:52:01,915 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 17:52:08,243 INFO  L130       PetriNetUnfolder]: 70386/102764 cut-off events.
[2023-11-01 17:52:08,244 INFO  L131       PetriNetUnfolder]: For 75691/77037 co-relation queries the response was YES.
[2023-11-01 17:52:08,520 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-01 17:52:08,894 INFO  L137   encePairwiseOnDemand]: 270/277 looper letters, 76 selfloop transitions, 17 changer transitions 0/102 dead transitions.
[2023-11-01 17:52:08,894 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 102 transitions, 656 flow
[2023-11-01 17:52:08,895 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-01 17:52:08,896 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-01 17:52:08,897 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 471 transitions.
[2023-11-01 17:52:08,897 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5667870036101083
[2023-11-01 17:52:08,897 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 471 transitions.
[2023-11-01 17:52:08,897 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 471 transitions.
[2023-11-01 17:52:08,898 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 17:52:08,898 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 471 transitions.
[2023-11-01 17:52:08,899 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-01 17:52:08,900 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-01 17:52:08,900 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-01 17:52:08,901 INFO  L175             Difference]: Start difference. First operand has 66 places, 63 transitions, 287 flow. Second operand 3 states and 471 transitions.
[2023-11-01 17:52:08,901 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 102 transitions, 656 flow
[2023-11-01 17:52:09,048 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 102 transitions, 651 flow, removed 2 selfloop flow, removed 1 redundant places.
[2023-11-01 17:52:09,049 INFO  L231             Difference]: Finished difference. Result has 67 places, 76 transitions, 441 flow
[2023-11-01 17:52:09,049 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-01 17:52:09,050 INFO  L288   CegarLoopForPetriNet]: 54 programPoint places, 13 predicate places.
[2023-11-01 17:52:09,050 INFO  L495      AbstractCegarLoop]: Abstraction has has 67 places, 76 transitions, 441 flow
[2023-11-01 17:52:09,050 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-01 17:52:09,051 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 17:52:09,051 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-01 17:52:09,051 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2023-11-01 17:52:09,051 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-01 17:52:09,051 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 17:52:09,052 INFO  L85        PathProgramCache]: Analyzing trace with hash -191335336, now seen corresponding path program 1 times
[2023-11-01 17:52:09,052 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 17:52:09,052 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418294315]
[2023-11-01 17:52:09,052 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:52:09,052 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 17:52:09,066 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 17:52:09,110 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-01 17:52:09,110 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 17:52:09,111 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418294315]
[2023-11-01 17:52:09,111 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418294315] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-01 17:52:09,111 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-01 17:52:09,112 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-01 17:52:09,112 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872131033]
[2023-11-01 17:52:09,112 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-01 17:52:09,112 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-01 17:52:09,113 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 17:52:09,113 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-01 17:52:09,114 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-01 17:52:09,138 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 135 out of 277
[2023-11-01 17:52:09,139 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-01 17:52:09,139 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 17:52:09,139 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 277
[2023-11-01 17:52:09,139 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 17:52:09,967 INFO  L130       PetriNetUnfolder]: 3849/8671 cut-off events.
[2023-11-01 17:52:09,967 INFO  L131       PetriNetUnfolder]: For 11095/11133 co-relation queries the response was YES.
[2023-11-01 17:52:09,983 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-01 17:52:10,001 INFO  L137   encePairwiseOnDemand]: 269/277 looper letters, 55 selfloop transitions, 9 changer transitions 0/76 dead transitions.
[2023-11-01 17:52:10,002 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 76 transitions, 517 flow
[2023-11-01 17:52:10,003 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-01 17:52:10,003 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-01 17:52:10,003 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 458 transitions.
[2023-11-01 17:52:10,004 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5511432009626955
[2023-11-01 17:52:10,004 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 458 transitions.
[2023-11-01 17:52:10,004 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 458 transitions.
[2023-11-01 17:52:10,004 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 17:52:10,004 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 458 transitions.
[2023-11-01 17:52:10,005 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-01 17:52:10,006 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-01 17:52:10,007 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-01 17:52:10,007 INFO  L175             Difference]: Start difference. First operand has 67 places, 76 transitions, 441 flow. Second operand 3 states and 458 transitions.
[2023-11-01 17:52:10,007 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 76 transitions, 517 flow
[2023-11-01 17:52:10,023 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 76 transitions, 509 flow, removed 2 selfloop flow, removed 1 redundant places.
[2023-11-01 17:52:10,024 INFO  L231             Difference]: Finished difference. Result has 68 places, 59 transitions, 300 flow
[2023-11-01 17:52:10,024 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-01 17:52:10,024 INFO  L288   CegarLoopForPetriNet]: 54 programPoint places, 14 predicate places.
[2023-11-01 17:52:10,025 INFO  L495      AbstractCegarLoop]: Abstraction has has 68 places, 59 transitions, 300 flow
[2023-11-01 17:52:10,025 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-01 17:52:10,025 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 17:52:10,025 INFO  L209   CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-01 17:52:10,025 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2023-11-01 17:52:10,026 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-01 17:52:10,026 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 17:52:10,026 INFO  L85        PathProgramCache]: Analyzing trace with hash 266652888, now seen corresponding path program 1 times
[2023-11-01 17:52:10,026 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 17:52:10,026 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853276640]
[2023-11-01 17:52:10,026 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:52:10,027 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 17:52:10,037 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 17:52:10,053 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-01 17:52:10,054 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 17:52:10,054 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853276640]
[2023-11-01 17:52:10,054 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853276640] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-01 17:52:10,054 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-01 17:52:10,054 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-01 17:52:10,055 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533233091]
[2023-11-01 17:52:10,055 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-01 17:52:10,055 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-01 17:52:10,055 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 17:52:10,056 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-01 17:52:10,056 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-01 17:52:10,076 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 135 out of 277
[2023-11-01 17:52:10,076 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-01 17:52:10,077 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 17:52:10,077 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 277
[2023-11-01 17:52:10,077 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 17:52:10,822 INFO  L130       PetriNetUnfolder]: 4013/9119 cut-off events.
[2023-11-01 17:52:10,823 INFO  L131       PetriNetUnfolder]: For 11263/11301 co-relation queries the response was YES.
[2023-11-01 17:52:10,835 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-01 17:52:10,849 INFO  L137   encePairwiseOnDemand]: 273/277 looper letters, 60 selfloop transitions, 4 changer transitions 0/73 dead transitions.
[2023-11-01 17:52:10,849 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 73 transitions, 502 flow
[2023-11-01 17:52:10,850 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-01 17:52:10,850 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-01 17:52:10,850 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 455 transitions.
[2023-11-01 17:52:10,851 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5475330926594465
[2023-11-01 17:52:10,851 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 455 transitions.
[2023-11-01 17:52:10,851 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 455 transitions.
[2023-11-01 17:52:10,851 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 17:52:10,851 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 455 transitions.
[2023-11-01 17:52:10,852 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-01 17:52:10,853 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-01 17:52:10,853 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-01 17:52:10,854 INFO  L175             Difference]: Start difference. First operand has 68 places, 59 transitions, 300 flow. Second operand 3 states and 455 transitions.
[2023-11-01 17:52:10,854 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 73 transitions, 502 flow
[2023-11-01 17:52:10,861 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 73 transitions, 493 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-11-01 17:52:10,863 INFO  L231             Difference]: Finished difference. Result has 70 places, 61 transitions, 321 flow
[2023-11-01 17:52:10,863 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-01 17:52:10,863 INFO  L288   CegarLoopForPetriNet]: 54 programPoint places, 16 predicate places.
[2023-11-01 17:52:10,863 INFO  L495      AbstractCegarLoop]: Abstraction has has 70 places, 61 transitions, 321 flow
[2023-11-01 17:52:10,864 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-01 17:52:10,864 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 17:52:10,864 INFO  L209   CegarLoopForPetriNet]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1]
[2023-11-01 17:52:10,864 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2023-11-01 17:52:10,864 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-01 17:52:10,864 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 17:52:10,865 INFO  L85        PathProgramCache]: Analyzing trace with hash -578019697, now seen corresponding path program 1 times
[2023-11-01 17:52:10,865 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 17:52:10,865 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490125044]
[2023-11-01 17:52:10,865 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:52:10,865 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 17:52:10,889 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-01 17:52:10,889 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-11-01 17:52:10,900 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-01 17:52:10,906 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-11-01 17:52:10,906 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-11-01 17:52:10,906 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining)
[2023-11-01 17:52:10,906 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining)
[2023-11-01 17:52:10,907 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining)
[2023-11-01 17:52:10,907 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining)
[2023-11-01 17:52:10,907 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining)
[2023-11-01 17:52:10,907 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining)
[2023-11-01 17:52:10,907 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining)
[2023-11-01 17:52:10,907 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining)
[2023-11-01 17:52:10,908 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining)
[2023-11-01 17:52:10,908 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining)
[2023-11-01 17:52:10,908 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining)
[2023-11-01 17:52:10,908 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2023-11-01 17:52:10,908 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-01 17:52:10,909 WARN  L233   ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-11-01 17:52:10,909 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances.
[2023-11-01 17:52:10,926 INFO  L144    ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions.
[2023-11-01 17:52:10,928 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 174 places, 171 transitions, 402 flow
[2023-11-01 17:52:11,073 INFO  L130       PetriNetUnfolder]: 93/1515 cut-off events.
[2023-11-01 17:52:11,073 INFO  L131       PetriNetUnfolder]: For 110/110 co-relation queries the response was YES.
[2023-11-01 17:52:11,078 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-01 17:52:11,079 INFO  L82        GeneralOperation]: Start removeDead. Operand has 174 places, 171 transitions, 402 flow
[2023-11-01 17:52:11,082 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 174 places, 171 transitions, 402 flow
[2023-11-01 17:52:11,083 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-11-01 17:52:11,083 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 171 transitions, 402 flow
[2023-11-01 17:52:11,083 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 174 places, 171 transitions, 402 flow
[2023-11-01 17:52:11,083 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 174 places, 171 transitions, 402 flow
[2023-11-01 17:52:11,207 INFO  L130       PetriNetUnfolder]: 93/1515 cut-off events.
[2023-11-01 17:52:11,207 INFO  L131       PetriNetUnfolder]: For 110/110 co-relation queries the response was YES.
[2023-11-01 17:52:11,212 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-01 17:52:11,228 INFO  L119        LiptonReduction]: Number of co-enabled transitions 13020
[2023-11-01 17:52:15,361 INFO  L134        LiptonReduction]: Checked pairs total: 31156
[2023-11-01 17:52:15,362 INFO  L136        LiptonReduction]: Total number of compositions: 130
[2023-11-01 17:52:15,363 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-01 17:52:15,364 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;@7abce646, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-11-01 17:52:15,364 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 12 error locations.
[2023-11-01 17:52:15,365 INFO  L130       PetriNetUnfolder]: 0/2 cut-off events.
[2023-11-01 17:52:15,365 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-11-01 17:52:15,365 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 17:52:15,366 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1]
[2023-11-01 17:52:15,366 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-01 17:52:15,366 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 17:52:15,366 INFO  L85        PathProgramCache]: Analyzing trace with hash 48217, now seen corresponding path program 1 times
[2023-11-01 17:52:15,367 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 17:52:15,367 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377819366]
[2023-11-01 17:52:15,367 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:52:15,367 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 17:52:15,372 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 17:52:15,375 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-01 17:52:15,375 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 17:52:15,375 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377819366]
[2023-11-01 17:52:15,375 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377819366] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-01 17:52:15,375 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-01 17:52:15,375 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2023-11-01 17:52:15,376 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126391413]
[2023-11-01 17:52:15,376 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-01 17:52:15,376 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-11-01 17:52:15,376 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 17:52:15,376 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-11-01 17:52:15,376 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-11-01 17:52:15,377 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 158 out of 301
[2023-11-01 17:52:15,377 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-01 17:52:15,377 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 17:52:15,377 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 301
[2023-11-01 17:52:15,378 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 17:52:30,915 INFO  L130       PetriNetUnfolder]: 191348/272230 cut-off events.
[2023-11-01 17:52:30,915 INFO  L131       PetriNetUnfolder]: For 32242/32242 co-relation queries the response was YES.
[2023-11-01 17:52:31,339 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-01 17:52:32,275 INFO  L137   encePairwiseOnDemand]: 297/301 looper letters, 39 selfloop transitions, 0 changer transitions 0/53 dead transitions.
[2023-11-01 17:52:32,276 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 53 transitions, 244 flow
[2023-11-01 17:52:32,277 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-11-01 17:52:32,277 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-11-01 17:52:32,277 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 359 transitions.
[2023-11-01 17:52:32,278 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5963455149501661
[2023-11-01 17:52:32,278 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 359 transitions.
[2023-11-01 17:52:32,278 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 359 transitions.
[2023-11-01 17:52:32,278 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 17:52:32,278 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 359 transitions.
[2023-11-01 17:52:32,279 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-01 17:52:32,280 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-01 17:52:32,280 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-01 17:52:32,280 INFO  L175             Difference]: Start difference. First operand has 63 places, 57 transitions, 174 flow. Second operand 2 states and 359 transitions.
[2023-11-01 17:52:32,280 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 53 transitions, 244 flow
[2023-11-01 17:52:32,283 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 53 transitions, 244 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-01 17:52:32,284 INFO  L231             Difference]: Finished difference. Result has 60 places, 53 transitions, 166 flow
[2023-11-01 17:52:32,284 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-01 17:52:32,284 INFO  L288   CegarLoopForPetriNet]: 63 programPoint places, -3 predicate places.
[2023-11-01 17:52:32,285 INFO  L495      AbstractCegarLoop]: Abstraction has has 60 places, 53 transitions, 166 flow
[2023-11-01 17:52:32,285 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-01 17:52:32,285 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 17:52:32,285 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1]
[2023-11-01 17:52:32,285 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2023-11-01 17:52:32,285 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-01 17:52:32,286 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 17:52:32,286 INFO  L85        PathProgramCache]: Analyzing trace with hash 46331455, now seen corresponding path program 1 times
[2023-11-01 17:52:32,286 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 17:52:32,286 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876930602]
[2023-11-01 17:52:32,286 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:52:32,286 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 17:52:32,292 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 17:52:32,302 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 17:52:32,302 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 17:52:32,302 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876930602]
[2023-11-01 17:52:32,303 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876930602] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-01 17:52:32,303 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-01 17:52:32,303 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-01 17:52:32,303 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583465506]
[2023-11-01 17:52:32,303 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-01 17:52:32,303 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-01 17:52:32,303 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 17:52:32,304 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-01 17:52:32,304 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-01 17:52:32,327 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 150 out of 301
[2023-11-01 17:52:32,328 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-01 17:52:32,328 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 17:52:32,328 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 301
[2023-11-01 17:52:32,328 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 17:53:06,333 INFO  L130       PetriNetUnfolder]: 464032/631928 cut-off events.
[2023-11-01 17:53:06,333 INFO  L131       PetriNetUnfolder]: For 43112/43112 co-relation queries the response was YES.
[2023-11-01 17:53:07,386 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-01 17:53:10,049 INFO  L137   encePairwiseOnDemand]: 293/301 looper letters, 61 selfloop transitions, 7 changer transitions 0/78 dead transitions.
[2023-11-01 17:53:10,049 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 78 transitions, 352 flow
[2023-11-01 17:53:10,050 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-01 17:53:10,050 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-01 17:53:10,051 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 519 transitions.
[2023-11-01 17:53:10,051 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.574750830564784
[2023-11-01 17:53:10,051 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 519 transitions.
[2023-11-01 17:53:10,051 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 519 transitions.
[2023-11-01 17:53:10,052 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 17:53:10,052 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 519 transitions.
[2023-11-01 17:53:10,053 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-01 17:53:10,054 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-01 17:53:10,054 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-01 17:53:10,054 INFO  L175             Difference]: Start difference. First operand has 60 places, 53 transitions, 166 flow. Second operand 3 states and 519 transitions.
[2023-11-01 17:53:10,054 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 78 transitions, 352 flow
[2023-11-01 17:53:10,057 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 78 transitions, 352 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-01 17:53:10,058 INFO  L231             Difference]: Finished difference. Result has 64 places, 59 transitions, 220 flow
[2023-11-01 17:53:10,058 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-01 17:53:10,059 INFO  L288   CegarLoopForPetriNet]: 63 programPoint places, 1 predicate places.
[2023-11-01 17:53:10,059 INFO  L495      AbstractCegarLoop]: Abstraction has has 64 places, 59 transitions, 220 flow
[2023-11-01 17:53:10,059 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-01 17:53:10,059 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 17:53:10,060 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-11-01 17:53:10,060 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2023-11-01 17:53:10,060 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-01 17:53:10,060 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 17:53:10,060 INFO  L85        PathProgramCache]: Analyzing trace with hash -1316280505, now seen corresponding path program 1 times
[2023-11-01 17:53:10,060 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 17:53:10,061 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565620135]
[2023-11-01 17:53:10,061 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:53:10,061 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 17:53:10,068 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 17:53:10,078 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-01 17:53:10,078 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 17:53:10,078 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565620135]
[2023-11-01 17:53:10,078 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565620135] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-01 17:53:10,079 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-01 17:53:10,079 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-01 17:53:10,079 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589528897]
[2023-11-01 17:53:10,079 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-01 17:53:10,079 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-01 17:53:10,079 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 17:53:10,080 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-01 17:53:10,080 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-01 17:53:10,106 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 148 out of 301
[2023-11-01 17:53:10,107 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-01 17:53:10,107 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 17:53:10,107 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 301
[2023-11-01 17:53:10,107 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 17:54:03,731 INFO  L130       PetriNetUnfolder]: 616853/841972 cut-off events.
[2023-11-01 17:54:03,731 INFO  L131       PetriNetUnfolder]: For 291438/291438 co-relation queries the response was YES.
[2023-11-01 17:54:05,679 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-01 17:54:09,183 INFO  L137   encePairwiseOnDemand]: 292/301 looper letters, 74 selfloop transitions, 13 changer transitions 0/99 dead transitions.
[2023-11-01 17:54:09,183 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 99 transitions, 546 flow
[2023-11-01 17:54:09,185 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-01 17:54:09,185 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-01 17:54:09,186 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 523 transitions.
[2023-11-01 17:54:09,186 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5791805094130675
[2023-11-01 17:54:09,186 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 523 transitions.
[2023-11-01 17:54:09,186 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 523 transitions.
[2023-11-01 17:54:09,187 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 17:54:09,187 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 523 transitions.
[2023-11-01 17:54:09,187 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-01 17:54:09,188 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-01 17:54:09,189 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-01 17:54:09,189 INFO  L175             Difference]: Start difference. First operand has 64 places, 59 transitions, 220 flow. Second operand 3 states and 523 transitions.
[2023-11-01 17:54:09,189 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 99 transitions, 546 flow
[2023-11-01 17:57:07,710 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 99 transitions, 522 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-01 17:57:07,712 INFO  L231             Difference]: Finished difference. Result has 66 places, 70 transitions, 322 flow
[2023-11-01 17:57:07,712 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-01 17:57:07,713 INFO  L288   CegarLoopForPetriNet]: 63 programPoint places, 3 predicate places.
[2023-11-01 17:57:07,713 INFO  L495      AbstractCegarLoop]: Abstraction has has 66 places, 70 transitions, 322 flow
[2023-11-01 17:57:07,713 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-01 17:57:07,713 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 17:57:07,714 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-01 17:57:07,714 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2023-11-01 17:57:07,714 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-01 17:57:07,714 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 17:57:07,715 INFO  L85        PathProgramCache]: Analyzing trace with hash -1287319553, now seen corresponding path program 1 times
[2023-11-01 17:57:07,715 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 17:57:07,715 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692956385]
[2023-11-01 17:57:07,715 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:57:07,715 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 17:57:07,741 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 17:57:07,793 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-01 17:57:07,793 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 17:57:07,793 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692956385]
[2023-11-01 17:57:07,793 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692956385] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-01 17:57:07,794 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [711693815]
[2023-11-01 17:57:07,794 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:57:07,794 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-01 17:57:07,794 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-01 17:57:07,797 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-01 17:57:07,799 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-01 17:57:07,911 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 17:57:07,912 INFO  L263         TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 4 conjunts are in the unsatisfiable core
[2023-11-01 17:57:07,913 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-01 17:57:07,952 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-01 17:57:07,952 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-01 17:57:07,984 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-01 17:57:07,984 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [711693815] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-01 17:57:07,985 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-01 17:57:07,985 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8
[2023-11-01 17:57:07,985 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910575099]
[2023-11-01 17:57:07,985 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-01 17:57:07,985 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2023-11-01 17:57:07,986 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 17:57:07,986 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2023-11-01 17:57:07,986 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2023-11-01 17:57:08,075 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 148 out of 301
[2023-11-01 17:57:08,076 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-01 17:57:08,076 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 17:57:08,076 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 301
[2023-11-01 17:57:08,076 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 17:57:20,455 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-01 17:57:20,455 INFO  L383   tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event
[2023-11-01 17:57:20,456 INFO  L386   tUnfolder$Statistics]:   existing Event has 36 ancestors and is cut-off event
[2023-11-01 17:57:20,456 INFO  L386   tUnfolder$Statistics]:   existing Event has 36 ancestors and is cut-off event
[2023-11-01 17:57:20,456 INFO  L386   tUnfolder$Statistics]:   existing Event has 36 ancestors and is cut-off event
[2023-11-01 17:57:22,343 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-01 17:57:22,343 INFO  L383   tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event
[2023-11-01 17:57:22,343 INFO  L386   tUnfolder$Statistics]:   existing Event has 37 ancestors and is cut-off event
[2023-11-01 17:57:22,343 INFO  L386   tUnfolder$Statistics]:   existing Event has 37 ancestors and is cut-off event
[2023-11-01 17:57:22,344 INFO  L386   tUnfolder$Statistics]:   existing Event has 37 ancestors and is cut-off event
[2023-11-01 17:57:23,648 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-01 17:57:23,648 INFO  L383   tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event
[2023-11-01 17:57:23,648 INFO  L386   tUnfolder$Statistics]:   existing Event has 38 ancestors and is cut-off event
[2023-11-01 17:57:23,648 INFO  L386   tUnfolder$Statistics]:   existing Event has 38 ancestors and is cut-off event
[2023-11-01 17:57:23,648 INFO  L386   tUnfolder$Statistics]:   existing Event has 38 ancestors and is cut-off event
[2023-11-01 17:57:25,208 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-01 17:57:25,208 INFO  L383   tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event
[2023-11-01 17:57:25,208 INFO  L386   tUnfolder$Statistics]:   existing Event has 39 ancestors and is cut-off event
[2023-11-01 17:57:25,209 INFO  L386   tUnfolder$Statistics]:   existing Event has 39 ancestors and is cut-off event
[2023-11-01 17:57:25,209 INFO  L386   tUnfolder$Statistics]:   existing Event has 39 ancestors and is cut-off event
[2023-11-01 17:57:25,473 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-01 17:57:25,473 INFO  L383   tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event
[2023-11-01 17:57:25,473 INFO  L386   tUnfolder$Statistics]:   existing Event has 39 ancestors and is cut-off event
[2023-11-01 17:57:25,473 INFO  L386   tUnfolder$Statistics]:   existing Event has 39 ancestors and is cut-off event
[2023-11-01 17:57:25,473 INFO  L386   tUnfolder$Statistics]:   existing Event has 39 ancestors and is cut-off event
[2023-11-01 17:57:25,627 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-01 17:57:25,627 INFO  L383   tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event
[2023-11-01 17:57:25,627 INFO  L386   tUnfolder$Statistics]:   existing Event has 39 ancestors and is cut-off event
[2023-11-01 17:57:25,627 INFO  L386   tUnfolder$Statistics]:   existing Event has 39 ancestors and is cut-off event
[2023-11-01 17:57:25,627 INFO  L386   tUnfolder$Statistics]:   existing Event has 39 ancestors and is cut-off event
[2023-11-01 17:57:26,975 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-01 17:57:26,975 INFO  L383   tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event
[2023-11-01 17:57:26,975 INFO  L386   tUnfolder$Statistics]:   existing Event has 40 ancestors and is cut-off event
[2023-11-01 17:57:26,976 INFO  L386   tUnfolder$Statistics]:   existing Event has 40 ancestors and is cut-off event
[2023-11-01 17:57:26,976 INFO  L386   tUnfolder$Statistics]:   existing Event has 40 ancestors and is cut-off event
[2023-11-01 17:57:27,275 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-01 17:57:27,275 INFO  L383   tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event
[2023-11-01 17:57:27,275 INFO  L386   tUnfolder$Statistics]:   existing Event has 40 ancestors and is cut-off event
[2023-11-01 17:57:27,276 INFO  L386   tUnfolder$Statistics]:   existing Event has 40 ancestors and is cut-off event
[2023-11-01 17:57:27,276 INFO  L386   tUnfolder$Statistics]:   existing Event has 40 ancestors and is cut-off event
[2023-11-01 17:57:27,545 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-01 17:57:27,546 INFO  L383   tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event
[2023-11-01 17:57:27,546 INFO  L386   tUnfolder$Statistics]:   existing Event has 40 ancestors and is cut-off event
[2023-11-01 17:57:27,546 INFO  L386   tUnfolder$Statistics]:   existing Event has 40 ancestors and is cut-off event
[2023-11-01 17:57:27,546 INFO  L386   tUnfolder$Statistics]:   existing Event has 40 ancestors and is cut-off event
[2023-11-01 17:57:29,065 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-01 17:57:29,065 INFO  L383   tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event
[2023-11-01 17:57:29,065 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2023-11-01 17:57:29,065 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2023-11-01 17:57:29,066 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2023-11-01 17:57:29,483 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-01 17:57:29,483 INFO  L383   tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event
[2023-11-01 17:57:29,484 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2023-11-01 17:57:29,484 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2023-11-01 17:57:29,484 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2023-11-01 17:57:31,416 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-01 17:57:31,417 INFO  L383   tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event
[2023-11-01 17:57:31,417 INFO  L386   tUnfolder$Statistics]:   existing Event has 42 ancestors and is cut-off event
[2023-11-01 17:57:31,417 INFO  L386   tUnfolder$Statistics]:   existing Event has 42 ancestors and is cut-off event
[2023-11-01 17:57:31,417 INFO  L386   tUnfolder$Statistics]:   existing Event has 42 ancestors and is cut-off event
[2023-11-01 17:57:31,696 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-01 17:57:31,697 INFO  L383   tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event
[2023-11-01 17:57:31,697 INFO  L386   tUnfolder$Statistics]:   existing Event has 42 ancestors and is cut-off event
[2023-11-01 17:57:31,697 INFO  L386   tUnfolder$Statistics]:   existing Event has 42 ancestors and is cut-off event
[2023-11-01 17:57:31,697 INFO  L386   tUnfolder$Statistics]:   existing Event has 42 ancestors and is cut-off event
[2023-11-01 17:57:31,698 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-01 17:57:31,698 INFO  L383   tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event
[2023-11-01 17:57:31,698 INFO  L386   tUnfolder$Statistics]:   existing Event has 42 ancestors and is cut-off event
[2023-11-01 17:57:31,698 INFO  L386   tUnfolder$Statistics]:   existing Event has 42 ancestors and is cut-off event
[2023-11-01 17:57:31,699 INFO  L386   tUnfolder$Statistics]:   existing Event has 42 ancestors and is cut-off event
[2023-11-01 17:57:31,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, 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-01 17:57:31,971 INFO  L383   tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event
[2023-11-01 17:57:31,971 INFO  L386   tUnfolder$Statistics]:   existing Event has 42 ancestors and is cut-off event
[2023-11-01 17:57:31,972 INFO  L386   tUnfolder$Statistics]:   existing Event has 42 ancestors and is cut-off event
[2023-11-01 17:57:31,972 INFO  L386   tUnfolder$Statistics]:   existing Event has 42 ancestors and is cut-off event
[2023-11-01 17:57:33,949 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-01 17:57:33,950 INFO  L383   tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event
[2023-11-01 17:57:33,950 INFO  L386   tUnfolder$Statistics]:   existing Event has 43 ancestors and is cut-off event
[2023-11-01 17:57:33,950 INFO  L386   tUnfolder$Statistics]:   existing Event has 43 ancestors and is cut-off event
[2023-11-01 17:57:33,950 INFO  L386   tUnfolder$Statistics]:   existing Event has 43 ancestors and is cut-off event
[2023-11-01 17:57:33,950 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-01 17:57:33,951 INFO  L383   tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event
[2023-11-01 17:57:33,951 INFO  L386   tUnfolder$Statistics]:   existing Event has 43 ancestors and is cut-off event
[2023-11-01 17:57:33,951 INFO  L386   tUnfolder$Statistics]:   existing Event has 43 ancestors and is cut-off event
[2023-11-01 17:57:33,951 INFO  L386   tUnfolder$Statistics]:   existing Event has 43 ancestors and is cut-off event
[2023-11-01 17:57:34,149 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-01 17:57:34,150 INFO  L383   tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event
[2023-11-01 17:57:34,150 INFO  L386   tUnfolder$Statistics]:   existing Event has 43 ancestors and is cut-off event
[2023-11-01 17:57:34,150 INFO  L386   tUnfolder$Statistics]:   existing Event has 43 ancestors and is cut-off event
[2023-11-01 17:57:34,150 INFO  L386   tUnfolder$Statistics]:   existing Event has 43 ancestors and is cut-off event
[2023-11-01 17:57:35,820 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-01 17:57:35,821 INFO  L383   tUnfolder$Statistics]: this new event has 43 ancestors and is not cut-off event
[2023-11-01 17:57:35,821 INFO  L386   tUnfolder$Statistics]:   existing Event has 43 ancestors and is not cut-off event
[2023-11-01 17:57:35,821 INFO  L386   tUnfolder$Statistics]:   existing Event has 43 ancestors and is not cut-off event
[2023-11-01 17:57:35,821 INFO  L386   tUnfolder$Statistics]:   existing Event has 43 ancestors and is not cut-off event
[2023-11-01 17:57:35,839 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-01 17:57:35,840 INFO  L383   tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event
[2023-11-01 17:57:35,840 INFO  L386   tUnfolder$Statistics]:   existing Event has 44 ancestors and is cut-off event
[2023-11-01 17:57:35,840 INFO  L386   tUnfolder$Statistics]:   existing Event has 44 ancestors and is cut-off event
[2023-11-01 17:57:35,840 INFO  L386   tUnfolder$Statistics]:   existing Event has 44 ancestors and is cut-off event
[2023-11-01 17:57:36,075 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-01 17:57:36,076 INFO  L383   tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event
[2023-11-01 17:57:36,076 INFO  L386   tUnfolder$Statistics]:   existing Event has 44 ancestors and is cut-off event
[2023-11-01 17:57:36,076 INFO  L386   tUnfolder$Statistics]:   existing Event has 44 ancestors and is cut-off event
[2023-11-01 17:57:36,076 INFO  L386   tUnfolder$Statistics]:   existing Event has 44 ancestors and is cut-off event
[2023-11-01 17:57:36,076 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-01 17:57:36,076 INFO  L383   tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event
[2023-11-01 17:57:36,077 INFO  L386   tUnfolder$Statistics]:   existing Event has 44 ancestors and is cut-off event
[2023-11-01 17:57:36,077 INFO  L386   tUnfolder$Statistics]:   existing Event has 44 ancestors and is cut-off event
[2023-11-01 17:57:36,077 INFO  L386   tUnfolder$Statistics]:   existing Event has 44 ancestors and is cut-off event
[2023-11-01 17:57:38,131 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-01 17:57:38,132 INFO  L383   tUnfolder$Statistics]: this new event has 45 ancestors and is cut-off event
[2023-11-01 17:57:38,132 INFO  L386   tUnfolder$Statistics]:   existing Event has 45 ancestors and is cut-off event
[2023-11-01 17:57:38,132 INFO  L386   tUnfolder$Statistics]:   existing Event has 45 ancestors and is cut-off event
[2023-11-01 17:57:38,132 INFO  L386   tUnfolder$Statistics]:   existing Event has 45 ancestors and is cut-off event
[2023-11-01 17:57:38,374 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-01 17:57:38,374 INFO  L383   tUnfolder$Statistics]: this new event has 45 ancestors and is cut-off event
[2023-11-01 17:57:38,374 INFO  L386   tUnfolder$Statistics]:   existing Event has 45 ancestors and is cut-off event
[2023-11-01 17:57:38,374 INFO  L386   tUnfolder$Statistics]:   existing Event has 45 ancestors and is cut-off event
[2023-11-01 17:57:38,374 INFO  L386   tUnfolder$Statistics]:   existing Event has 45 ancestors and is cut-off event
[2023-11-01 17:57:38,375 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-01 17:57:38,375 INFO  L383   tUnfolder$Statistics]: this new event has 45 ancestors and is cut-off event
[2023-11-01 17:57:38,375 INFO  L386   tUnfolder$Statistics]:   existing Event has 45 ancestors and is cut-off event
[2023-11-01 17:57:38,375 INFO  L386   tUnfolder$Statistics]:   existing Event has 45 ancestors and is cut-off event
[2023-11-01 17:57:38,375 INFO  L386   tUnfolder$Statistics]:   existing Event has 45 ancestors and is cut-off event
[2023-11-01 17:57:39,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], [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-01 17:57:39,269 INFO  L383   tUnfolder$Statistics]: this new event has 47 ancestors and is cut-off event
[2023-11-01 17:57:39,269 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is cut-off event
[2023-11-01 17:57:39,269 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is cut-off event
[2023-11-01 17:57:39,269 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is cut-off event
[2023-11-01 17:57:40,285 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-01 17:57:40,286 INFO  L383   tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event
[2023-11-01 17:57:40,286 INFO  L386   tUnfolder$Statistics]:   existing Event has 46 ancestors and is cut-off event
[2023-11-01 17:57:40,286 INFO  L386   tUnfolder$Statistics]:   existing Event has 46 ancestors and is cut-off event
[2023-11-01 17:57:40,286 INFO  L386   tUnfolder$Statistics]:   existing Event has 46 ancestors and is cut-off event
[2023-11-01 17:57:40,306 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-01 17:57:40,306 INFO  L383   tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event
[2023-11-01 17:57:40,306 INFO  L386   tUnfolder$Statistics]:   existing Event has 46 ancestors and is cut-off event
[2023-11-01 17:57:40,306 INFO  L386   tUnfolder$Statistics]:   existing Event has 46 ancestors and is cut-off event
[2023-11-01 17:57:40,307 INFO  L386   tUnfolder$Statistics]:   existing Event has 46 ancestors and is cut-off event
[2023-11-01 17:57:41,103 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-01 17:57:41,103 INFO  L383   tUnfolder$Statistics]: this new event has 48 ancestors and is cut-off event
[2023-11-01 17:57:41,103 INFO  L386   tUnfolder$Statistics]:   existing Event has 48 ancestors and is cut-off event
[2023-11-01 17:57:41,103 INFO  L386   tUnfolder$Statistics]:   existing Event has 48 ancestors and is cut-off event
[2023-11-01 17:57:41,104 INFO  L386   tUnfolder$Statistics]:   existing Event has 48 ancestors and is cut-off event
[2023-11-01 17:57:42,006 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-01 17:57:42,006 INFO  L383   tUnfolder$Statistics]: this new event has 46 ancestors and is not cut-off event
[2023-11-01 17:57:42,006 INFO  L386   tUnfolder$Statistics]:   existing Event has 46 ancestors and is not cut-off event
[2023-11-01 17:57:42,006 INFO  L386   tUnfolder$Statistics]:   existing Event has 46 ancestors and is not cut-off event
[2023-11-01 17:57:42,007 INFO  L386   tUnfolder$Statistics]:   existing Event has 46 ancestors and is not cut-off event
[2023-11-01 17:57:42,097 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-01 17:57:42,098 INFO  L383   tUnfolder$Statistics]: this new event has 47 ancestors and is cut-off event
[2023-11-01 17:57:42,098 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is cut-off event
[2023-11-01 17:57:42,098 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is cut-off event
[2023-11-01 17:57:42,098 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is cut-off event
[2023-11-01 17:57:42,098 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-01 17:57:42,099 INFO  L383   tUnfolder$Statistics]: this new event has 47 ancestors and is cut-off event
[2023-11-01 17:57:42,099 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is cut-off event
[2023-11-01 17:57:42,099 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is cut-off event
[2023-11-01 17:57:42,099 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is cut-off event
[2023-11-01 17:57:42,099 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-01 17:57:42,099 INFO  L383   tUnfolder$Statistics]: this new event has 47 ancestors and is cut-off event
[2023-11-01 17:57:42,099 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is cut-off event
[2023-11-01 17:57:42,099 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is cut-off event
[2023-11-01 17:57:42,100 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is cut-off event
[2023-11-01 17:57:42,100 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-01 17:57:42,100 INFO  L383   tUnfolder$Statistics]: this new event has 47 ancestors and is cut-off event
[2023-11-01 17:57:42,100 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is cut-off event
[2023-11-01 17:57:42,100 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is cut-off event
[2023-11-01 17:57:42,100 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is cut-off event
[2023-11-01 17:57:42,592 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-01 17:57:42,592 INFO  L383   tUnfolder$Statistics]: this new event has 49 ancestors and is cut-off event
[2023-11-01 17:57:42,593 INFO  L386   tUnfolder$Statistics]:   existing Event has 49 ancestors and is cut-off event
[2023-11-01 17:57:42,593 INFO  L386   tUnfolder$Statistics]:   existing Event has 49 ancestors and is cut-off event
[2023-11-01 17:57:42,593 INFO  L386   tUnfolder$Statistics]:   existing Event has 49 ancestors and is cut-off event
[2023-11-01 17:57:42,844 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-01 17:57:42,844 INFO  L383   tUnfolder$Statistics]: this new event has 48 ancestors and is cut-off event
[2023-11-01 17:57:42,844 INFO  L386   tUnfolder$Statistics]:   existing Event has 48 ancestors and is cut-off event
[2023-11-01 17:57:42,844 INFO  L386   tUnfolder$Statistics]:   existing Event has 48 ancestors and is cut-off event
[2023-11-01 17:57:42,844 INFO  L386   tUnfolder$Statistics]:   existing Event has 48 ancestors and is cut-off event
[2023-11-01 17:57:43,266 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-01 17:57:43,267 INFO  L383   tUnfolder$Statistics]: this new event has 47 ancestors and is not cut-off event
[2023-11-01 17:57:43,267 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is not cut-off event
[2023-11-01 17:57:43,267 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is not cut-off event
[2023-11-01 17:57:43,267 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is not cut-off event
[2023-11-01 17:57:43,399 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-01 17:57:43,399 INFO  L383   tUnfolder$Statistics]: this new event has 48 ancestors and is cut-off event
[2023-11-01 17:57:43,399 INFO  L386   tUnfolder$Statistics]:   existing Event has 48 ancestors and is cut-off event
[2023-11-01 17:57:43,399 INFO  L386   tUnfolder$Statistics]:   existing Event has 48 ancestors and is cut-off event
[2023-11-01 17:57:43,399 INFO  L386   tUnfolder$Statistics]:   existing Event has 48 ancestors and is cut-off event
[2023-11-01 17:57:43,400 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-01 17:57:43,400 INFO  L383   tUnfolder$Statistics]: this new event has 48 ancestors and is cut-off event
[2023-11-01 17:57:43,400 INFO  L386   tUnfolder$Statistics]:   existing Event has 48 ancestors and is cut-off event
[2023-11-01 17:57:43,400 INFO  L386   tUnfolder$Statistics]:   existing Event has 48 ancestors and is cut-off event
[2023-11-01 17:57:43,400 INFO  L386   tUnfolder$Statistics]:   existing Event has 48 ancestors and is cut-off event
[2023-11-01 17:57:44,062 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-01 17:57:44,062 INFO  L383   tUnfolder$Statistics]: this new event has 49 ancestors and is cut-off event
[2023-11-01 17:57:44,062 INFO  L386   tUnfolder$Statistics]:   existing Event has 49 ancestors and is cut-off event
[2023-11-01 17:57:44,062 INFO  L386   tUnfolder$Statistics]:   existing Event has 49 ancestors and is cut-off event
[2023-11-01 17:57:44,062 INFO  L386   tUnfolder$Statistics]:   existing Event has 49 ancestors and is cut-off event
[2023-11-01 17:57:44,393 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-01 17:57:44,393 INFO  L383   tUnfolder$Statistics]: this new event has 49 ancestors and is cut-off event
[2023-11-01 17:57:44,393 INFO  L386   tUnfolder$Statistics]:   existing Event has 49 ancestors and is cut-off event
[2023-11-01 17:57:44,393 INFO  L386   tUnfolder$Statistics]:   existing Event has 49 ancestors and is cut-off event
[2023-11-01 17:57:44,393 INFO  L386   tUnfolder$Statistics]:   existing Event has 49 ancestors and is cut-off event
[2023-11-01 17:57:46,932 INFO  L130       PetriNetUnfolder]: 398441/561241 cut-off events.
[2023-11-01 17:57:46,932 INFO  L131       PetriNetUnfolder]: For 471561/511562 co-relation queries the response was YES.
[2023-11-01 17:57:48,260 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-01 17:57:50,623 INFO  L137   encePairwiseOnDemand]: 294/301 looper letters, 105 selfloop transitions, 7 changer transitions 4/137 dead transitions.
[2023-11-01 17:57:50,623 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 137 transitions, 795 flow
[2023-11-01 17:57:50,624 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2023-11-01 17:57:50,625 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2023-11-01 17:57:50,626 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1283 transitions.
[2023-11-01 17:57:50,627 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5328073089700996
[2023-11-01 17:57:50,627 INFO  L72            ComplementDD]: Start complementDD. Operand 8 states and 1283 transitions.
[2023-11-01 17:57:50,627 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 8 states and 1283 transitions.
[2023-11-01 17:57:50,627 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 17:57:50,628 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1283 transitions.
[2023-11-01 17:57:50,629 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-01 17:57:50,631 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-01 17:57:50,631 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-01 17:57:50,632 INFO  L175             Difference]: Start difference. First operand has 66 places, 70 transitions, 322 flow. Second operand 8 states and 1283 transitions.
[2023-11-01 17:57:50,632 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 137 transitions, 795 flow
[2023-11-01 17:58:30,529 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 137 transitions, 745 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-01 17:58:30,531 INFO  L231             Difference]: Finished difference. Result has 75 places, 74 transitions, 341 flow
[2023-11-01 17:58:30,531 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-01 17:58:30,532 INFO  L288   CegarLoopForPetriNet]: 63 programPoint places, 12 predicate places.
[2023-11-01 17:58:30,532 INFO  L495      AbstractCegarLoop]: Abstraction has has 75 places, 74 transitions, 341 flow
[2023-11-01 17:58:30,532 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-01 17:58:30,532 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 17:58:30,532 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-01 17:58:30,541 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2023-11-01 17:58:30,733 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-01 17:58:30,734 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-01 17:58:30,735 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 17:58:30,735 INFO  L85        PathProgramCache]: Analyzing trace with hash 107845692, now seen corresponding path program 1 times
[2023-11-01 17:58:30,735 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 17:58:30,735 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719023933]
[2023-11-01 17:58:30,735 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:58:30,736 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 17:58:30,750 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 17:58:30,765 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-01 17:58:30,766 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 17:58:30,766 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719023933]
[2023-11-01 17:58:30,766 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719023933] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-01 17:58:30,766 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-01 17:58:30,766 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-01 17:58:30,766 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641367750]
[2023-11-01 17:58:30,766 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-01 17:58:30,767 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-01 17:58:30,767 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 17:58:30,767 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-01 17:58:30,767 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-01 17:58:30,803 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 148 out of 301
[2023-11-01 17:58:30,804 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-01 17:58:30,804 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 17:58:30,804 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 301
[2023-11-01 17:58:30,804 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 17:59:21,723 INFO  L130       PetriNetUnfolder]: 534677/740459 cut-off events.
[2023-11-01 17:59:21,724 INFO  L131       PetriNetUnfolder]: For 589460/602485 co-relation queries the response was YES.
[2023-11-01 17:59:23,819 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-01 17:59:27,058 INFO  L137   encePairwiseOnDemand]: 293/301 looper letters, 88 selfloop transitions, 21 changer transitions 0/121 dead transitions.
[2023-11-01 17:59:27,058 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 121 transitions, 788 flow
[2023-11-01 17:59:27,059 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-01 17:59:27,060 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-01 17:59:27,060 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 520 transitions.
[2023-11-01 17:59:27,061 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5758582502768549
[2023-11-01 17:59:27,061 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 520 transitions.
[2023-11-01 17:59:27,061 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 520 transitions.
[2023-11-01 17:59:27,061 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 17:59:27,061 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 520 transitions.
[2023-11-01 17:59:27,062 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-01 17:59:27,063 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-01 17:59:27,063 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-01 17:59:27,063 INFO  L175             Difference]: Start difference. First operand has 75 places, 74 transitions, 341 flow. Second operand 3 states and 520 transitions.
[2023-11-01 17:59:27,064 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 121 transitions, 788 flow
[2023-11-01 17:59:34,580 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 121 transitions, 783 flow, removed 2 selfloop flow, removed 1 redundant places.
[2023-11-01 17:59:34,581 INFO  L231             Difference]: Finished difference. Result has 76 places, 91 transitions, 539 flow
[2023-11-01 17:59:34,582 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=539, PETRI_PLACES=76, PETRI_TRANSITIONS=91}
[2023-11-01 17:59:34,582 INFO  L288   CegarLoopForPetriNet]: 63 programPoint places, 13 predicate places.
[2023-11-01 17:59:34,582 INFO  L495      AbstractCegarLoop]: Abstraction has has 76 places, 91 transitions, 539 flow
[2023-11-01 17:59:34,583 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  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-01 17:59:34,583 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 17:59:34,583 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-01 17:59:34,583 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2023-11-01 17:59:34,583 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 9 more)] ===
[2023-11-01 17:59:34,583 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 17:59:34,584 INFO  L85        PathProgramCache]: Analyzing trace with hash -578993535, now seen corresponding path program 1 times
[2023-11-01 17:59:34,584 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 17:59:34,584 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221955231]
[2023-11-01 17:59:34,584 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:59:34,584 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 17:59:34,594 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 17:59:34,711 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-01 17:59:34,711 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 17:59:34,712 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221955231]
[2023-11-01 17:59:34,712 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221955231] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-01 17:59:34,712 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-01 17:59:34,713 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-01 17:59:34,713 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543620912]
[2023-11-01 17:59:34,713 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-01 17:59:34,714 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-01 17:59:34,714 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 17:59:34,715 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-01 17:59:34,715 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-01 17:59:34,741 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 147 out of 301
[2023-11-01 17:59:34,742 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 91 transitions, 539 flow. Second operand  has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 17:59:34,742 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 17:59:34,742 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 301
[2023-11-01 17:59:34,742 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 17:59:37,287 INFO  L130       PetriNetUnfolder]: 14108/32304 cut-off events.
[2023-11-01 17:59:37,288 INFO  L131       PetriNetUnfolder]: For 45316/45446 co-relation queries the response was YES.
[2023-11-01 17:59:37,345 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 90932 conditions, 32304 events. 14108/32304 cut-off events. For 45316/45446 co-relation queries the response was YES. Maximal size of possible extension queue 1150. Compared 348443 event pairs, 3052 based on Foata normal form. 13415/44370 useless extension candidates. Maximal degree in co-relation 90916. Up to 20758 conditions per place. 
[2023-11-01 17:59:37,413 INFO  L137   encePairwiseOnDemand]: 291/301 looper letters, 59 selfloop transitions, 11 changer transitions 0/87 dead transitions.
[2023-11-01 17:59:37,413 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 87 transitions, 593 flow
[2023-11-01 17:59:37,414 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-01 17:59:37,415 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-01 17:59:37,415 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 501 transitions.
[2023-11-01 17:59:37,416 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5548172757475083
[2023-11-01 17:59:37,416 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 501 transitions.
[2023-11-01 17:59:37,416 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 501 transitions.
[2023-11-01 17:59:37,416 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 17:59:37,416 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 501 transitions.
[2023-11-01 17:59:37,417 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 167.0) internal successors, (501), 3 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 17:59:37,418 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-01 17:59:37,418 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-01 17:59:37,418 INFO  L175             Difference]: Start difference. First operand has 76 places, 91 transitions, 539 flow. Second operand 3 states and 501 transitions.
[2023-11-01 17:59:37,418 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 87 transitions, 593 flow
[2023-11-01 17:59:37,560 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 87 transitions, 585 flow, removed 2 selfloop flow, removed 1 redundant places.
[2023-11-01 17:59:37,561 INFO  L231             Difference]: Finished difference. Result has 77 places, 68 transitions, 350 flow
[2023-11-01 17:59:37,562 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=350, PETRI_PLACES=77, PETRI_TRANSITIONS=68}
[2023-11-01 17:59:37,562 INFO  L288   CegarLoopForPetriNet]: 63 programPoint places, 14 predicate places.
[2023-11-01 17:59:37,562 INFO  L495      AbstractCegarLoop]: Abstraction has has 77 places, 68 transitions, 350 flow
[2023-11-01 17:59:37,562 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 17:59:37,562 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 17:59:37,563 INFO  L209   CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-01 17:59:37,563 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2023-11-01 17:59:37,563 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 9 more)] ===
[2023-11-01 17:59:37,563 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 17:59:37,563 INFO  L85        PathProgramCache]: Analyzing trace with hash 1988096797, now seen corresponding path program 1 times
[2023-11-01 17:59:37,563 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 17:59:37,564 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971010704]
[2023-11-01 17:59:37,564 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:59:37,564 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 17:59:37,576 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 17:59:37,602 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-01 17:59:37,602 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 17:59:37,603 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971010704]
[2023-11-01 17:59:37,603 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971010704] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-01 17:59:37,603 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-01 17:59:37,604 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-01 17:59:37,604 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219940025]
[2023-11-01 17:59:37,604 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-01 17:59:37,605 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-01 17:59:37,605 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 17:59:37,606 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-01 17:59:37,607 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-01 17:59:37,643 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 148 out of 301
[2023-11-01 17:59:37,643 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 68 transitions, 350 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-01 17:59:37,643 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 17:59:37,644 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 301
[2023-11-01 17:59:37,644 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 17:59:40,271 INFO  L130       PetriNetUnfolder]: 14777/33295 cut-off events.
[2023-11-01 17:59:40,271 INFO  L131       PetriNetUnfolder]: For 45000/45134 co-relation queries the response was YES.
[2023-11-01 17:59:40,341 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 101732 conditions, 33295 events. 14777/33295 cut-off events. For 45000/45134 co-relation queries the response was YES. Maximal size of possible extension queue 1149. Compared 351986 event pairs, 11053 based on Foata normal form. 0/32304 useless extension candidates. Maximal degree in co-relation 101716. Up to 26148 conditions per place. 
[2023-11-01 17:59:40,415 INFO  L137   encePairwiseOnDemand]: 296/301 looper letters, 68 selfloop transitions, 5 changer transitions 0/85 dead transitions.
[2023-11-01 17:59:40,415 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 85 transitions, 592 flow
[2023-11-01 17:59:40,416 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-01 17:59:40,416 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-01 17:59:40,417 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 502 transitions.
[2023-11-01 17:59:40,417 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5559246954595792
[2023-11-01 17:59:40,418 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 502 transitions.
[2023-11-01 17:59:40,418 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 502 transitions.
[2023-11-01 17:59:40,418 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 17:59:40,418 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 502 transitions.
[2023-11-01 17:59:40,419 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 167.33333333333334) internal successors, (502), 3 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 17:59:40,420 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-01 17:59:40,420 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-01 17:59:40,420 INFO  L175             Difference]: Start difference. First operand has 77 places, 68 transitions, 350 flow. Second operand 3 states and 502 transitions.
[2023-11-01 17:59:40,420 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 85 transitions, 592 flow
[2023-11-01 17:59:40,453 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 85 transitions, 580 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-11-01 17:59:40,454 INFO  L231             Difference]: Finished difference. Result has 80 places, 71 transitions, 382 flow
[2023-11-01 17:59:40,454 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=382, PETRI_PLACES=80, PETRI_TRANSITIONS=71}
[2023-11-01 17:59:40,455 INFO  L288   CegarLoopForPetriNet]: 63 programPoint places, 17 predicate places.
[2023-11-01 17:59:40,455 INFO  L495      AbstractCegarLoop]: Abstraction has has 80 places, 71 transitions, 382 flow
[2023-11-01 17:59:40,455 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-01 17:59:40,455 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 17:59:40,455 INFO  L209   CegarLoopForPetriNet]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-01 17:59:40,456 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2023-11-01 17:59:40,456 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 9 more)] ===
[2023-11-01 17:59:40,456 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 17:59:40,456 INFO  L85        PathProgramCache]: Analyzing trace with hash 493467640, now seen corresponding path program 1 times
[2023-11-01 17:59:40,456 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 17:59:40,456 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238649475]
[2023-11-01 17:59:40,457 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:59:40,457 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 17:59:40,470 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 17:59:40,486 INFO  L134       CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked.
[2023-11-01 17:59:40,487 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 17:59:40,487 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238649475]
[2023-11-01 17:59:40,487 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238649475] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-01 17:59:40,487 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-01 17:59:40,487 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-01 17:59:40,488 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889077227]
[2023-11-01 17:59:40,488 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-01 17:59:40,488 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-01 17:59:40,489 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 17:59:40,489 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-01 17:59:40,489 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-01 17:59:40,519 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 148 out of 301
[2023-11-01 17:59:40,520 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 71 transitions, 382 flow. Second operand  has 3 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-01 17:59:40,520 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 17:59:40,520 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 301
[2023-11-01 17:59:40,520 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 17:59:43,202 INFO  L130       PetriNetUnfolder]: 15103/33809 cut-off events.
[2023-11-01 17:59:43,202 INFO  L131       PetriNetUnfolder]: For 55807/56006 co-relation queries the response was YES.
[2023-11-01 17:59:43,296 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 105704 conditions, 33809 events. 15103/33809 cut-off events. For 55807/56006 co-relation queries the response was YES. Maximal size of possible extension queue 1171. Compared 355968 event pairs, 10936 based on Foata normal form. 0/32769 useless extension candidates. Maximal degree in co-relation 105686. Up to 26824 conditions per place. 
[2023-11-01 17:59:43,371 INFO  L137   encePairwiseOnDemand]: 296/301 looper letters, 70 selfloop transitions, 5 changer transitions 0/87 dead transitions.
[2023-11-01 17:59:43,372 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 87 transitions, 618 flow
[2023-11-01 17:59:43,373 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-01 17:59:43,373 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-01 17:59:43,373 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 501 transitions.
[2023-11-01 17:59:43,374 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5548172757475083
[2023-11-01 17:59:43,374 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 501 transitions.
[2023-11-01 17:59:43,374 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 501 transitions.
[2023-11-01 17:59:43,374 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 17:59:43,374 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 501 transitions.
[2023-11-01 17:59:43,375 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 167.0) internal successors, (501), 3 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 17:59:43,376 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-01 17:59:43,376 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-01 17:59:43,376 INFO  L175             Difference]: Start difference. First operand has 80 places, 71 transitions, 382 flow. Second operand 3 states and 501 transitions.
[2023-11-01 17:59:43,377 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 87 transitions, 618 flow
[2023-11-01 17:59:43,466 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 87 transitions, 604 flow, removed 2 selfloop flow, removed 2 redundant places.
[2023-11-01 17:59:43,467 INFO  L231             Difference]: Finished difference. Result has 82 places, 74 transitions, 413 flow
[2023-11-01 17:59:43,467 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=368, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=413, PETRI_PLACES=82, PETRI_TRANSITIONS=74}
[2023-11-01 17:59:43,468 INFO  L288   CegarLoopForPetriNet]: 63 programPoint places, 19 predicate places.
[2023-11-01 17:59:43,468 INFO  L495      AbstractCegarLoop]: Abstraction has has 82 places, 74 transitions, 413 flow
[2023-11-01 17:59:43,468 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 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-01 17:59:43,468 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 17:59:43,468 INFO  L209   CegarLoopForPetriNet]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1]
[2023-11-01 17:59:43,469 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2023-11-01 17:59:43,469 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 9 more)] ===
[2023-11-01 17:59:43,469 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 17:59:43,469 INFO  L85        PathProgramCache]: Analyzing trace with hash -853322564, now seen corresponding path program 1 times
[2023-11-01 17:59:43,469 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 17:59:43,469 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417765967]
[2023-11-01 17:59:43,470 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:59:43,470 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 17:59:43,496 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-01 17:59:43,496 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-11-01 17:59:43,507 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-01 17:59:43,514 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-11-01 17:59:43,514 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-11-01 17:59:43,514 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 12 remaining)
[2023-11-01 17:59:43,514 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (10 of 12 remaining)
[2023-11-01 17:59:43,514 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (9 of 12 remaining)
[2023-11-01 17:59:43,515 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (8 of 12 remaining)
[2023-11-01 17:59:43,515 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (7 of 12 remaining)
[2023-11-01 17:59:43,515 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 12 remaining)
[2023-11-01 17:59:43,515 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 12 remaining)
[2023-11-01 17:59:43,515 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 12 remaining)
[2023-11-01 17:59:43,515 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 12 remaining)
[2023-11-01 17:59:43,516 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 12 remaining)
[2023-11-01 17:59:43,516 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 12 remaining)
[2023-11-01 17:59:43,516 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 12 remaining)
[2023-11-01 17:59:43,516 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2023-11-01 17:59:43,516 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-01 17:59:43,517 WARN  L233   ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-11-01 17:59:43,517 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances.
[2023-11-01 17:59:43,532 INFO  L144    ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions.
[2023-11-01 17:59:43,534 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 191 places, 187 transitions, 452 flow
[2023-11-01 17:59:43,833 INFO  L130       PetriNetUnfolder]: 207/2878 cut-off events.
[2023-11-01 17:59:43,834 INFO  L131       PetriNetUnfolder]: For 242/242 co-relation queries the response was YES.
[2023-11-01 17:59:43,847 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3110 conditions, 2878 events. 207/2878 cut-off events. For 242/242 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 19183 event pairs, 72 based on Foata normal form. 0/2466 useless extension candidates. Maximal degree in co-relation 1614. Up to 192 conditions per place. 
[2023-11-01 17:59:43,847 INFO  L82        GeneralOperation]: Start removeDead. Operand has 191 places, 187 transitions, 452 flow
[2023-11-01 17:59:43,855 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 191 places, 187 transitions, 452 flow
[2023-11-01 17:59:43,855 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-11-01 17:59:43,855 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 191 places, 187 transitions, 452 flow
[2023-11-01 17:59:43,856 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 191 places, 187 transitions, 452 flow
[2023-11-01 17:59:43,856 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 191 places, 187 transitions, 452 flow
[2023-11-01 17:59:44,158 INFO  L130       PetriNetUnfolder]: 207/2878 cut-off events.
[2023-11-01 17:59:44,158 INFO  L131       PetriNetUnfolder]: For 242/242 co-relation queries the response was YES.
[2023-11-01 17:59:44,171 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3110 conditions, 2878 events. 207/2878 cut-off events. For 242/242 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 19183 event pairs, 72 based on Foata normal form. 0/2466 useless extension candidates. Maximal degree in co-relation 1614. Up to 192 conditions per place. 
[2023-11-01 17:59:44,224 INFO  L119        LiptonReduction]: Number of co-enabled transitions 17052
[2023-11-01 17:59:49,053 INFO  L134        LiptonReduction]: Checked pairs total: 41776
[2023-11-01 17:59:49,053 INFO  L136        LiptonReduction]: Total number of compositions: 138
[2023-11-01 17:59:49,055 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-01 17:59:49,056 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;@7abce646, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-11-01 17:59:49,056 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 13 error locations.
[2023-11-01 17:59:49,057 INFO  L130       PetriNetUnfolder]: 0/2 cut-off events.
[2023-11-01 17:59:49,057 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-11-01 17:59:49,057 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 17:59:49,058 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1]
[2023-11-01 17:59:49,059 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-11-01 17:59:49,059 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 17:59:49,059 INFO  L85        PathProgramCache]: Analyzing trace with hash 59128, now seen corresponding path program 1 times
[2023-11-01 17:59:49,059 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 17:59:49,060 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977829584]
[2023-11-01 17:59:49,060 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:59:49,060 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 17:59:49,064 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 17:59:49,066 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-01 17:59:49,067 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 17:59:49,067 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977829584]
[2023-11-01 17:59:49,067 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977829584] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-01 17:59:49,067 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-01 17:59:49,067 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2023-11-01 17:59:49,067 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839215299]
[2023-11-01 17:59:49,067 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-01 17:59:49,068 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-11-01 17:59:49,068 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 17:59:49,068 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-11-01 17:59:49,068 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-11-01 17:59:49,069 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 172 out of 325
[2023-11-01 17:59:49,069 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 65 transitions, 208 flow. Second operand  has 2 states, 2 states have (on average 173.0) internal successors, (346), 2 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 17:59:49,069 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 17:59:49,069 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 325
[2023-11-01 17:59:49,069 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
Killed by 15
