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


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


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

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fa97db609b81da66bf52cc8a991e92a8e36f90f772d6309b33e0ed95dfe245e6
--- Real Ultimate output ---
This is Ultimate 0.2.2-dev-2329fc7
[2023-10-25 15:19:32,910 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2023-10-25 15:19:32,912 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2023-10-25 15:19:32,960 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2023-10-25 15:19:32,961 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2023-10-25 15:19:32,963 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2023-10-25 15:19:32,965 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2023-10-25 15:19:32,979 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2023-10-25 15:19:32,980 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2023-10-25 15:19:32,984 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2023-10-25 15:19:32,985 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2023-10-25 15:19:32,986 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2023-10-25 15:19:32,986 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2023-10-25 15:19:32,988 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2023-10-25 15:19:32,989 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2023-10-25 15:19:32,990 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2023-10-25 15:19:32,991 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2023-10-25 15:19:32,992 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2023-10-25 15:19:32,993 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2023-10-25 15:19:32,997 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2023-10-25 15:19:32,998 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2023-10-25 15:19:32,999 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2023-10-25 15:19:32,999 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2023-10-25 15:19:33,014 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2023-10-25 15:19:33,020 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2023-10-25 15:19:33,020 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2023-10-25 15:19:33,020 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2023-10-25 15:19:33,021 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2023-10-25 15:19:33,022 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2023-10-25 15:19:33,022 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2023-10-25 15:19:33,022 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2023-10-25 15:19:33,024 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2023-10-25 15:19:33,025 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2023-10-25 15:19:33,026 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2023-10-25 15:19:33,026 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2023-10-25 15:19:33,027 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2023-10-25 15:19:33,027 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2023-10-25 15:19:33,027 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2023-10-25 15:19:33,027 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2023-10-25 15:19:33,028 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2023-10-25 15:19:33,029 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2023-10-25 15:19:33,029 INFO  L101        SettingsManager]: Beginning loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2023-10-25 15:19:33,073 INFO  L113        SettingsManager]: Loading preferences was successful
[2023-10-25 15:19:33,073 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2023-10-25 15:19:33,073 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-10-25 15:19:33,074 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-10-25 15:19:33,074 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-10-25 15:19:33,074 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-10-25 15:19:33,075 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-10-25 15:19:33,075 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2023-10-25 15:19:33,075 INFO  L138        SettingsManager]:  * Use SBE=true
[2023-10-25 15:19:33,075 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-10-25 15:19:33,076 INFO  L138        SettingsManager]:  * sizeof long=4
[2023-10-25 15:19:33,076 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2023-10-25 15:19:33,076 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2023-10-25 15:19:33,077 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2023-10-25 15:19:33,077 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2023-10-25 15:19:33,077 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2023-10-25 15:19:33,077 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-10-25 15:19:33,077 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2023-10-25 15:19:33,077 INFO  L138        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2023-10-25 15:19:33,077 INFO  L138        SettingsManager]:  * sizeof long double=12
[2023-10-25 15:19:33,078 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2023-10-25 15:19:33,078 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2023-10-25 15:19:33,078 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2023-10-25 15:19:33,078 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-10-25 15:19:33,078 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2023-10-25 15:19:33,078 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2023-10-25 15:19:33,079 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-10-25 15:19:33,079 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-10-25 15:19:33,079 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2023-10-25 15:19:33,079 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2023-10-25 15:19:33,079 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2023-10-25 15:19:33,079 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-10-25 15:19:33,080 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2023-10-25 15:19:33,080 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-10-25 15:19:33,080 INFO  L138        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2023-10-25 15:19:33,081 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2023-10-25 15:19:33,081 INFO  L138        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2023-10-25 15:19:33,081 INFO  L138        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) )


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fa97db609b81da66bf52cc8a991e92a8e36f90f772d6309b33e0ed95dfe245e6
[2023-10-25 15:19:33,425 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2023-10-25 15:19:33,447 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-10-25 15:19:33,449 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-10-25 15:19:33,450 INFO  L271        PluginConnector]: Initializing CDTParser...
[2023-10-25 15:19:33,450 INFO  L275        PluginConnector]: CDTParser initialized
[2023-10-25 15:19:33,451 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/thread-join-array-dynamic-race-2.i
[2023-10-25 15:19:35,156 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2023-10-25 15:19:35,566 INFO  L351              CDTParser]: Found 1 translation units.
[2023-10-25 15:19:35,567 INFO  L172              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/thread-join-array-dynamic-race-2.i
[2023-10-25 15:19:35,590 INFO  L394              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/c6ce01ff1/f5d56e9afcbd498697843d517badcefa/FLAG2128d958d
[2023-10-25 15:19:35,604 INFO  L402              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/c6ce01ff1/f5d56e9afcbd498697843d517badcefa
[2023-10-25 15:19:35,607 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-10-25 15:19:35,610 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2023-10-25 15:19:35,613 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-10-25 15:19:35,613 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-10-25 15:19:35,619 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2023-10-25 15:19:35,620 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 03:19:35" (1/1) ...
[2023-10-25 15:19:35,625 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e51d897 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:19:35, skipping insertion in model container
[2023-10-25 15:19:35,625 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 03:19:35" (1/1) ...
[2023-10-25 15:19:35,650 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2023-10-25 15:19:35,744 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2023-10-25 15:19:35,991 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2023-10-25 15:19:36,290 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-10-25 15:19:36,308 INFO  L203         MainTranslator]: Completed pre-run
[2023-10-25 15:19:36,344 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2023-10-25 15:19:36,401 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-10-25 15:19:36,498 INFO  L208         MainTranslator]: Completed translation
[2023-10-25 15:19:36,499 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:19:36 WrapperNode
[2023-10-25 15:19:36,499 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-10-25 15:19:36,500 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-10-25 15:19:36,500 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-10-25 15:19:36,500 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2023-10-25 15:19:36,520 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:19:36" (1/1) ...
[2023-10-25 15:19:36,548 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:19:36" (1/1) ...
[2023-10-25 15:19:36,606 INFO  L138                Inliner]: procedures = 269, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 82
[2023-10-25 15:19:36,607 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-10-25 15:19:36,608 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-10-25 15:19:36,608 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2023-10-25 15:19:36,608 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2023-10-25 15:19:36,624 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:19:36" (1/1) ...
[2023-10-25 15:19:36,624 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:19:36" (1/1) ...
[2023-10-25 15:19:36,635 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:19:36" (1/1) ...
[2023-10-25 15:19:36,635 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:19:36" (1/1) ...
[2023-10-25 15:19:36,660 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:19:36" (1/1) ...
[2023-10-25 15:19:36,667 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:19:36" (1/1) ...
[2023-10-25 15:19:36,673 INFO  L185        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:19:36" (1/1) ...
[2023-10-25 15:19:36,677 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:19:36" (1/1) ...
[2023-10-25 15:19:36,680 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-10-25 15:19:36,681 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-10-25 15:19:36,697 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2023-10-25 15:19:36,697 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2023-10-25 15:19:36,698 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:19:36" (1/1) ...
[2023-10-25 15:19:36,702 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-10-25 15:19:36,710 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 15:19:36,743 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2023-10-25 15:19:36,785 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2023-10-25 15:19:36,805 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2023-10-25 15:19:36,805 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2023-10-25 15:19:36,806 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-10-25 15:19:36,806 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2023-10-25 15:19:36,806 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2023-10-25 15:19:36,806 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2023-10-25 15:19:36,806 INFO  L130     BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock
[2023-10-25 15:19:36,806 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2023-10-25 15:19:36,806 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2023-10-25 15:19:36,807 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2023-10-25 15:19:36,807 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2023-10-25 15:19:36,807 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2023-10-25 15:19:36,807 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-10-25 15:19:36,807 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-10-25 15:19:36,808 WARN  L209             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2023-10-25 15:19:37,042 INFO  L235             CfgBuilder]: Building ICFG
[2023-10-25 15:19:37,044 INFO  L261             CfgBuilder]: Building CFG for each procedure with an implementation
[2023-10-25 15:19:37,425 INFO  L276             CfgBuilder]: Performing block encoding
[2023-10-25 15:19:37,431 INFO  L295             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-10-25 15:19:37,438 INFO  L300             CfgBuilder]: Removed 2 assume(true) statements.
[2023-10-25 15:19:37,440 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 03:19:37 BoogieIcfgContainer
[2023-10-25 15:19:37,453 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-10-25 15:19:37,455 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-10-25 15:19:37,455 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2023-10-25 15:19:37,458 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2023-10-25 15:19:37,459 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 03:19:35" (1/3) ...
[2023-10-25 15:19:37,460 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4931aa0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 03:19:37, skipping insertion in model container
[2023-10-25 15:19:37,461 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:19:36" (2/3) ...
[2023-10-25 15:19:37,461 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4931aa0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 03:19:37, skipping insertion in model container
[2023-10-25 15:19:37,461 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 03:19:37" (3/3) ...
[2023-10-25 15:19:37,462 INFO  L112   eAbstractionObserver]: Analyzing ICFG thread-join-array-dynamic-race-2.i
[2023-10-25 15:19:37,475 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2023-10-25 15:19:37,491 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-10-25 15:19:37,492 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations.
[2023-10-25 15:19:37,492 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2023-10-25 15:19:37,591 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2023-10-25 15:19:37,629 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 106 places, 107 transitions, 222 flow
[2023-10-25 15:19:37,749 INFO  L130       PetriNetUnfolder]: 6/156 cut-off events.
[2023-10-25 15:19:37,749 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-10-25 15:19:37,753 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 162 conditions, 156 events. 6/156 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 306 event pairs, 0 based on Foata normal form. 0/136 useless extension candidates. Maximal degree in co-relation 81. Up to 4 conditions per place. 
[2023-10-25 15:19:37,754 INFO  L82        GeneralOperation]: Start removeDead. Operand has 106 places, 107 transitions, 222 flow
[2023-10-25 15:19:37,775 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 106 places, 107 transitions, 222 flow
[2023-10-25 15:19:37,780 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-10-25 15:19:37,812 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 107 transitions, 222 flow
[2023-10-25 15:19:37,814 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 107 transitions, 222 flow
[2023-10-25 15:19:37,815 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 106 places, 107 transitions, 222 flow
[2023-10-25 15:19:37,850 INFO  L130       PetriNetUnfolder]: 6/156 cut-off events.
[2023-10-25 15:19:37,859 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-10-25 15:19:37,860 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 162 conditions, 156 events. 6/156 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 306 event pairs, 0 based on Foata normal form. 0/136 useless extension candidates. Maximal degree in co-relation 81. Up to 4 conditions per place. 
[2023-10-25 15:19:37,869 INFO  L119        LiptonReduction]: Number of co-enabled transitions 1568
[2023-10-25 15:19:42,914 INFO  L134        LiptonReduction]: Checked pairs total: 2097
[2023-10-25 15:19:42,914 INFO  L136        LiptonReduction]: Total number of compositions: 101
[2023-10-25 15:19:42,958 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-10-25 15:19:42,965 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;@65717078, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-10-25 15:19:42,966 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 8 error locations.
[2023-10-25 15:19:42,970 INFO  L130       PetriNetUnfolder]: 0/2 cut-off events.
[2023-10-25 15:19:42,971 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-25 15:19:42,971 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:19:42,972 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1]
[2023-10-25 15:19:42,984 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-25 15:19:42,988 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:19:42,988 INFO  L85        PathProgramCache]: Analyzing trace with hash 12251, now seen corresponding path program 1 times
[2023-10-25 15:19:42,995 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:19:42,997 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934252210]
[2023-10-25 15:19:42,998 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:19:42,998 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:19:43,157 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:19:43,267 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:19:43,267 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:19:43,268 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934252210]
[2023-10-25 15:19:43,268 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934252210] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:19:43,268 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:19:43,268 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2023-10-25 15:19:43,269 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847586366]
[2023-10-25 15:19:43,285 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:19:43,291 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-10-25 15:19:43,292 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:19:43,327 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-10-25 15:19:43,329 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-10-25 15:19:43,330 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 102 out of 208
[2023-10-25 15:19:43,335 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 21 transitions, 50 flow. Second operand  has 2 states, 2 states have (on average 103.0) internal successors, (206), 2 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:43,335 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:19:43,335 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 208
[2023-10-25 15:19:43,336 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:19:43,410 INFO  L130       PetriNetUnfolder]: 19/66 cut-off events.
[2023-10-25 15:19:43,411 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-10-25 15:19:43,411 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 127 conditions, 66 events. 19/66 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 206 event pairs, 18 based on Foata normal form. 0/53 useless extension candidates. Maximal degree in co-relation 99. Up to 55 conditions per place. 
[2023-10-25 15:19:43,413 INFO  L137   encePairwiseOnDemand]: 204/208 looper letters, 13 selfloop transitions, 0 changer transitions 0/17 dead transitions.
[2023-10-25 15:19:43,413 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 20 places, 17 transitions, 68 flow
[2023-10-25 15:19:43,414 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-10-25 15:19:43,416 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-10-25 15:19:43,438 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 221 transitions.
[2023-10-25 15:19:43,440 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.53125
[2023-10-25 15:19:43,441 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 221 transitions.
[2023-10-25 15:19:43,442 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 221 transitions.
[2023-10-25 15:19:43,443 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:19:43,445 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 221 transitions.
[2023-10-25 15:19:43,450 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 110.5) internal successors, (221), 2 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:43,457 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 208.0) internal successors, (624), 3 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:43,458 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 208.0) internal successors, (624), 3 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:43,459 INFO  L175             Difference]: Start difference. First operand has 23 places, 21 transitions, 50 flow. Second operand 2 states and 221 transitions.
[2023-10-25 15:19:43,463 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 20 places, 17 transitions, 68 flow
[2023-10-25 15:19:43,465 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 17 transitions, 68 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-25 15:19:43,466 INFO  L231             Difference]: Finished difference. Result has 20 places, 17 transitions, 42 flow
[2023-10-25 15:19:43,482 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=42, PETRI_PLACES=20, PETRI_TRANSITIONS=17}
[2023-10-25 15:19:43,486 INFO  L288   CegarLoopForPetriNet]: 23 programPoint places, -3 predicate places.
[2023-10-25 15:19:43,486 INFO  L495      AbstractCegarLoop]: Abstraction has has 20 places, 17 transitions, 42 flow
[2023-10-25 15:19:43,487 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 103.0) internal successors, (206), 2 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:43,487 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:19:43,487 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1]
[2023-10-25 15:19:43,488 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-10-25 15:19:43,489 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-25 15:19:43,491 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:19:43,492 INFO  L85        PathProgramCache]: Analyzing trace with hash 11737896, now seen corresponding path program 1 times
[2023-10-25 15:19:43,492 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:19:43,492 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798901496]
[2023-10-25 15:19:43,493 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:19:43,493 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:19:43,551 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:19:43,651 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:19:43,651 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:19:43,651 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798901496]
[2023-10-25 15:19:43,656 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798901496] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:19:43,656 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:19:43,656 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 15:19:43,657 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215021591]
[2023-10-25 15:19:43,657 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:19:43,658 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:19:43,658 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:19:43,658 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:19:43,659 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:19:43,687 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 98 out of 208
[2023-10-25 15:19:43,688 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 17 transitions, 42 flow. Second operand  has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:43,688 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:19:43,688 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 208
[2023-10-25 15:19:43,688 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:19:43,762 INFO  L130       PetriNetUnfolder]: 24/81 cut-off events.
[2023-10-25 15:19:43,762 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-10-25 15:19:43,763 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 161 conditions, 81 events. 24/81 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 274 event pairs, 13 based on Foata normal form. 0/69 useless extension candidates. Maximal degree in co-relation 157. Up to 50 conditions per place. 
[2023-10-25 15:19:43,764 INFO  L137   encePairwiseOnDemand]: 204/208 looper letters, 14 selfloop transitions, 3 changer transitions 3/22 dead transitions.
[2023-10-25 15:19:43,764 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 22 transitions, 92 flow
[2023-10-25 15:19:43,764 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:19:43,764 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:19:43,768 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 315 transitions.
[2023-10-25 15:19:43,769 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5048076923076923
[2023-10-25 15:19:43,769 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 315 transitions.
[2023-10-25 15:19:43,769 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 315 transitions.
[2023-10-25 15:19:43,770 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:19:43,770 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 315 transitions.
[2023-10-25 15:19:43,772 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:43,774 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 208.0) internal successors, (832), 4 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:43,775 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 208.0) internal successors, (832), 4 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:43,775 INFO  L175             Difference]: Start difference. First operand has 20 places, 17 transitions, 42 flow. Second operand 3 states and 315 transitions.
[2023-10-25 15:19:43,789 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 22 transitions, 92 flow
[2023-10-25 15:19:43,790 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 22 transitions, 92 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-25 15:19:43,791 INFO  L231             Difference]: Finished difference. Result has 24 places, 17 transitions, 57 flow
[2023-10-25 15:19:43,791 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=57, PETRI_PLACES=24, PETRI_TRANSITIONS=17}
[2023-10-25 15:19:43,791 INFO  L288   CegarLoopForPetriNet]: 23 programPoint places, 1 predicate places.
[2023-10-25 15:19:43,792 INFO  L495      AbstractCegarLoop]: Abstraction has has 24 places, 17 transitions, 57 flow
[2023-10-25 15:19:43,792 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:43,792 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:19:43,792 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1]
[2023-10-25 15:19:43,793 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-10-25 15:19:43,793 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-25 15:19:43,794 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:19:43,794 INFO  L85        PathProgramCache]: Analyzing trace with hash -1562108238, now seen corresponding path program 1 times
[2023-10-25 15:19:43,794 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:19:43,795 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515807961]
[2023-10-25 15:19:43,795 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:19:43,795 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:19:43,876 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-25 15:19:43,893 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-10-25 15:19:43,924 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-25 15:19:43,967 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-10-25 15:19:43,971 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-10-25 15:19:43,973 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining)
[2023-10-25 15:19:43,974 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 8 remaining)
[2023-10-25 15:19:43,975 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 8 remaining)
[2023-10-25 15:19:43,986 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (4 of 8 remaining)
[2023-10-25 15:19:43,986 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (3 of 8 remaining)
[2023-10-25 15:19:43,986 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (2 of 8 remaining)
[2023-10-25 15:19:43,987 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 8 remaining)
[2023-10-25 15:19:43,987 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 8 remaining)
[2023-10-25 15:19:43,987 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-10-25 15:19:43,987 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1]
[2023-10-25 15:19:43,989 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-10-25 15:19:43,989 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2023-10-25 15:19:44,019 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2023-10-25 15:19:44,023 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 123 places, 123 transitions, 264 flow
[2023-10-25 15:19:44,084 INFO  L130       PetriNetUnfolder]: 11/270 cut-off events.
[2023-10-25 15:19:44,085 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2023-10-25 15:19:44,086 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 284 conditions, 270 events. 11/270 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 618 event pairs, 0 based on Foata normal form. 0/234 useless extension candidates. Maximal degree in co-relation 158. Up to 8 conditions per place. 
[2023-10-25 15:19:44,086 INFO  L82        GeneralOperation]: Start removeDead. Operand has 123 places, 123 transitions, 264 flow
[2023-10-25 15:19:44,087 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 123 places, 123 transitions, 264 flow
[2023-10-25 15:19:44,087 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-10-25 15:19:44,087 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 123 transitions, 264 flow
[2023-10-25 15:19:44,088 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 123 transitions, 264 flow
[2023-10-25 15:19:44,088 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 123 places, 123 transitions, 264 flow
[2023-10-25 15:19:44,137 INFO  L130       PetriNetUnfolder]: 11/270 cut-off events.
[2023-10-25 15:19:44,137 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2023-10-25 15:19:44,138 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 284 conditions, 270 events. 11/270 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 618 event pairs, 0 based on Foata normal form. 0/234 useless extension candidates. Maximal degree in co-relation 158. Up to 8 conditions per place. 
[2023-10-25 15:19:44,141 INFO  L119        LiptonReduction]: Number of co-enabled transitions 3780
[2023-10-25 15:19:48,524 INFO  L134        LiptonReduction]: Checked pairs total: 7172
[2023-10-25 15:19:48,525 INFO  L136        LiptonReduction]: Total number of compositions: 106
[2023-10-25 15:19:48,526 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-10-25 15:19:48,527 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;@65717078, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-10-25 15:19:48,527 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 9 error locations.
[2023-10-25 15:19:48,528 INFO  L130       PetriNetUnfolder]: 0/2 cut-off events.
[2023-10-25 15:19:48,528 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-25 15:19:48,528 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:19:48,528 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1]
[2023-10-25 15:19:48,528 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-10-25 15:19:48,529 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:19:48,529 INFO  L85        PathProgramCache]: Analyzing trace with hash 20088, now seen corresponding path program 1 times
[2023-10-25 15:19:48,529 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:19:48,541 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916224499]
[2023-10-25 15:19:48,541 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:19:48,542 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:19:48,553 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:19:48,582 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:19:48,587 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:19:48,591 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916224499]
[2023-10-25 15:19:48,591 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916224499] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:19:48,592 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:19:48,592 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2023-10-25 15:19:48,592 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709183882]
[2023-10-25 15:19:48,592 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:19:48,592 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-10-25 15:19:48,593 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:19:48,593 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-10-25 15:19:48,593 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-10-25 15:19:48,594 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 116 out of 229
[2023-10-25 15:19:48,595 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 33 transitions, 84 flow. Second operand  has 2 states, 2 states have (on average 117.0) internal successors, (234), 2 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:48,596 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:19:48,596 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 229
[2023-10-25 15:19:48,596 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:19:48,842 INFO  L130       PetriNetUnfolder]: 378/759 cut-off events.
[2023-10-25 15:19:48,842 INFO  L131       PetriNetUnfolder]: For 38/38 co-relation queries the response was YES.
[2023-10-25 15:19:48,845 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1466 conditions, 759 events. 378/759 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3819 event pairs, 371 based on Foata normal form. 0/668 useless extension candidates. Maximal degree in co-relation 519. Up to 666 conditions per place. 
[2023-10-25 15:19:48,850 INFO  L137   encePairwiseOnDemand]: 225/229 looper letters, 21 selfloop transitions, 0 changer transitions 0/29 dead transitions.
[2023-10-25 15:19:48,858 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 29 transitions, 118 flow
[2023-10-25 15:19:48,859 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-10-25 15:19:48,859 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-10-25 15:19:48,860 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 257 transitions.
[2023-10-25 15:19:48,860 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5611353711790393
[2023-10-25 15:19:48,860 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 257 transitions.
[2023-10-25 15:19:48,860 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 257 transitions.
[2023-10-25 15:19:48,861 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:19:48,861 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 257 transitions.
[2023-10-25 15:19:48,864 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 128.5) internal successors, (257), 2 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:48,866 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 229.0) internal successors, (687), 3 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:48,866 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 229.0) internal successors, (687), 3 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:48,866 INFO  L175             Difference]: Start difference. First operand has 36 places, 33 transitions, 84 flow. Second operand 2 states and 257 transitions.
[2023-10-25 15:19:48,867 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 29 transitions, 118 flow
[2023-10-25 15:19:48,877 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 29 transitions, 118 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-25 15:19:48,879 INFO  L231             Difference]: Finished difference. Result has 33 places, 29 transitions, 76 flow
[2023-10-25 15:19:48,879 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=76, PETRI_PLACES=33, PETRI_TRANSITIONS=29}
[2023-10-25 15:19:48,881 INFO  L288   CegarLoopForPetriNet]: 36 programPoint places, -3 predicate places.
[2023-10-25 15:19:48,881 INFO  L495      AbstractCegarLoop]: Abstraction has has 33 places, 29 transitions, 76 flow
[2023-10-25 15:19:48,881 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 117.0) internal successors, (234), 2 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:48,881 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:19:48,881 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1]
[2023-10-25 15:19:48,882 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2023-10-25 15:19:48,882 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-10-25 15:19:48,882 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:19:48,882 INFO  L85        PathProgramCache]: Analyzing trace with hash 19281939, now seen corresponding path program 1 times
[2023-10-25 15:19:48,883 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:19:48,884 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147817148]
[2023-10-25 15:19:48,897 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:19:48,897 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:19:48,910 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:19:48,958 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:19:48,958 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:19:48,958 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147817148]
[2023-10-25 15:19:48,958 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147817148] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:19:48,959 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:19:48,959 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 15:19:48,959 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668281755]
[2023-10-25 15:19:48,959 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:19:48,959 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:19:48,960 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:19:48,960 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:19:48,961 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:19:48,974 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 111 out of 229
[2023-10-25 15:19:48,975 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 29 transitions, 76 flow. Second operand  has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:48,975 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:19:48,975 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 229
[2023-10-25 15:19:48,975 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:19:49,204 INFO  L130       PetriNetUnfolder]: 679/1281 cut-off events.
[2023-10-25 15:19:49,204 INFO  L131       PetriNetUnfolder]: For 42/42 co-relation queries the response was YES.
[2023-10-25 15:19:49,205 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2525 conditions, 1281 events. 679/1281 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 6810 event pairs, 416 based on Foata normal form. 0/1155 useless extension candidates. Maximal degree in co-relation 2520. Up to 850 conditions per place. 
[2023-10-25 15:19:49,208 INFO  L137   encePairwiseOnDemand]: 224/229 looper letters, 32 selfloop transitions, 4 changer transitions 0/41 dead transitions.
[2023-10-25 15:19:49,209 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 41 transitions, 172 flow
[2023-10-25 15:19:49,210 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:19:49,210 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:19:49,218 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 370 transitions.
[2023-10-25 15:19:49,218 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5385735080058224
[2023-10-25 15:19:49,218 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 370 transitions.
[2023-10-25 15:19:49,218 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 370 transitions.
[2023-10-25 15:19:49,219 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:19:49,219 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 370 transitions.
[2023-10-25 15:19:49,220 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:49,221 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 229.0) internal successors, (916), 4 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:49,221 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 229.0) internal successors, (916), 4 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:49,221 INFO  L175             Difference]: Start difference. First operand has 33 places, 29 transitions, 76 flow. Second operand 3 states and 370 transitions.
[2023-10-25 15:19:49,222 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 41 transitions, 172 flow
[2023-10-25 15:19:49,222 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 41 transitions, 172 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-25 15:19:49,223 INFO  L231             Difference]: Finished difference. Result has 37 places, 32 transitions, 106 flow
[2023-10-25 15:19:49,223 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=37, PETRI_TRANSITIONS=32}
[2023-10-25 15:19:49,224 INFO  L288   CegarLoopForPetriNet]: 36 programPoint places, 1 predicate places.
[2023-10-25 15:19:49,224 INFO  L495      AbstractCegarLoop]: Abstraction has has 37 places, 32 transitions, 106 flow
[2023-10-25 15:19:49,224 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:49,224 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:19:49,224 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:19:49,225 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2023-10-25 15:19:49,225 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-10-25 15:19:49,241 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:19:49,241 INFO  L85        PathProgramCache]: Analyzing trace with hash 15874969, now seen corresponding path program 1 times
[2023-10-25 15:19:49,242 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:19:49,242 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809591514]
[2023-10-25 15:19:49,242 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:19:49,242 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:19:49,260 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:19:49,290 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:19:49,290 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:19:49,291 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809591514]
[2023-10-25 15:19:49,291 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809591514] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:19:49,291 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:19:49,291 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 15:19:49,291 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947902523]
[2023-10-25 15:19:49,291 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:19:49,292 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:19:49,292 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:19:49,292 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:19:49,292 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:19:49,310 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 109 out of 229
[2023-10-25 15:19:49,311 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 32 transitions, 106 flow. Second operand  has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:49,311 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:19:49,311 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 229
[2023-10-25 15:19:49,311 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:19:49,573 INFO  L130       PetriNetUnfolder]: 739/1420 cut-off events.
[2023-10-25 15:19:49,593 INFO  L131       PetriNetUnfolder]: For 333/333 co-relation queries the response was YES.
[2023-10-25 15:19:49,595 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3150 conditions, 1420 events. 739/1420 cut-off events. For 333/333 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 8126 event pairs, 430 based on Foata normal form. 0/1298 useless extension candidates. Maximal degree in co-relation 3143. Up to 943 conditions per place. 
[2023-10-25 15:19:49,599 INFO  L137   encePairwiseOnDemand]: 223/229 looper letters, 35 selfloop transitions, 7 changer transitions 0/49 dead transitions.
[2023-10-25 15:19:49,600 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 49 transitions, 242 flow
[2023-10-25 15:19:49,600 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:19:49,600 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:19:49,601 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 367 transitions.
[2023-10-25 15:19:49,601 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5342066957787481
[2023-10-25 15:19:49,601 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 367 transitions.
[2023-10-25 15:19:49,601 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 367 transitions.
[2023-10-25 15:19:49,602 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:19:49,602 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 367 transitions.
[2023-10-25 15:19:49,603 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:49,604 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 229.0) internal successors, (916), 4 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:49,604 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 229.0) internal successors, (916), 4 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:49,604 INFO  L175             Difference]: Start difference. First operand has 37 places, 32 transitions, 106 flow. Second operand 3 states and 367 transitions.
[2023-10-25 15:19:49,605 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 49 transitions, 242 flow
[2023-10-25 15:19:49,609 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 49 transitions, 230 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-25 15:19:49,610 INFO  L231             Difference]: Finished difference. Result has 39 places, 37 transitions, 154 flow
[2023-10-25 15:19:49,610 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=154, PETRI_PLACES=39, PETRI_TRANSITIONS=37}
[2023-10-25 15:19:49,621 INFO  L288   CegarLoopForPetriNet]: 36 programPoint places, 3 predicate places.
[2023-10-25 15:19:49,621 INFO  L495      AbstractCegarLoop]: Abstraction has has 39 places, 37 transitions, 154 flow
[2023-10-25 15:19:49,622 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:49,622 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:19:49,622 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:19:49,622 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2023-10-25 15:19:49,622 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-10-25 15:19:49,623 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:19:49,623 INFO  L85        PathProgramCache]: Analyzing trace with hash -1219947716, now seen corresponding path program 1 times
[2023-10-25 15:19:49,623 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:19:49,623 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842161326]
[2023-10-25 15:19:49,623 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:19:49,623 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:19:49,654 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:19:49,794 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:19:49,795 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:19:49,797 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842161326]
[2023-10-25 15:19:49,797 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842161326] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 15:19:49,798 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468403112]
[2023-10-25 15:19:49,798 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:19:49,798 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 15:19:49,798 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 15:19:49,814 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-25 15:19:49,852 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2023-10-25 15:19:49,945 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:19:49,963 INFO  L263         TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 4 conjunts are in the unsatisfiable core
[2023-10-25 15:19:49,965 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 15:19:50,082 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:19:50,082 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-25 15:19:50,122 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:19:50,123 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1468403112] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-25 15:19:50,123 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-25 15:19:50,123 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8
[2023-10-25 15:19:50,123 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37279840]
[2023-10-25 15:19:50,133 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-25 15:19:50,134 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2023-10-25 15:19:50,145 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:19:50,145 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2023-10-25 15:19:50,146 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2023-10-25 15:19:50,316 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 106 out of 229
[2023-10-25 15:19:50,317 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 37 transitions, 154 flow. Second operand  has 9 states, 9 states have (on average 107.77777777777777) internal successors, (970), 9 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:50,317 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:19:50,317 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 229
[2023-10-25 15:19:50,317 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:19:50,628 INFO  L130       PetriNetUnfolder]: 349/722 cut-off events.
[2023-10-25 15:19:50,634 INFO  L131       PetriNetUnfolder]: For 490/564 co-relation queries the response was YES.
[2023-10-25 15:19:50,635 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1765 conditions, 722 events. 349/722 cut-off events. For 490/564 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3573 event pairs, 88 based on Foata normal form. 84/758 useless extension candidates. Maximal degree in co-relation 1757. Up to 373 conditions per place. 
[2023-10-25 15:19:50,637 INFO  L137   encePairwiseOnDemand]: 222/229 looper letters, 42 selfloop transitions, 6 changer transitions 15/73 dead transitions.
[2023-10-25 15:19:50,637 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 73 transitions, 400 flow
[2023-10-25 15:19:50,638 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2023-10-25 15:19:50,638 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2023-10-25 15:19:50,639 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 902 transitions.
[2023-10-25 15:19:50,640 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.4923580786026201
[2023-10-25 15:19:50,640 INFO  L72            ComplementDD]: Start complementDD. Operand 8 states and 902 transitions.
[2023-10-25 15:19:50,640 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 8 states and 902 transitions.
[2023-10-25 15:19:50,640 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:19:50,653 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 902 transitions.
[2023-10-25 15:19:50,655 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 9 states, 8 states have (on average 112.75) internal successors, (902), 8 states have internal predecessors, (902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:50,658 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 9 states, 9 states have (on average 229.0) internal successors, (2061), 9 states have internal predecessors, (2061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:50,659 INFO  L81            ComplementDD]: Finished complementDD. Result  has 9 states, 9 states have (on average 229.0) internal successors, (2061), 9 states have internal predecessors, (2061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:50,659 INFO  L175             Difference]: Start difference. First operand has 39 places, 37 transitions, 154 flow. Second operand 8 states and 902 transitions.
[2023-10-25 15:19:50,659 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 73 transitions, 400 flow
[2023-10-25 15:19:50,661 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 73 transitions, 376 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-25 15:19:50,662 INFO  L231             Difference]: Finished difference. Result has 48 places, 39 transitions, 174 flow
[2023-10-25 15:19:50,663 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=174, PETRI_PLACES=48, PETRI_TRANSITIONS=39}
[2023-10-25 15:19:50,664 INFO  L288   CegarLoopForPetriNet]: 36 programPoint places, 12 predicate places.
[2023-10-25 15:19:50,664 INFO  L495      AbstractCegarLoop]: Abstraction has has 48 places, 39 transitions, 174 flow
[2023-10-25 15:19:50,664 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 107.77777777777777) internal successors, (970), 9 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:50,665 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:19:50,665 INFO  L209   CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1]
[2023-10-25 15:19:50,675 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2023-10-25 15:19:50,869 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 15:19:50,870 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-10-25 15:19:50,871 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:19:50,871 INFO  L85        PathProgramCache]: Analyzing trace with hash -113454216, now seen corresponding path program 1 times
[2023-10-25 15:19:50,871 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:19:50,872 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545231781]
[2023-10-25 15:19:50,872 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:19:50,873 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:19:50,930 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-25 15:19:50,930 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-10-25 15:19:50,959 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-25 15:19:50,969 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-10-25 15:19:50,969 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-10-25 15:19:50,970 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining)
[2023-10-25 15:19:50,970 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining)
[2023-10-25 15:19:50,970 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining)
[2023-10-25 15:19:50,970 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining)
[2023-10-25 15:19:50,970 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining)
[2023-10-25 15:19:50,971 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining)
[2023-10-25 15:19:50,971 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining)
[2023-10-25 15:19:50,971 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining)
[2023-10-25 15:19:50,971 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining)
[2023-10-25 15:19:50,971 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2023-10-25 15:19:50,972 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1]
[2023-10-25 15:19:50,973 WARN  L233   ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-10-25 15:19:50,973 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances.
[2023-10-25 15:19:51,006 INFO  L144    ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions.
[2023-10-25 15:19:51,021 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 140 places, 139 transitions, 308 flow
[2023-10-25 15:19:51,087 INFO  L130       PetriNetUnfolder]: 21/465 cut-off events.
[2023-10-25 15:19:51,087 INFO  L131       PetriNetUnfolder]: For 19/19 co-relation queries the response was YES.
[2023-10-25 15:19:51,088 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 493 conditions, 465 events. 21/465 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1345 event pairs, 1 based on Foata normal form. 0/401 useless extension candidates. Maximal degree in co-relation 278. Up to 16 conditions per place. 
[2023-10-25 15:19:51,088 INFO  L82        GeneralOperation]: Start removeDead. Operand has 140 places, 139 transitions, 308 flow
[2023-10-25 15:19:51,089 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 140 places, 139 transitions, 308 flow
[2023-10-25 15:19:51,089 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-10-25 15:19:51,090 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 140 places, 139 transitions, 308 flow
[2023-10-25 15:19:51,090 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 140 places, 139 transitions, 308 flow
[2023-10-25 15:19:51,090 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 140 places, 139 transitions, 308 flow
[2023-10-25 15:19:51,146 INFO  L130       PetriNetUnfolder]: 21/465 cut-off events.
[2023-10-25 15:19:51,161 INFO  L131       PetriNetUnfolder]: For 19/19 co-relation queries the response was YES.
[2023-10-25 15:19:51,162 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 493 conditions, 465 events. 21/465 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1345 event pairs, 1 based on Foata normal form. 0/401 useless extension candidates. Maximal degree in co-relation 278. Up to 16 conditions per place. 
[2023-10-25 15:19:51,167 INFO  L119        LiptonReduction]: Number of co-enabled transitions 6384
[2023-10-25 15:19:55,646 INFO  L134        LiptonReduction]: Checked pairs total: 13211
[2023-10-25 15:19:55,646 INFO  L136        LiptonReduction]: Total number of compositions: 114
[2023-10-25 15:19:55,648 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-10-25 15:19:55,648 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;@65717078, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-10-25 15:19:55,648 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 10 error locations.
[2023-10-25 15:19:55,649 INFO  L130       PetriNetUnfolder]: 0/2 cut-off events.
[2023-10-25 15:19:55,649 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-25 15:19:55,649 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:19:55,649 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1]
[2023-10-25 15:19:55,649 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-10-25 15:19:55,650 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:19:55,650 INFO  L85        PathProgramCache]: Analyzing trace with hash 28698, now seen corresponding path program 1 times
[2023-10-25 15:19:55,650 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:19:55,650 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975227107]
[2023-10-25 15:19:55,650 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:19:55,650 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:19:55,681 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:19:55,686 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:19:55,686 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:19:55,686 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975227107]
[2023-10-25 15:19:55,686 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975227107] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:19:55,686 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:19:55,687 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2023-10-25 15:19:55,687 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427276950]
[2023-10-25 15:19:55,687 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:19:55,687 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-10-25 15:19:55,689 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:19:55,689 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-10-25 15:19:55,690 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-10-25 15:19:55,690 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 130 out of 253
[2023-10-25 15:19:55,690 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 41 transitions, 112 flow. Second operand  has 2 states, 2 states have (on average 131.0) internal successors, (262), 2 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:55,690 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:19:55,691 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 253
[2023-10-25 15:19:55,691 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:19:56,606 INFO  L130       PetriNetUnfolder]: 4046/6932 cut-off events.
[2023-10-25 15:19:56,606 INFO  L131       PetriNetUnfolder]: For 527/527 co-relation queries the response was YES.
[2023-10-25 15:19:56,612 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13310 conditions, 6932 events. 4046/6932 cut-off events. For 527/527 co-relation queries the response was YES. Maximal size of possible extension queue 284. Compared 44954 event pairs, 3989 based on Foata normal form. 0/6326 useless extension candidates. Maximal degree in co-relation 1715. Up to 6005 conditions per place. 
[2023-10-25 15:19:56,672 INFO  L137   encePairwiseOnDemand]: 249/253 looper letters, 28 selfloop transitions, 0 changer transitions 0/37 dead transitions.
[2023-10-25 15:19:56,672 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 37 transitions, 160 flow
[2023-10-25 15:19:56,673 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-10-25 15:19:56,673 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-10-25 15:19:56,674 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 292 transitions.
[2023-10-25 15:19:56,674 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5770750988142292
[2023-10-25 15:19:56,674 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 292 transitions.
[2023-10-25 15:19:56,674 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 292 transitions.
[2023-10-25 15:19:56,674 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:19:56,674 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 292 transitions.
[2023-10-25 15:19:56,675 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 146.0) internal successors, (292), 2 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:56,676 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 253.0) internal successors, (759), 3 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:56,676 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 253.0) internal successors, (759), 3 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:56,677 INFO  L175             Difference]: Start difference. First operand has 45 places, 41 transitions, 112 flow. Second operand 2 states and 292 transitions.
[2023-10-25 15:19:56,677 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 37 transitions, 160 flow
[2023-10-25 15:19:56,677 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 37 transitions, 160 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-25 15:19:56,678 INFO  L231             Difference]: Finished difference. Result has 42 places, 37 transitions, 104 flow
[2023-10-25 15:19:56,678 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=104, PETRI_PLACES=42, PETRI_TRANSITIONS=37}
[2023-10-25 15:19:56,679 INFO  L288   CegarLoopForPetriNet]: 45 programPoint places, -3 predicate places.
[2023-10-25 15:19:56,679 INFO  L495      AbstractCegarLoop]: Abstraction has has 42 places, 37 transitions, 104 flow
[2023-10-25 15:19:56,680 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 131.0) internal successors, (262), 2 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:56,680 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:19:56,680 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1]
[2023-10-25 15:19:56,680 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2023-10-25 15:19:56,680 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-10-25 15:19:56,680 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:19:56,680 INFO  L85        PathProgramCache]: Analyzing trace with hash 27557975, now seen corresponding path program 1 times
[2023-10-25 15:19:56,681 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:19:56,681 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892061974]
[2023-10-25 15:19:56,681 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:19:56,681 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:19:56,703 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:19:56,716 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:19:56,716 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:19:56,716 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892061974]
[2023-10-25 15:19:56,717 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892061974] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:19:56,717 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:19:56,717 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 15:19:56,717 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987935385]
[2023-10-25 15:19:56,717 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:19:56,718 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:19:56,718 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:19:56,719 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:19:56,719 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:19:56,748 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 124 out of 253
[2023-10-25 15:19:56,749 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 37 transitions, 104 flow. Second operand  has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:56,749 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:19:56,749 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 253
[2023-10-25 15:19:56,749 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:19:58,140 INFO  L130       PetriNetUnfolder]: 7618/11957 cut-off events.
[2023-10-25 15:19:58,157 INFO  L131       PetriNetUnfolder]: For 567/567 co-relation queries the response was YES.
[2023-10-25 15:19:58,167 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23698 conditions, 11957 events. 7618/11957 cut-off events. For 567/567 co-relation queries the response was YES. Maximal size of possible extension queue 407. Compared 74502 event pairs, 4897 based on Foata normal form. 0/11070 useless extension candidates. Maximal degree in co-relation 23692. Up to 8281 conditions per place. 
[2023-10-25 15:19:58,251 INFO  L137   encePairwiseOnDemand]: 247/253 looper letters, 43 selfloop transitions, 5 changer transitions 0/54 dead transitions.
[2023-10-25 15:19:58,260 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 54 transitions, 234 flow
[2023-10-25 15:19:58,261 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:19:58,261 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:19:58,262 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 421 transitions.
[2023-10-25 15:19:58,262 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5546772068511199
[2023-10-25 15:19:58,262 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 421 transitions.
[2023-10-25 15:19:58,262 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 421 transitions.
[2023-10-25 15:19:58,263 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:19:58,263 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 421 transitions.
[2023-10-25 15:19:58,264 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:58,278 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 253.0) internal successors, (1012), 4 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:58,278 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 253.0) internal successors, (1012), 4 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:58,279 INFO  L175             Difference]: Start difference. First operand has 42 places, 37 transitions, 104 flow. Second operand 3 states and 421 transitions.
[2023-10-25 15:19:58,279 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 54 transitions, 234 flow
[2023-10-25 15:19:58,281 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 54 transitions, 234 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-25 15:19:58,281 INFO  L231             Difference]: Finished difference. Result has 46 places, 41 transitions, 142 flow
[2023-10-25 15:19:58,282 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=46, PETRI_TRANSITIONS=41}
[2023-10-25 15:19:58,283 INFO  L288   CegarLoopForPetriNet]: 45 programPoint places, 1 predicate places.
[2023-10-25 15:19:58,283 INFO  L495      AbstractCegarLoop]: Abstraction has has 46 places, 41 transitions, 142 flow
[2023-10-25 15:19:58,283 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:58,283 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:19:58,283 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:19:58,283 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2023-10-25 15:19:58,283 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-10-25 15:19:58,284 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:19:58,284 INFO  L85        PathProgramCache]: Analyzing trace with hash 1947879644, now seen corresponding path program 1 times
[2023-10-25 15:19:58,284 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:19:58,284 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444438023]
[2023-10-25 15:19:58,284 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:19:58,286 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:19:58,293 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:19:58,320 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:19:58,320 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:19:58,320 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444438023]
[2023-10-25 15:19:58,321 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444438023] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:19:58,321 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:19:58,321 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 15:19:58,321 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271263969]
[2023-10-25 15:19:58,321 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:19:58,321 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:19:58,321 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:19:58,322 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:19:58,322 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:19:58,350 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 122 out of 253
[2023-10-25 15:19:58,351 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 41 transitions, 142 flow. Second operand  has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:58,351 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:19:58,351 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 253
[2023-10-25 15:19:58,351 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:20:00,252 INFO  L130       PetriNetUnfolder]: 9031/14325 cut-off events.
[2023-10-25 15:20:00,252 INFO  L131       PetriNetUnfolder]: For 3695/3695 co-relation queries the response was YES.
[2023-10-25 15:20:00,265 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 32017 conditions, 14325 events. 9031/14325 cut-off events. For 3695/3695 co-relation queries the response was YES. Maximal size of possible extension queue 600. Compared 96027 event pairs, 5597 based on Foata normal form. 0/13298 useless extension candidates. Maximal degree in co-relation 32009. Up to 10170 conditions per place. 
[2023-10-25 15:20:00,354 INFO  L137   encePairwiseOnDemand]: 246/253 looper letters, 49 selfloop transitions, 9 changer transitions 0/66 dead transitions.
[2023-10-25 15:20:00,355 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 66 transitions, 342 flow
[2023-10-25 15:20:00,355 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:20:00,355 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:20:00,356 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 420 transitions.
[2023-10-25 15:20:00,357 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5533596837944664
[2023-10-25 15:20:00,357 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 420 transitions.
[2023-10-25 15:20:00,357 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 420 transitions.
[2023-10-25 15:20:00,357 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:20:00,357 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 420 transitions.
[2023-10-25 15:20:00,358 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:00,359 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 253.0) internal successors, (1012), 4 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:00,360 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 253.0) internal successors, (1012), 4 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:00,360 INFO  L175             Difference]: Start difference. First operand has 46 places, 41 transitions, 142 flow. Second operand 3 states and 420 transitions.
[2023-10-25 15:20:00,360 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 66 transitions, 342 flow
[2023-10-25 15:20:00,465 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 66 transitions, 326 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-25 15:20:00,474 INFO  L231             Difference]: Finished difference. Result has 48 places, 48 transitions, 208 flow
[2023-10-25 15:20:00,474 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=208, PETRI_PLACES=48, PETRI_TRANSITIONS=48}
[2023-10-25 15:20:00,475 INFO  L288   CegarLoopForPetriNet]: 45 programPoint places, 3 predicate places.
[2023-10-25 15:20:00,475 INFO  L495      AbstractCegarLoop]: Abstraction has has 48 places, 48 transitions, 208 flow
[2023-10-25 15:20:00,476 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:00,476 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:20:00,476 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:20:00,476 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2023-10-25 15:20:00,476 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-10-25 15:20:00,477 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:20:00,477 INFO  L85        PathProgramCache]: Analyzing trace with hash -1731667041, now seen corresponding path program 1 times
[2023-10-25 15:20:00,477 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:20:00,477 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759337684]
[2023-10-25 15:20:00,477 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:20:00,477 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:20:00,506 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:20:00,659 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:20:00,659 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:20:00,659 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759337684]
[2023-10-25 15:20:00,659 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759337684] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 15:20:00,659 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [541384064]
[2023-10-25 15:20:00,660 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:20:00,660 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 15:20:00,660 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 15:20:00,661 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-25 15:20:00,705 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2023-10-25 15:20:00,789 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:20:00,790 INFO  L263         TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 4 conjunts are in the unsatisfiable core
[2023-10-25 15:20:00,791 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 15:20:00,840 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:20:00,840 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-25 15:20:00,862 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:20:00,863 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [541384064] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-25 15:20:00,863 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-25 15:20:00,863 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8
[2023-10-25 15:20:00,863 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948020471]
[2023-10-25 15:20:00,863 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-25 15:20:00,864 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2023-10-25 15:20:00,864 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:20:00,864 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2023-10-25 15:20:00,865 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2023-10-25 15:20:01,011 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 120 out of 253
[2023-10-25 15:20:01,011 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 48 transitions, 208 flow. Second operand  has 9 states, 9 states have (on average 121.88888888888889) internal successors, (1097), 9 states have internal predecessors, (1097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:01,011 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:20:01,012 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 253
[2023-10-25 15:20:01,012 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:20:01,946 INFO  L130       PetriNetUnfolder]: 4872/8243 cut-off events.
[2023-10-25 15:20:01,946 INFO  L131       PetriNetUnfolder]: For 6426/6669 co-relation queries the response was YES.
[2023-10-25 15:20:01,955 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20601 conditions, 8243 events. 4872/8243 cut-off events. For 6426/6669 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 53604 event pairs, 1866 based on Foata normal form. 388/8214 useless extension candidates. Maximal degree in co-relation 20592. Up to 4469 conditions per place. 
[2023-10-25 15:20:02,014 INFO  L137   encePairwiseOnDemand]: 246/253 looper letters, 74 selfloop transitions, 7 changer transitions 4/98 dead transitions.
[2023-10-25 15:20:02,014 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 98 transitions, 559 flow
[2023-10-25 15:20:02,015 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2023-10-25 15:20:02,015 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2023-10-25 15:20:02,017 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1033 transitions.
[2023-10-25 15:20:02,017 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5103754940711462
[2023-10-25 15:20:02,017 INFO  L72            ComplementDD]: Start complementDD. Operand 8 states and 1033 transitions.
[2023-10-25 15:20:02,018 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 8 states and 1033 transitions.
[2023-10-25 15:20:02,018 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:20:02,018 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1033 transitions.
[2023-10-25 15:20:02,020 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 9 states, 8 states have (on average 129.125) internal successors, (1033), 8 states have internal predecessors, (1033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:02,022 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 9 states, 9 states have (on average 253.0) internal successors, (2277), 9 states have internal predecessors, (2277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:02,023 INFO  L81            ComplementDD]: Finished complementDD. Result  has 9 states, 9 states have (on average 253.0) internal successors, (2277), 9 states have internal predecessors, (2277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:02,024 INFO  L175             Difference]: Start difference. First operand has 48 places, 48 transitions, 208 flow. Second operand 8 states and 1033 transitions.
[2023-10-25 15:20:02,024 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 98 transitions, 559 flow
[2023-10-25 15:20:02,043 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 98 transitions, 521 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-25 15:20:02,044 INFO  L231             Difference]: Finished difference. Result has 57 places, 52 transitions, 235 flow
[2023-10-25 15:20:02,045 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=235, PETRI_PLACES=57, PETRI_TRANSITIONS=52}
[2023-10-25 15:20:02,046 INFO  L288   CegarLoopForPetriNet]: 45 programPoint places, 12 predicate places.
[2023-10-25 15:20:02,046 INFO  L495      AbstractCegarLoop]: Abstraction has has 57 places, 52 transitions, 235 flow
[2023-10-25 15:20:02,046 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 121.88888888888889) internal successors, (1097), 9 states have internal predecessors, (1097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:02,046 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:20:02,046 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:20:02,068 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2023-10-25 15:20:02,250 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 15:20:02,251 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-10-25 15:20:02,251 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:20:02,251 INFO  L85        PathProgramCache]: Analyzing trace with hash -430492556, now seen corresponding path program 1 times
[2023-10-25 15:20:02,251 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:20:02,251 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159382734]
[2023-10-25 15:20:02,252 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:20:02,252 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:20:02,269 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:20:02,317 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2023-10-25 15:20:02,317 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:20:02,317 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159382734]
[2023-10-25 15:20:02,318 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159382734] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:20:02,318 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:20:02,318 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 15:20:02,318 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998771665]
[2023-10-25 15:20:02,318 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:20:02,318 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:20:02,319 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:20:02,319 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:20:02,319 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:20:02,334 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 122 out of 253
[2023-10-25 15:20:02,335 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 52 transitions, 235 flow. Second operand  has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:02,335 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:20:02,335 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 253
[2023-10-25 15:20:02,335 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:20:03,464 INFO  L130       PetriNetUnfolder]: 6319/10299 cut-off events.
[2023-10-25 15:20:03,464 INFO  L131       PetriNetUnfolder]: For 7970/8114 co-relation queries the response was YES.
[2023-10-25 15:20:03,481 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27986 conditions, 10299 events. 6319/10299 cut-off events. For 7970/8114 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 65263 event pairs, 4537 based on Foata normal form. 0/9863 useless extension candidates. Maximal degree in co-relation 27973. Up to 8531 conditions per place. 
[2023-10-25 15:20:03,536 INFO  L137   encePairwiseOnDemand]: 247/253 looper letters, 60 selfloop transitions, 12 changer transitions 0/80 dead transitions.
[2023-10-25 15:20:03,549 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 80 transitions, 508 flow
[2023-10-25 15:20:03,550 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:20:03,550 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:20:03,550 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 418 transitions.
[2023-10-25 15:20:03,551 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5507246376811594
[2023-10-25 15:20:03,551 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 418 transitions.
[2023-10-25 15:20:03,551 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 418 transitions.
[2023-10-25 15:20:03,551 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:20:03,551 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 418 transitions.
[2023-10-25 15:20:03,552 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:03,553 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 253.0) internal successors, (1012), 4 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:03,554 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 253.0) internal successors, (1012), 4 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:03,554 INFO  L175             Difference]: Start difference. First operand has 57 places, 52 transitions, 235 flow. Second operand 3 states and 418 transitions.
[2023-10-25 15:20:03,554 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 80 transitions, 508 flow
[2023-10-25 15:20:03,577 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 80 transitions, 503 flow, removed 2 selfloop flow, removed 1 redundant places.
[2023-10-25 15:20:03,578 INFO  L231             Difference]: Finished difference. Result has 58 places, 60 transitions, 334 flow
[2023-10-25 15:20:03,579 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=334, PETRI_PLACES=58, PETRI_TRANSITIONS=60}
[2023-10-25 15:20:03,579 INFO  L288   CegarLoopForPetriNet]: 45 programPoint places, 13 predicate places.
[2023-10-25 15:20:03,579 INFO  L495      AbstractCegarLoop]: Abstraction has has 58 places, 60 transitions, 334 flow
[2023-10-25 15:20:03,579 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:03,579 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:20:03,580 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:20:03,580 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2023-10-25 15:20:03,580 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-10-25 15:20:03,580 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:20:03,580 INFO  L85        PathProgramCache]: Analyzing trace with hash 585262481, now seen corresponding path program 1 times
[2023-10-25 15:20:03,580 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:20:03,581 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077455531]
[2023-10-25 15:20:03,581 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:20:03,581 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:20:03,593 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:20:03,725 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:20:03,725 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:20:03,726 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077455531]
[2023-10-25 15:20:03,726 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077455531] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:20:03,726 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:20:03,726 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-10-25 15:20:03,727 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780276610]
[2023-10-25 15:20:03,727 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:20:03,728 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:20:03,728 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:20:03,728 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:20:03,728 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:20:03,745 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 123 out of 253
[2023-10-25 15:20:03,745 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 60 transitions, 334 flow. Second operand  has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:03,746 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:20:03,746 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 253
[2023-10-25 15:20:03,746 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:20:04,089 INFO  L130       PetriNetUnfolder]: 857/2028 cut-off events.
[2023-10-25 15:20:04,090 INFO  L131       PetriNetUnfolder]: For 2518/2528 co-relation queries the response was YES.
[2023-10-25 15:20:04,093 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6091 conditions, 2028 events. 857/2028 cut-off events. For 2518/2528 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 13962 event pairs, 171 based on Foata normal form. 412/2388 useless extension candidates. Maximal degree in co-relation 6077. Up to 1380 conditions per place. 
[2023-10-25 15:20:04,095 INFO  L137   encePairwiseOnDemand]: 247/253 looper letters, 47 selfloop transitions, 7 changer transitions 0/65 dead transitions.
[2023-10-25 15:20:04,103 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 65 transitions, 437 flow
[2023-10-25 15:20:04,103 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:20:04,104 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:20:04,105 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 412 transitions.
[2023-10-25 15:20:04,105 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5428194993412385
[2023-10-25 15:20:04,105 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 412 transitions.
[2023-10-25 15:20:04,105 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 412 transitions.
[2023-10-25 15:20:04,106 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:20:04,106 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 412 transitions.
[2023-10-25 15:20:04,107 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:04,139 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 253.0) internal successors, (1012), 4 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:04,140 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 253.0) internal successors, (1012), 4 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:04,140 INFO  L175             Difference]: Start difference. First operand has 58 places, 60 transitions, 334 flow. Second operand 3 states and 412 transitions.
[2023-10-25 15:20:04,141 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 65 transitions, 437 flow
[2023-10-25 15:20:04,144 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 65 transitions, 429 flow, removed 2 selfloop flow, removed 1 redundant places.
[2023-10-25 15:20:04,147 INFO  L231             Difference]: Finished difference. Result has 59 places, 50 transitions, 252 flow
[2023-10-25 15:20:04,147 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=252, PETRI_PLACES=59, PETRI_TRANSITIONS=50}
[2023-10-25 15:20:04,148 INFO  L288   CegarLoopForPetriNet]: 45 programPoint places, 14 predicate places.
[2023-10-25 15:20:04,148 INFO  L495      AbstractCegarLoop]: Abstraction has has 59 places, 50 transitions, 252 flow
[2023-10-25 15:20:04,148 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:04,149 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:20:04,149 INFO  L209   CegarLoopForPetriNet]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1]
[2023-10-25 15:20:04,149 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2023-10-25 15:20:04,149 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-10-25 15:20:04,149 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:20:04,149 INFO  L85        PathProgramCache]: Analyzing trace with hash -1108884398, now seen corresponding path program 1 times
[2023-10-25 15:20:04,150 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:20:04,150 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485011041]
[2023-10-25 15:20:04,150 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:20:04,150 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:20:04,195 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-25 15:20:04,195 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-10-25 15:20:04,229 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-25 15:20:04,242 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-10-25 15:20:04,244 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-10-25 15:20:04,244 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining)
[2023-10-25 15:20:04,244 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining)
[2023-10-25 15:20:04,244 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining)
[2023-10-25 15:20:04,245 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining)
[2023-10-25 15:20:04,245 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining)
[2023-10-25 15:20:04,245 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining)
[2023-10-25 15:20:04,245 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining)
[2023-10-25 15:20:04,245 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining)
[2023-10-25 15:20:04,245 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining)
[2023-10-25 15:20:04,246 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining)
[2023-10-25 15:20:04,246 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2023-10-25 15:20:04,246 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:20:04,246 WARN  L233   ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-10-25 15:20:04,247 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances.
[2023-10-25 15:20:04,284 INFO  L144    ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions.
[2023-10-25 15:20:04,286 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 157 places, 155 transitions, 354 flow
[2023-10-25 15:20:04,433 INFO  L130       PetriNetUnfolder]: 43/824 cut-off events.
[2023-10-25 15:20:04,433 INFO  L131       PetriNetUnfolder]: For 48/48 co-relation queries the response was YES.
[2023-10-25 15:20:04,434 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 879 conditions, 824 events. 43/824 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 3260 event pairs, 6 based on Foata normal form. 0/708 useless extension candidates. Maximal degree in co-relation 485. Up to 32 conditions per place. 
[2023-10-25 15:20:04,434 INFO  L82        GeneralOperation]: Start removeDead. Operand has 157 places, 155 transitions, 354 flow
[2023-10-25 15:20:04,438 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 157 places, 155 transitions, 354 flow
[2023-10-25 15:20:04,438 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-10-25 15:20:04,438 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 157 places, 155 transitions, 354 flow
[2023-10-25 15:20:04,439 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 157 places, 155 transitions, 354 flow
[2023-10-25 15:20:04,439 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 157 places, 155 transitions, 354 flow
[2023-10-25 15:20:04,561 INFO  L130       PetriNetUnfolder]: 43/824 cut-off events.
[2023-10-25 15:20:04,562 INFO  L131       PetriNetUnfolder]: For 48/48 co-relation queries the response was YES.
[2023-10-25 15:20:04,564 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 879 conditions, 824 events. 43/824 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 3260 event pairs, 6 based on Foata normal form. 0/708 useless extension candidates. Maximal degree in co-relation 485. Up to 32 conditions per place. 
[2023-10-25 15:20:04,591 INFO  L119        LiptonReduction]: Number of co-enabled transitions 9464
[2023-10-25 15:20:08,938 INFO  L134        LiptonReduction]: Checked pairs total: 22521
[2023-10-25 15:20:08,938 INFO  L136        LiptonReduction]: Total number of compositions: 122
[2023-10-25 15:20:08,939 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-10-25 15:20:08,940 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;@65717078, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-10-25 15:20:08,940 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 11 error locations.
[2023-10-25 15:20:08,940 INFO  L130       PetriNetUnfolder]: 0/3 cut-off events.
[2023-10-25 15:20:08,941 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-25 15:20:08,941 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:20:08,941 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1]
[2023-10-25 15:20:08,941 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-10-25 15:20:08,941 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:20:08,941 INFO  L85        PathProgramCache]: Analyzing trace with hash 38078, now seen corresponding path program 1 times
[2023-10-25 15:20:08,941 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:20:08,941 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763500745]
[2023-10-25 15:20:08,941 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:20:08,941 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:20:08,964 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:20:08,967 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:20:08,968 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:20:08,968 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763500745]
[2023-10-25 15:20:08,968 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763500745] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:20:08,968 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:20:08,968 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2023-10-25 15:20:08,968 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209372605]
[2023-10-25 15:20:08,968 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:20:08,969 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-10-25 15:20:08,969 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:20:08,969 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-10-25 15:20:08,969 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-10-25 15:20:08,970 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 144 out of 277
[2023-10-25 15:20:08,970 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 49 transitions, 142 flow. Second operand  has 2 states, 2 states have (on average 145.0) internal successors, (290), 2 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:08,970 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:20:08,970 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 277
[2023-10-25 15:20:08,970 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:20:13,531 INFO  L130       PetriNetUnfolder]: 36913/53898 cut-off events.
[2023-10-25 15:20:13,531 INFO  L131       PetriNetUnfolder]: For 5118/5118 co-relation queries the response was YES.
[2023-10-25 15:20:13,602 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 106656 conditions, 53898 events. 36913/53898 cut-off events. For 5118/5118 co-relation queries the response was YES. Maximal size of possible extension queue 1564. Compared 371174 event pairs, 36570 based on Foata normal form. 0/49989 useless extension candidates. Maximal degree in co-relation 15264. Up to 50011 conditions per place. 
[2023-10-25 15:20:13,834 INFO  L137   encePairwiseOnDemand]: 273/277 looper letters, 35 selfloop transitions, 0 changer transitions 0/45 dead transitions.
[2023-10-25 15:20:13,834 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 45 transitions, 204 flow
[2023-10-25 15:20:13,835 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-10-25 15:20:13,849 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-10-25 15:20:13,850 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 327 transitions.
[2023-10-25 15:20:13,850 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5902527075812274
[2023-10-25 15:20:13,851 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 327 transitions.
[2023-10-25 15:20:13,851 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 327 transitions.
[2023-10-25 15:20:13,851 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:20:13,851 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 327 transitions.
[2023-10-25 15:20:13,857 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 163.5) internal successors, (327), 2 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:13,858 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 277.0) internal successors, (831), 3 states have internal predecessors, (831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:13,858 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 277.0) internal successors, (831), 3 states have internal predecessors, (831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:13,858 INFO  L175             Difference]: Start difference. First operand has 54 places, 49 transitions, 142 flow. Second operand 2 states and 327 transitions.
[2023-10-25 15:20:13,859 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 45 transitions, 204 flow
[2023-10-25 15:20:13,860 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 45 transitions, 204 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-25 15:20:13,861 INFO  L231             Difference]: Finished difference. Result has 51 places, 45 transitions, 134 flow
[2023-10-25 15:20:13,861 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=134, PETRI_PLACES=51, PETRI_TRANSITIONS=45}
[2023-10-25 15:20:13,862 INFO  L288   CegarLoopForPetriNet]: 54 programPoint places, -3 predicate places.
[2023-10-25 15:20:13,863 INFO  L495      AbstractCegarLoop]: Abstraction has has 51 places, 45 transitions, 134 flow
[2023-10-25 15:20:13,863 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 145.0) internal successors, (290), 2 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:13,863 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:20:13,863 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1]
[2023-10-25 15:20:13,866 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2023-10-25 15:20:13,866 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-10-25 15:20:13,867 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:20:13,867 INFO  L85        PathProgramCache]: Analyzing trace with hash 36575772, now seen corresponding path program 1 times
[2023-10-25 15:20:13,867 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:20:13,867 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557623515]
[2023-10-25 15:20:13,867 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:20:13,868 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:20:13,889 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:20:13,897 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:20:13,897 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:20:13,897 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557623515]
[2023-10-25 15:20:13,898 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557623515] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:20:13,898 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:20:13,898 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 15:20:13,898 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931708196]
[2023-10-25 15:20:13,898 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:20:13,898 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:20:13,898 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:20:13,899 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:20:13,899 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:20:13,913 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 137 out of 277
[2023-10-25 15:20:13,913 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 45 transitions, 134 flow. Second operand  has 3 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:13,914 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:20:13,916 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 277
[2023-10-25 15:20:13,916 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:20:21,649 INFO  L130       PetriNetUnfolder]: 73069/103628 cut-off events.
[2023-10-25 15:20:21,649 INFO  L131       PetriNetUnfolder]: For 5920/5920 co-relation queries the response was YES.
[2023-10-25 15:20:21,812 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 206250 conditions, 103628 events. 73069/103628 cut-off events. For 5920/5920 co-relation queries the response was YES. Maximal size of possible extension queue 2410. Compared 706049 event pairs, 48108 based on Foata normal form. 0/97520 useless extension candidates. Maximal degree in co-relation 206243. Up to 73612 conditions per place. 
[2023-10-25 15:20:22,257 INFO  L137   encePairwiseOnDemand]: 270/277 looper letters, 54 selfloop transitions, 6 changer transitions 0/67 dead transitions.
[2023-10-25 15:20:22,257 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 67 transitions, 298 flow
[2023-10-25 15:20:22,258 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:20:22,258 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:20:22,274 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 472 transitions.
[2023-10-25 15:20:22,275 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5679903730445247
[2023-10-25 15:20:22,275 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 472 transitions.
[2023-10-25 15:20:22,275 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 472 transitions.
[2023-10-25 15:20:22,275 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:20:22,275 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 472 transitions.
[2023-10-25 15:20:22,277 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 157.33333333333334) internal successors, (472), 3 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:22,292 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 277.0) internal successors, (1108), 4 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:22,293 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 277.0) internal successors, (1108), 4 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:22,293 INFO  L175             Difference]: Start difference. First operand has 51 places, 45 transitions, 134 flow. Second operand 3 states and 472 transitions.
[2023-10-25 15:20:22,293 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 67 transitions, 298 flow
[2023-10-25 15:20:22,296 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 67 transitions, 298 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-25 15:20:22,297 INFO  L231             Difference]: Finished difference. Result has 55 places, 50 transitions, 180 flow
[2023-10-25 15:20:22,297 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=180, PETRI_PLACES=55, PETRI_TRANSITIONS=50}
[2023-10-25 15:20:22,298 INFO  L288   CegarLoopForPetriNet]: 54 programPoint places, 1 predicate places.
[2023-10-25 15:20:22,298 INFO  L495      AbstractCegarLoop]: Abstraction has has 55 places, 50 transitions, 180 flow
[2023-10-25 15:20:22,298 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:22,299 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:20:22,299 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:20:22,299 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2023-10-25 15:20:22,299 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-10-25 15:20:22,299 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:20:22,300 INFO  L85        PathProgramCache]: Analyzing trace with hash 176595664, now seen corresponding path program 1 times
[2023-10-25 15:20:22,300 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:20:22,300 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808011749]
[2023-10-25 15:20:22,300 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:20:22,300 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:20:22,321 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:20:22,333 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:20:22,333 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:20:22,333 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808011749]
[2023-10-25 15:20:22,334 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808011749] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:20:22,334 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:20:22,334 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 15:20:22,345 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423893203]
[2023-10-25 15:20:22,345 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:20:22,345 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:20:22,346 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:20:22,346 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:20:22,346 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:20:22,362 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 135 out of 277
[2023-10-25 15:20:22,363 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 50 transitions, 180 flow. Second operand  has 3 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:22,363 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:20:22,363 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 277
[2023-10-25 15:20:22,363 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:20:31,403 INFO  L130       PetriNetUnfolder]: 89848/128539 cut-off events.
[2023-10-25 15:20:31,403 INFO  L131       PetriNetUnfolder]: For 37185/37185 co-relation queries the response was YES.
[2023-10-25 15:20:31,650 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 289520 conditions, 128539 events. 89848/128539 cut-off events. For 37185/37185 co-relation queries the response was YES. Maximal size of possible extension queue 3583. Compared 938554 event pairs, 58046 based on Foata normal form. 0/120609 useless extension candidates. Maximal degree in co-relation 289511. Up to 95069 conditions per place. 
[2023-10-25 15:20:32,225 INFO  L137   encePairwiseOnDemand]: 269/277 looper letters, 63 selfloop transitions, 11 changer transitions 0/83 dead transitions.
[2023-10-25 15:20:32,225 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 83 transitions, 446 flow
[2023-10-25 15:20:32,225 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:20:32,225 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:20:32,243 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 473 transitions.
[2023-10-25 15:20:32,244 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5691937424789411
[2023-10-25 15:20:32,244 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 473 transitions.
[2023-10-25 15:20:32,244 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 473 transitions.
[2023-10-25 15:20:32,244 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:20:32,244 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 473 transitions.
[2023-10-25 15:20:32,245 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 157.66666666666666) internal successors, (473), 3 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:32,246 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 277.0) internal successors, (1108), 4 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:32,247 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 277.0) internal successors, (1108), 4 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:32,247 INFO  L175             Difference]: Start difference. First operand has 55 places, 50 transitions, 180 flow. Second operand 3 states and 473 transitions.
[2023-10-25 15:20:32,247 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 83 transitions, 446 flow
[2023-10-25 15:20:35,515 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 83 transitions, 426 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-25 15:20:35,517 INFO  L231             Difference]: Finished difference. Result has 57 places, 59 transitions, 264 flow
[2023-10-25 15:20:35,517 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=264, PETRI_PLACES=57, PETRI_TRANSITIONS=59}
[2023-10-25 15:20:35,518 INFO  L288   CegarLoopForPetriNet]: 54 programPoint places, 3 predicate places.
[2023-10-25 15:20:35,518 INFO  L495      AbstractCegarLoop]: Abstraction has has 57 places, 59 transitions, 264 flow
[2023-10-25 15:20:35,519 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:35,519 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:20:35,519 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:20:35,519 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2023-10-25 15:20:35,519 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-10-25 15:20:35,520 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:20:35,520 INFO  L85        PathProgramCache]: Analyzing trace with hash -756770437, now seen corresponding path program 1 times
[2023-10-25 15:20:35,520 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:20:35,520 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316165003]
[2023-10-25 15:20:35,520 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:20:35,520 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:20:35,551 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:20:35,645 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:20:35,645 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:20:35,645 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316165003]
[2023-10-25 15:20:35,646 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316165003] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 15:20:35,646 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1239862918]
[2023-10-25 15:20:35,646 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:20:35,646 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 15:20:35,646 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 15:20:35,647 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-25 15:20:35,687 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2023-10-25 15:20:35,790 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:20:35,791 INFO  L263         TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 4 conjunts are in the unsatisfiable core
[2023-10-25 15:20:35,792 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 15:20:35,823 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:20:35,824 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-25 15:20:35,854 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:20:35,854 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1239862918] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-25 15:20:35,855 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-25 15:20:35,855 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8
[2023-10-25 15:20:35,855 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548347048]
[2023-10-25 15:20:35,855 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-25 15:20:35,855 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2023-10-25 15:20:35,856 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:20:35,856 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2023-10-25 15:20:35,856 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2023-10-25 15:20:35,998 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 134 out of 277
[2023-10-25 15:20:35,999 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 59 transitions, 264 flow. Second operand  has 9 states, 9 states have (on average 135.77777777777777) internal successors, (1222), 9 states have internal predecessors, (1222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:35,999 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:20:35,999 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 277
[2023-10-25 15:20:35,999 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:20:41,570 INFO  L130       PetriNetUnfolder]: 51304/76067 cut-off events.
[2023-10-25 15:20:41,570 INFO  L131       PetriNetUnfolder]: For 54745/60542 co-relation queries the response was YES.
[2023-10-25 15:20:41,718 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 190830 conditions, 76067 events. 51304/76067 cut-off events. For 54745/60542 co-relation queries the response was YES. Maximal size of possible extension queue 1785. Compared 557804 event pairs, 22175 based on Foata normal form. 4019/76369 useless extension candidates. Maximal degree in co-relation 190820. Up to 45140 conditions per place. 
[2023-10-25 15:20:41,963 INFO  L137   encePairwiseOnDemand]: 270/277 looper letters, 100 selfloop transitions, 7 changer transitions 4/123 dead transitions.
[2023-10-25 15:20:41,964 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 123 transitions, 720 flow
[2023-10-25 15:20:41,964 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2023-10-25 15:20:41,964 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2023-10-25 15:20:41,981 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1162 transitions.
[2023-10-25 15:20:41,981 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5243682310469314
[2023-10-25 15:20:41,982 INFO  L72            ComplementDD]: Start complementDD. Operand 8 states and 1162 transitions.
[2023-10-25 15:20:41,982 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 8 states and 1162 transitions.
[2023-10-25 15:20:41,982 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:20:41,982 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1162 transitions.
[2023-10-25 15:20:41,984 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 9 states, 8 states have (on average 145.25) internal successors, (1162), 8 states have internal predecessors, (1162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:41,994 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 9 states, 9 states have (on average 277.0) internal successors, (2493), 9 states have internal predecessors, (2493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:41,995 INFO  L81            ComplementDD]: Finished complementDD. Result  has 9 states, 9 states have (on average 277.0) internal successors, (2493), 9 states have internal predecessors, (2493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:41,995 INFO  L175             Difference]: Start difference. First operand has 57 places, 59 transitions, 264 flow. Second operand 8 states and 1162 transitions.
[2023-10-25 15:20:41,995 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 123 transitions, 720 flow
[2023-10-25 15:20:42,183 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 123 transitions, 676 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-25 15:20:42,185 INFO  L231             Difference]: Finished difference. Result has 66 places, 63 transitions, 287 flow
[2023-10-25 15:20:42,185 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=287, PETRI_PLACES=66, PETRI_TRANSITIONS=63}
[2023-10-25 15:20:42,190 INFO  L288   CegarLoopForPetriNet]: 54 programPoint places, 12 predicate places.
[2023-10-25 15:20:42,190 INFO  L495      AbstractCegarLoop]: Abstraction has has 66 places, 63 transitions, 287 flow
[2023-10-25 15:20:42,190 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 135.77777777777777) internal successors, (1222), 9 states have internal predecessors, (1222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:42,190 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:20:42,208 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:20:42,214 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2023-10-25 15:20:42,412 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 15:20:42,413 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-10-25 15:20:42,414 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:20:42,414 INFO  L85        PathProgramCache]: Analyzing trace with hash 707331847, now seen corresponding path program 1 times
[2023-10-25 15:20:42,414 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:20:42,414 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976140359]
[2023-10-25 15:20:42,415 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:20:42,415 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:20:42,441 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:20:42,470 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2023-10-25 15:20:42,470 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:20:42,470 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976140359]
[2023-10-25 15:20:42,470 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976140359] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:20:42,471 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:20:42,471 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 15:20:42,471 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760672316]
[2023-10-25 15:20:42,471 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:20:42,471 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:20:42,471 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:20:42,472 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:20:42,472 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:20:42,490 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 135 out of 277
[2023-10-25 15:20:42,490 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 63 transitions, 287 flow. Second operand  has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:42,493 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:20:42,493 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 277
[2023-10-25 15:20:42,494 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:20:51,059 INFO  L130       PetriNetUnfolder]: 70386/102764 cut-off events.
[2023-10-25 15:20:51,068 INFO  L131       PetriNetUnfolder]: For 75691/77037 co-relation queries the response was YES.
[2023-10-25 15:20:51,317 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 272884 conditions, 102764 events. 70386/102764 cut-off events. For 75691/77037 co-relation queries the response was YES. Maximal size of possible extension queue 2248. Compared 743900 event pairs, 51147 based on Foata normal form. 4/98168 useless extension candidates. Maximal degree in co-relation 272870. Up to 86779 conditions per place. 
[2023-10-25 15:20:51,651 INFO  L137   encePairwiseOnDemand]: 270/277 looper letters, 76 selfloop transitions, 17 changer transitions 0/102 dead transitions.
[2023-10-25 15:20:51,652 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 102 transitions, 656 flow
[2023-10-25 15:20:51,652 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:20:51,652 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:20:51,653 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 471 transitions.
[2023-10-25 15:20:51,653 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5667870036101083
[2023-10-25 15:20:51,653 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 471 transitions.
[2023-10-25 15:20:51,653 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 471 transitions.
[2023-10-25 15:20:51,654 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:20:51,654 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 471 transitions.
[2023-10-25 15:20:51,655 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 157.0) internal successors, (471), 3 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:51,656 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 277.0) internal successors, (1108), 4 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:51,656 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 277.0) internal successors, (1108), 4 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:51,656 INFO  L175             Difference]: Start difference. First operand has 66 places, 63 transitions, 287 flow. Second operand 3 states and 471 transitions.
[2023-10-25 15:20:51,656 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 102 transitions, 656 flow
[2023-10-25 15:20:51,829 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 102 transitions, 651 flow, removed 2 selfloop flow, removed 1 redundant places.
[2023-10-25 15:20:51,830 INFO  L231             Difference]: Finished difference. Result has 67 places, 76 transitions, 441 flow
[2023-10-25 15:20:51,830 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=441, PETRI_PLACES=67, PETRI_TRANSITIONS=76}
[2023-10-25 15:20:51,830 INFO  L288   CegarLoopForPetriNet]: 54 programPoint places, 13 predicate places.
[2023-10-25 15:20:51,831 INFO  L495      AbstractCegarLoop]: Abstraction has has 67 places, 76 transitions, 441 flow
[2023-10-25 15:20:51,831 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:51,831 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:20:51,831 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:20:51,831 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2023-10-25 15:20:51,831 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-10-25 15:20:51,832 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:20:51,832 INFO  L85        PathProgramCache]: Analyzing trace with hash -191335336, now seen corresponding path program 1 times
[2023-10-25 15:20:51,832 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:20:51,837 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634808720]
[2023-10-25 15:20:51,838 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:20:51,838 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:20:51,873 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:20:51,947 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:20:51,947 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:20:51,947 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634808720]
[2023-10-25 15:20:51,947 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634808720] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:20:51,948 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:20:51,948 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-10-25 15:20:51,948 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933448503]
[2023-10-25 15:20:51,949 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:20:51,949 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:20:51,949 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:20:51,949 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:20:51,949 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:20:51,980 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 135 out of 277
[2023-10-25 15:20:51,980 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 76 transitions, 441 flow. Second operand  has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:51,980 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:20:51,981 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 277
[2023-10-25 15:20:51,981 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:20:52,987 INFO  L130       PetriNetUnfolder]: 3849/8671 cut-off events.
[2023-10-25 15:20:52,987 INFO  L131       PetriNetUnfolder]: For 11095/11133 co-relation queries the response was YES.
[2023-10-25 15:20:52,997 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25393 conditions, 8671 events. 3849/8671 cut-off events. For 11095/11133 co-relation queries the response was YES. Maximal size of possible extension queue 368. Compared 76338 event pairs, 761 based on Foata normal form. 2851/11218 useless extension candidates. Maximal degree in co-relation 25378. Up to 6051 conditions per place. 
[2023-10-25 15:20:53,010 INFO  L137   encePairwiseOnDemand]: 269/277 looper letters, 55 selfloop transitions, 9 changer transitions 0/76 dead transitions.
[2023-10-25 15:20:53,010 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 76 transitions, 517 flow
[2023-10-25 15:20:53,010 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:20:53,010 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:20:53,011 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 458 transitions.
[2023-10-25 15:20:53,012 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5511432009626955
[2023-10-25 15:20:53,012 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 458 transitions.
[2023-10-25 15:20:53,012 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 458 transitions.
[2023-10-25 15:20:53,012 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:20:53,012 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 458 transitions.
[2023-10-25 15:20:53,030 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:53,031 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 277.0) internal successors, (1108), 4 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:53,032 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 277.0) internal successors, (1108), 4 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:53,032 INFO  L175             Difference]: Start difference. First operand has 67 places, 76 transitions, 441 flow. Second operand 3 states and 458 transitions.
[2023-10-25 15:20:53,032 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 76 transitions, 517 flow
[2023-10-25 15:20:53,047 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 76 transitions, 509 flow, removed 2 selfloop flow, removed 1 redundant places.
[2023-10-25 15:20:53,049 INFO  L231             Difference]: Finished difference. Result has 68 places, 59 transitions, 300 flow
[2023-10-25 15:20:53,049 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=300, PETRI_PLACES=68, PETRI_TRANSITIONS=59}
[2023-10-25 15:20:53,051 INFO  L288   CegarLoopForPetriNet]: 54 programPoint places, 14 predicate places.
[2023-10-25 15:20:53,051 INFO  L495      AbstractCegarLoop]: Abstraction has has 68 places, 59 transitions, 300 flow
[2023-10-25 15:20:53,051 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:53,051 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:20:53,051 INFO  L209   CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:20:53,051 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2023-10-25 15:20:53,052 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-10-25 15:20:53,052 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:20:53,052 INFO  L85        PathProgramCache]: Analyzing trace with hash 266652888, now seen corresponding path program 1 times
[2023-10-25 15:20:53,052 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:20:53,052 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584084784]
[2023-10-25 15:20:53,053 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:20:53,053 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:20:53,098 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:20:53,125 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2023-10-25 15:20:53,125 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:20:53,125 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584084784]
[2023-10-25 15:20:53,125 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584084784] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:20:53,125 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:20:53,125 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 15:20:53,126 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297101806]
[2023-10-25 15:20:53,126 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:20:53,127 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:20:53,128 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:20:53,128 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:20:53,128 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:20:53,143 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 135 out of 277
[2023-10-25 15:20:53,144 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 59 transitions, 300 flow. Second operand  has 3 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:53,147 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:20:53,147 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 277
[2023-10-25 15:20:53,147 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:20:54,017 INFO  L130       PetriNetUnfolder]: 4013/9119 cut-off events.
[2023-10-25 15:20:54,018 INFO  L131       PetriNetUnfolder]: For 11263/11301 co-relation queries the response was YES.
[2023-10-25 15:20:54,028 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28141 conditions, 9119 events. 4013/9119 cut-off events. For 11263/11301 co-relation queries the response was YES. Maximal size of possible extension queue 375. Compared 79138 event pairs, 3200 based on Foata normal form. 0/8895 useless extension candidates. Maximal degree in co-relation 28126. Up to 7676 conditions per place. 
[2023-10-25 15:20:54,042 INFO  L137   encePairwiseOnDemand]: 273/277 looper letters, 60 selfloop transitions, 4 changer transitions 0/73 dead transitions.
[2023-10-25 15:20:54,042 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 73 transitions, 502 flow
[2023-10-25 15:20:54,043 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:20:54,043 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:20:54,043 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 455 transitions.
[2023-10-25 15:20:54,044 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5475330926594465
[2023-10-25 15:20:54,044 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 455 transitions.
[2023-10-25 15:20:54,044 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 455 transitions.
[2023-10-25 15:20:54,044 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:20:54,044 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 455 transitions.
[2023-10-25 15:20:54,045 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:54,046 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 277.0) internal successors, (1108), 4 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:54,046 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 277.0) internal successors, (1108), 4 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:54,046 INFO  L175             Difference]: Start difference. First operand has 68 places, 59 transitions, 300 flow. Second operand 3 states and 455 transitions.
[2023-10-25 15:20:54,046 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 73 transitions, 502 flow
[2023-10-25 15:20:54,055 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 73 transitions, 493 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-10-25 15:20:54,056 INFO  L231             Difference]: Finished difference. Result has 70 places, 61 transitions, 321 flow
[2023-10-25 15:20:54,056 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=291, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=321, PETRI_PLACES=70, PETRI_TRANSITIONS=61}
[2023-10-25 15:20:54,057 INFO  L288   CegarLoopForPetriNet]: 54 programPoint places, 16 predicate places.
[2023-10-25 15:20:54,057 INFO  L495      AbstractCegarLoop]: Abstraction has has 70 places, 61 transitions, 321 flow
[2023-10-25 15:20:54,057 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:54,057 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:20:54,057 INFO  L209   CegarLoopForPetriNet]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:20:54,058 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2023-10-25 15:20:54,058 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-10-25 15:20:54,058 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:20:54,058 INFO  L85        PathProgramCache]: Analyzing trace with hash -578019697, now seen corresponding path program 1 times
[2023-10-25 15:20:54,058 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:20:54,059 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744408991]
[2023-10-25 15:20:54,059 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:20:54,060 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:20:54,134 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-25 15:20:54,135 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-10-25 15:20:54,155 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-25 15:20:54,184 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-10-25 15:20:54,186 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-10-25 15:20:54,186 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining)
[2023-10-25 15:20:54,186 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining)
[2023-10-25 15:20:54,186 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining)
[2023-10-25 15:20:54,187 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining)
[2023-10-25 15:20:54,187 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining)
[2023-10-25 15:20:54,187 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining)
[2023-10-25 15:20:54,187 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining)
[2023-10-25 15:20:54,187 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining)
[2023-10-25 15:20:54,187 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining)
[2023-10-25 15:20:54,187 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining)
[2023-10-25 15:20:54,188 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining)
[2023-10-25 15:20:54,188 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2023-10-25 15:20:54,188 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:20:54,188 WARN  L233   ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-10-25 15:20:54,188 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances.
[2023-10-25 15:20:54,219 INFO  L144    ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions.
[2023-10-25 15:20:54,221 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 174 places, 171 transitions, 402 flow
[2023-10-25 15:20:54,466 INFO  L130       PetriNetUnfolder]: 93/1515 cut-off events.
[2023-10-25 15:20:54,467 INFO  L131       PetriNetUnfolder]: For 110/110 co-relation queries the response was YES.
[2023-10-25 15:20:54,472 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1626 conditions, 1515 events. 93/1515 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 7801 event pairs, 23 based on Foata normal form. 0/1299 useless extension candidates. Maximal degree in co-relation 869. Up to 80 conditions per place. 
[2023-10-25 15:20:54,472 INFO  L82        GeneralOperation]: Start removeDead. Operand has 174 places, 171 transitions, 402 flow
[2023-10-25 15:20:54,475 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 174 places, 171 transitions, 402 flow
[2023-10-25 15:20:54,489 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-10-25 15:20:54,489 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 171 transitions, 402 flow
[2023-10-25 15:20:54,489 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 174 places, 171 transitions, 402 flow
[2023-10-25 15:20:54,489 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 174 places, 171 transitions, 402 flow
[2023-10-25 15:20:54,718 INFO  L130       PetriNetUnfolder]: 93/1515 cut-off events.
[2023-10-25 15:20:54,718 INFO  L131       PetriNetUnfolder]: For 110/110 co-relation queries the response was YES.
[2023-10-25 15:20:54,723 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1626 conditions, 1515 events. 93/1515 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 7801 event pairs, 23 based on Foata normal form. 0/1299 useless extension candidates. Maximal degree in co-relation 869. Up to 80 conditions per place. 
[2023-10-25 15:20:54,771 INFO  L119        LiptonReduction]: Number of co-enabled transitions 13020
[2023-10-25 15:20:59,347 INFO  L134        LiptonReduction]: Checked pairs total: 31156
[2023-10-25 15:20:59,347 INFO  L136        LiptonReduction]: Total number of compositions: 130
[2023-10-25 15:20:59,348 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-10-25 15:20:59,348 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;@65717078, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-10-25 15:20:59,349 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 12 error locations.
[2023-10-25 15:20:59,349 INFO  L130       PetriNetUnfolder]: 0/2 cut-off events.
[2023-10-25 15:20:59,349 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-25 15:20:59,349 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:20:59,349 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1]
[2023-10-25 15:20:59,349 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 9 more)] ===
[2023-10-25 15:20:59,350 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:20:59,350 INFO  L85        PathProgramCache]: Analyzing trace with hash 48217, now seen corresponding path program 1 times
[2023-10-25 15:20:59,350 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:20:59,350 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866992019]
[2023-10-25 15:20:59,350 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:20:59,350 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:20:59,380 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:20:59,384 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:20:59,384 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:20:59,384 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866992019]
[2023-10-25 15:20:59,384 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866992019] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:20:59,384 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:20:59,384 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2023-10-25 15:20:59,385 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250930121]
[2023-10-25 15:20:59,385 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:20:59,385 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-10-25 15:20:59,385 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:20:59,385 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-10-25 15:20:59,386 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-10-25 15:20:59,386 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 158 out of 301
[2023-10-25 15:20:59,386 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 57 transitions, 174 flow. Second operand  has 2 states, 2 states have (on average 159.0) internal successors, (318), 2 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:59,386 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:20:59,387 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 301
[2023-10-25 15:20:59,387 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:21:24,120 INFO  L130       PetriNetUnfolder]: 191348/272230 cut-off events.
[2023-10-25 15:21:24,120 INFO  L131       PetriNetUnfolder]: For 32242/32242 co-relation queries the response was YES.
[2023-10-25 15:21:24,741 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 534983 conditions, 272230 events. 191348/272230 cut-off events. For 32242/32242 co-relation queries the response was YES. Maximal size of possible extension queue 7005. Compared 2163212 event pairs, 189535 based on Foata normal form. 0/253731 useless extension candidates. Maximal degree in co-relation 78792. Up to 247016 conditions per place. 
[2023-10-25 15:21:26,151 INFO  L137   encePairwiseOnDemand]: 297/301 looper letters, 39 selfloop transitions, 0 changer transitions 0/53 dead transitions.
[2023-10-25 15:21:26,151 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 53 transitions, 244 flow
[2023-10-25 15:21:26,152 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-10-25 15:21:26,152 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-10-25 15:21:26,152 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 359 transitions.
[2023-10-25 15:21:26,153 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5963455149501661
[2023-10-25 15:21:26,153 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 359 transitions.
[2023-10-25 15:21:26,153 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 359 transitions.
[2023-10-25 15:21:26,153 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:21:26,154 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 359 transitions.
[2023-10-25 15:21:26,154 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 179.5) internal successors, (359), 2 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:21:26,155 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 301.0) internal successors, (903), 3 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:21:26,155 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 301.0) internal successors, (903), 3 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:21:26,155 INFO  L175             Difference]: Start difference. First operand has 63 places, 57 transitions, 174 flow. Second operand 2 states and 359 transitions.
[2023-10-25 15:21:26,156 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 53 transitions, 244 flow
[2023-10-25 15:21:26,166 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 53 transitions, 244 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-25 15:21:26,166 INFO  L231             Difference]: Finished difference. Result has 60 places, 53 transitions, 166 flow
[2023-10-25 15:21:26,166 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=166, PETRI_PLACES=60, PETRI_TRANSITIONS=53}
[2023-10-25 15:21:26,167 INFO  L288   CegarLoopForPetriNet]: 63 programPoint places, -3 predicate places.
[2023-10-25 15:21:26,167 INFO  L495      AbstractCegarLoop]: Abstraction has has 60 places, 53 transitions, 166 flow
[2023-10-25 15:21:26,172 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 159.0) internal successors, (318), 2 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:21:26,172 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:21:26,172 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1]
[2023-10-25 15:21:26,172 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2023-10-25 15:21:26,172 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 9 more)] ===
[2023-10-25 15:21:26,172 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:21:26,173 INFO  L85        PathProgramCache]: Analyzing trace with hash 46331455, now seen corresponding path program 1 times
[2023-10-25 15:21:26,173 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:21:26,173 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213370044]
[2023-10-25 15:21:26,173 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:21:26,173 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:21:26,194 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:21:26,216 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:21:26,216 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:21:26,216 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213370044]
[2023-10-25 15:21:26,216 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213370044] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:21:26,216 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:21:26,217 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 15:21:26,217 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523785907]
[2023-10-25 15:21:26,217 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:21:26,217 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:21:26,217 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:21:26,218 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:21:26,218 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:21:26,238 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 150 out of 301
[2023-10-25 15:21:26,238 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 53 transitions, 166 flow. Second operand  has 3 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:21:26,239 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:21:26,239 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 301
[2023-10-25 15:21:26,239 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
