./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-3.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-3.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 823c8bbbc717266df7f251162f585d17a8ba6d1a227f3e24b77e759ee8d293c2
--- Real Ultimate output ---
This is Ultimate 0.2.2-dev-2329fc7
[2024-03-11 23:00:23,757 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2024-03-11 23:00:23,759 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2024-03-11 23:00:23,781 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2024-03-11 23:00:23,781 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2024-03-11 23:00:23,782 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2024-03-11 23:00:23,783 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2024-03-11 23:00:23,784 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2024-03-11 23:00:23,785 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2024-03-11 23:00:23,786 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2024-03-11 23:00:23,787 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2024-03-11 23:00:23,788 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2024-03-11 23:00:23,788 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2024-03-11 23:00:23,789 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2024-03-11 23:00:23,789 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2024-03-11 23:00:23,790 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2024-03-11 23:00:23,791 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2024-03-11 23:00:23,792 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2024-03-11 23:00:23,793 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2024-03-11 23:00:23,794 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2024-03-11 23:00:23,795 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2024-03-11 23:00:23,796 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2024-03-11 23:00:23,797 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2024-03-11 23:00:23,798 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2024-03-11 23:00:23,800 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2024-03-11 23:00:23,800 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2024-03-11 23:00:23,800 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2024-03-11 23:00:23,801 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2024-03-11 23:00:23,801 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2024-03-11 23:00:23,802 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2024-03-11 23:00:23,802 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2024-03-11 23:00:23,803 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2024-03-11 23:00:23,803 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2024-03-11 23:00:23,804 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2024-03-11 23:00:23,805 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2024-03-11 23:00:23,805 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2024-03-11 23:00:23,806 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2024-03-11 23:00:23,806 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2024-03-11 23:00:23,806 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2024-03-11 23:00:23,807 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2024-03-11 23:00:23,808 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2024-03-11 23:00:23,809 INFO  L101        SettingsManager]: Beginning loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2024-03-11 23:00:23,830 INFO  L113        SettingsManager]: Loading preferences was successful
[2024-03-11 23:00:23,830 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2024-03-11 23:00:23,830 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-03-11 23:00:23,831 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-03-11 23:00:23,831 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-03-11 23:00:23,831 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-03-11 23:00:23,832 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-03-11 23:00:23,832 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2024-03-11 23:00:23,832 INFO  L138        SettingsManager]:  * Use SBE=true
[2024-03-11 23:00:23,832 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-03-11 23:00:23,832 INFO  L138        SettingsManager]:  * sizeof long=4
[2024-03-11 23:00:23,832 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2024-03-11 23:00:23,832 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-03-11 23:00:23,832 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2024-03-11 23:00:23,832 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2024-03-11 23:00:23,833 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-03-11 23:00:23,833 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-03-11 23:00:23,833 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-03-11 23:00:23,833 INFO  L138        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2024-03-11 23:00:23,833 INFO  L138        SettingsManager]:  * sizeof long double=12
[2024-03-11 23:00:23,833 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2024-03-11 23:00:23,833 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2024-03-11 23:00:23,833 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-03-11 23:00:23,833 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-03-11 23:00:23,834 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-03-11 23:00:23,834 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-03-11 23:00:23,834 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-03-11 23:00:23,834 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-03-11 23:00:23,834 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-03-11 23:00:23,834 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2024-03-11 23:00:23,834 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-03-11 23:00:23,834 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-03-11 23:00:23,835 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-03-11 23:00:23,835 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-03-11 23:00:23,835 INFO  L138        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-03-11 23:00:23,835 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-03-11 23:00:23,835 INFO  L138        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2024-03-11 23:00:23,835 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 -> 823c8bbbc717266df7f251162f585d17a8ba6d1a227f3e24b77e759ee8d293c2
[2024-03-11 23:00:24,011 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-03-11 23:00:24,037 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-03-11 23:00:24,040 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-03-11 23:00:24,041 INFO  L271        PluginConnector]: Initializing CDTParser...
[2024-03-11 23:00:24,042 INFO  L275        PluginConnector]: CDTParser initialized
[2024-03-11 23:00:24,043 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/thread-join-array-dynamic-race-3.i
[2024-03-11 23:00:24,941 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2024-03-11 23:00:25,172 INFO  L351              CDTParser]: Found 1 translation units.
[2024-03-11 23:00:25,172 INFO  L172              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/thread-join-array-dynamic-race-3.i
[2024-03-11 23:00:25,184 INFO  L394              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/c518b145c/652ca823437c4801b297092c6cbecd0b/FLAG1eaa3170d
[2024-03-11 23:00:25,196 INFO  L402              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/c518b145c/652ca823437c4801b297092c6cbecd0b
[2024-03-11 23:00:25,198 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-03-11 23:00:25,199 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-03-11 23:00:25,200 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-03-11 23:00:25,200 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-03-11 23:00:25,202 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-03-11 23:00:25,203 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 11:00:25" (1/1) ...
[2024-03-11 23:00:25,204 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74f0d894 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:00:25, skipping insertion in model container
[2024-03-11 23:00:25,204 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 11:00:25" (1/1) ...
[2024-03-11 23:00:25,209 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2024-03-11 23:00:25,244 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2024-03-11 23:00:25,363 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2024-03-11 23:00:25,541 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-03-11 23:00:25,550 INFO  L203         MainTranslator]: Completed pre-run
[2024-03-11 23:00:25,560 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2024-03-11 23:00:25,585 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-03-11 23:00:25,628 INFO  L208         MainTranslator]: Completed translation
[2024-03-11 23:00:25,628 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:00:25 WrapperNode
[2024-03-11 23:00:25,628 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-03-11 23:00:25,629 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-03-11 23:00:25,629 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-03-11 23:00:25,629 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2024-03-11 23:00:25,634 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:00:25" (1/1) ...
[2024-03-11 23:00:25,649 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:00:25" (1/1) ...
[2024-03-11 23:00:25,683 INFO  L138                Inliner]: procedures = 269, calls = 26, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 97
[2024-03-11 23:00:25,684 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-03-11 23:00:25,684 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-03-11 23:00:25,685 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2024-03-11 23:00:25,685 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2024-03-11 23:00:25,693 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:00:25" (1/1) ...
[2024-03-11 23:00:25,693 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:00:25" (1/1) ...
[2024-03-11 23:00:25,697 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:00:25" (1/1) ...
[2024-03-11 23:00:25,697 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:00:25" (1/1) ...
[2024-03-11 23:00:25,703 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:00:25" (1/1) ...
[2024-03-11 23:00:25,706 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:00:25" (1/1) ...
[2024-03-11 23:00:25,707 INFO  L185        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:00:25" (1/1) ...
[2024-03-11 23:00:25,708 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:00:25" (1/1) ...
[2024-03-11 23:00:25,710 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-03-11 23:00:25,711 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-03-11 23:00:25,711 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2024-03-11 23:00:25,711 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2024-03-11 23:00:25,712 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:00:25" (1/1) ...
[2024-03-11 23:00:25,716 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-03-11 23:00:25,723 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 23:00:25,734 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2024-03-11 23:00:25,737 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2024-03-11 23:00:25,777 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2024-03-11 23:00:25,777 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2024-03-11 23:00:25,778 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-03-11 23:00:25,778 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2024-03-11 23:00:25,778 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2024-03-11 23:00:25,778 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2024-03-11 23:00:25,778 INFO  L130     BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock
[2024-03-11 23:00:25,778 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2024-03-11 23:00:25,778 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-03-11 23:00:25,779 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2024-03-11 23:00:25,779 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2024-03-11 23:00:25,779 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2024-03-11 23:00:25,779 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-03-11 23:00:25,779 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-03-11 23:00:25,781 WARN  L209             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2024-03-11 23:00:25,910 INFO  L235             CfgBuilder]: Building ICFG
[2024-03-11 23:00:25,911 INFO  L261             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-03-11 23:00:26,103 INFO  L276             CfgBuilder]: Performing block encoding
[2024-03-11 23:00:26,109 INFO  L295             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-03-11 23:00:26,109 INFO  L300             CfgBuilder]: Removed 2 assume(true) statements.
[2024-03-11 23:00:26,110 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 11:00:26 BoogieIcfgContainer
[2024-03-11 23:00:26,110 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-03-11 23:00:26,112 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-03-11 23:00:26,112 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2024-03-11 23:00:26,114 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2024-03-11 23:00:26,114 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.03 11:00:25" (1/3) ...
[2024-03-11 23:00:26,115 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c279a15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 11:00:26, skipping insertion in model container
[2024-03-11 23:00:26,115 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:00:25" (2/3) ...
[2024-03-11 23:00:26,115 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c279a15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 11:00:26, skipping insertion in model container
[2024-03-11 23:00:26,115 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 11:00:26" (3/3) ...
[2024-03-11 23:00:26,116 INFO  L112   eAbstractionObserver]: Analyzing ICFG thread-join-array-dynamic-race-3.i
[2024-03-11 23:00:26,122 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2024-03-11 23:00:26,129 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-03-11 23:00:26,130 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations.
[2024-03-11 23:00:26,130 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-03-11 23:00:26,176 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2024-03-11 23:00:26,203 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 140 places, 139 transitions, 294 flow
[2024-03-11 23:00:26,288 INFO  L130       PetriNetUnfolder]: 9/297 cut-off events.
[2024-03-11 23:00:26,288 INFO  L131       PetriNetUnfolder]: For 4/4 co-relation queries the response was YES.
[2024-03-11 23:00:26,293 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 311 conditions, 297 events. 9/297 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 795 event pairs, 0 based on Foata normal form. 0/261 useless extension candidates. Maximal degree in co-relation 153. Up to 8 conditions per place. 
[2024-03-11 23:00:26,293 INFO  L82        GeneralOperation]: Start removeDead. Operand has 140 places, 139 transitions, 294 flow
[2024-03-11 23:00:26,297 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 139 places, 138 transitions, 290 flow
[2024-03-11 23:00:26,300 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2024-03-11 23:00:26,308 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 138 transitions, 290 flow
[2024-03-11 23:00:26,310 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 138 transitions, 290 flow
[2024-03-11 23:00:26,311 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 139 places, 138 transitions, 290 flow
[2024-03-11 23:00:26,348 INFO  L130       PetriNetUnfolder]: 9/297 cut-off events.
[2024-03-11 23:00:26,348 INFO  L131       PetriNetUnfolder]: For 4/4 co-relation queries the response was YES.
[2024-03-11 23:00:26,349 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 311 conditions, 297 events. 9/297 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 795 event pairs, 0 based on Foata normal form. 0/261 useless extension candidates. Maximal degree in co-relation 153. Up to 8 conditions per place. 
[2024-03-11 23:00:26,352 INFO  L119        LiptonReduction]: Number of co-enabled transitions 3780
[2024-03-11 23:00:31,321 INFO  L134        LiptonReduction]: Checked pairs total: 7148
[2024-03-11 23:00:31,322 INFO  L136        LiptonReduction]: Total number of compositions: 121
[2024-03-11 23:00:31,346 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-11 23:00:31,352 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;@4e3602e4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2024-03-11 23:00:31,353 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 11 error locations.
[2024-03-11 23:00:31,358 INFO  L130       PetriNetUnfolder]: 0/2 cut-off events.
[2024-03-11 23:00:31,358 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2024-03-11 23:00:31,359 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 23:00:31,359 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1]
[2024-03-11 23:00:31,360 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-11 23:00:31,364 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 23:00:31,365 INFO  L85        PathProgramCache]: Analyzing trace with hash 14459, now seen corresponding path program 1 times
[2024-03-11 23:00:31,371 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 23:00:31,371 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364412955]
[2024-03-11 23:00:31,371 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:00:31,372 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 23:00:31,464 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 23:00:31,513 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 23:00:31,514 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 23:00:31,514 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364412955]
[2024-03-11 23:00:31,515 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364412955] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 23:00:31,522 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 23:00:31,522 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-03-11 23:00:31,524 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589690996]
[2024-03-11 23:00:31,524 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 23:00:31,530 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-03-11 23:00:31,531 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 23:00:31,545 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-03-11 23:00:31,546 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-03-11 23:00:31,548 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 132 out of 260
[2024-03-11 23:00:31,550 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 34 transitions, 82 flow. Second operand  has 2 states, 2 states have (on average 133.0) internal successors, (266), 2 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:00:31,550 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 23:00:31,550 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 260
[2024-03-11 23:00:31,551 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 23:00:31,652 INFO  L130       PetriNetUnfolder]: 284/596 cut-off events.
[2024-03-11 23:00:31,653 INFO  L131       PetriNetUnfolder]: For 17/17 co-relation queries the response was YES.
[2024-03-11 23:00:31,654 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1153 conditions, 596 events. 284/596 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2903 event pairs, 277 based on Foata normal form. 0/525 useless extension candidates. Maximal degree in co-relation 957. Up to 524 conditions per place. 
[2024-03-11 23:00:31,657 INFO  L137   encePairwiseOnDemand]: 255/260 looper letters, 22 selfloop transitions, 0 changer transitions 0/29 dead transitions.
[2024-03-11 23:00:31,657 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 29 transitions, 116 flow
[2024-03-11 23:00:31,659 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-03-11 23:00:31,660 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2024-03-11 23:00:31,666 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 291 transitions.
[2024-03-11 23:00:31,668 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5596153846153846
[2024-03-11 23:00:31,668 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 291 transitions.
[2024-03-11 23:00:31,669 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 291 transitions.
[2024-03-11 23:00:31,670 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 23:00:31,672 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 291 transitions.
[2024-03-11 23:00:31,674 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 145.5) internal successors, (291), 2 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:00:31,678 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 260.0) internal successors, (780), 3 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:00:31,679 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 260.0) internal successors, (780), 3 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:00:31,680 INFO  L175             Difference]: Start difference. First operand has 38 places, 34 transitions, 82 flow. Second operand 2 states and 291 transitions.
[2024-03-11 23:00:31,681 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 29 transitions, 116 flow
[2024-03-11 23:00:31,684 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 29 transitions, 112 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-11 23:00:31,685 INFO  L231             Difference]: Finished difference. Result has 32 places, 29 transitions, 68 flow
[2024-03-11 23:00:31,686 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, 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=68, PETRI_PLACES=32, PETRI_TRANSITIONS=29}
[2024-03-11 23:00:31,689 INFO  L288   CegarLoopForPetriNet]: 38 programPoint places, -6 predicate places.
[2024-03-11 23:00:31,689 INFO  L495      AbstractCegarLoop]: Abstraction has has 32 places, 29 transitions, 68 flow
[2024-03-11 23:00:31,690 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 133.0) internal successors, (266), 2 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:00:31,690 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 23:00:31,690 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1]
[2024-03-11 23:00:31,690 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-03-11 23:00:31,691 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-11 23:00:31,691 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 23:00:31,691 INFO  L85        PathProgramCache]: Analyzing trace with hash 481227978, now seen corresponding path program 1 times
[2024-03-11 23:00:31,691 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 23:00:31,692 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767402248]
[2024-03-11 23:00:31,692 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:00:31,692 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 23:00:31,739 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-11 23:00:31,739 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-03-11 23:00:31,760 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-11 23:00:31,776 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-03-11 23:00:31,777 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-03-11 23:00:31,778 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining)
[2024-03-11 23:00:31,780 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining)
[2024-03-11 23:00:31,780 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining)
[2024-03-11 23:00:31,780 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining)
[2024-03-11 23:00:31,780 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining)
[2024-03-11 23:00:31,781 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining)
[2024-03-11 23:00:31,781 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining)
[2024-03-11 23:00:31,781 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 11 remaining)
[2024-03-11 23:00:31,781 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining)
[2024-03-11 23:00:31,781 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining)
[2024-03-11 23:00:31,782 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining)
[2024-03-11 23:00:31,782 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-03-11 23:00:31,782 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1]
[2024-03-11 23:00:31,784 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-03-11 23:00:31,784 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2024-03-11 23:00:31,803 INFO  L144    ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions.
[2024-03-11 23:00:31,806 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 174 places, 171 transitions, 378 flow
[2024-03-11 23:00:31,861 INFO  L130       PetriNetUnfolder]: 19/528 cut-off events.
[2024-03-11 23:00:31,862 INFO  L131       PetriNetUnfolder]: For 14/14 co-relation queries the response was YES.
[2024-03-11 23:00:31,863 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 558 conditions, 528 events. 19/528 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1809 event pairs, 1 based on Foata normal form. 0/462 useless extension candidates. Maximal degree in co-relation 553. Up to 16 conditions per place. 
[2024-03-11 23:00:31,863 INFO  L82        GeneralOperation]: Start removeDead. Operand has 174 places, 171 transitions, 378 flow
[2024-03-11 23:00:31,865 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 156 places, 154 transitions, 332 flow
[2024-03-11 23:00:31,865 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2024-03-11 23:00:31,865 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 156 places, 154 transitions, 332 flow
[2024-03-11 23:00:31,865 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 156 places, 154 transitions, 332 flow
[2024-03-11 23:00:31,865 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 156 places, 154 transitions, 332 flow
[2024-03-11 23:00:31,908 INFO  L130       PetriNetUnfolder]: 19/528 cut-off events.
[2024-03-11 23:00:31,908 INFO  L131       PetriNetUnfolder]: For 14/14 co-relation queries the response was YES.
[2024-03-11 23:00:31,910 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 557 conditions, 528 events. 19/528 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1809 event pairs, 1 based on Foata normal form. 0/462 useless extension candidates. Maximal degree in co-relation 306. Up to 16 conditions per place. 
[2024-03-11 23:00:31,916 INFO  L119        LiptonReduction]: Number of co-enabled transitions 6804
[2024-03-11 23:00:36,308 INFO  L134        LiptonReduction]: Checked pairs total: 14171
[2024-03-11 23:00:36,309 INFO  L136        LiptonReduction]: Total number of compositions: 128
[2024-03-11 23:00:36,312 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-11 23:00:36,314 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;@4e3602e4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2024-03-11 23:00:36,314 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 13 error locations.
[2024-03-11 23:00:36,316 INFO  L130       PetriNetUnfolder]: 0/1 cut-off events.
[2024-03-11 23:00:36,316 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2024-03-11 23:00:36,316 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 23:00:36,316 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1]
[2024-03-11 23:00:36,317 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-03-11 23:00:36,317 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 23:00:36,318 INFO  L85        PathProgramCache]: Analyzing trace with hash 24570, now seen corresponding path program 1 times
[2024-03-11 23:00:36,318 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 23:00:36,318 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626566654]
[2024-03-11 23:00:36,319 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:00:36,319 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 23:00:36,330 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 23:00:36,340 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 23:00:36,341 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 23:00:36,341 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626566654]
[2024-03-11 23:00:36,341 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626566654] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 23:00:36,341 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 23:00:36,341 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-03-11 23:00:36,341 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505984221]
[2024-03-11 23:00:36,342 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 23:00:36,342 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-03-11 23:00:36,342 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 23:00:36,342 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-03-11 23:00:36,343 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-03-11 23:00:36,343 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 160 out of 299
[2024-03-11 23:00:36,344 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 43 transitions, 110 flow. Second operand  has 2 states, 2 states have (on average 161.0) internal successors, (322), 2 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:00:36,344 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 23:00:36,344 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 299
[2024-03-11 23:00:36,344 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 23:00:36,727 INFO  L130       PetriNetUnfolder]: 3192/5385 cut-off events.
[2024-03-11 23:00:36,727 INFO  L131       PetriNetUnfolder]: For 286/286 co-relation queries the response was YES.
[2024-03-11 23:00:36,736 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10461 conditions, 5385 events. 3192/5385 cut-off events. For 286/286 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 32765 event pairs, 3143 based on Foata normal form. 0/4946 useless extension candidates. Maximal degree in co-relation 4036. Up to 4842 conditions per place. 
[2024-03-11 23:00:36,786 INFO  L137   encePairwiseOnDemand]: 294/299 looper letters, 29 selfloop transitions, 0 changer transitions 0/38 dead transitions.
[2024-03-11 23:00:36,786 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 38 transitions, 158 flow
[2024-03-11 23:00:36,787 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-03-11 23:00:36,787 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2024-03-11 23:00:36,788 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 354 transitions.
[2024-03-11 23:00:36,789 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5919732441471572
[2024-03-11 23:00:36,789 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 354 transitions.
[2024-03-11 23:00:36,789 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 354 transitions.
[2024-03-11 23:00:36,790 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 23:00:36,790 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 354 transitions.
[2024-03-11 23:00:36,791 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 177.0) internal successors, (354), 2 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:00:36,792 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 299.0) internal successors, (897), 3 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:00:36,793 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 299.0) internal successors, (897), 3 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:00:36,793 INFO  L175             Difference]: Start difference. First operand has 48 places, 43 transitions, 110 flow. Second operand 2 states and 354 transitions.
[2024-03-11 23:00:36,793 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 38 transitions, 158 flow
[2024-03-11 23:00:36,796 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 38 transitions, 154 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-11 23:00:36,796 INFO  L231             Difference]: Finished difference. Result has 42 places, 38 transitions, 96 flow
[2024-03-11 23:00:36,796 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=96, PETRI_PLACES=42, PETRI_TRANSITIONS=38}
[2024-03-11 23:00:36,797 INFO  L288   CegarLoopForPetriNet]: 48 programPoint places, -6 predicate places.
[2024-03-11 23:00:36,797 INFO  L495      AbstractCegarLoop]: Abstraction has has 42 places, 38 transitions, 96 flow
[2024-03-11 23:00:36,797 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 161.0) internal successors, (322), 2 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:00:36,797 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 23:00:36,797 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-03-11 23:00:36,798 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-03-11 23:00:36,798 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-03-11 23:00:36,798 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 23:00:36,798 INFO  L85        PathProgramCache]: Analyzing trace with hash 1233876068, now seen corresponding path program 1 times
[2024-03-11 23:00:36,798 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 23:00:36,798 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295187029]
[2024-03-11 23:00:36,798 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:00:36,798 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 23:00:36,812 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 23:00:36,841 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 23:00:36,842 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 23:00:36,842 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295187029]
[2024-03-11 23:00:36,842 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295187029] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 23:00:36,842 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 23:00:36,842 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-11 23:00:36,842 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645634913]
[2024-03-11 23:00:36,842 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 23:00:36,842 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-11 23:00:36,843 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 23:00:36,843 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-11 23:00:36,843 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-11 23:00:36,863 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 153 out of 299
[2024-03-11 23:00:36,864 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 38 transitions, 96 flow. Second operand  has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:00:36,864 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 23:00:36,864 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 299
[2024-03-11 23:00:36,864 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 23:00:37,570 INFO  L130       PetriNetUnfolder]: 6632/10525 cut-off events.
[2024-03-11 23:00:37,570 INFO  L131       PetriNetUnfolder]: For 202/202 co-relation queries the response was YES.
[2024-03-11 23:00:37,579 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20718 conditions, 10525 events. 6632/10525 cut-off events. For 202/202 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 64340 event pairs, 3912 based on Foata normal form. 0/9854 useless extension candidates. Maximal degree in co-relation 20713. Up to 6948 conditions per place. 
[2024-03-11 23:00:37,611 INFO  L137   encePairwiseOnDemand]: 293/299 looper letters, 44 selfloop transitions, 5 changer transitions 0/55 dead transitions.
[2024-03-11 23:00:37,611 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 55 transitions, 228 flow
[2024-03-11 23:00:37,612 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-11 23:00:37,612 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-11 23:00:37,613 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 509 transitions.
[2024-03-11 23:00:37,613 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5674470457079153
[2024-03-11 23:00:37,613 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 509 transitions.
[2024-03-11 23:00:37,614 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 509 transitions.
[2024-03-11 23:00:37,614 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 23:00:37,614 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 509 transitions.
[2024-03-11 23:00:37,616 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 169.66666666666666) internal successors, (509), 3 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:00:37,618 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 299.0) internal successors, (1196), 4 states have internal predecessors, (1196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:00:37,618 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 299.0) internal successors, (1196), 4 states have internal predecessors, (1196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:00:37,618 INFO  L175             Difference]: Start difference. First operand has 42 places, 38 transitions, 96 flow. Second operand 3 states and 509 transitions.
[2024-03-11 23:00:37,618 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 55 transitions, 228 flow
[2024-03-11 23:00:37,621 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 55 transitions, 228 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-11 23:00:37,621 INFO  L231             Difference]: Finished difference. Result has 46 places, 42 transitions, 134 flow
[2024-03-11 23:00:37,622 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=134, PETRI_PLACES=46, PETRI_TRANSITIONS=42}
[2024-03-11 23:00:37,622 INFO  L288   CegarLoopForPetriNet]: 48 programPoint places, -2 predicate places.
[2024-03-11 23:00:37,622 INFO  L495      AbstractCegarLoop]: Abstraction has has 46 places, 42 transitions, 134 flow
[2024-03-11 23:00:37,623 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:00:37,623 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 23:00:37,623 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2024-03-11 23:00:37,623 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-03-11 23:00:37,623 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-03-11 23:00:37,623 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 23:00:37,623 INFO  L85        PathProgramCache]: Analyzing trace with hash -407096971, now seen corresponding path program 1 times
[2024-03-11 23:00:37,624 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 23:00:37,624 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566469125]
[2024-03-11 23:00:37,624 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:00:37,624 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 23:00:37,635 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 23:00:37,653 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 23:00:37,653 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 23:00:37,653 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566469125]
[2024-03-11 23:00:37,653 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566469125] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 23:00:37,653 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 23:00:37,654 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-11 23:00:37,654 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552054915]
[2024-03-11 23:00:37,654 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 23:00:37,654 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-11 23:00:37,654 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 23:00:37,655 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-11 23:00:37,655 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-11 23:00:37,681 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 151 out of 299
[2024-03-11 23:00:37,682 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 42 transitions, 134 flow. Second operand  has 3 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:00:37,682 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 23:00:37,682 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 299
[2024-03-11 23:00:37,682 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 23:00:38,420 INFO  L130       PetriNetUnfolder]: 6916/11193 cut-off events.
[2024-03-11 23:00:38,420 INFO  L131       PetriNetUnfolder]: For 2972/2975 co-relation queries the response was YES.
[2024-03-11 23:00:38,436 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25195 conditions, 11193 events. 6916/11193 cut-off events. For 2972/2975 co-relation queries the response was YES. Maximal size of possible extension queue 474. Compared 73205 event pairs, 5175 based on Foata normal form. 0/10613 useless extension candidates. Maximal degree in co-relation 25188. Up to 9305 conditions per place. 
[2024-03-11 23:00:38,498 INFO  L137   encePairwiseOnDemand]: 293/299 looper letters, 46 selfloop transitions, 8 changer transitions 0/62 dead transitions.
[2024-03-11 23:00:38,498 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 62 transitions, 304 flow
[2024-03-11 23:00:38,499 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-11 23:00:38,499 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-11 23:00:38,500 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 503 transitions.
[2024-03-11 23:00:38,500 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5607580824972129
[2024-03-11 23:00:38,500 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 503 transitions.
[2024-03-11 23:00:38,500 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 503 transitions.
[2024-03-11 23:00:38,500 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 23:00:38,500 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 503 transitions.
[2024-03-11 23:00:38,501 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:00:38,503 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 299.0) internal successors, (1196), 4 states have internal predecessors, (1196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:00:38,503 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 299.0) internal successors, (1196), 4 states have internal predecessors, (1196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:00:38,504 INFO  L175             Difference]: Start difference. First operand has 46 places, 42 transitions, 134 flow. Second operand 3 states and 503 transitions.
[2024-03-11 23:00:38,504 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 62 transitions, 304 flow
[2024-03-11 23:00:38,527 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 62 transitions, 288 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-11 23:00:38,527 INFO  L231             Difference]: Finished difference. Result has 47 places, 48 transitions, 184 flow
[2024-03-11 23:00:38,528 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=184, PETRI_PLACES=47, PETRI_TRANSITIONS=48}
[2024-03-11 23:00:38,528 INFO  L288   CegarLoopForPetriNet]: 48 programPoint places, -1 predicate places.
[2024-03-11 23:00:38,528 INFO  L495      AbstractCegarLoop]: Abstraction has has 47 places, 48 transitions, 184 flow
[2024-03-11 23:00:38,529 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:00:38,529 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 23:00:38,529 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2024-03-11 23:00:38,529 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-03-11 23:00:38,529 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-03-11 23:00:38,529 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 23:00:38,529 INFO  L85        PathProgramCache]: Analyzing trace with hash -294648208, now seen corresponding path program 1 times
[2024-03-11 23:00:38,529 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 23:00:38,529 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427614962]
[2024-03-11 23:00:38,529 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:00:38,530 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 23:00:38,539 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 23:00:38,554 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 23:00:38,554 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 23:00:38,554 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427614962]
[2024-03-11 23:00:38,555 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427614962] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 23:00:38,555 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 23:00:38,555 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-11 23:00:38,555 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609988018]
[2024-03-11 23:00:38,555 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 23:00:38,555 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-11 23:00:38,555 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 23:00:38,555 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-11 23:00:38,556 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-11 23:00:38,572 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 151 out of 299
[2024-03-11 23:00:38,573 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 48 transitions, 184 flow. Second operand  has 3 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:00:38,573 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 23:00:38,574 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 299
[2024-03-11 23:00:38,574 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 23:00:39,417 INFO  L130       PetriNetUnfolder]: 8788/14055 cut-off events.
[2024-03-11 23:00:39,417 INFO  L131       PetriNetUnfolder]: For 7574/7807 co-relation queries the response was YES.
[2024-03-11 23:00:39,432 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 34388 conditions, 14055 events. 8788/14055 cut-off events. For 7574/7807 co-relation queries the response was YES. Maximal size of possible extension queue 642. Compared 94686 event pairs, 4894 based on Foata normal form. 0/13054 useless extension candidates. Maximal degree in co-relation 34380. Up to 10083 conditions per place. 
[2024-03-11 23:00:39,468 INFO  L137   encePairwiseOnDemand]: 292/299 looper letters, 56 selfloop transitions, 14 changer transitions 0/78 dead transitions.
[2024-03-11 23:00:39,469 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 78 transitions, 436 flow
[2024-03-11 23:00:39,469 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-11 23:00:39,469 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-11 23:00:39,470 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 509 transitions.
[2024-03-11 23:00:39,471 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5674470457079153
[2024-03-11 23:00:39,471 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 509 transitions.
[2024-03-11 23:00:39,471 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 509 transitions.
[2024-03-11 23:00:39,471 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 23:00:39,471 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 509 transitions.
[2024-03-11 23:00:39,473 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 169.66666666666666) internal successors, (509), 3 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:00:39,474 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 299.0) internal successors, (1196), 4 states have internal predecessors, (1196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:00:39,475 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 299.0) internal successors, (1196), 4 states have internal predecessors, (1196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:00:39,475 INFO  L175             Difference]: Start difference. First operand has 47 places, 48 transitions, 184 flow. Second operand 3 states and 509 transitions.
[2024-03-11 23:00:39,475 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 78 transitions, 436 flow
[2024-03-11 23:00:39,481 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 78 transitions, 422 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-11 23:00:39,482 INFO  L231             Difference]: Finished difference. Result has 50 places, 58 transitions, 306 flow
[2024-03-11 23:00:39,482 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=306, PETRI_PLACES=50, PETRI_TRANSITIONS=58}
[2024-03-11 23:00:39,483 INFO  L288   CegarLoopForPetriNet]: 48 programPoint places, 2 predicate places.
[2024-03-11 23:00:39,483 INFO  L495      AbstractCegarLoop]: Abstraction has has 50 places, 58 transitions, 306 flow
[2024-03-11 23:00:39,483 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:00:39,483 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 23:00:39,484 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 23:00:39,484 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-03-11 23:00:39,484 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-03-11 23:00:39,484 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 23:00:39,484 INFO  L85        PathProgramCache]: Analyzing trace with hash -347707743, now seen corresponding path program 1 times
[2024-03-11 23:00:39,484 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 23:00:39,484 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555193421]
[2024-03-11 23:00:39,484 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:00:39,485 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 23:00:39,499 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 23:00:39,560 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 23:00:39,560 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 23:00:39,560 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555193421]
[2024-03-11 23:00:39,560 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555193421] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 23:00:39,561 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 23:00:39,561 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-11 23:00:39,561 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722223919]
[2024-03-11 23:00:39,561 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 23:00:39,561 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-11 23:00:39,561 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 23:00:39,561 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-11 23:00:39,561 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-11 23:00:39,578 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 156 out of 299
[2024-03-11 23:00:39,579 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 58 transitions, 306 flow. Second operand  has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:00:39,579 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 23:00:39,579 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 299
[2024-03-11 23:00:39,579 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 23:00:40,324 INFO  L130       PetriNetUnfolder]: 7464/12294 cut-off events.
[2024-03-11 23:00:40,324 INFO  L131       PetriNetUnfolder]: For 13752/15067 co-relation queries the response was YES.
[2024-03-11 23:00:40,344 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 34432 conditions, 12294 events. 7464/12294 cut-off events. For 13752/15067 co-relation queries the response was YES. Maximal size of possible extension queue 588. Compared 85032 event pairs, 3817 based on Foata normal form. 218/11924 useless extension candidates. Maximal degree in co-relation 34423. Up to 10964 conditions per place. 
[2024-03-11 23:00:40,373 INFO  L137   encePairwiseOnDemand]: 296/299 looper letters, 49 selfloop transitions, 2 changer transitions 0/64 dead transitions.
[2024-03-11 23:00:40,374 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 64 transitions, 426 flow
[2024-03-11 23:00:40,374 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-11 23:00:40,374 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-11 23:00:40,375 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 504 transitions.
[2024-03-11 23:00:40,375 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5618729096989966
[2024-03-11 23:00:40,375 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 504 transitions.
[2024-03-11 23:00:40,375 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 504 transitions.
[2024-03-11 23:00:40,376 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 23:00:40,376 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 504 transitions.
[2024-03-11 23:00:40,377 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:00:40,378 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 299.0) internal successors, (1196), 4 states have internal predecessors, (1196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:00:40,379 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 299.0) internal successors, (1196), 4 states have internal predecessors, (1196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:00:40,379 INFO  L175             Difference]: Start difference. First operand has 50 places, 58 transitions, 306 flow. Second operand 3 states and 504 transitions.
[2024-03-11 23:00:40,379 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 64 transitions, 426 flow
[2024-03-11 23:00:40,394 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 64 transitions, 396 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-11 23:00:40,395 INFO  L231             Difference]: Finished difference. Result has 51 places, 59 transitions, 290 flow
[2024-03-11 23:00:40,395 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=290, PETRI_PLACES=51, PETRI_TRANSITIONS=59}
[2024-03-11 23:00:40,395 INFO  L288   CegarLoopForPetriNet]: 48 programPoint places, 3 predicate places.
[2024-03-11 23:00:40,396 INFO  L495      AbstractCegarLoop]: Abstraction has has 51 places, 59 transitions, 290 flow
[2024-03-11 23:00:40,396 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:00:40,396 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 23:00:40,396 INFO  L209   CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1]
[2024-03-11 23:00:40,396 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-03-11 23:00:40,396 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-03-11 23:00:40,396 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 23:00:40,396 INFO  L85        PathProgramCache]: Analyzing trace with hash 1769815493, now seen corresponding path program 1 times
[2024-03-11 23:00:40,397 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 23:00:40,397 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781936436]
[2024-03-11 23:00:40,397 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:00:40,397 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 23:00:40,415 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-11 23:00:40,415 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-03-11 23:00:40,425 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-11 23:00:40,430 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-03-11 23:00:40,430 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-03-11 23:00:40,431 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining)
[2024-03-11 23:00:40,431 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (11 of 13 remaining)
[2024-03-11 23:00:40,431 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 13 remaining)
[2024-03-11 23:00:40,431 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (9 of 13 remaining)
[2024-03-11 23:00:40,431 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (8 of 13 remaining)
[2024-03-11 23:00:40,431 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (7 of 13 remaining)
[2024-03-11 23:00:40,431 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (6 of 13 remaining)
[2024-03-11 23:00:40,431 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 13 remaining)
[2024-03-11 23:00:40,431 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 13 remaining)
[2024-03-11 23:00:40,431 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 13 remaining)
[2024-03-11 23:00:40,432 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 13 remaining)
[2024-03-11 23:00:40,432 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 13 remaining)
[2024-03-11 23:00:40,432 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 13 remaining)
[2024-03-11 23:00:40,432 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-03-11 23:00:40,432 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1]
[2024-03-11 23:00:40,432 WARN  L233   ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-03-11 23:00:40,433 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances.
[2024-03-11 23:00:40,451 INFO  L144    ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions.
[2024-03-11 23:00:40,454 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 208 places, 203 transitions, 466 flow
[2024-03-11 23:00:40,524 INFO  L130       PetriNetUnfolder]: 41/931 cut-off events.
[2024-03-11 23:00:40,524 INFO  L131       PetriNetUnfolder]: For 39/39 co-relation queries the response was YES.
[2024-03-11 23:00:40,526 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 990 conditions, 931 events. 41/931 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 4024 event pairs, 6 based on Foata normal form. 0/811 useless extension candidates. Maximal degree in co-relation 983. Up to 32 conditions per place. 
[2024-03-11 23:00:40,526 INFO  L82        GeneralOperation]: Start removeDead. Operand has 208 places, 203 transitions, 466 flow
[2024-03-11 23:00:40,529 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 173 places, 170 transitions, 376 flow
[2024-03-11 23:00:40,529 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2024-03-11 23:00:40,529 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 173 places, 170 transitions, 376 flow
[2024-03-11 23:00:40,529 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 173 places, 170 transitions, 376 flow
[2024-03-11 23:00:40,529 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 173 places, 170 transitions, 376 flow
[2024-03-11 23:00:40,635 INFO  L130       PetriNetUnfolder]: 41/931 cut-off events.
[2024-03-11 23:00:40,635 INFO  L131       PetriNetUnfolder]: For 39/39 co-relation queries the response was YES.
[2024-03-11 23:00:40,638 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 988 conditions, 931 events. 41/931 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 4021 event pairs, 6 based on Foata normal form. 0/811 useless extension candidates. Maximal degree in co-relation 550. Up to 32 conditions per place. 
[2024-03-11 23:00:40,651 INFO  L119        LiptonReduction]: Number of co-enabled transitions 10304
[2024-03-11 23:00:44,841 INFO  L134        LiptonReduction]: Checked pairs total: 21520
[2024-03-11 23:00:44,841 INFO  L136        LiptonReduction]: Total number of compositions: 138
[2024-03-11 23:00:44,843 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-11 23:00:44,844 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;@4e3602e4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2024-03-11 23:00:44,844 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 15 error locations.
[2024-03-11 23:00:44,845 INFO  L130       PetriNetUnfolder]: 0/2 cut-off events.
[2024-03-11 23:00:44,845 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2024-03-11 23:00:44,845 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 23:00:44,846 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1]
[2024-03-11 23:00:44,846 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-03-11 23:00:44,846 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 23:00:44,846 INFO  L85        PathProgramCache]: Analyzing trace with hash 36020, now seen corresponding path program 1 times
[2024-03-11 23:00:44,846 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 23:00:44,846 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389858100]
[2024-03-11 23:00:44,847 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:00:44,847 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 23:00:44,852 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 23:00:44,855 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 23:00:44,855 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 23:00:44,855 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389858100]
[2024-03-11 23:00:44,855 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389858100] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 23:00:44,855 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 23:00:44,855 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-03-11 23:00:44,856 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709168045]
[2024-03-11 23:00:44,856 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 23:00:44,856 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-03-11 23:00:44,856 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 23:00:44,856 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-03-11 23:00:44,856 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-03-11 23:00:44,856 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 188 out of 341
[2024-03-11 23:00:44,857 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 51 transitions, 138 flow. Second operand  has 2 states, 2 states have (on average 189.0) internal successors, (378), 2 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:00:44,857 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 23:00:44,857 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 341
[2024-03-11 23:00:44,857 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 23:00:47,045 INFO  L130       PetriNetUnfolder]: 25775/38880 cut-off events.
[2024-03-11 23:00:47,045 INFO  L131       PetriNetUnfolder]: For 2488/2488 co-relation queries the response was YES.
[2024-03-11 23:00:47,108 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 76021 conditions, 38880 events. 25775/38880 cut-off events. For 2488/2488 co-relation queries the response was YES. Maximal size of possible extension queue 1125. Compared 271259 event pairs, 25474 based on Foata normal form. 0/36287 useless extension candidates. Maximal degree in co-relation 10450. Up to 35505 conditions per place. 
[2024-03-11 23:00:47,219 INFO  L137   encePairwiseOnDemand]: 336/341 looper letters, 35 selfloop transitions, 0 changer transitions 0/46 dead transitions.
[2024-03-11 23:00:47,219 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 46 transitions, 198 flow
[2024-03-11 23:00:47,222 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-03-11 23:00:47,223 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2024-03-11 23:00:47,223 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 416 transitions.
[2024-03-11 23:00:47,224 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6099706744868035
[2024-03-11 23:00:47,224 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 416 transitions.
[2024-03-11 23:00:47,224 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 416 transitions.
[2024-03-11 23:00:47,224 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 23:00:47,224 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 416 transitions.
[2024-03-11 23:00:47,226 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 208.0) internal successors, (416), 2 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)
[2024-03-11 23:00:47,227 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 341.0) internal successors, (1023), 3 states have internal predecessors, (1023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:00:47,228 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 341.0) internal successors, (1023), 3 states have internal predecessors, (1023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:00:47,228 INFO  L175             Difference]: Start difference. First operand has 57 places, 51 transitions, 138 flow. Second operand 2 states and 416 transitions.
[2024-03-11 23:00:47,228 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 46 transitions, 198 flow
[2024-03-11 23:00:47,233 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 46 transitions, 194 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-11 23:00:47,234 INFO  L231             Difference]: Finished difference. Result has 51 places, 46 transitions, 124 flow
[2024-03-11 23:00:47,234 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=124, PETRI_PLACES=51, PETRI_TRANSITIONS=46}
[2024-03-11 23:00:47,234 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, -6 predicate places.
[2024-03-11 23:00:47,235 INFO  L495      AbstractCegarLoop]: Abstraction has has 51 places, 46 transitions, 124 flow
[2024-03-11 23:00:47,235 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 189.0) internal successors, (378), 2 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:00:47,235 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 23:00:47,235 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-03-11 23:00:47,235 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-03-11 23:00:47,235 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-03-11 23:00:47,235 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 23:00:47,235 INFO  L85        PathProgramCache]: Analyzing trace with hash -1064247341, now seen corresponding path program 1 times
[2024-03-11 23:00:47,235 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 23:00:47,236 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482621446]
[2024-03-11 23:00:47,236 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:00:47,236 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 23:00:47,244 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 23:00:47,258 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 23:00:47,258 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 23:00:47,258 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482621446]
[2024-03-11 23:00:47,258 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482621446] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 23:00:47,258 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 23:00:47,258 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-11 23:00:47,258 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316178661]
[2024-03-11 23:00:47,258 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 23:00:47,259 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-11 23:00:47,259 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 23:00:47,259 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-11 23:00:47,259 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-11 23:00:47,291 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 179 out of 341
[2024-03-11 23:00:47,291 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 46 transitions, 124 flow. Second operand  has 3 states, 3 states have (on average 181.0) internal successors, (543), 3 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:00:47,291 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 23:00:47,291 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 341
[2024-03-11 23:00:47,292 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 23:00:51,010 INFO  L130       PetriNetUnfolder]: 55404/79470 cut-off events.
[2024-03-11 23:00:51,011 INFO  L131       PetriNetUnfolder]: For 2181/2181 co-relation queries the response was YES.
[2024-03-11 23:00:51,127 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 157115 conditions, 79470 events. 55404/79470 cut-off events. For 2181/2181 co-relation queries the response was YES. Maximal size of possible extension queue 1894. Compared 542494 event pairs, 34193 based on Foata normal form. 0/75293 useless extension candidates. Maximal degree in co-relation 157109. Up to 54585 conditions per place. 
[2024-03-11 23:00:51,355 INFO  L137   encePairwiseOnDemand]: 334/341 looper letters, 53 selfloop transitions, 6 changer transitions 0/67 dead transitions.
[2024-03-11 23:00:51,355 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 67 transitions, 284 flow
[2024-03-11 23:00:51,356 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-11 23:00:51,356 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-11 23:00:51,357 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 597 transitions.
[2024-03-11 23:00:51,358 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5835777126099707
[2024-03-11 23:00:51,358 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 597 transitions.
[2024-03-11 23:00:51,358 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 597 transitions.
[2024-03-11 23:00:51,358 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 23:00:51,358 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 597 transitions.
[2024-03-11 23:00:51,359 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 199.0) internal successors, (597), 3 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:00:51,361 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:00:51,361 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:00:51,361 INFO  L175             Difference]: Start difference. First operand has 51 places, 46 transitions, 124 flow. Second operand 3 states and 597 transitions.
[2024-03-11 23:00:51,361 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 67 transitions, 284 flow
[2024-03-11 23:00:51,363 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 67 transitions, 284 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-11 23:00:51,364 INFO  L231             Difference]: Finished difference. Result has 55 places, 51 transitions, 170 flow
[2024-03-11 23:00:51,364 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=170, PETRI_PLACES=55, PETRI_TRANSITIONS=51}
[2024-03-11 23:00:51,364 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, -2 predicate places.
[2024-03-11 23:00:51,365 INFO  L495      AbstractCegarLoop]: Abstraction has has 55 places, 51 transitions, 170 flow
[2024-03-11 23:00:51,365 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 181.0) internal successors, (543), 3 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:00:51,365 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 23:00:51,365 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2024-03-11 23:00:51,365 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-03-11 23:00:51,365 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-03-11 23:00:51,365 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 23:00:51,366 INFO  L85        PathProgramCache]: Analyzing trace with hash 1650918618, now seen corresponding path program 1 times
[2024-03-11 23:00:51,366 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 23:00:51,366 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045600197]
[2024-03-11 23:00:51,366 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:00:51,366 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 23:00:51,376 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 23:00:51,391 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 23:00:51,391 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 23:00:51,391 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045600197]
[2024-03-11 23:00:51,391 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045600197] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 23:00:51,391 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 23:00:51,392 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-11 23:00:51,392 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103116896]
[2024-03-11 23:00:51,392 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 23:00:51,392 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-11 23:00:51,392 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 23:00:51,392 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-11 23:00:51,392 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-11 23:00:51,423 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 177 out of 341
[2024-03-11 23:00:51,424 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 51 transitions, 170 flow. Second operand  has 3 states, 3 states have (on average 179.0) internal successors, (537), 3 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:00:51,424 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 23:00:51,424 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 341
[2024-03-11 23:00:51,424 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 23:00:56,311 INFO  L130       PetriNetUnfolder]: 62197/90663 cut-off events.
[2024-03-11 23:00:56,311 INFO  L131       PetriNetUnfolder]: For 25891/25907 co-relation queries the response was YES.
[2024-03-11 23:00:56,495 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 205372 conditions, 90663 events. 62197/90663 cut-off events. For 25891/25907 co-relation queries the response was YES. Maximal size of possible extension queue 2612. Compared 651435 event pairs, 46010 based on Foata normal form. 0/85873 useless extension candidates. Maximal degree in co-relation 205364. Up to 75101 conditions per place. 
[2024-03-11 23:00:56,765 INFO  L137   encePairwiseOnDemand]: 334/341 looper letters, 64 selfloop transitions, 10 changer transitions 0/84 dead transitions.
[2024-03-11 23:00:56,765 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 84 transitions, 426 flow
[2024-03-11 23:00:56,766 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-11 23:00:56,766 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-11 23:00:56,767 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 599 transitions.
[2024-03-11 23:00:56,767 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5855327468230694
[2024-03-11 23:00:56,767 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 599 transitions.
[2024-03-11 23:00:56,767 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 599 transitions.
[2024-03-11 23:00:56,768 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 23:00:56,768 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 599 transitions.
[2024-03-11 23:00:56,769 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 199.66666666666666) internal successors, (599), 3 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:00:56,770 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:00:56,770 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:00:56,770 INFO  L175             Difference]: Start difference. First operand has 55 places, 51 transitions, 170 flow. Second operand 3 states and 599 transitions.
[2024-03-11 23:00:56,770 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 84 transitions, 426 flow
[2024-03-11 23:00:58,195 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 84 transitions, 406 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-11 23:00:58,198 INFO  L231             Difference]: Finished difference. Result has 56 places, 59 transitions, 236 flow
[2024-03-11 23:00:58,198 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=236, PETRI_PLACES=56, PETRI_TRANSITIONS=59}
[2024-03-11 23:00:58,199 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, -1 predicate places.
[2024-03-11 23:00:58,199 INFO  L495      AbstractCegarLoop]: Abstraction has has 56 places, 59 transitions, 236 flow
[2024-03-11 23:00:58,199 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 179.0) internal successors, (537), 3 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:00:58,199 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 23:00:58,199 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2024-03-11 23:00:58,199 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-03-11 23:00:58,200 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-03-11 23:00:58,200 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 23:00:58,200 INFO  L85        PathProgramCache]: Analyzing trace with hash 1365471007, now seen corresponding path program 1 times
[2024-03-11 23:00:58,200 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 23:00:58,200 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476410926]
[2024-03-11 23:00:58,200 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:00:58,201 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 23:00:58,210 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 23:00:58,224 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 23:00:58,225 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 23:00:58,225 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476410926]
[2024-03-11 23:00:58,225 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476410926] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 23:00:58,225 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 23:00:58,225 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-11 23:00:58,225 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84756699]
[2024-03-11 23:00:58,225 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 23:00:58,225 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-11 23:00:58,225 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 23:00:58,226 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-11 23:00:58,226 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-11 23:00:58,257 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 177 out of 341
[2024-03-11 23:00:58,258 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 59 transitions, 236 flow. Second operand  has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:00:58,258 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 23:00:58,258 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 341
[2024-03-11 23:00:58,258 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 23:01:02,990 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([973] L1016-2-->L1016-4: Formula: (= |v_#race~data~0_37| |v_threadThread1of3ForFork1_#t~nondet5_13|)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_37|, threadThread1of3ForFork1_#t~nondet5=|v_threadThread1of3ForFork1_#t~nondet5_13|}  AuxVars[]  AssignedVars[#race~data~0, threadThread1of3ForFork1_#t~nondet5][24], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 111#L1032-2true, 220#true, 29#L1016-6true, threadThread1of3ForFork0InUse, 157#L1016-6true, threadThread2of3ForFork0InUse, threadThread3of3ForFork0InUse, 211#true, 116#L1016-4true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), Black: 216#(= |#race~data~0| 0)])
[2024-03-11 23:01:02,990 INFO  L383   tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event
[2024-03-11 23:01:02,990 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2024-03-11 23:01:02,990 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2024-03-11 23:01:02,990 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2024-03-11 23:01:03,370 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([973] L1016-2-->L1016-4: Formula: (= |v_#race~data~0_37| |v_threadThread1of3ForFork1_#t~nondet5_13|)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_37|, threadThread1of3ForFork1_#t~nondet5=|v_threadThread1of3ForFork1_#t~nondet5_13|}  AuxVars[]  AssignedVars[#race~data~0, threadThread1of3ForFork1_#t~nondet5][24], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 111#L1032-2true, 220#true, 29#L1016-6true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, threadThread3of3ForFork0InUse, 158#threadEXITtrue, 211#true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 116#L1016-4true, 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), Black: 216#(= |#race~data~0| 0)])
[2024-03-11 23:01:03,370 INFO  L383   tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event
[2024-03-11 23:01:03,371 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2024-03-11 23:01:03,371 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2024-03-11 23:01:03,371 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2024-03-11 23:01:03,371 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([973] L1016-2-->L1016-4: Formula: (= |v_#race~data~0_37| |v_threadThread1of3ForFork1_#t~nondet5_13|)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_37|, threadThread1of3ForFork1_#t~nondet5=|v_threadThread1of3ForFork1_#t~nondet5_13|}  AuxVars[]  AssignedVars[#race~data~0, threadThread1of3ForFork1_#t~nondet5][24], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 111#L1032-2true, 220#true, threadThread1of3ForFork0InUse, 157#L1016-6true, threadThread2of3ForFork0InUse, threadThread3of3ForFork0InUse, 211#true, 116#L1016-4true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 4#threadEXITtrue, 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), Black: 216#(= |#race~data~0| 0)])
[2024-03-11 23:01:03,371 INFO  L383   tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event
[2024-03-11 23:01:03,371 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2024-03-11 23:01:03,372 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2024-03-11 23:01:03,372 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2024-03-11 23:01:03,630 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1025] L1016-2-->L1016-4: Formula: (= |v_#race~data~0_47| |v_threadThread3of3ForFork0_#t~nondet5_17|)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_47|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_17|}  AuxVars[]  AssignedVars[#race~data~0, threadThread3of3ForFork0_#t~nondet5][77], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 111#L1032-2true, 220#true, 2#L1016-4true, threadThread1of3ForFork0InUse, 157#L1016-6true, threadThread2of3ForFork0InUse, threadThread3of3ForFork0InUse, 10#threadEXITtrue, 211#true, 225#true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 216#(= |#race~data~0| 0)])
[2024-03-11 23:01:03,630 INFO  L383   tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event
[2024-03-11 23:01:03,630 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2024-03-11 23:01:03,630 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2024-03-11 23:01:03,630 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2024-03-11 23:01:03,631 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([909] L1016-3-->L1016-4: Formula: (= |v_#race~data~0_4| |v_threadThread2of3ForFork0_#t~nondet5_3|)  InVars {threadThread2of3ForFork0_#t~nondet5=|v_threadThread2of3ForFork0_#t~nondet5_3|}  OutVars{threadThread2of3ForFork0_#t~nondet5=|v_threadThread2of3ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_4|}  AuxVars[]  AssignedVars[#race~data~0][65], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 111#L1032-2true, 220#true, 29#L1016-6true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, threadThread3of3ForFork0InUse, 36#L1016-4true, 10#threadEXITtrue, 211#true, 225#true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 216#(= |#race~data~0| 0)])
[2024-03-11 23:01:03,631 INFO  L383   tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event
[2024-03-11 23:01:03,631 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2024-03-11 23:01:03,631 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2024-03-11 23:01:03,631 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2024-03-11 23:01:03,664 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([973] L1016-2-->L1016-4: Formula: (= |v_#race~data~0_37| |v_threadThread1of3ForFork1_#t~nondet5_13|)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_37|, threadThread1of3ForFork1_#t~nondet5=|v_threadThread1of3ForFork1_#t~nondet5_13|}  AuxVars[]  AssignedVars[#race~data~0, threadThread1of3ForFork1_#t~nondet5][15], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 220#true, 29#L1016-6true, threadThread1of3ForFork0InUse, 157#L1016-6true, 107#ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACEtrue, threadThread2of3ForFork0InUse, threadThread3of3ForFork0InUse, 211#true, 116#L1016-4true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), Black: 216#(= |#race~data~0| 0)])
[2024-03-11 23:01:03,664 INFO  L383   tUnfolder$Statistics]: this new event has 33 ancestors and is not cut-off event
[2024-03-11 23:01:03,664 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is not cut-off event
[2024-03-11 23:01:03,664 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is not cut-off event
[2024-03-11 23:01:03,664 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is not cut-off event
[2024-03-11 23:01:03,801 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([973] L1016-2-->L1016-4: Formula: (= |v_#race~data~0_37| |v_threadThread1of3ForFork1_#t~nondet5_13|)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_37|, threadThread1of3ForFork1_#t~nondet5=|v_threadThread1of3ForFork1_#t~nondet5_13|}  AuxVars[]  AssignedVars[#race~data~0, threadThread1of3ForFork1_#t~nondet5][24], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 111#L1032-2true, 220#true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, threadThread3of3ForFork0InUse, 158#threadEXITtrue, 211#true, 116#L1016-4true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 4#threadEXITtrue, 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), Black: 216#(= |#race~data~0| 0)])
[2024-03-11 23:01:03,801 INFO  L383   tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event
[2024-03-11 23:01:03,802 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is cut-off event
[2024-03-11 23:01:03,802 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is cut-off event
[2024-03-11 23:01:03,802 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is cut-off event
[2024-03-11 23:01:03,802 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1025] L1016-2-->L1016-4: Formula: (= |v_#race~data~0_47| |v_threadThread3of3ForFork0_#t~nondet5_17|)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_47|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_17|}  AuxVars[]  AssignedVars[#race~data~0, threadThread3of3ForFork0_#t~nondet5][53], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 220#true, 2#L1016-4true, threadThread1of3ForFork0InUse, 107#ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACEtrue, 157#L1016-6true, threadThread2of3ForFork0InUse, threadThread3of3ForFork0InUse, 10#threadEXITtrue, 211#true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 225#true, Black: 216#(= |#race~data~0| 0)])
[2024-03-11 23:01:03,802 INFO  L383   tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event
[2024-03-11 23:01:03,802 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2024-03-11 23:01:03,802 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2024-03-11 23:01:03,802 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2024-03-11 23:01:04,035 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1025] L1016-2-->L1016-4: Formula: (= |v_#race~data~0_47| |v_threadThread3of3ForFork0_#t~nondet5_17|)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_47|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_17|}  AuxVars[]  AssignedVars[#race~data~0, threadThread3of3ForFork0_#t~nondet5][77], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 111#L1032-2true, 220#true, 2#L1016-4true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, threadThread3of3ForFork0InUse, 10#threadEXITtrue, 158#threadEXITtrue, 211#true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 225#true, Black: 216#(= |#race~data~0| 0)])
[2024-03-11 23:01:04,035 INFO  L383   tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event
[2024-03-11 23:01:04,035 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is cut-off event
[2024-03-11 23:01:04,035 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is cut-off event
[2024-03-11 23:01:04,035 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is cut-off event
[2024-03-11 23:01:04,035 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([909] L1016-3-->L1016-4: Formula: (= |v_#race~data~0_4| |v_threadThread2of3ForFork0_#t~nondet5_3|)  InVars {threadThread2of3ForFork0_#t~nondet5=|v_threadThread2of3ForFork0_#t~nondet5_3|}  OutVars{threadThread2of3ForFork0_#t~nondet5=|v_threadThread2of3ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_4|}  AuxVars[]  AssignedVars[#race~data~0][65], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 111#L1032-2true, 220#true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, threadThread3of3ForFork0InUse, 36#L1016-4true, 10#threadEXITtrue, 211#true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 225#true, 4#threadEXITtrue, Black: 216#(= |#race~data~0| 0)])
[2024-03-11 23:01:04,035 INFO  L383   tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event
[2024-03-11 23:01:04,035 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is cut-off event
[2024-03-11 23:01:04,036 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is cut-off event
[2024-03-11 23:01:04,036 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is cut-off event
[2024-03-11 23:01:04,061 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([973] L1016-2-->L1016-4: Formula: (= |v_#race~data~0_37| |v_threadThread1of3ForFork1_#t~nondet5_13|)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_37|, threadThread1of3ForFork1_#t~nondet5=|v_threadThread1of3ForFork1_#t~nondet5_13|}  AuxVars[]  AssignedVars[#race~data~0, threadThread1of3ForFork1_#t~nondet5][15], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 220#true, 29#L1016-6true, threadThread1of3ForFork0InUse, 107#ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACEtrue, threadThread2of3ForFork0InUse, threadThread3of3ForFork0InUse, 158#threadEXITtrue, 211#true, 116#L1016-4true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), Black: 216#(= |#race~data~0| 0)])
[2024-03-11 23:01:04,061 INFO  L383   tUnfolder$Statistics]: this new event has 34 ancestors and is not cut-off event
[2024-03-11 23:01:04,062 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is not cut-off event
[2024-03-11 23:01:04,062 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is not cut-off event
[2024-03-11 23:01:04,062 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is not cut-off event
[2024-03-11 23:01:04,062 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([973] L1016-2-->L1016-4: Formula: (= |v_#race~data~0_37| |v_threadThread1of3ForFork1_#t~nondet5_13|)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_37|, threadThread1of3ForFork1_#t~nondet5=|v_threadThread1of3ForFork1_#t~nondet5_13|}  AuxVars[]  AssignedVars[#race~data~0, threadThread1of3ForFork1_#t~nondet5][15], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 220#true, threadThread1of3ForFork0InUse, 157#L1016-6true, 107#ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACEtrue, threadThread2of3ForFork0InUse, threadThread3of3ForFork0InUse, 211#true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 116#L1016-4true, 4#threadEXITtrue, 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), Black: 216#(= |#race~data~0| 0)])
[2024-03-11 23:01:04,062 INFO  L383   tUnfolder$Statistics]: this new event has 34 ancestors and is not cut-off event
[2024-03-11 23:01:04,062 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is not cut-off event
[2024-03-11 23:01:04,062 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is not cut-off event
[2024-03-11 23:01:04,062 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is not cut-off event
[2024-03-11 23:01:04,080 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1025] L1016-2-->L1016-4: Formula: (= |v_#race~data~0_47| |v_threadThread3of3ForFork0_#t~nondet5_17|)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_47|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_17|}  AuxVars[]  AssignedVars[#race~data~0, threadThread3of3ForFork0_#t~nondet5][53], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 220#true, 2#L1016-4true, threadThread1of3ForFork0InUse, 107#ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACEtrue, threadThread2of3ForFork0InUse, threadThread3of3ForFork0InUse, 158#threadEXITtrue, 10#threadEXITtrue, 211#true, 225#true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 216#(= |#race~data~0| 0)])
[2024-03-11 23:01:04,080 INFO  L383   tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event
[2024-03-11 23:01:04,080 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is cut-off event
[2024-03-11 23:01:04,080 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is cut-off event
[2024-03-11 23:01:04,080 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is cut-off event
[2024-03-11 23:01:04,308 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([973] L1016-2-->L1016-4: Formula: (= |v_#race~data~0_37| |v_threadThread1of3ForFork1_#t~nondet5_13|)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_37|, threadThread1of3ForFork1_#t~nondet5=|v_threadThread1of3ForFork1_#t~nondet5_13|}  AuxVars[]  AssignedVars[#race~data~0, threadThread1of3ForFork1_#t~nondet5][15], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 220#true, threadThread1of3ForFork0InUse, 107#ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACEtrue, threadThread2of3ForFork0InUse, threadThread3of3ForFork0InUse, 158#threadEXITtrue, 211#true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 116#L1016-4true, 4#threadEXITtrue, 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), Black: 216#(= |#race~data~0| 0)])
[2024-03-11 23:01:04,309 INFO  L383   tUnfolder$Statistics]: this new event has 35 ancestors and is not cut-off event
[2024-03-11 23:01:04,309 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is not cut-off event
[2024-03-11 23:01:04,309 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is not cut-off event
[2024-03-11 23:01:04,309 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is not cut-off event
[2024-03-11 23:01:05,150 INFO  L130       PetriNetUnfolder]: 80967/117106 cut-off events.
[2024-03-11 23:01:05,151 INFO  L131       PetriNetUnfolder]: For 73295/75192 co-relation queries the response was YES.
[2024-03-11 23:01:05,392 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 291946 conditions, 117106 events. 80967/117106 cut-off events. For 73295/75192 co-relation queries the response was YES. Maximal size of possible extension queue 3586. Compared 875504 event pairs, 47850 based on Foata normal form. 3/109354 useless extension candidates. Maximal degree in co-relation 291937. Up to 88602 conditions per place. 
[2024-03-11 23:01:05,736 INFO  L137   encePairwiseOnDemand]: 333/341 looper letters, 64 selfloop transitions, 18 changer transitions 0/92 dead transitions.
[2024-03-11 23:01:05,736 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 92 transitions, 535 flow
[2024-03-11 23:01:05,737 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-11 23:01:05,737 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-11 23:01:05,738 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 593 transitions.
[2024-03-11 23:01:05,738 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5796676441837733
[2024-03-11 23:01:05,738 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 593 transitions.
[2024-03-11 23:01:05,738 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 593 transitions.
[2024-03-11 23:01:05,738 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 23:01:05,738 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 593 transitions.
[2024-03-11 23:01:05,739 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 197.66666666666666) internal successors, (593), 3 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:01:05,740 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:01:05,741 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:01:05,741 INFO  L175             Difference]: Start difference. First operand has 56 places, 59 transitions, 236 flow. Second operand 3 states and 593 transitions.
[2024-03-11 23:01:05,741 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 92 transitions, 535 flow
[2024-03-11 23:01:07,243 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 92 transitions, 517 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-11 23:01:07,244 INFO  L231             Difference]: Finished difference. Result has 59 places, 73 transitions, 404 flow
[2024-03-11 23:01:07,244 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=404, PETRI_PLACES=59, PETRI_TRANSITIONS=73}
[2024-03-11 23:01:07,245 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 2 predicate places.
[2024-03-11 23:01:07,245 INFO  L495      AbstractCegarLoop]: Abstraction has has 59 places, 73 transitions, 404 flow
[2024-03-11 23:01:07,245 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:01:07,245 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 23:01:07,245 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 23:01:07,245 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-03-11 23:01:07,246 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-03-11 23:01:07,246 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 23:01:07,246 INFO  L85        PathProgramCache]: Analyzing trace with hash -2033738317, now seen corresponding path program 1 times
[2024-03-11 23:01:07,246 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 23:01:07,246 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391100258]
[2024-03-11 23:01:07,246 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:01:07,246 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 23:01:07,258 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 23:01:07,297 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 23:01:07,309 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 23:01:07,309 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391100258]
[2024-03-11 23:01:07,309 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391100258] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 23:01:07,309 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 23:01:07,309 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-11 23:01:07,310 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677953687]
[2024-03-11 23:01:07,310 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 23:01:07,310 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-11 23:01:07,310 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 23:01:07,311 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-11 23:01:07,311 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-11 23:01:07,333 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 184 out of 341
[2024-03-11 23:01:07,334 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 73 transitions, 404 flow. Second operand  has 3 states, 3 states have (on average 186.66666666666666) internal successors, (560), 3 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:01:07,334 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 23:01:07,334 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 341
[2024-03-11 23:01:07,334 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 23:01:10,102 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1025] L1016-2-->L1016-4: Formula: (= |v_#race~data~0_47| |v_threadThread3of3ForFork0_#t~nondet5_17|)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_47|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_17|}  AuxVars[]  AssignedVars[#race~data~0, threadThread3of3ForFork0_#t~nondet5][68], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 111#L1032-2true, 20#$Ultimate##0true, 2#L1016-4true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 100#L1017true, threadThread3of3ForFork0InUse, 211#true, 225#true, 231#true, 96#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 216#(= |#race~data~0| 0)])
[2024-03-11 23:01:10,102 INFO  L383   tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event
[2024-03-11 23:01:10,102 INFO  L386   tUnfolder$Statistics]:   existing Event has 29 ancestors and is cut-off event
[2024-03-11 23:01:10,102 INFO  L386   tUnfolder$Statistics]:   existing Event has 29 ancestors and is cut-off event
[2024-03-11 23:01:10,103 INFO  L386   tUnfolder$Statistics]:   existing Event has 29 ancestors and is cut-off event
[2024-03-11 23:01:10,543 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1025] L1016-2-->L1016-4: Formula: (= |v_#race~data~0_47| |v_threadThread3of3ForFork0_#t~nondet5_17|)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_47|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_17|}  AuxVars[]  AssignedVars[#race~data~0, threadThread3of3ForFork0_#t~nondet5][68], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 111#L1032-2true, 2#L1016-4true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), threadThread1of3ForFork0InUse, 77#L1015-1true, threadThread2of3ForFork0InUse, 100#L1017true, threadThread3of3ForFork0InUse, 211#true, 225#true, 231#true, 96#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 216#(= |#race~data~0| 0)])
[2024-03-11 23:01:10,543 INFO  L383   tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event
[2024-03-11 23:01:10,543 INFO  L386   tUnfolder$Statistics]:   existing Event has 30 ancestors and is cut-off event
[2024-03-11 23:01:10,543 INFO  L386   tUnfolder$Statistics]:   existing Event has 30 ancestors and is cut-off event
[2024-03-11 23:01:10,543 INFO  L386   tUnfolder$Statistics]:   existing Event has 30 ancestors and is cut-off event
[2024-03-11 23:01:10,550 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1025] L1016-2-->L1016-4: Formula: (= |v_#race~data~0_47| |v_threadThread3of3ForFork0_#t~nondet5_17|)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_47|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_17|}  AuxVars[]  AssignedVars[#race~data~0, threadThread3of3ForFork0_#t~nondet5][68], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 111#L1032-2true, 20#$Ultimate##0true, 2#L1016-4true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), threadThread1of3ForFork0InUse, 47#threadEXITtrue, threadThread2of3ForFork0InUse, threadThread3of3ForFork0InUse, 211#true, 225#true, 231#true, 96#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 216#(= |#race~data~0| 0)])
[2024-03-11 23:01:10,550 INFO  L383   tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event
[2024-03-11 23:01:10,550 INFO  L386   tUnfolder$Statistics]:   existing Event has 30 ancestors and is cut-off event
[2024-03-11 23:01:10,550 INFO  L386   tUnfolder$Statistics]:   existing Event has 30 ancestors and is cut-off event
[2024-03-11 23:01:10,550 INFO  L386   tUnfolder$Statistics]:   existing Event has 30 ancestors and is cut-off event
[2024-03-11 23:01:10,962 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1025] L1016-2-->L1016-4: Formula: (= |v_#race~data~0_47| |v_threadThread3of3ForFork0_#t~nondet5_17|)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_47|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_17|}  AuxVars[]  AssignedVars[#race~data~0, threadThread3of3ForFork0_#t~nondet5][68], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 111#L1032-2true, 2#L1016-4true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 100#L1017true, 36#L1016-4true, threadThread3of3ForFork0InUse, 211#true, 225#true, 231#true, 96#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 216#(= |#race~data~0| 0)])
[2024-03-11 23:01:10,962 INFO  L383   tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event
[2024-03-11 23:01:10,962 INFO  L386   tUnfolder$Statistics]:   existing Event has 32 ancestors and is cut-off event
[2024-03-11 23:01:10,962 INFO  L386   tUnfolder$Statistics]:   existing Event has 32 ancestors and is cut-off event
[2024-03-11 23:01:10,962 INFO  L386   tUnfolder$Statistics]:   existing Event has 32 ancestors and is cut-off event
[2024-03-11 23:01:11,072 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1025] L1016-2-->L1016-4: Formula: (= |v_#race~data~0_47| |v_threadThread3of3ForFork0_#t~nondet5_17|)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_47|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_17|}  AuxVars[]  AssignedVars[#race~data~0, threadThread3of3ForFork0_#t~nondet5][68], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 111#L1032-2true, 2#L1016-4true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 100#L1017true, threadThread3of3ForFork0InUse, 174#L1016-3true, 211#true, 225#true, 231#true, 96#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 216#(= |#race~data~0| 0)])
[2024-03-11 23:01:11,073 INFO  L383   tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event
[2024-03-11 23:01:11,073 INFO  L386   tUnfolder$Statistics]:   existing Event has 31 ancestors and is cut-off event
[2024-03-11 23:01:11,073 INFO  L386   tUnfolder$Statistics]:   existing Event has 31 ancestors and is cut-off event
[2024-03-11 23:01:11,073 INFO  L386   tUnfolder$Statistics]:   existing Event has 31 ancestors and is cut-off event
[2024-03-11 23:01:11,075 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1025] L1016-2-->L1016-4: Formula: (= |v_#race~data~0_47| |v_threadThread3of3ForFork0_#t~nondet5_17|)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_47|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_17|}  AuxVars[]  AssignedVars[#race~data~0, threadThread3of3ForFork0_#t~nondet5][68], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 111#L1032-2true, 2#L1016-4true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), threadThread1of3ForFork0InUse, 77#L1015-1true, threadThread2of3ForFork0InUse, 47#threadEXITtrue, threadThread3of3ForFork0InUse, 211#true, 225#true, 231#true, 96#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 216#(= |#race~data~0| 0)])
[2024-03-11 23:01:11,075 INFO  L383   tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event
[2024-03-11 23:01:11,075 INFO  L386   tUnfolder$Statistics]:   existing Event has 31 ancestors and is cut-off event
[2024-03-11 23:01:11,075 INFO  L386   tUnfolder$Statistics]:   existing Event has 31 ancestors and is cut-off event
[2024-03-11 23:01:11,075 INFO  L386   tUnfolder$Statistics]:   existing Event has 31 ancestors and is cut-off event
[2024-03-11 23:01:11,359 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1025] L1016-2-->L1016-4: Formula: (= |v_#race~data~0_47| |v_threadThread3of3ForFork0_#t~nondet5_17|)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_47|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_17|}  AuxVars[]  AssignedVars[#race~data~0, threadThread3of3ForFork0_#t~nondet5][68], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 111#L1032-2true, 2#L1016-4true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), threadThread1of3ForFork0InUse, 47#threadEXITtrue, threadThread2of3ForFork0InUse, 36#L1016-4true, threadThread3of3ForFork0InUse, 211#true, 225#true, 231#true, 96#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 216#(= |#race~data~0| 0)])
[2024-03-11 23:01:11,359 INFO  L383   tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event
[2024-03-11 23:01:11,359 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2024-03-11 23:01:11,359 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2024-03-11 23:01:11,359 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2024-03-11 23:01:11,421 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1025] L1016-2-->L1016-4: Formula: (= |v_#race~data~0_47| |v_threadThread3of3ForFork0_#t~nondet5_17|)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_47|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_17|}  AuxVars[]  AssignedVars[#race~data~0, threadThread3of3ForFork0_#t~nondet5][51], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 111#L1032-2true, 2#L1016-4true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 100#L1017true, threadThread3of3ForFork0InUse, 36#L1016-4true, 211#true, 225#true, 231#true, 96#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 216#(= |#race~data~0| 0)])
[2024-03-11 23:01:11,421 INFO  L383   tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event
[2024-03-11 23:01:11,421 INFO  L386   tUnfolder$Statistics]:   existing Event has 32 ancestors and is cut-off event
[2024-03-11 23:01:11,422 INFO  L386   tUnfolder$Statistics]:   existing Event has 32 ancestors and is cut-off event
[2024-03-11 23:01:11,422 INFO  L386   tUnfolder$Statistics]:   existing Event has 32 ancestors and is cut-off event
[2024-03-11 23:01:11,423 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1025] L1016-2-->L1016-4: Formula: (= |v_#race~data~0_47| |v_threadThread3of3ForFork0_#t~nondet5_17|)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_47|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_17|}  AuxVars[]  AssignedVars[#race~data~0, threadThread3of3ForFork0_#t~nondet5][51], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 2#L1016-4true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), threadThread1of3ForFork0InUse, 107#ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACEtrue, threadThread2of3ForFork0InUse, 100#L1017true, 36#L1016-4true, threadThread3of3ForFork0InUse, 211#true, 225#true, 231#true, 96#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 216#(= |#race~data~0| 0)])
[2024-03-11 23:01:11,423 INFO  L383   tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event
[2024-03-11 23:01:11,423 INFO  L386   tUnfolder$Statistics]:   existing Event has 32 ancestors and is cut-off event
[2024-03-11 23:01:11,423 INFO  L386   tUnfolder$Statistics]:   existing Event has 32 ancestors and is cut-off event
[2024-03-11 23:01:11,423 INFO  L386   tUnfolder$Statistics]:   existing Event has 32 ancestors and is cut-off event
[2024-03-11 23:01:11,476 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1025] L1016-2-->L1016-4: Formula: (= |v_#race~data~0_47| |v_threadThread3of3ForFork0_#t~nondet5_17|)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_47|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_17|}  AuxVars[]  AssignedVars[#race~data~0, threadThread3of3ForFork0_#t~nondet5][68], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 111#L1032-2true, 2#L1016-4true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 47#threadEXITtrue, threadThread3of3ForFork0InUse, 174#L1016-3true, 211#true, 225#true, 231#true, 96#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 216#(= |#race~data~0| 0)])
[2024-03-11 23:01:11,477 INFO  L383   tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event
[2024-03-11 23:01:11,477 INFO  L386   tUnfolder$Statistics]:   existing Event has 32 ancestors and is cut-off event
[2024-03-11 23:01:11,477 INFO  L386   tUnfolder$Statistics]:   existing Event has 32 ancestors and is cut-off event
[2024-03-11 23:01:11,477 INFO  L386   tUnfolder$Statistics]:   existing Event has 32 ancestors and is cut-off event
[2024-03-11 23:01:11,636 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1025] L1016-2-->L1016-4: Formula: (= |v_#race~data~0_47| |v_threadThread3of3ForFork0_#t~nondet5_17|)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_47|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_17|}  AuxVars[]  AssignedVars[#race~data~0, threadThread3of3ForFork0_#t~nondet5][68], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 111#L1032-2true, 2#L1016-4true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), threadThread1of3ForFork0InUse, 157#L1016-6true, threadThread2of3ForFork0InUse, 100#L1017true, threadThread3of3ForFork0InUse, 211#true, 225#true, 231#true, 96#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 216#(= |#race~data~0| 0)])
[2024-03-11 23:01:11,636 INFO  L383   tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event
[2024-03-11 23:01:11,636 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2024-03-11 23:01:11,636 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2024-03-11 23:01:11,636 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2024-03-11 23:01:11,941 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1025] L1016-2-->L1016-4: Formula: (= |v_#race~data~0_47| |v_threadThread3of3ForFork0_#t~nondet5_17|)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_47|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_17|}  AuxVars[]  AssignedVars[#race~data~0, threadThread3of3ForFork0_#t~nondet5][51], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 111#L1032-2true, 2#L1016-4true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), threadThread1of3ForFork0InUse, 47#threadEXITtrue, threadThread2of3ForFork0InUse, threadThread3of3ForFork0InUse, 36#L1016-4true, 211#true, 225#true, 231#true, 96#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 216#(= |#race~data~0| 0)])
[2024-03-11 23:01:11,941 INFO  L383   tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event
[2024-03-11 23:01:11,941 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2024-03-11 23:01:11,941 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2024-03-11 23:01:11,941 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2024-03-11 23:01:11,942 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1025] L1016-2-->L1016-4: Formula: (= |v_#race~data~0_47| |v_threadThread3of3ForFork0_#t~nondet5_17|)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_47|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_17|}  AuxVars[]  AssignedVars[#race~data~0, threadThread3of3ForFork0_#t~nondet5][51], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 2#L1016-4true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), threadThread1of3ForFork0InUse, 107#ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACEtrue, 47#threadEXITtrue, threadThread2of3ForFork0InUse, 36#L1016-4true, threadThread3of3ForFork0InUse, 211#true, 225#true, 231#true, 96#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 216#(= |#race~data~0| 0)])
[2024-03-11 23:01:11,942 INFO  L383   tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event
[2024-03-11 23:01:11,942 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2024-03-11 23:01:11,943 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2024-03-11 23:01:11,943 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2024-03-11 23:01:11,945 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1025] L1016-2-->L1016-4: Formula: (= |v_#race~data~0_47| |v_threadThread3of3ForFork0_#t~nondet5_17|)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_47|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_17|}  AuxVars[]  AssignedVars[#race~data~0, threadThread3of3ForFork0_#t~nondet5][51], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 2#L1016-4true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 100#L1017true, 36#L1016-4true, threadThread3of3ForFork0InUse, 211#true, 225#true, 231#true, 96#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 98#ULTIMATE.startEXITtrue, Black: 216#(= |#race~data~0| 0)])
[2024-03-11 23:01:11,945 INFO  L383   tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event
[2024-03-11 23:01:11,945 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2024-03-11 23:01:11,945 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2024-03-11 23:01:11,945 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2024-03-11 23:01:12,121 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1025] L1016-2-->L1016-4: Formula: (= |v_#race~data~0_47| |v_threadThread3of3ForFork0_#t~nondet5_17|)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_47|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_17|}  AuxVars[]  AssignedVars[#race~data~0, threadThread3of3ForFork0_#t~nondet5][68], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 111#L1032-2true, 2#L1016-4true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), threadThread1of3ForFork0InUse, 157#L1016-6true, threadThread2of3ForFork0InUse, 47#threadEXITtrue, threadThread3of3ForFork0InUse, 211#true, 225#true, 231#true, 96#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 216#(= |#race~data~0| 0)])
[2024-03-11 23:01:12,121 INFO  L383   tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event
[2024-03-11 23:01:12,121 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2024-03-11 23:01:12,121 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2024-03-11 23:01:12,121 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2024-03-11 23:01:12,194 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1025] L1016-2-->L1016-4: Formula: (= |v_#race~data~0_47| |v_threadThread3of3ForFork0_#t~nondet5_17|)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_47|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_17|}  AuxVars[]  AssignedVars[#race~data~0, threadThread3of3ForFork0_#t~nondet5][68], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 111#L1032-2true, 2#L1016-4true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 100#L1017true, threadThread3of3ForFork0InUse, 158#threadEXITtrue, 211#true, 225#true, 231#true, 96#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 216#(= |#race~data~0| 0)])
[2024-03-11 23:01:12,194 INFO  L383   tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event
[2024-03-11 23:01:12,194 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2024-03-11 23:01:12,194 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2024-03-11 23:01:12,194 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2024-03-11 23:01:12,278 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1025] L1016-2-->L1016-4: Formula: (= |v_#race~data~0_47| |v_threadThread3of3ForFork0_#t~nondet5_17|)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_47|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_17|}  AuxVars[]  AssignedVars[#race~data~0, threadThread3of3ForFork0_#t~nondet5][68], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 111#L1032-2true, 2#L1016-4true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), threadThread1of3ForFork0InUse, 157#L1016-6true, threadThread2of3ForFork0InUse, threadThread3of3ForFork0InUse, 10#threadEXITtrue, 211#true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 225#true, 231#true, Black: 216#(= |#race~data~0| 0)])
[2024-03-11 23:01:12,278 INFO  L383   tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event
[2024-03-11 23:01:12,278 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2024-03-11 23:01:12,278 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2024-03-11 23:01:12,278 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2024-03-11 23:01:12,346 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1025] L1016-2-->L1016-4: Formula: (= |v_#race~data~0_47| |v_threadThread3of3ForFork0_#t~nondet5_17|)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_47|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_17|}  AuxVars[]  AssignedVars[#race~data~0, threadThread3of3ForFork0_#t~nondet5][51], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 2#L1016-4true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 47#threadEXITtrue, 36#L1016-4true, threadThread3of3ForFork0InUse, 211#true, 225#true, 231#true, 96#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 98#ULTIMATE.startEXITtrue, Black: 216#(= |#race~data~0| 0)])
[2024-03-11 23:01:12,346 INFO  L383   tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event
[2024-03-11 23:01:12,346 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2024-03-11 23:01:12,346 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2024-03-11 23:01:12,346 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2024-03-11 23:01:12,508 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1025] L1016-2-->L1016-4: Formula: (= |v_#race~data~0_47| |v_threadThread3of3ForFork0_#t~nondet5_17|)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_47|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_17|}  AuxVars[]  AssignedVars[#race~data~0, threadThread3of3ForFork0_#t~nondet5][68], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 111#L1032-2true, 2#L1016-4true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 47#threadEXITtrue, threadThread3of3ForFork0InUse, 158#threadEXITtrue, 211#true, 225#true, 231#true, 96#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 216#(= |#race~data~0| 0)])
[2024-03-11 23:01:12,508 INFO  L383   tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event
[2024-03-11 23:01:12,508 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is cut-off event
[2024-03-11 23:01:12,508 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is cut-off event
[2024-03-11 23:01:12,508 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is cut-off event
[2024-03-11 23:01:12,644 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1025] L1016-2-->L1016-4: Formula: (= |v_#race~data~0_47| |v_threadThread3of3ForFork0_#t~nondet5_17|)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_47|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_17|}  AuxVars[]  AssignedVars[#race~data~0, threadThread3of3ForFork0_#t~nondet5][68], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 111#L1032-2true, 2#L1016-4true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, threadThread3of3ForFork0InUse, 10#threadEXITtrue, 158#threadEXITtrue, 211#true, 225#true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 231#true, Black: 216#(= |#race~data~0| 0)])
[2024-03-11 23:01:12,644 INFO  L383   tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event
[2024-03-11 23:01:12,644 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is cut-off event
[2024-03-11 23:01:12,644 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is cut-off event
[2024-03-11 23:01:12,644 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is cut-off event
[2024-03-11 23:01:13,697 INFO  L130       PetriNetUnfolder]: 73128/107752 cut-off events.
[2024-03-11 23:01:13,697 INFO  L131       PetriNetUnfolder]: For 133485/141993 co-relation queries the response was YES.
[2024-03-11 23:01:13,934 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 307014 conditions, 107752 events. 73128/107752 cut-off events. For 133485/141993 co-relation queries the response was YES. Maximal size of possible extension queue 3712. Compared 831415 event pairs, 41806 based on Foata normal form. 44/101126 useless extension candidates. Maximal degree in co-relation 307004. Up to 97538 conditions per place. 
[2024-03-11 23:01:14,274 INFO  L137   encePairwiseOnDemand]: 338/341 looper letters, 58 selfloop transitions, 2 changer transitions 0/79 dead transitions.
[2024-03-11 23:01:14,274 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 79 transitions, 544 flow
[2024-03-11 23:01:14,275 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-11 23:01:14,275 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-11 23:01:14,276 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 594 transitions.
[2024-03-11 23:01:14,276 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5806451612903226
[2024-03-11 23:01:14,276 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 594 transitions.
[2024-03-11 23:01:14,276 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 594 transitions.
[2024-03-11 23:01:14,277 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 23:01:14,277 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 594 transitions.
[2024-03-11 23:01:14,278 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 198.0) internal successors, (594), 3 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:01:14,279 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:01:14,279 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:01:14,279 INFO  L175             Difference]: Start difference. First operand has 59 places, 73 transitions, 404 flow. Second operand 3 states and 594 transitions.
[2024-03-11 23:01:14,279 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 79 transitions, 544 flow
[2024-03-11 23:01:15,592 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 79 transitions, 508 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-11 23:01:15,593 INFO  L231             Difference]: Finished difference. Result has 60 places, 74 transitions, 380 flow
[2024-03-11 23:01:15,593 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=368, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=380, PETRI_PLACES=60, PETRI_TRANSITIONS=74}
[2024-03-11 23:01:15,593 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 3 predicate places.
[2024-03-11 23:01:15,593 INFO  L495      AbstractCegarLoop]: Abstraction has has 60 places, 74 transitions, 380 flow
[2024-03-11 23:01:15,594 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 186.66666666666666) internal successors, (560), 3 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:01:15,594 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 23:01:15,594 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 23:01:15,594 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-03-11 23:01:15,594 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-03-11 23:01:15,594 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 23:01:15,594 INFO  L85        PathProgramCache]: Analyzing trace with hash 453749829, now seen corresponding path program 1 times
[2024-03-11 23:01:15,594 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 23:01:15,594 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282676744]
[2024-03-11 23:01:15,594 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:01:15,595 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 23:01:15,605 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 23:01:15,619 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2024-03-11 23:01:15,620 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 23:01:15,620 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282676744]
[2024-03-11 23:01:15,620 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282676744] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 23:01:15,620 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 23:01:15,620 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-11 23:01:15,620 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606824664]
[2024-03-11 23:01:15,620 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 23:01:15,621 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-11 23:01:15,621 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 23:01:15,621 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-11 23:01:15,621 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-11 23:01:15,648 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 177 out of 341
[2024-03-11 23:01:15,649 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 74 transitions, 380 flow. Second operand  has 3 states, 3 states have (on average 180.0) internal successors, (540), 3 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:01:15,649 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 23:01:15,649 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 341
[2024-03-11 23:01:15,649 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 23:01:19,414 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1025] L1016-2-->L1016-4: Formula: (= |v_#race~data~0_47| |v_threadThread3of3ForFork0_#t~nondet5_17|)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_47|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_17|}  AuxVars[]  AssignedVars[#race~data~0, threadThread3of3ForFork0_#t~nondet5][92], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 111#L1032-2true, 20#$Ultimate##0true, 2#L1016-4true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 100#L1017true, Black: 233#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~breads_total~0#1|)), threadThread3of3ForFork0InUse, 211#true, 231#true, 236#true, 96#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 216#(= |#race~data~0| 0)])
[2024-03-11 23:01:19,414 INFO  L383   tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event
[2024-03-11 23:01:19,415 INFO  L386   tUnfolder$Statistics]:   existing Event has 29 ancestors and is cut-off event
[2024-03-11 23:01:19,415 INFO  L386   tUnfolder$Statistics]:   existing Event has 29 ancestors and is cut-off event
[2024-03-11 23:01:19,415 INFO  L386   tUnfolder$Statistics]:   existing Event has 29 ancestors and is cut-off event
[2024-03-11 23:01:20,062 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1025] L1016-2-->L1016-4: Formula: (= |v_#race~data~0_47| |v_threadThread3of3ForFork0_#t~nondet5_17|)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_47|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_17|}  AuxVars[]  AssignedVars[#race~data~0, threadThread3of3ForFork0_#t~nondet5][92], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 111#L1032-2true, 2#L1016-4true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), threadThread1of3ForFork0InUse, 77#L1015-1true, threadThread2of3ForFork0InUse, 100#L1017true, threadThread3of3ForFork0InUse, Black: 233#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~breads_total~0#1|)), 211#true, 231#true, 236#true, 96#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 216#(= |#race~data~0| 0)])
[2024-03-11 23:01:20,062 INFO  L383   tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event
[2024-03-11 23:01:20,062 INFO  L386   tUnfolder$Statistics]:   existing Event has 30 ancestors and is cut-off event
[2024-03-11 23:01:20,062 INFO  L386   tUnfolder$Statistics]:   existing Event has 30 ancestors and is cut-off event
[2024-03-11 23:01:20,062 INFO  L386   tUnfolder$Statistics]:   existing Event has 30 ancestors and is cut-off event
[2024-03-11 23:01:20,070 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1025] L1016-2-->L1016-4: Formula: (= |v_#race~data~0_47| |v_threadThread3of3ForFork0_#t~nondet5_17|)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_47|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_17|}  AuxVars[]  AssignedVars[#race~data~0, threadThread3of3ForFork0_#t~nondet5][92], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 111#L1032-2true, 20#$Ultimate##0true, 2#L1016-4true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), threadThread1of3ForFork0InUse, 47#threadEXITtrue, threadThread2of3ForFork0InUse, Black: 233#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~breads_total~0#1|)), threadThread3of3ForFork0InUse, 211#true, 231#true, 236#true, 96#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 216#(= |#race~data~0| 0)])
[2024-03-11 23:01:20,070 INFO  L383   tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event
[2024-03-11 23:01:20,070 INFO  L386   tUnfolder$Statistics]:   existing Event has 30 ancestors and is cut-off event
[2024-03-11 23:01:20,070 INFO  L386   tUnfolder$Statistics]:   existing Event has 30 ancestors and is cut-off event
[2024-03-11 23:01:20,070 INFO  L386   tUnfolder$Statistics]:   existing Event has 30 ancestors and is cut-off event
[2024-03-11 23:01:20,842 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1025] L1016-2-->L1016-4: Formula: (= |v_#race~data~0_47| |v_threadThread3of3ForFork0_#t~nondet5_17|)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_47|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_17|}  AuxVars[]  AssignedVars[#race~data~0, threadThread3of3ForFork0_#t~nondet5][92], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 111#L1032-2true, 2#L1016-4true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), threadThread1of3ForFork0InUse, 77#L1015-1true, 47#threadEXITtrue, threadThread2of3ForFork0InUse, threadThread3of3ForFork0InUse, Black: 233#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~breads_total~0#1|)), 211#true, 231#true, 236#true, 96#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 216#(= |#race~data~0| 0)])
[2024-03-11 23:01:20,843 INFO  L383   tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event
[2024-03-11 23:01:20,843 INFO  L386   tUnfolder$Statistics]:   existing Event has 31 ancestors and is cut-off event
[2024-03-11 23:01:20,843 INFO  L386   tUnfolder$Statistics]:   existing Event has 31 ancestors and is cut-off event
[2024-03-11 23:01:20,843 INFO  L386   tUnfolder$Statistics]:   existing Event has 31 ancestors and is cut-off event
[2024-03-11 23:01:20,845 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1025] L1016-2-->L1016-4: Formula: (= |v_#race~data~0_47| |v_threadThread3of3ForFork0_#t~nondet5_17|)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_47|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_17|}  AuxVars[]  AssignedVars[#race~data~0, threadThread3of3ForFork0_#t~nondet5][92], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 111#L1032-2true, 2#L1016-4true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 100#L1017true, Black: 233#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~breads_total~0#1|)), threadThread3of3ForFork0InUse, 174#L1016-3true, 211#true, 231#true, 236#true, 96#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 216#(= |#race~data~0| 0)])
[2024-03-11 23:01:20,846 INFO  L383   tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event
[2024-03-11 23:01:20,846 INFO  L386   tUnfolder$Statistics]:   existing Event has 31 ancestors and is cut-off event
[2024-03-11 23:01:20,846 INFO  L386   tUnfolder$Statistics]:   existing Event has 31 ancestors and is cut-off event
[2024-03-11 23:01:20,846 INFO  L386   tUnfolder$Statistics]:   existing Event has 31 ancestors and is cut-off event
[2024-03-11 23:01:20,846 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([909] L1016-3-->L1016-4: Formula: (= |v_#race~data~0_4| |v_threadThread2of3ForFork0_#t~nondet5_3|)  InVars {threadThread2of3ForFork0_#t~nondet5=|v_threadThread2of3ForFork0_#t~nondet5_3|}  OutVars{threadThread2of3ForFork0_#t~nondet5=|v_threadThread2of3ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_4|}  AuxVars[]  AssignedVars[#race~data~0][72], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 111#L1032-2true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 186#L1016-2true, 100#L1017true, Black: 233#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~breads_total~0#1|)), threadThread3of3ForFork0InUse, 36#L1016-4true, 211#true, 231#true, 96#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 238#(= |threadThread2of3ForFork0_#t~nondet5| |#race~data~0|), Black: 216#(= |#race~data~0| 0)])
[2024-03-11 23:01:20,846 INFO  L383   tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event
[2024-03-11 23:01:20,846 INFO  L386   tUnfolder$Statistics]:   existing Event has 31 ancestors and is cut-off event
[2024-03-11 23:01:20,846 INFO  L386   tUnfolder$Statistics]:   existing Event has 31 ancestors and is cut-off event
[2024-03-11 23:01:20,846 INFO  L386   tUnfolder$Statistics]:   existing Event has 31 ancestors and is cut-off event
[2024-03-11 23:01:20,936 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([999] L1016-2-->L1016-4: Formula: (= |v_#race~data~0_43| |v_threadThread1of3ForFork0_#t~nondet5_15|)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_43|, threadThread1of3ForFork0_#t~nondet5=|v_threadThread1of3ForFork0_#t~nondet5_15|}  AuxVars[]  AssignedVars[#race~data~0, threadThread1of3ForFork0_#t~nondet5][87], [111#L1032-2true, 29#L1016-6true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), threadThread1of3ForFork0InUse, 157#L1016-6true, threadThread2of3ForFork0InUse, Black: 233#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~breads_total~0#1|)), threadThread3of3ForFork0InUse, 211#true, 136#L1016-4true, 231#true, 236#true, 96#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 216#(= |#race~data~0| 0), 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|)])
[2024-03-11 23:01:20,936 INFO  L383   tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event
[2024-03-11 23:01:20,936 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2024-03-11 23:01:20,936 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2024-03-11 23:01:20,936 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2024-03-11 23:01:21,379 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1025] L1016-2-->L1016-4: Formula: (= |v_#race~data~0_47| |v_threadThread3of3ForFork0_#t~nondet5_17|)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_47|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_17|}  AuxVars[]  AssignedVars[#race~data~0, threadThread3of3ForFork0_#t~nondet5][112], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 111#L1032-2true, 2#L1016-4true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), threadThread1of3ForFork0InUse, 157#L1016-6true, threadThread2of3ForFork0InUse, Black: 233#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~breads_total~0#1|)), threadThread3of3ForFork0InUse, 211#true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 231#true, 236#true, 96#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 216#(= |#race~data~0| 0)])
[2024-03-11 23:01:21,380 INFO  L383   tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event
[2024-03-11 23:01:21,380 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2024-03-11 23:01:21,380 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2024-03-11 23:01:21,380 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2024-03-11 23:01:21,448 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1025] L1016-2-->L1016-4: Formula: (= |v_#race~data~0_47| |v_threadThread3of3ForFork0_#t~nondet5_17|)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_47|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_17|}  AuxVars[]  AssignedVars[#race~data~0, threadThread3of3ForFork0_#t~nondet5][92], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 111#L1032-2true, 2#L1016-4true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), threadThread1of3ForFork0InUse, 47#threadEXITtrue, threadThread2of3ForFork0InUse, Black: 233#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~breads_total~0#1|)), threadThread3of3ForFork0InUse, 174#L1016-3true, 211#true, 231#true, 236#true, 96#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 216#(= |#race~data~0| 0)])
[2024-03-11 23:01:21,449 INFO  L383   tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event
[2024-03-11 23:01:21,449 INFO  L386   tUnfolder$Statistics]:   existing Event has 32 ancestors and is cut-off event
[2024-03-11 23:01:21,449 INFO  L386   tUnfolder$Statistics]:   existing Event has 32 ancestors and is cut-off event
[2024-03-11 23:01:21,449 INFO  L386   tUnfolder$Statistics]:   existing Event has 32 ancestors and is cut-off event
[2024-03-11 23:01:21,449 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([909] L1016-3-->L1016-4: Formula: (= |v_#race~data~0_4| |v_threadThread2of3ForFork0_#t~nondet5_3|)  InVars {threadThread2of3ForFork0_#t~nondet5=|v_threadThread2of3ForFork0_#t~nondet5_3|}  OutVars{threadThread2of3ForFork0_#t~nondet5=|v_threadThread2of3ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_4|}  AuxVars[]  AssignedVars[#race~data~0][72], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 111#L1032-2true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), threadThread1of3ForFork0InUse, 47#threadEXITtrue, threadThread2of3ForFork0InUse, 186#L1016-2true, Black: 233#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~breads_total~0#1|)), threadThread3of3ForFork0InUse, 36#L1016-4true, 211#true, 231#true, 96#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 216#(= |#race~data~0| 0), 238#(= |threadThread2of3ForFork0_#t~nondet5| |#race~data~0|)])
[2024-03-11 23:01:21,449 INFO  L383   tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event
[2024-03-11 23:01:21,449 INFO  L386   tUnfolder$Statistics]:   existing Event has 32 ancestors and is cut-off event
[2024-03-11 23:01:21,449 INFO  L386   tUnfolder$Statistics]:   existing Event has 32 ancestors and is cut-off event
[2024-03-11 23:01:21,449 INFO  L386   tUnfolder$Statistics]:   existing Event has 32 ancestors and is cut-off event
[2024-03-11 23:01:21,529 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([999] L1016-2-->L1016-4: Formula: (= |v_#race~data~0_43| |v_threadThread1of3ForFork0_#t~nondet5_15|)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_43|, threadThread1of3ForFork0_#t~nondet5=|v_threadThread1of3ForFork0_#t~nondet5_15|}  AuxVars[]  AssignedVars[#race~data~0, threadThread1of3ForFork0_#t~nondet5][87], [111#L1032-2true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), threadThread1of3ForFork0InUse, 157#L1016-6true, threadThread2of3ForFork0InUse, Black: 233#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~breads_total~0#1|)), threadThread3of3ForFork0InUse, 211#true, 136#L1016-4true, 4#threadEXITtrue, 231#true, 236#true, 96#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 216#(= |#race~data~0| 0), 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|)])
[2024-03-11 23:01:21,529 INFO  L383   tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event
[2024-03-11 23:01:21,529 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2024-03-11 23:01:21,529 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2024-03-11 23:01:21,529 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2024-03-11 23:01:21,875 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1025] L1016-2-->L1016-4: Formula: (= |v_#race~data~0_47| |v_threadThread3of3ForFork0_#t~nondet5_17|)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_47|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_17|}  AuxVars[]  AssignedVars[#race~data~0, threadThread3of3ForFork0_#t~nondet5][92], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 111#L1032-2true, 2#L1016-4true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 100#L1017true, Black: 233#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~breads_total~0#1|)), threadThread3of3ForFork0InUse, 211#true, 231#true, 236#true, 96#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 129#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 216#(= |#race~data~0| 0)])
[2024-03-11 23:01:21,875 INFO  L383   tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event
[2024-03-11 23:01:21,876 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2024-03-11 23:01:21,876 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2024-03-11 23:01:21,876 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2024-03-11 23:01:22,306 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1025] L1016-2-->L1016-4: Formula: (= |v_#race~data~0_47| |v_threadThread3of3ForFork0_#t~nondet5_17|)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_47|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_17|}  AuxVars[]  AssignedVars[#race~data~0, threadThread3of3ForFork0_#t~nondet5][92], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 111#L1032-2true, 2#L1016-4true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 47#threadEXITtrue, Black: 233#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~breads_total~0#1|)), threadThread3of3ForFork0InUse, 211#true, 231#true, 236#true, 96#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 129#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 216#(= |#race~data~0| 0)])
[2024-03-11 23:01:22,306 INFO  L383   tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event
[2024-03-11 23:01:22,306 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2024-03-11 23:01:22,306 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2024-03-11 23:01:22,306 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2024-03-11 23:01:22,503 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([909] L1016-3-->L1016-4: Formula: (= |v_#race~data~0_4| |v_threadThread2of3ForFork0_#t~nondet5_3|)  InVars {threadThread2of3ForFork0_#t~nondet5=|v_threadThread2of3ForFork0_#t~nondet5_3|}  OutVars{threadThread2of3ForFork0_#t~nondet5=|v_threadThread2of3ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_4|}  AuxVars[]  AssignedVars[#race~data~0][72], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 111#L1032-2true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 29#L1016-6true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 233#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~breads_total~0#1|)), 36#L1016-4true, threadThread3of3ForFork0InUse, 10#threadEXITtrue, 211#true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 231#true, 238#(= |threadThread2of3ForFork0_#t~nondet5| |#race~data~0|), Black: 216#(= |#race~data~0| 0)])
[2024-03-11 23:01:22,504 INFO  L383   tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event
[2024-03-11 23:01:22,504 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2024-03-11 23:01:22,504 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2024-03-11 23:01:22,504 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2024-03-11 23:01:22,512 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1025] L1016-2-->L1016-4: Formula: (= |v_#race~data~0_47| |v_threadThread3of3ForFork0_#t~nondet5_17|)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_47|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_17|}  AuxVars[]  AssignedVars[#race~data~0, threadThread3of3ForFork0_#t~nondet5][92], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 111#L1032-2true, 2#L1016-4true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 233#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~breads_total~0#1|)), threadThread3of3ForFork0InUse, 158#threadEXITtrue, 211#true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 231#true, 236#true, 96#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 216#(= |#race~data~0| 0)])
[2024-03-11 23:01:22,512 INFO  L383   tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event
[2024-03-11 23:01:22,512 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2024-03-11 23:01:22,512 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2024-03-11 23:01:22,512 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2024-03-11 23:01:22,543 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([909] L1016-3-->L1016-4: Formula: (= |v_#race~data~0_4| |v_threadThread2of3ForFork0_#t~nondet5_3|)  InVars {threadThread2of3ForFork0_#t~nondet5=|v_threadThread2of3ForFork0_#t~nondet5_3|}  OutVars{threadThread2of3ForFork0_#t~nondet5=|v_threadThread2of3ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_4|}  AuxVars[]  AssignedVars[#race~data~0][72], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 111#L1032-2true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 233#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~breads_total~0#1|)), threadThread3of3ForFork0InUse, 36#L1016-4true, 10#threadEXITtrue, 211#true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 4#threadEXITtrue, 231#true, Black: 216#(= |#race~data~0| 0), 238#(= |threadThread2of3ForFork0_#t~nondet5| |#race~data~0|)])
[2024-03-11 23:01:22,543 INFO  L383   tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event
[2024-03-11 23:01:22,543 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is cut-off event
[2024-03-11 23:01:22,543 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is cut-off event
[2024-03-11 23:01:22,543 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is cut-off event
[2024-03-11 23:01:23,120 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([909] L1016-3-->L1016-4: Formula: (= |v_#race~data~0_4| |v_threadThread2of3ForFork0_#t~nondet5_3|)  InVars {threadThread2of3ForFork0_#t~nondet5=|v_threadThread2of3ForFork0_#t~nondet5_3|}  OutVars{threadThread2of3ForFork0_#t~nondet5=|v_threadThread2of3ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_4|}  AuxVars[]  AssignedVars[#race~data~0][21], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 29#L1016-6true, threadThread1of3ForFork0InUse, 107#ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACEtrue, threadThread2of3ForFork0InUse, Black: 233#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~breads_total~0#1|)), 36#L1016-4true, threadThread3of3ForFork0InUse, 10#threadEXITtrue, 211#true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 231#true, Black: 216#(= |#race~data~0| 0), 238#(= |threadThread2of3ForFork0_#t~nondet5| |#race~data~0|)])
[2024-03-11 23:01:23,120 INFO  L383   tUnfolder$Statistics]: this new event has 34 ancestors and is not cut-off event
[2024-03-11 23:01:23,120 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is not cut-off event
[2024-03-11 23:01:23,120 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is not cut-off event
[2024-03-11 23:01:23,120 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is not cut-off event
[2024-03-11 23:01:23,566 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([909] L1016-3-->L1016-4: Formula: (= |v_#race~data~0_4| |v_threadThread2of3ForFork0_#t~nondet5_3|)  InVars {threadThread2of3ForFork0_#t~nondet5=|v_threadThread2of3ForFork0_#t~nondet5_3|}  OutVars{threadThread2of3ForFork0_#t~nondet5=|v_threadThread2of3ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_4|}  AuxVars[]  AssignedVars[#race~data~0][21], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), threadThread1of3ForFork0InUse, 107#ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACEtrue, threadThread2of3ForFork0InUse, Black: 233#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~breads_total~0#1|)), threadThread3of3ForFork0InUse, 36#L1016-4true, 10#threadEXITtrue, 211#true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 4#threadEXITtrue, 231#true, Black: 216#(= |#race~data~0| 0), 238#(= |threadThread2of3ForFork0_#t~nondet5| |#race~data~0|)])
[2024-03-11 23:01:23,566 INFO  L383   tUnfolder$Statistics]: this new event has 35 ancestors and is not cut-off event
[2024-03-11 23:01:23,567 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is not cut-off event
[2024-03-11 23:01:23,567 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is not cut-off event
[2024-03-11 23:01:23,567 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is not cut-off event
[2024-03-11 23:01:24,689 INFO  L130       PetriNetUnfolder]: 105341/151365 cut-off events.
[2024-03-11 23:01:24,689 INFO  L131       PetriNetUnfolder]: For 154508/159711 co-relation queries the response was YES.
[2024-03-11 23:01:25,046 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 415539 conditions, 151365 events. 105341/151365 cut-off events. For 154508/159711 co-relation queries the response was YES. Maximal size of possible extension queue 4838. Compared 1147273 event pairs, 52911 based on Foata normal form. 39/140450 useless extension candidates. Maximal degree in co-relation 415528. Up to 113270 conditions per place. 
[2024-03-11 23:01:25,524 INFO  L137   encePairwiseOnDemand]: 333/341 looper letters, 82 selfloop transitions, 30 changer transitions 0/122 dead transitions.
[2024-03-11 23:01:25,524 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 122 transitions, 851 flow
[2024-03-11 23:01:25,525 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-11 23:01:25,525 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-11 23:01:25,526 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 598 transitions.
[2024-03-11 23:01:25,526 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5845552297165201
[2024-03-11 23:01:25,526 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 598 transitions.
[2024-03-11 23:01:25,526 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 598 transitions.
[2024-03-11 23:01:25,526 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 23:01:25,526 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 598 transitions.
[2024-03-11 23:01:25,527 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 199.33333333333334) internal successors, (598), 3 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:01:25,529 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:01:25,529 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:01:25,529 INFO  L175             Difference]: Start difference. First operand has 60 places, 74 transitions, 380 flow. Second operand 3 states and 598 transitions.
[2024-03-11 23:01:25,529 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 122 transitions, 851 flow
[2024-03-11 23:01:25,563 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 122 transitions, 849 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-11 23:01:25,564 INFO  L231             Difference]: Finished difference. Result has 63 places, 96 transitions, 708 flow
[2024-03-11 23:01:25,564 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=378, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=708, PETRI_PLACES=63, PETRI_TRANSITIONS=96}
[2024-03-11 23:01:25,565 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 6 predicate places.
[2024-03-11 23:01:25,565 INFO  L495      AbstractCegarLoop]: Abstraction has has 63 places, 96 transitions, 708 flow
[2024-03-11 23:01:25,565 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 180.0) internal successors, (540), 3 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:01:25,565 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 23:01:25,565 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 23:01:25,565 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-03-11 23:01:25,565 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-03-11 23:01:25,565 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 23:01:25,565 INFO  L85        PathProgramCache]: Analyzing trace with hash 198761968, now seen corresponding path program 1 times
[2024-03-11 23:01:25,566 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 23:01:25,566 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724321566]
[2024-03-11 23:01:25,566 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:01:25,566 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 23:01:25,582 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 23:01:25,637 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 23:01:25,637 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 23:01:25,637 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724321566]
[2024-03-11 23:01:25,637 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724321566] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 23:01:25,638 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [47761617]
[2024-03-11 23:01:25,638 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:01:25,638 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 23:01:25,638 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 23:01:25,639 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-11 23:01:25,645 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-03-11 23:01:25,744 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 23:01:25,746 INFO  L263         TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 4 conjunts are in the unsatisfiable core
[2024-03-11 23:01:25,748 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 23:01:25,801 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 23:01:25,801 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 23:01:25,837 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 23:01:25,837 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [47761617] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 23:01:25,837 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 23:01:25,837 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8
[2024-03-11 23:01:25,837 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961087022]
[2024-03-11 23:01:25,837 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 23:01:25,837 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-03-11 23:01:25,838 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 23:01:25,838 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-03-11 23:01:25,838 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2024-03-11 23:01:25,937 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 178 out of 341
[2024-03-11 23:01:25,938 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 96 transitions, 708 flow. Second operand  has 9 states, 9 states have (on average 180.0) internal successors, (1620), 9 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:01:25,938 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 23:01:25,938 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 341
[2024-03-11 23:01:25,938 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 23:01:30,740 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1085] L1028-6-->L1032-1: Formula: (and (= |v_#race_647| (store |v_#race_648| |v_ULTIMATE.start_main_~#tids~0#1.base_378| (store (store (store (store (select |v_#race_648| |v_ULTIMATE.start_main_~#tids~0#1.base_378|) |v_ULTIMATE.start_main_~#tids~0#1.offset_360| 0) (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_360| 1) 0) (+ 2 |v_ULTIMATE.start_main_~#tids~0#1.offset_360|) 0) (+ 3 |v_ULTIMATE.start_main_~#tids~0#1.offset_360|) 0))) (= |v_#valid_213| (store |v_#valid_214| (select (select |v_#memory_$Pointer$.base_206| |v_ULTIMATE.start_main_~#tids~0#1.base_378|) |v_ULTIMATE.start_main_~#tids~0#1.offset_360|) 0)) (not (< |v_ULTIMATE.start_main_~i~1#1_184| |v_ULTIMATE.start_main_~breads_total~0#1_187|)) (= |v_#race~data~0_53| 0))  InVars {#race=|v_#race_648|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_360|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_184|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_206|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_378|, #valid=|v_#valid_214|, ULTIMATE.start_main_~breads_total~0#1=|v_ULTIMATE.start_main_~breads_total~0#1_187|}  OutVars{#race=|v_#race_647|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_360|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_184|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_206|, #race~data~0=|v_#race~data~0_53|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_378|, #valid=|v_#valid_213|, ULTIMATE.start_main_#t~mem18#1.base=|v_ULTIMATE.start_main_#t~mem18#1.base_97|, ULTIMATE.start_main_~breads_total~0#1=|v_ULTIMATE.start_main_~breads_total~0#1_187|, ULTIMATE.start_main_#t~mem18#1.offset=|v_ULTIMATE.start_main_#t~mem18#1.offset_83|}  AuxVars[]  AssignedVars[#race, #race~data~0, #valid, ULTIMATE.start_main_#t~mem18#1.base, ULTIMATE.start_main_#t~mem18#1.offset][122], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 29#L1016-6true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 36#L1016-4true, threadThread3of3ForFork0InUse, Black: 233#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~breads_total~0#1|)), 211#true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 238#(= |threadThread2of3ForFork0_#t~nondet5| |#race~data~0|), 324#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~breads_total~0#1|)), 236#true, Black: 214#true, 45#L1032-1true])
[2024-03-11 23:01:30,740 INFO  L383   tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event
[2024-03-11 23:01:30,740 INFO  L386   tUnfolder$Statistics]:   existing Event has 37 ancestors and is cut-off event
[2024-03-11 23:01:30,740 INFO  L386   tUnfolder$Statistics]:   existing Event has 37 ancestors and is cut-off event
[2024-03-11 23:01:30,740 INFO  L386   tUnfolder$Statistics]:   existing Event has 37 ancestors and is cut-off event
[2024-03-11 23:01:30,803 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1085] L1028-6-->L1032-1: Formula: (and (= |v_#race_647| (store |v_#race_648| |v_ULTIMATE.start_main_~#tids~0#1.base_378| (store (store (store (store (select |v_#race_648| |v_ULTIMATE.start_main_~#tids~0#1.base_378|) |v_ULTIMATE.start_main_~#tids~0#1.offset_360| 0) (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_360| 1) 0) (+ 2 |v_ULTIMATE.start_main_~#tids~0#1.offset_360|) 0) (+ 3 |v_ULTIMATE.start_main_~#tids~0#1.offset_360|) 0))) (= |v_#valid_213| (store |v_#valid_214| (select (select |v_#memory_$Pointer$.base_206| |v_ULTIMATE.start_main_~#tids~0#1.base_378|) |v_ULTIMATE.start_main_~#tids~0#1.offset_360|) 0)) (not (< |v_ULTIMATE.start_main_~i~1#1_184| |v_ULTIMATE.start_main_~breads_total~0#1_187|)) (= |v_#race~data~0_53| 0))  InVars {#race=|v_#race_648|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_360|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_184|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_206|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_378|, #valid=|v_#valid_214|, ULTIMATE.start_main_~breads_total~0#1=|v_ULTIMATE.start_main_~breads_total~0#1_187|}  OutVars{#race=|v_#race_647|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_360|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_184|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_206|, #race~data~0=|v_#race~data~0_53|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_378|, #valid=|v_#valid_213|, ULTIMATE.start_main_#t~mem18#1.base=|v_ULTIMATE.start_main_#t~mem18#1.base_97|, ULTIMATE.start_main_~breads_total~0#1=|v_ULTIMATE.start_main_~breads_total~0#1_187|, ULTIMATE.start_main_#t~mem18#1.offset=|v_ULTIMATE.start_main_#t~mem18#1.offset_83|}  AuxVars[]  AssignedVars[#race, #race~data~0, #valid, ULTIMATE.start_main_#t~mem18#1.base, ULTIMATE.start_main_#t~mem18#1.offset][122], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 29#L1016-6true, threadThread1of3ForFork0NotInUse, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), threadThread2of3ForFork0InUse, threadThread3of3ForFork0InUse, 36#L1016-4true, Black: 233#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~breads_total~0#1|)), 211#true, Black: 238#(= |threadThread2of3ForFork0_#t~nondet5| |#race~data~0|), 324#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~breads_total~0#1|)), 236#true, 96#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 214#true, 45#L1032-1true])
[2024-03-11 23:01:30,803 INFO  L383   tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event
[2024-03-11 23:01:30,803 INFO  L386   tUnfolder$Statistics]:   existing Event has 37 ancestors and is cut-off event
[2024-03-11 23:01:30,803 INFO  L386   tUnfolder$Statistics]:   existing Event has 37 ancestors and is cut-off event
[2024-03-11 23:01:30,803 INFO  L386   tUnfolder$Statistics]:   existing Event has 37 ancestors and is cut-off event
[2024-03-11 23:01:30,804 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1085] L1028-6-->L1032-1: Formula: (and (= |v_#race_647| (store |v_#race_648| |v_ULTIMATE.start_main_~#tids~0#1.base_378| (store (store (store (store (select |v_#race_648| |v_ULTIMATE.start_main_~#tids~0#1.base_378|) |v_ULTIMATE.start_main_~#tids~0#1.offset_360| 0) (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_360| 1) 0) (+ 2 |v_ULTIMATE.start_main_~#tids~0#1.offset_360|) 0) (+ 3 |v_ULTIMATE.start_main_~#tids~0#1.offset_360|) 0))) (= |v_#valid_213| (store |v_#valid_214| (select (select |v_#memory_$Pointer$.base_206| |v_ULTIMATE.start_main_~#tids~0#1.base_378|) |v_ULTIMATE.start_main_~#tids~0#1.offset_360|) 0)) (not (< |v_ULTIMATE.start_main_~i~1#1_184| |v_ULTIMATE.start_main_~breads_total~0#1_187|)) (= |v_#race~data~0_53| 0))  InVars {#race=|v_#race_648|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_360|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_184|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_206|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_378|, #valid=|v_#valid_214|, ULTIMATE.start_main_~breads_total~0#1=|v_ULTIMATE.start_main_~breads_total~0#1_187|}  OutVars{#race=|v_#race_647|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_360|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_184|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_206|, #race~data~0=|v_#race~data~0_53|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_378|, #valid=|v_#valid_213|, ULTIMATE.start_main_#t~mem18#1.base=|v_ULTIMATE.start_main_#t~mem18#1.base_97|, ULTIMATE.start_main_~breads_total~0#1=|v_ULTIMATE.start_main_~breads_total~0#1_187|, ULTIMATE.start_main_#t~mem18#1.offset=|v_ULTIMATE.start_main_#t~mem18#1.offset_83|}  AuxVars[]  AssignedVars[#race, #race~data~0, #valid, ULTIMATE.start_main_#t~mem18#1.base, ULTIMATE.start_main_#t~mem18#1.offset][122], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 100#L1017true, threadThread3of3ForFork0NotInUse, Black: 233#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~breads_total~0#1|)), 36#L1016-4true, 211#true, Black: 238#(= |threadThread2of3ForFork0_#t~nondet5| |#race~data~0|), 324#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~breads_total~0#1|)), 236#true, 96#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 214#true, 45#L1032-1true])
[2024-03-11 23:01:30,804 INFO  L383   tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event
[2024-03-11 23:01:30,804 INFO  L386   tUnfolder$Statistics]:   existing Event has 37 ancestors and is cut-off event
[2024-03-11 23:01:30,804 INFO  L386   tUnfolder$Statistics]:   existing Event has 37 ancestors and is cut-off event
[2024-03-11 23:01:30,804 INFO  L386   tUnfolder$Statistics]:   existing Event has 37 ancestors and is cut-off event
[2024-03-11 23:01:31,035 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1085] L1028-6-->L1032-1: Formula: (and (= |v_#race_647| (store |v_#race_648| |v_ULTIMATE.start_main_~#tids~0#1.base_378| (store (store (store (store (select |v_#race_648| |v_ULTIMATE.start_main_~#tids~0#1.base_378|) |v_ULTIMATE.start_main_~#tids~0#1.offset_360| 0) (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_360| 1) 0) (+ 2 |v_ULTIMATE.start_main_~#tids~0#1.offset_360|) 0) (+ 3 |v_ULTIMATE.start_main_~#tids~0#1.offset_360|) 0))) (= |v_#valid_213| (store |v_#valid_214| (select (select |v_#memory_$Pointer$.base_206| |v_ULTIMATE.start_main_~#tids~0#1.base_378|) |v_ULTIMATE.start_main_~#tids~0#1.offset_360|) 0)) (not (< |v_ULTIMATE.start_main_~i~1#1_184| |v_ULTIMATE.start_main_~breads_total~0#1_187|)) (= |v_#race~data~0_53| 0))  InVars {#race=|v_#race_648|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_360|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_184|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_206|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_378|, #valid=|v_#valid_214|, ULTIMATE.start_main_~breads_total~0#1=|v_ULTIMATE.start_main_~breads_total~0#1_187|}  OutVars{#race=|v_#race_647|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_360|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_184|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_206|, #race~data~0=|v_#race~data~0_53|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_378|, #valid=|v_#valid_213|, ULTIMATE.start_main_#t~mem18#1.base=|v_ULTIMATE.start_main_#t~mem18#1.base_97|, ULTIMATE.start_main_~breads_total~0#1=|v_ULTIMATE.start_main_~breads_total~0#1_187|, ULTIMATE.start_main_#t~mem18#1.offset=|v_ULTIMATE.start_main_#t~mem18#1.offset_83|}  AuxVars[]  AssignedVars[#race, #race~data~0, #valid, ULTIMATE.start_main_#t~mem18#1.base, ULTIMATE.start_main_#t~mem18#1.offset][122], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, threadThread3of3ForFork0NotInUse, 36#L1016-4true, Black: 233#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~breads_total~0#1|)), 10#threadEXITtrue, 211#true, Black: 238#(= |threadThread2of3ForFork0_#t~nondet5| |#race~data~0|), 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 324#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~breads_total~0#1|)), 236#true, Black: 214#true, 45#L1032-1true])
[2024-03-11 23:01:31,035 INFO  L383   tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event
[2024-03-11 23:01:31,035 INFO  L386   tUnfolder$Statistics]:   existing Event has 38 ancestors and is cut-off event
[2024-03-11 23:01:31,035 INFO  L386   tUnfolder$Statistics]:   existing Event has 38 ancestors and is cut-off event
[2024-03-11 23:01:31,035 INFO  L386   tUnfolder$Statistics]:   existing Event has 38 ancestors and is cut-off event
[2024-03-11 23:01:31,036 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1085] L1028-6-->L1032-1: Formula: (and (= |v_#race_647| (store |v_#race_648| |v_ULTIMATE.start_main_~#tids~0#1.base_378| (store (store (store (store (select |v_#race_648| |v_ULTIMATE.start_main_~#tids~0#1.base_378|) |v_ULTIMATE.start_main_~#tids~0#1.offset_360| 0) (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_360| 1) 0) (+ 2 |v_ULTIMATE.start_main_~#tids~0#1.offset_360|) 0) (+ 3 |v_ULTIMATE.start_main_~#tids~0#1.offset_360|) 0))) (= |v_#valid_213| (store |v_#valid_214| (select (select |v_#memory_$Pointer$.base_206| |v_ULTIMATE.start_main_~#tids~0#1.base_378|) |v_ULTIMATE.start_main_~#tids~0#1.offset_360|) 0)) (not (< |v_ULTIMATE.start_main_~i~1#1_184| |v_ULTIMATE.start_main_~breads_total~0#1_187|)) (= |v_#race~data~0_53| 0))  InVars {#race=|v_#race_648|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_360|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_184|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_206|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_378|, #valid=|v_#valid_214|, ULTIMATE.start_main_~breads_total~0#1=|v_ULTIMATE.start_main_~breads_total~0#1_187|}  OutVars{#race=|v_#race_647|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_360|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_184|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_206|, #race~data~0=|v_#race~data~0_53|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_378|, #valid=|v_#valid_213|, ULTIMATE.start_main_#t~mem18#1.base=|v_ULTIMATE.start_main_#t~mem18#1.base_97|, ULTIMATE.start_main_~breads_total~0#1=|v_ULTIMATE.start_main_~breads_total~0#1_187|, ULTIMATE.start_main_#t~mem18#1.offset=|v_ULTIMATE.start_main_#t~mem18#1.offset_83|}  AuxVars[]  AssignedVars[#race, #race~data~0, #valid, ULTIMATE.start_main_#t~mem18#1.base, ULTIMATE.start_main_#t~mem18#1.offset][122], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 36#L1016-4true, threadThread3of3ForFork0InUse, Black: 233#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~breads_total~0#1|)), 211#true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 238#(= |threadThread2of3ForFork0_#t~nondet5| |#race~data~0|), 4#threadEXITtrue, 324#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~breads_total~0#1|)), 236#true, Black: 214#true, 45#L1032-1true])
[2024-03-11 23:01:31,036 INFO  L383   tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event
[2024-03-11 23:01:31,036 INFO  L386   tUnfolder$Statistics]:   existing Event has 38 ancestors and is cut-off event
[2024-03-11 23:01:31,036 INFO  L386   tUnfolder$Statistics]:   existing Event has 38 ancestors and is cut-off event
[2024-03-11 23:01:31,036 INFO  L386   tUnfolder$Statistics]:   existing Event has 38 ancestors and is cut-off event
[2024-03-11 23:01:31,068 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1085] L1028-6-->L1032-1: Formula: (and (= |v_#race_647| (store |v_#race_648| |v_ULTIMATE.start_main_~#tids~0#1.base_378| (store (store (store (store (select |v_#race_648| |v_ULTIMATE.start_main_~#tids~0#1.base_378|) |v_ULTIMATE.start_main_~#tids~0#1.offset_360| 0) (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_360| 1) 0) (+ 2 |v_ULTIMATE.start_main_~#tids~0#1.offset_360|) 0) (+ 3 |v_ULTIMATE.start_main_~#tids~0#1.offset_360|) 0))) (= |v_#valid_213| (store |v_#valid_214| (select (select |v_#memory_$Pointer$.base_206| |v_ULTIMATE.start_main_~#tids~0#1.base_378|) |v_ULTIMATE.start_main_~#tids~0#1.offset_360|) 0)) (not (< |v_ULTIMATE.start_main_~i~1#1_184| |v_ULTIMATE.start_main_~breads_total~0#1_187|)) (= |v_#race~data~0_53| 0))  InVars {#race=|v_#race_648|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_360|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_184|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_206|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_378|, #valid=|v_#valid_214|, ULTIMATE.start_main_~breads_total~0#1=|v_ULTIMATE.start_main_~breads_total~0#1_187|}  OutVars{#race=|v_#race_647|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_360|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_184|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_206|, #race~data~0=|v_#race~data~0_53|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_378|, #valid=|v_#valid_213|, ULTIMATE.start_main_#t~mem18#1.base=|v_ULTIMATE.start_main_#t~mem18#1.base_97|, ULTIMATE.start_main_~breads_total~0#1=|v_ULTIMATE.start_main_~breads_total~0#1_187|, ULTIMATE.start_main_#t~mem18#1.offset=|v_ULTIMATE.start_main_#t~mem18#1.offset_83|}  AuxVars[]  AssignedVars[#race, #race~data~0, #valid, ULTIMATE.start_main_#t~mem18#1.base, ULTIMATE.start_main_#t~mem18#1.offset][122], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), threadThread1of3ForFork0NotInUse, threadThread2of3ForFork0InUse, threadThread3of3ForFork0InUse, 36#L1016-4true, Black: 233#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~breads_total~0#1|)), 211#true, Black: 238#(= |threadThread2of3ForFork0_#t~nondet5| |#race~data~0|), 4#threadEXITtrue, 324#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~breads_total~0#1|)), 236#true, 96#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 214#true, 45#L1032-1true])
[2024-03-11 23:01:31,068 INFO  L383   tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event
[2024-03-11 23:01:31,068 INFO  L386   tUnfolder$Statistics]:   existing Event has 38 ancestors and is cut-off event
[2024-03-11 23:01:31,068 INFO  L386   tUnfolder$Statistics]:   existing Event has 38 ancestors and is cut-off event
[2024-03-11 23:01:31,068 INFO  L386   tUnfolder$Statistics]:   existing Event has 38 ancestors and is cut-off event
[2024-03-11 23:01:31,068 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1085] L1028-6-->L1032-1: Formula: (and (= |v_#race_647| (store |v_#race_648| |v_ULTIMATE.start_main_~#tids~0#1.base_378| (store (store (store (store (select |v_#race_648| |v_ULTIMATE.start_main_~#tids~0#1.base_378|) |v_ULTIMATE.start_main_~#tids~0#1.offset_360| 0) (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_360| 1) 0) (+ 2 |v_ULTIMATE.start_main_~#tids~0#1.offset_360|) 0) (+ 3 |v_ULTIMATE.start_main_~#tids~0#1.offset_360|) 0))) (= |v_#valid_213| (store |v_#valid_214| (select (select |v_#memory_$Pointer$.base_206| |v_ULTIMATE.start_main_~#tids~0#1.base_378|) |v_ULTIMATE.start_main_~#tids~0#1.offset_360|) 0)) (not (< |v_ULTIMATE.start_main_~i~1#1_184| |v_ULTIMATE.start_main_~breads_total~0#1_187|)) (= |v_#race~data~0_53| 0))  InVars {#race=|v_#race_648|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_360|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_184|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_206|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_378|, #valid=|v_#valid_214|, ULTIMATE.start_main_~breads_total~0#1=|v_ULTIMATE.start_main_~breads_total~0#1_187|}  OutVars{#race=|v_#race_647|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_360|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_184|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_206|, #race~data~0=|v_#race~data~0_53|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_378|, #valid=|v_#valid_213|, ULTIMATE.start_main_#t~mem18#1.base=|v_ULTIMATE.start_main_#t~mem18#1.base_97|, ULTIMATE.start_main_~breads_total~0#1=|v_ULTIMATE.start_main_~breads_total~0#1_187|, ULTIMATE.start_main_#t~mem18#1.offset=|v_ULTIMATE.start_main_#t~mem18#1.offset_83|}  AuxVars[]  AssignedVars[#race, #race~data~0, #valid, ULTIMATE.start_main_#t~mem18#1.base, ULTIMATE.start_main_#t~mem18#1.offset][122], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), threadThread1of3ForFork0InUse, 47#threadEXITtrue, threadThread2of3ForFork0InUse, threadThread3of3ForFork0NotInUse, Black: 233#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~breads_total~0#1|)), 36#L1016-4true, 211#true, Black: 238#(= |threadThread2of3ForFork0_#t~nondet5| |#race~data~0|), 324#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~breads_total~0#1|)), 236#true, 96#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 214#true, 45#L1032-1true])
[2024-03-11 23:01:31,068 INFO  L383   tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event
[2024-03-11 23:01:31,068 INFO  L386   tUnfolder$Statistics]:   existing Event has 38 ancestors and is cut-off event
[2024-03-11 23:01:31,068 INFO  L386   tUnfolder$Statistics]:   existing Event has 38 ancestors and is cut-off event
[2024-03-11 23:01:31,068 INFO  L386   tUnfolder$Statistics]:   existing Event has 38 ancestors and is cut-off event
[2024-03-11 23:01:31,672 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1085] L1028-6-->L1032-1: Formula: (and (= |v_#race_647| (store |v_#race_648| |v_ULTIMATE.start_main_~#tids~0#1.base_378| (store (store (store (store (select |v_#race_648| |v_ULTIMATE.start_main_~#tids~0#1.base_378|) |v_ULTIMATE.start_main_~#tids~0#1.offset_360| 0) (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_360| 1) 0) (+ 2 |v_ULTIMATE.start_main_~#tids~0#1.offset_360|) 0) (+ 3 |v_ULTIMATE.start_main_~#tids~0#1.offset_360|) 0))) (= |v_#valid_213| (store |v_#valid_214| (select (select |v_#memory_$Pointer$.base_206| |v_ULTIMATE.start_main_~#tids~0#1.base_378|) |v_ULTIMATE.start_main_~#tids~0#1.offset_360|) 0)) (not (< |v_ULTIMATE.start_main_~i~1#1_184| |v_ULTIMATE.start_main_~breads_total~0#1_187|)) (= |v_#race~data~0_53| 0))  InVars {#race=|v_#race_648|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_360|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_184|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_206|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_378|, #valid=|v_#valid_214|, ULTIMATE.start_main_~breads_total~0#1=|v_ULTIMATE.start_main_~breads_total~0#1_187|}  OutVars{#race=|v_#race_647|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_360|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_184|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_206|, #race~data~0=|v_#race~data~0_53|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_378|, #valid=|v_#valid_213|, ULTIMATE.start_main_#t~mem18#1.base=|v_ULTIMATE.start_main_#t~mem18#1.base_97|, ULTIMATE.start_main_~breads_total~0#1=|v_ULTIMATE.start_main_~breads_total~0#1_187|, ULTIMATE.start_main_#t~mem18#1.offset=|v_ULTIMATE.start_main_#t~mem18#1.offset_83|}  AuxVars[]  AssignedVars[#race, #race~data~0, #valid, ULTIMATE.start_main_#t~mem18#1.base, ULTIMATE.start_main_#t~mem18#1.offset][122], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, threadThread3of3ForFork0NotInUse, 36#L1016-4true, Black: 233#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~breads_total~0#1|)), 211#true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 238#(= |threadThread2of3ForFork0_#t~nondet5| |#race~data~0|), 324#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~breads_total~0#1|)), 236#true, Black: 214#true, 45#L1032-1true])
[2024-03-11 23:01:31,672 INFO  L383   tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event
[2024-03-11 23:01:31,672 INFO  L386   tUnfolder$Statistics]:   existing Event has 29 ancestors and is cut-off event
[2024-03-11 23:01:31,672 INFO  L386   tUnfolder$Statistics]:   existing Event has 29 ancestors and is cut-off event
[2024-03-11 23:01:31,672 INFO  L386   tUnfolder$Statistics]:   existing Event has 29 ancestors and is cut-off event
[2024-03-11 23:01:31,810 INFO  L130       PetriNetUnfolder]: 57905/87261 cut-off events.
[2024-03-11 23:01:31,810 INFO  L131       PetriNetUnfolder]: For 175802/188648 co-relation queries the response was YES.
[2024-03-11 23:01:32,012 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 261652 conditions, 87261 events. 57905/87261 cut-off events. For 175802/188648 co-relation queries the response was YES. Maximal size of possible extension queue 2667. Compared 680496 event pairs, 14538 based on Foata normal form. 5046/88489 useless extension candidates. Maximal degree in co-relation 261640. Up to 42761 conditions per place. 
[2024-03-11 23:01:32,272 INFO  L137   encePairwiseOnDemand]: 335/341 looper letters, 152 selfloop transitions, 6 changer transitions 0/177 dead transitions.
[2024-03-11 23:01:32,272 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 177 transitions, 1522 flow
[2024-03-11 23:01:32,273 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-11 23:01:32,273 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-11 23:01:32,274 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1152 transitions.
[2024-03-11 23:01:32,275 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5630498533724341
[2024-03-11 23:01:32,275 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 1152 transitions.
[2024-03-11 23:01:32,275 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 1152 transitions.
[2024-03-11 23:01:32,275 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 23:01:32,275 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1152 transitions.
[2024-03-11 23:01:32,277 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 192.0) internal successors, (1152), 6 states have internal predecessors, (1152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:01:32,279 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 341.0) internal successors, (2387), 7 states have internal predecessors, (2387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:01:32,280 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 341.0) internal successors, (2387), 7 states have internal predecessors, (2387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:01:32,280 INFO  L175             Difference]: Start difference. First operand has 63 places, 96 transitions, 708 flow. Second operand 6 states and 1152 transitions.
[2024-03-11 23:01:32,280 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 177 transitions, 1522 flow
[2024-03-11 23:01:32,455 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 177 transitions, 1426 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-11 23:01:32,457 INFO  L231             Difference]: Finished difference. Result has 68 places, 97 transitions, 679 flow
[2024-03-11 23:01:32,457 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=638, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=679, PETRI_PLACES=68, PETRI_TRANSITIONS=97}
[2024-03-11 23:01:32,457 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 11 predicate places.
[2024-03-11 23:01:32,457 INFO  L495      AbstractCegarLoop]: Abstraction has has 68 places, 97 transitions, 679 flow
[2024-03-11 23:01:32,458 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 180.0) internal successors, (1620), 9 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:01:32,458 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 23:01:32,458 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 23:01:32,468 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2024-03-11 23:01:32,659 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14
[2024-03-11 23:01:32,660 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-03-11 23:01:32,660 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 23:01:32,660 INFO  L85        PathProgramCache]: Analyzing trace with hash -1868600994, now seen corresponding path program 1 times
[2024-03-11 23:01:32,661 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 23:01:32,661 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977076686]
[2024-03-11 23:01:32,661 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:01:32,661 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 23:01:32,676 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 23:01:32,721 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 23:01:32,721 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 23:01:32,721 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977076686]
[2024-03-11 23:01:32,721 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977076686] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 23:01:32,721 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 23:01:32,722 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-03-11 23:01:32,722 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485632216]
[2024-03-11 23:01:32,722 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 23:01:32,722 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-11 23:01:32,722 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 23:01:32,723 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-11 23:01:32,723 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-11 23:01:32,750 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 175 out of 341
[2024-03-11 23:01:32,751 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 97 transitions, 679 flow. Second operand  has 3 states, 3 states have (on average 178.33333333333334) internal successors, (535), 3 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:01:32,751 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 23:01:32,751 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 341
[2024-03-11 23:01:32,751 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 23:01:33,378 INFO  L130       PetriNetUnfolder]: 3464/8009 cut-off events.
[2024-03-11 23:01:33,378 INFO  L131       PetriNetUnfolder]: For 12826/13048 co-relation queries the response was YES.
[2024-03-11 23:01:33,394 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 24506 conditions, 8009 events. 3464/8009 cut-off events. For 12826/13048 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 69834 event pairs, 881 based on Foata normal form. 2496/10219 useless extension candidates. Maximal degree in co-relation 24492. Up to 5428 conditions per place. 
[2024-03-11 23:01:33,407 INFO  L137   encePairwiseOnDemand]: 333/341 looper letters, 57 selfloop transitions, 10 changer transitions 0/80 dead transitions.
[2024-03-11 23:01:33,407 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 80 transitions, 549 flow
[2024-03-11 23:01:33,408 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-11 23:01:33,408 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-11 23:01:33,409 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 579 transitions.
[2024-03-11 23:01:33,409 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5659824046920822
[2024-03-11 23:01:33,409 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 579 transitions.
[2024-03-11 23:01:33,409 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 579 transitions.
[2024-03-11 23:01:33,410 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 23:01:33,410 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 579 transitions.
[2024-03-11 23:01:33,411 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 193.0) internal successors, (579), 3 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:01:33,412 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:01:33,412 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:01:33,412 INFO  L175             Difference]: Start difference. First operand has 68 places, 97 transitions, 679 flow. Second operand 3 states and 579 transitions.
[2024-03-11 23:01:33,412 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 80 transitions, 549 flow
[2024-03-11 23:01:33,419 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 80 transitions, 533 flow, removed 6 selfloop flow, removed 2 redundant places.
[2024-03-11 23:01:33,420 INFO  L231             Difference]: Finished difference. Result has 68 places, 62 transitions, 326 flow
[2024-03-11 23:01:33,420 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=326, PETRI_PLACES=68, PETRI_TRANSITIONS=62}
[2024-03-11 23:01:33,420 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 11 predicate places.
[2024-03-11 23:01:33,420 INFO  L495      AbstractCegarLoop]: Abstraction has has 68 places, 62 transitions, 326 flow
[2024-03-11 23:01:33,421 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 178.33333333333334) internal successors, (535), 3 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:01:33,421 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 23:01:33,421 INFO  L209   CegarLoopForPetriNet]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1]
[2024-03-11 23:01:33,421 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-03-11 23:01:33,421 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-03-11 23:01:33,421 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 23:01:33,421 INFO  L85        PathProgramCache]: Analyzing trace with hash -1402818722, now seen corresponding path program 1 times
[2024-03-11 23:01:33,421 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 23:01:33,421 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12038794]
[2024-03-11 23:01:33,421 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:01:33,422 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 23:01:33,440 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-11 23:01:33,440 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-03-11 23:01:33,449 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-11 23:01:33,454 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-03-11 23:01:33,454 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-03-11 23:01:33,454 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 15 remaining)
[2024-03-11 23:01:33,455 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining)
[2024-03-11 23:01:33,455 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining)
[2024-03-11 23:01:33,455 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining)
[2024-03-11 23:01:33,455 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining)
[2024-03-11 23:01:33,455 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining)
[2024-03-11 23:01:33,455 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (8 of 15 remaining)
[2024-03-11 23:01:33,455 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 15 remaining)
[2024-03-11 23:01:33,455 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining)
[2024-03-11 23:01:33,456 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining)
[2024-03-11 23:01:33,456 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 15 remaining)
[2024-03-11 23:01:33,456 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 15 remaining)
[2024-03-11 23:01:33,456 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining)
[2024-03-11 23:01:33,456 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining)
[2024-03-11 23:01:33,456 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining)
[2024-03-11 23:01:33,456 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-03-11 23:01:33,456 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 23:01:33,457 WARN  L233   ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-03-11 23:01:33,457 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances.
[2024-03-11 23:01:33,482 INFO  L144    ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions.
[2024-03-11 23:01:33,484 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 242 places, 235 transitions, 558 flow
[2024-03-11 23:01:33,629 INFO  L130       PetriNetUnfolder]: 91/1682 cut-off events.
[2024-03-11 23:01:33,629 INFO  L131       PetriNetUnfolder]: For 96/96 co-relation queries the response was YES.
[2024-03-11 23:01:33,637 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1799 conditions, 1682 events. 91/1682 cut-off events. For 96/96 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 8932 event pairs, 23 based on Foata normal form. 0/1460 useless extension candidates. Maximal degree in co-relation 1790. Up to 80 conditions per place. 
[2024-03-11 23:01:33,637 INFO  L82        GeneralOperation]: Start removeDead. Operand has 242 places, 235 transitions, 558 flow
[2024-03-11 23:01:33,640 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 190 places, 186 transitions, 422 flow
[2024-03-11 23:01:33,641 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2024-03-11 23:01:33,641 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 190 places, 186 transitions, 422 flow
[2024-03-11 23:01:33,641 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 190 places, 186 transitions, 422 flow
[2024-03-11 23:01:33,641 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 190 places, 186 transitions, 422 flow
[2024-03-11 23:01:33,919 INFO  L130       PetriNetUnfolder]: 91/1682 cut-off events.
[2024-03-11 23:01:33,919 INFO  L131       PetriNetUnfolder]: For 96/96 co-relation queries the response was YES.
[2024-03-11 23:01:33,922 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1796 conditions, 1682 events. 91/1682 cut-off events. For 96/96 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 8957 event pairs, 23 based on Foata normal form. 0/1460 useless extension candidates. Maximal degree in co-relation 979. Up to 80 conditions per place. 
[2024-03-11 23:01:33,936 INFO  L119        LiptonReduction]: Number of co-enabled transitions 14280
[2024-03-11 23:01:38,722 INFO  L134        LiptonReduction]: Checked pairs total: 32065
[2024-03-11 23:01:38,722 INFO  L136        LiptonReduction]: Total number of compositions: 145
[2024-03-11 23:01:38,723 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-11 23:01:38,724 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;@4e3602e4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2024-03-11 23:01:38,724 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 17 error locations.
[2024-03-11 23:01:38,725 INFO  L130       PetriNetUnfolder]: 0/2 cut-off events.
[2024-03-11 23:01:38,725 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2024-03-11 23:01:38,725 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 23:01:38,725 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1]
[2024-03-11 23:01:38,725 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] ===
[2024-03-11 23:01:38,725 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 23:01:38,725 INFO  L85        PathProgramCache]: Analyzing trace with hash 48727, now seen corresponding path program 1 times
[2024-03-11 23:01:38,725 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 23:01:38,725 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353985233]
[2024-03-11 23:01:38,725 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:01:38,725 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 23:01:38,729 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 23:01:38,732 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 23:01:38,732 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 23:01:38,732 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353985233]
[2024-03-11 23:01:38,732 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353985233] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 23:01:38,732 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 23:01:38,732 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-03-11 23:01:38,732 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423852077]
[2024-03-11 23:01:38,732 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 23:01:38,732 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-03-11 23:01:38,732 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 23:01:38,733 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-03-11 23:01:38,733 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-03-11 23:01:38,733 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 216 out of 380
[2024-03-11 23:01:38,733 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 59 transitions, 168 flow. Second operand  has 2 states, 2 states have (on average 217.0) internal successors, (434), 2 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:01:38,734 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 23:01:38,734 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 380
[2024-03-11 23:01:38,734 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 23:01:57,439 INFO  L130       PetriNetUnfolder]: 229869/330400 cut-off events.
[2024-03-11 23:01:57,439 INFO  L131       PetriNetUnfolder]: For 22219/22219 co-relation queries the response was YES.
[2024-03-11 23:01:58,090 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 641139 conditions, 330400 events. 229869/330400 cut-off events. For 22219/22219 co-relation queries the response was YES. Maximal size of possible extension queue 7608. Compared 2658286 event pairs, 227412 based on Foata normal form. 0/312872 useless extension candidates. Maximal degree in co-relation 91374. Up to 297439 conditions per place. 
[2024-03-11 23:01:59,137 INFO  L137   encePairwiseOnDemand]: 375/380 looper letters, 42 selfloop transitions, 0 changer transitions 0/54 dead transitions.
[2024-03-11 23:01:59,138 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 54 transitions, 242 flow
[2024-03-11 23:01:59,138 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-03-11 23:01:59,139 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2024-03-11 23:01:59,139 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 479 transitions.
[2024-03-11 23:01:59,140 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6302631578947369
[2024-03-11 23:01:59,140 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 479 transitions.
[2024-03-11 23:01:59,140 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 479 transitions.
[2024-03-11 23:01:59,140 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 23:01:59,140 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 479 transitions.
[2024-03-11 23:01:59,141 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 239.5) internal successors, (479), 2 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:01:59,142 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 380.0) internal successors, (1140), 3 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:01:59,142 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 380.0) internal successors, (1140), 3 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:01:59,142 INFO  L175             Difference]: Start difference. First operand has 66 places, 59 transitions, 168 flow. Second operand 2 states and 479 transitions.
[2024-03-11 23:01:59,142 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 54 transitions, 242 flow
[2024-03-11 23:01:59,196 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 54 transitions, 238 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-11 23:01:59,196 INFO  L231             Difference]: Finished difference. Result has 60 places, 54 transitions, 154 flow
[2024-03-11 23:01:59,197 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=380, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=154, PETRI_PLACES=60, PETRI_TRANSITIONS=54}
[2024-03-11 23:01:59,197 INFO  L288   CegarLoopForPetriNet]: 66 programPoint places, -6 predicate places.
[2024-03-11 23:01:59,197 INFO  L495      AbstractCegarLoop]: Abstraction has has 60 places, 54 transitions, 154 flow
[2024-03-11 23:01:59,197 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 217.0) internal successors, (434), 2 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:01:59,197 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 23:01:59,197 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-03-11 23:01:59,198 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-03-11 23:01:59,198 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] ===
[2024-03-11 23:01:59,198 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 23:01:59,198 INFO  L85        PathProgramCache]: Analyzing trace with hash 2091082336, now seen corresponding path program 1 times
[2024-03-11 23:01:59,198 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 23:01:59,198 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108942532]
[2024-03-11 23:01:59,198 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:01:59,198 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 23:01:59,205 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 23:01:59,217 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 23:01:59,217 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 23:01:59,217 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108942532]
[2024-03-11 23:01:59,217 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108942532] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 23:01:59,217 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 23:01:59,217 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-11 23:01:59,217 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085200796]
[2024-03-11 23:01:59,217 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 23:01:59,218 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-11 23:01:59,218 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 23:01:59,218 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-11 23:01:59,218 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-11 23:01:59,250 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 205 out of 380
[2024-03-11 23:01:59,251 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 54 transitions, 154 flow. Second operand  has 3 states, 3 states have (on average 207.0) internal successors, (621), 3 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:01:59,251 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 23:01:59,251 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 380
[2024-03-11 23:01:59,251 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
