./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-const-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-const-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 93fcc6043461d76c9e3fa969bb797afe31775f06278c2c03325428159ee692d6
--- Real Ultimate output ---
This is Ultimate 0.2.2-dev-2329fc7
[2024-03-11 22:54:28,915 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2024-03-11 22:54:28,916 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2024-03-11 22:54:28,937 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2024-03-11 22:54:28,938 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2024-03-11 22:54:28,938 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2024-03-11 22:54:28,942 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2024-03-11 22:54:28,943 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2024-03-11 22:54:28,945 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2024-03-11 22:54:28,945 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2024-03-11 22:54:28,946 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2024-03-11 22:54:28,947 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2024-03-11 22:54:28,947 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2024-03-11 22:54:28,948 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2024-03-11 22:54:28,948 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2024-03-11 22:54:28,949 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2024-03-11 22:54:28,950 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2024-03-11 22:54:28,951 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2024-03-11 22:54:28,952 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2024-03-11 22:54:28,953 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2024-03-11 22:54:28,954 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2024-03-11 22:54:28,955 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2024-03-11 22:54:28,959 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2024-03-11 22:54:28,959 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2024-03-11 22:54:28,962 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2024-03-11 22:54:28,962 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2024-03-11 22:54:28,962 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2024-03-11 22:54:28,963 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2024-03-11 22:54:28,963 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2024-03-11 22:54:28,964 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2024-03-11 22:54:28,964 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2024-03-11 22:54:28,964 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2024-03-11 22:54:28,965 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2024-03-11 22:54:28,965 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2024-03-11 22:54:28,966 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2024-03-11 22:54:28,966 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2024-03-11 22:54:28,967 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2024-03-11 22:54:28,967 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2024-03-11 22:54:28,967 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2024-03-11 22:54:28,968 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2024-03-11 22:54:28,968 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2024-03-11 22:54:28,969 INFO  L101        SettingsManager]: Beginning loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2024-03-11 22:54:28,985 INFO  L113        SettingsManager]: Loading preferences was successful
[2024-03-11 22:54:28,985 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2024-03-11 22:54:28,985 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-03-11 22:54:28,985 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-03-11 22:54:28,986 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-03-11 22:54:28,986 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-03-11 22:54:28,986 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-03-11 22:54:28,986 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2024-03-11 22:54:28,986 INFO  L138        SettingsManager]:  * Use SBE=true
[2024-03-11 22:54:28,987 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-03-11 22:54:28,987 INFO  L138        SettingsManager]:  * sizeof long=4
[2024-03-11 22:54:28,987 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2024-03-11 22:54:28,987 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-03-11 22:54:28,987 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2024-03-11 22:54:28,987 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2024-03-11 22:54:28,987 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-03-11 22:54:28,987 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-03-11 22:54:28,988 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-03-11 22:54:28,988 INFO  L138        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2024-03-11 22:54:28,988 INFO  L138        SettingsManager]:  * sizeof long double=12
[2024-03-11 22:54:28,988 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2024-03-11 22:54:28,988 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2024-03-11 22:54:28,988 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-03-11 22:54:28,988 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-03-11 22:54:28,988 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-03-11 22:54:28,989 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-03-11 22:54:28,989 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-03-11 22:54:28,989 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-03-11 22:54:28,989 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-03-11 22:54:28,989 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2024-03-11 22:54:28,989 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-03-11 22:54:28,989 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-03-11 22:54:28,990 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-03-11 22:54:28,990 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-03-11 22:54:28,990 INFO  L138        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-03-11 22:54:28,990 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-03-11 22:54:28,990 INFO  L138        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2024-03-11 22:54:28,990 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 -> 93fcc6043461d76c9e3fa969bb797afe31775f06278c2c03325428159ee692d6
[2024-03-11 22:54:29,157 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-03-11 22:54:29,177 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-03-11 22:54:29,179 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-03-11 22:54:29,180 INFO  L271        PluginConnector]: Initializing CDTParser...
[2024-03-11 22:54:29,181 INFO  L275        PluginConnector]: CDTParser initialized
[2024-03-11 22:54:29,181 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/thread-join-array-const-race-2.i
[2024-03-11 22:54:30,146 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2024-03-11 22:54:30,340 INFO  L351              CDTParser]: Found 1 translation units.
[2024-03-11 22:54:30,340 INFO  L172              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/thread-join-array-const-race-2.i
[2024-03-11 22:54:30,348 INFO  L394              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/557c43740/d14a681d80a040fb8c5f99c5af856183/FLAG84ff2247d
[2024-03-11 22:54:30,358 INFO  L402              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/557c43740/d14a681d80a040fb8c5f99c5af856183
[2024-03-11 22:54:30,361 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-03-11 22:54:30,362 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-03-11 22:54:30,363 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-03-11 22:54:30,363 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-03-11 22:54:30,366 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-03-11 22:54:30,367 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 10:54:30" (1/1) ...
[2024-03-11 22:54:30,367 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ffc27ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:54:30, skipping insertion in model container
[2024-03-11 22:54:30,367 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 10:54:30" (1/1) ...
[2024-03-11 22:54:30,373 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2024-03-11 22:54:30,400 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2024-03-11 22:54:30,614 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-03-11 22:54:30,623 INFO  L203         MainTranslator]: Completed pre-run
[2024-03-11 22:54:30,651 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-03-11 22:54:30,675 INFO  L208         MainTranslator]: Completed translation
[2024-03-11 22:54:30,675 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:54:30 WrapperNode
[2024-03-11 22:54:30,675 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-03-11 22:54:30,676 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-03-11 22:54:30,676 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-03-11 22:54:30,676 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2024-03-11 22:54:30,682 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:54:30" (1/1) ...
[2024-03-11 22:54:30,693 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:54:30" (1/1) ...
[2024-03-11 22:54:30,708 INFO  L138                Inliner]: procedures = 157, calls = 15, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 51
[2024-03-11 22:54:30,708 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-03-11 22:54:30,709 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-03-11 22:54:30,709 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2024-03-11 22:54:30,709 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2024-03-11 22:54:30,716 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:54:30" (1/1) ...
[2024-03-11 22:54:30,716 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:54:30" (1/1) ...
[2024-03-11 22:54:30,721 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:54:30" (1/1) ...
[2024-03-11 22:54:30,722 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:54:30" (1/1) ...
[2024-03-11 22:54:30,726 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:54:30" (1/1) ...
[2024-03-11 22:54:30,728 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:54:30" (1/1) ...
[2024-03-11 22:54:30,729 INFO  L185        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:54:30" (1/1) ...
[2024-03-11 22:54:30,730 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:54:30" (1/1) ...
[2024-03-11 22:54:30,732 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-03-11 22:54:30,732 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-03-11 22:54:30,732 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2024-03-11 22:54:30,732 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2024-03-11 22:54:30,733 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:54:30" (1/1) ...
[2024-03-11 22:54:30,738 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-03-11 22:54:30,746 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:54:30,756 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2024-03-11 22:54:30,769 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2024-03-11 22:54:30,791 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2024-03-11 22:54:30,792 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2024-03-11 22:54:30,792 INFO  L130     BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock
[2024-03-11 22:54:30,792 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-03-11 22:54:30,792 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2024-03-11 22:54:30,792 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-03-11 22:54:30,792 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2024-03-11 22:54:30,792 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2024-03-11 22:54:30,792 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2024-03-11 22:54:30,792 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-03-11 22:54:30,792 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-03-11 22:54:30,794 WARN  L209             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2024-03-11 22:54:30,930 INFO  L235             CfgBuilder]: Building ICFG
[2024-03-11 22:54:30,931 INFO  L261             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-03-11 22:54:31,071 INFO  L276             CfgBuilder]: Performing block encoding
[2024-03-11 22:54:31,077 INFO  L295             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-03-11 22:54:31,077 INFO  L300             CfgBuilder]: Removed 2 assume(true) statements.
[2024-03-11 22:54:31,078 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 10:54:31 BoogieIcfgContainer
[2024-03-11 22:54:31,078 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-03-11 22:54:31,080 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-03-11 22:54:31,080 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2024-03-11 22:54:31,084 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2024-03-11 22:54:31,084 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.03 10:54:30" (1/3) ...
[2024-03-11 22:54:31,085 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53461b58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 10:54:31, skipping insertion in model container
[2024-03-11 22:54:31,085 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:54:30" (2/3) ...
[2024-03-11 22:54:31,085 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53461b58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 10:54:31, skipping insertion in model container
[2024-03-11 22:54:31,085 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 10:54:31" (3/3) ...
[2024-03-11 22:54:31,086 INFO  L112   eAbstractionObserver]: Analyzing ICFG thread-join-array-const-race-2.i
[2024-03-11 22:54:31,094 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2024-03-11 22:54:31,102 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-03-11 22:54:31,102 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations.
[2024-03-11 22:54:31,102 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-03-11 22:54:31,141 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2024-03-11 22:54:31,167 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 69 places, 69 transitions, 146 flow
[2024-03-11 22:54:31,197 INFO  L130       PetriNetUnfolder]: 5/95 cut-off events.
[2024-03-11 22:54:31,198 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2024-03-11 22:54:31,201 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 101 conditions, 95 events. 5/95 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 181 event pairs, 0 based on Foata normal form. 0/82 useless extension candidates. Maximal degree in co-relation 45. Up to 4 conditions per place. 
[2024-03-11 22:54:31,202 INFO  L82        GeneralOperation]: Start removeDead. Operand has 69 places, 69 transitions, 146 flow
[2024-03-11 22:54:31,205 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 69 places, 69 transitions, 146 flow
[2024-03-11 22:54:31,207 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2024-03-11 22:54:31,214 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 69 transitions, 146 flow
[2024-03-11 22:54:31,216 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 69 transitions, 146 flow
[2024-03-11 22:54:31,217 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 69 places, 69 transitions, 146 flow
[2024-03-11 22:54:31,233 INFO  L130       PetriNetUnfolder]: 5/95 cut-off events.
[2024-03-11 22:54:31,234 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2024-03-11 22:54:31,234 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 101 conditions, 95 events. 5/95 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 181 event pairs, 0 based on Foata normal form. 0/82 useless extension candidates. Maximal degree in co-relation 45. Up to 4 conditions per place. 
[2024-03-11 22:54:31,235 INFO  L119        LiptonReduction]: Number of co-enabled transitions 896
[2024-03-11 22:54:32,537 INFO  L134        LiptonReduction]: Checked pairs total: 1515
[2024-03-11 22:54:32,537 INFO  L136        LiptonReduction]: Total number of compositions: 54
[2024-03-11 22:54:32,555 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-11 22:54:32,560 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;@13cb7aed, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2024-03-11 22:54:32,560 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 5 error locations.
[2024-03-11 22:54:32,562 INFO  L130       PetriNetUnfolder]: 0/5 cut-off events.
[2024-03-11 22:54:32,562 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2024-03-11 22:54:32,562 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:54:32,563 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1]
[2024-03-11 22:54:32,563 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2024-03-11 22:54:32,566 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:54:32,567 INFO  L85        PathProgramCache]: Analyzing trace with hash 253400, now seen corresponding path program 1 times
[2024-03-11 22:54:32,573 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:54:32,574 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048679065]
[2024-03-11 22:54:32,574 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:54:32,574 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:54:32,645 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:54:32,730 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:54:32,730 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:54:32,731 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048679065]
[2024-03-11 22:54:32,731 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048679065] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:54:32,731 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:54:32,731 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-11 22:54:32,733 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518067207]
[2024-03-11 22:54:32,733 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:54:32,739 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-11 22:54:32,739 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:54:32,754 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-11 22:54:32,756 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-11 22:54:32,778 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 62 out of 123
[2024-03-11 22:54:32,780 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 18 transitions, 44 flow. Second operand  has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:32,780 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:54:32,780 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 123
[2024-03-11 22:54:32,781 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:54:32,812 INFO  L130       PetriNetUnfolder]: 12/52 cut-off events.
[2024-03-11 22:54:32,812 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2024-03-11 22:54:32,813 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 100 conditions, 52 events. 12/52 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 144 event pairs, 5 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 72. Up to 36 conditions per place. 
[2024-03-11 22:54:32,814 INFO  L137   encePairwiseOnDemand]: 119/123 looper letters, 13 selfloop transitions, 2 changer transitions 0/20 dead transitions.
[2024-03-11 22:54:32,814 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 20 transitions, 78 flow
[2024-03-11 22:54:32,815 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-11 22:54:32,817 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-11 22:54:32,823 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 203 transitions.
[2024-03-11 22:54:32,825 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5501355013550135
[2024-03-11 22:54:32,825 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 203 transitions.
[2024-03-11 22:54:32,826 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 203 transitions.
[2024-03-11 22:54:32,826 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:54:32,828 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 203 transitions.
[2024-03-11 22:54:32,830 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:32,834 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 123.0) internal successors, (492), 4 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:32,835 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 123.0) internal successors, (492), 4 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:32,836 INFO  L175             Difference]: Start difference. First operand has 20 places, 18 transitions, 44 flow. Second operand 3 states and 203 transitions.
[2024-03-11 22:54:32,837 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 20 transitions, 78 flow
[2024-03-11 22:54:32,839 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 20 transitions, 78 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-11 22:54:32,840 INFO  L231             Difference]: Finished difference. Result has 22 places, 17 transitions, 50 flow
[2024-03-11 22:54:32,841 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=22, PETRI_TRANSITIONS=17}
[2024-03-11 22:54:32,844 INFO  L288   CegarLoopForPetriNet]: 20 programPoint places, 2 predicate places.
[2024-03-11 22:54:32,844 INFO  L495      AbstractCegarLoop]: Abstraction has has 22 places, 17 transitions, 50 flow
[2024-03-11 22:54:32,845 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:32,845 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:54:32,845 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-03-11 22:54:32,845 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-03-11 22:54:32,845 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2024-03-11 22:54:32,846 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:54:32,846 INFO  L85        PathProgramCache]: Analyzing trace with hash -1030225790, now seen corresponding path program 1 times
[2024-03-11 22:54:32,846 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:54:32,846 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55968201]
[2024-03-11 22:54:32,846 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:54:32,846 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:54:32,859 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:54:32,884 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:54:32,884 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:54:32,884 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55968201]
[2024-03-11 22:54:32,885 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55968201] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:54:32,885 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:54:32,885 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-11 22:54:32,885 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098334124]
[2024-03-11 22:54:32,885 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:54:32,886 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-11 22:54:32,886 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:54:32,887 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-11 22:54:32,887 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-11 22:54:32,903 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 59 out of 123
[2024-03-11 22:54:32,903 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 17 transitions, 50 flow. Second operand  has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:32,903 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:54:32,903 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 123
[2024-03-11 22:54:32,903 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:54:32,939 INFO  L130       PetriNetUnfolder]: 20/71 cut-off events.
[2024-03-11 22:54:32,939 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2024-03-11 22:54:32,940 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 153 conditions, 71 events. 20/71 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 223 event pairs, 13 based on Foata normal form. 0/59 useless extension candidates. Maximal degree in co-relation 122. Up to 48 conditions per place. 
[2024-03-11 22:54:32,940 INFO  L137   encePairwiseOnDemand]: 119/123 looper letters, 17 selfloop transitions, 3 changer transitions 1/24 dead transitions.
[2024-03-11 22:54:32,940 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 24 transitions, 111 flow
[2024-03-11 22:54:32,940 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-11 22:54:32,941 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-11 22:54:32,941 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 199 transitions.
[2024-03-11 22:54:32,942 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5392953929539296
[2024-03-11 22:54:32,942 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 199 transitions.
[2024-03-11 22:54:32,942 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 199 transitions.
[2024-03-11 22:54:32,942 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:54:32,943 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 199 transitions.
[2024-03-11 22:54:32,943 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:32,944 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 123.0) internal successors, (492), 4 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:32,945 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 123.0) internal successors, (492), 4 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:32,945 INFO  L175             Difference]: Start difference. First operand has 22 places, 17 transitions, 50 flow. Second operand 3 states and 199 transitions.
[2024-03-11 22:54:32,945 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 24 transitions, 111 flow
[2024-03-11 22:54:32,945 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 24 transitions, 105 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-11 22:54:32,946 INFO  L231             Difference]: Finished difference. Result has 23 places, 19 transitions, 65 flow
[2024-03-11 22:54:32,946 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=46, 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=65, PETRI_PLACES=23, PETRI_TRANSITIONS=19}
[2024-03-11 22:54:32,946 INFO  L288   CegarLoopForPetriNet]: 20 programPoint places, 3 predicate places.
[2024-03-11 22:54:32,947 INFO  L495      AbstractCegarLoop]: Abstraction has has 23 places, 19 transitions, 65 flow
[2024-03-11 22:54:32,947 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:32,947 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:54:32,947 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1]
[2024-03-11 22:54:32,947 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-03-11 22:54:32,947 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2024-03-11 22:54:32,948 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:54:32,948 INFO  L85        PathProgramCache]: Analyzing trace with hash -1030223241, now seen corresponding path program 1 times
[2024-03-11 22:54:32,948 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:54:32,948 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912660626]
[2024-03-11 22:54:32,948 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:54:32,949 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:54:32,965 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-11 22:54:32,966 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-03-11 22:54:32,974 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-11 22:54:32,988 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-03-11 22:54:32,988 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-03-11 22:54:32,989 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining)
[2024-03-11 22:54:32,990 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (3 of 5 remaining)
[2024-03-11 22:54:32,991 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (2 of 5 remaining)
[2024-03-11 22:54:32,991 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 5 remaining)
[2024-03-11 22:54:32,991 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 5 remaining)
[2024-03-11 22:54:32,991 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-03-11 22:54:32,991 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1]
[2024-03-11 22:54:32,993 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-03-11 22:54:32,993 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2024-03-11 22:54:33,005 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2024-03-11 22:54:33,007 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 86 places, 85 transitions, 188 flow
[2024-03-11 22:54:33,026 INFO  L130       PetriNetUnfolder]: 10/167 cut-off events.
[2024-03-11 22:54:33,027 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2024-03-11 22:54:33,027 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 181 conditions, 167 events. 10/167 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 403 event pairs, 0 based on Foata normal form. 0/143 useless extension candidates. Maximal degree in co-relation 97. Up to 8 conditions per place. 
[2024-03-11 22:54:33,027 INFO  L82        GeneralOperation]: Start removeDead. Operand has 86 places, 85 transitions, 188 flow
[2024-03-11 22:54:33,028 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 86 places, 85 transitions, 188 flow
[2024-03-11 22:54:33,028 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2024-03-11 22:54:33,028 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 86 places, 85 transitions, 188 flow
[2024-03-11 22:54:33,028 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 85 transitions, 188 flow
[2024-03-11 22:54:33,029 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 86 places, 85 transitions, 188 flow
[2024-03-11 22:54:33,043 INFO  L130       PetriNetUnfolder]: 10/167 cut-off events.
[2024-03-11 22:54:33,043 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2024-03-11 22:54:33,044 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 181 conditions, 167 events. 10/167 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 403 event pairs, 0 based on Foata normal form. 0/143 useless extension candidates. Maximal degree in co-relation 97. Up to 8 conditions per place. 
[2024-03-11 22:54:33,046 INFO  L119        LiptonReduction]: Number of co-enabled transitions 2380
[2024-03-11 22:54:34,519 INFO  L134        LiptonReduction]: Checked pairs total: 5120
[2024-03-11 22:54:34,519 INFO  L136        LiptonReduction]: Total number of compositions: 58
[2024-03-11 22:54:34,521 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-11 22:54:34,522 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;@13cb7aed, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2024-03-11 22:54:34,522 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2024-03-11 22:54:34,523 INFO  L130       PetriNetUnfolder]: 0/4 cut-off events.
[2024-03-11 22:54:34,523 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2024-03-11 22:54:34,523 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:54:34,523 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1]
[2024-03-11 22:54:34,524 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2024-03-11 22:54:34,524 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:54:34,524 INFO  L85        PathProgramCache]: Analyzing trace with hash 411287, now seen corresponding path program 1 times
[2024-03-11 22:54:34,524 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:54:34,524 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129481335]
[2024-03-11 22:54:34,524 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:54:34,524 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:54:34,533 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:54:34,557 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:54:34,558 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:54:34,558 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129481335]
[2024-03-11 22:54:34,558 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129481335] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:54:34,558 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:54:34,558 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-11 22:54:34,558 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599086680]
[2024-03-11 22:54:34,558 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:54:34,559 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-11 22:54:34,559 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:54:34,559 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-11 22:54:34,559 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-11 22:54:34,577 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 76 out of 143
[2024-03-11 22:54:34,577 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 30 transitions, 78 flow. Second operand  has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:34,577 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:54:34,578 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 143
[2024-03-11 22:54:34,578 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:54:34,656 INFO  L130       PetriNetUnfolder]: 372/753 cut-off events.
[2024-03-11 22:54:34,656 INFO  L131       PetriNetUnfolder]: For 33/33 co-relation queries the response was YES.
[2024-03-11 22:54:34,658 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1444 conditions, 753 events. 372/753 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3870 event pairs, 170 based on Foata normal form. 0/658 useless extension candidates. Maximal degree in co-relation 270. Up to 641 conditions per place. 
[2024-03-11 22:54:34,660 INFO  L137   encePairwiseOnDemand]: 139/143 looper letters, 24 selfloop transitions, 2 changer transitions 0/35 dead transitions.
[2024-03-11 22:54:34,660 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 35 transitions, 140 flow
[2024-03-11 22:54:34,661 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-11 22:54:34,661 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-11 22:54:34,662 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 256 transitions.
[2024-03-11 22:54:34,662 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5967365967365967
[2024-03-11 22:54:34,662 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 256 transitions.
[2024-03-11 22:54:34,662 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 256 transitions.
[2024-03-11 22:54:34,663 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:54:34,663 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 256 transitions.
[2024-03-11 22:54:34,664 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:34,665 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:34,665 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:34,666 INFO  L175             Difference]: Start difference. First operand has 33 places, 30 transitions, 78 flow. Second operand 3 states and 256 transitions.
[2024-03-11 22:54:34,666 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 35 transitions, 140 flow
[2024-03-11 22:54:34,666 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 35 transitions, 140 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-11 22:54:34,667 INFO  L231             Difference]: Finished difference. Result has 35 places, 30 transitions, 88 flow
[2024-03-11 22:54:34,667 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=35, PETRI_TRANSITIONS=30}
[2024-03-11 22:54:34,667 INFO  L288   CegarLoopForPetriNet]: 33 programPoint places, 2 predicate places.
[2024-03-11 22:54:34,668 INFO  L495      AbstractCegarLoop]: Abstraction has has 35 places, 30 transitions, 88 flow
[2024-03-11 22:54:34,668 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:34,668 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:54:34,668 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:54:34,668 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-03-11 22:54:34,668 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2024-03-11 22:54:34,668 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:54:34,669 INFO  L85        PathProgramCache]: Analyzing trace with hash -2032684283, now seen corresponding path program 1 times
[2024-03-11 22:54:34,669 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:54:34,669 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229155000]
[2024-03-11 22:54:34,669 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:54:34,669 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:54:34,678 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:54:34,692 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:54:34,692 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:54:34,692 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229155000]
[2024-03-11 22:54:34,693 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229155000] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:54:34,693 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:54:34,693 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-11 22:54:34,693 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503526110]
[2024-03-11 22:54:34,693 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:54:34,693 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-11 22:54:34,693 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:54:34,694 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-11 22:54:34,694 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-11 22:54:34,706 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 72 out of 143
[2024-03-11 22:54:34,706 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 30 transitions, 88 flow. Second operand  has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:34,706 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:54:34,707 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 143
[2024-03-11 22:54:34,707 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:54:34,807 INFO  L130       PetriNetUnfolder]: 505/980 cut-off events.
[2024-03-11 22:54:34,807 INFO  L131       PetriNetUnfolder]: For 130/130 co-relation queries the response was YES.
[2024-03-11 22:54:34,808 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1994 conditions, 980 events. 505/980 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 5242 event pairs, 294 based on Foata normal form. 0/872 useless extension candidates. Maximal degree in co-relation 1949. Up to 615 conditions per place. 
[2024-03-11 22:54:34,811 INFO  L137   encePairwiseOnDemand]: 137/143 looper letters, 33 selfloop transitions, 5 changer transitions 0/46 dead transitions.
[2024-03-11 22:54:34,811 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 46 transitions, 211 flow
[2024-03-11 22:54:34,811 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-11 22:54:34,811 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-11 22:54:34,812 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 253 transitions.
[2024-03-11 22:54:34,812 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5897435897435898
[2024-03-11 22:54:34,813 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 253 transitions.
[2024-03-11 22:54:34,813 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 253 transitions.
[2024-03-11 22:54:34,813 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:54:34,813 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 253 transitions.
[2024-03-11 22:54:34,814 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:34,815 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:34,815 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:34,815 INFO  L175             Difference]: Start difference. First operand has 35 places, 30 transitions, 88 flow. Second operand 3 states and 253 transitions.
[2024-03-11 22:54:34,815 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 46 transitions, 211 flow
[2024-03-11 22:54:34,816 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 46 transitions, 208 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-11 22:54:34,817 INFO  L231             Difference]: Finished difference. Result has 38 places, 34 transitions, 124 flow
[2024-03-11 22:54:34,817 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=38, PETRI_TRANSITIONS=34}
[2024-03-11 22:54:34,817 INFO  L288   CegarLoopForPetriNet]: 33 programPoint places, 5 predicate places.
[2024-03-11 22:54:34,817 INFO  L495      AbstractCegarLoop]: Abstraction has has 38 places, 34 transitions, 124 flow
[2024-03-11 22:54:34,818 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:34,818 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:54:34,818 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:54:34,818 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-03-11 22:54:34,818 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2024-03-11 22:54:34,818 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:54:34,818 INFO  L85        PathProgramCache]: Analyzing trace with hash 1288850991, now seen corresponding path program 1 times
[2024-03-11 22:54:34,818 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:54:34,819 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014277155]
[2024-03-11 22:54:34,819 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:54:34,819 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:54:34,825 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:54:34,856 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-11 22:54:34,856 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:54:34,856 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014277155]
[2024-03-11 22:54:34,856 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014277155] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:54:34,856 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:54:34,857 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-03-11 22:54:34,857 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534937450]
[2024-03-11 22:54:34,857 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:54:34,857 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-03-11 22:54:34,857 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:54:34,857 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-03-11 22:54:34,858 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-03-11 22:54:34,883 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 74 out of 143
[2024-03-11 22:54:34,884 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 34 transitions, 124 flow. Second operand  has 4 states, 4 states have (on average 75.5) internal successors, (302), 4 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:34,884 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:54:34,884 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 143
[2024-03-11 22:54:34,884 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:54:34,964 INFO  L130       PetriNetUnfolder]: 338/685 cut-off events.
[2024-03-11 22:54:34,964 INFO  L131       PetriNetUnfolder]: For 464/478 co-relation queries the response was YES.
[2024-03-11 22:54:34,965 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1751 conditions, 685 events. 338/685 cut-off events. For 464/478 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3346 event pairs, 170 based on Foata normal form. 43/714 useless extension candidates. Maximal degree in co-relation 727. Up to 383 conditions per place. 
[2024-03-11 22:54:34,967 INFO  L137   encePairwiseOnDemand]: 139/143 looper letters, 39 selfloop transitions, 3 changer transitions 0/50 dead transitions.
[2024-03-11 22:54:34,967 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 50 transitions, 268 flow
[2024-03-11 22:54:34,968 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-03-11 22:54:34,968 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-03-11 22:54:34,968 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 331 transitions.
[2024-03-11 22:54:34,969 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5786713286713286
[2024-03-11 22:54:34,969 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 331 transitions.
[2024-03-11 22:54:34,969 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 331 transitions.
[2024-03-11 22:54:34,969 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:54:34,969 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 331 transitions.
[2024-03-11 22:54:34,970 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 82.75) internal successors, (331), 4 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:34,971 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 143.0) internal successors, (715), 5 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:34,971 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 143.0) internal successors, (715), 5 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:34,972 INFO  L175             Difference]: Start difference. First operand has 38 places, 34 transitions, 124 flow. Second operand 4 states and 331 transitions.
[2024-03-11 22:54:34,972 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 50 transitions, 268 flow
[2024-03-11 22:54:34,973 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 50 transitions, 250 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-11 22:54:34,974 INFO  L231             Difference]: Finished difference. Result has 40 places, 35 transitions, 130 flow
[2024-03-11 22:54:34,974 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=130, PETRI_PLACES=40, PETRI_TRANSITIONS=35}
[2024-03-11 22:54:34,975 INFO  L288   CegarLoopForPetriNet]: 33 programPoint places, 7 predicate places.
[2024-03-11 22:54:34,975 INFO  L495      AbstractCegarLoop]: Abstraction has has 40 places, 35 transitions, 130 flow
[2024-03-11 22:54:34,975 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 75.5) internal successors, (302), 4 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:34,975 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:54:34,975 INFO  L209   CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1]
[2024-03-11 22:54:34,975 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-03-11 22:54:34,976 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2024-03-11 22:54:34,976 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:54:34,976 INFO  L85        PathProgramCache]: Analyzing trace with hash -451073316, now seen corresponding path program 1 times
[2024-03-11 22:54:34,976 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:54:34,976 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190919577]
[2024-03-11 22:54:34,976 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:54:34,976 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:54:34,988 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-11 22:54:34,988 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-03-11 22:54:34,993 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-11 22:54:34,997 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-03-11 22:54:34,997 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-03-11 22:54:34,997 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining)
[2024-03-11 22:54:34,997 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 6 remaining)
[2024-03-11 22:54:34,998 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (3 of 6 remaining)
[2024-03-11 22:54:34,998 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 6 remaining)
[2024-03-11 22:54:34,998 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 6 remaining)
[2024-03-11 22:54:34,998 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 6 remaining)
[2024-03-11 22:54:34,998 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-03-11 22:54:34,998 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1]
[2024-03-11 22:54:34,999 WARN  L233   ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-03-11 22:54:34,999 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances.
[2024-03-11 22:54:35,014 INFO  L144    ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions.
[2024-03-11 22:54:35,016 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 103 places, 101 transitions, 232 flow
[2024-03-11 22:54:35,032 INFO  L130       PetriNetUnfolder]: 20/286 cut-off events.
[2024-03-11 22:54:35,032 INFO  L131       PetriNetUnfolder]: For 19/19 co-relation queries the response was YES.
[2024-03-11 22:54:35,032 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 314 conditions, 286 events. 20/286 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 855 event pairs, 1 based on Foata normal form. 0/243 useless extension candidates. Maximal degree in co-relation 175. Up to 16 conditions per place. 
[2024-03-11 22:54:35,032 INFO  L82        GeneralOperation]: Start removeDead. Operand has 103 places, 101 transitions, 232 flow
[2024-03-11 22:54:35,033 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 103 places, 101 transitions, 232 flow
[2024-03-11 22:54:35,033 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2024-03-11 22:54:35,034 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 101 transitions, 232 flow
[2024-03-11 22:54:35,034 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 101 transitions, 232 flow
[2024-03-11 22:54:35,034 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 103 places, 101 transitions, 232 flow
[2024-03-11 22:54:35,049 INFO  L130       PetriNetUnfolder]: 20/286 cut-off events.
[2024-03-11 22:54:35,049 INFO  L131       PetriNetUnfolder]: For 19/19 co-relation queries the response was YES.
[2024-03-11 22:54:35,050 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 314 conditions, 286 events. 20/286 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 855 event pairs, 1 based on Foata normal form. 0/243 useless extension candidates. Maximal degree in co-relation 175. Up to 16 conditions per place. 
[2024-03-11 22:54:35,053 INFO  L119        LiptonReduction]: Number of co-enabled transitions 4284
[2024-03-11 22:54:36,236 INFO  L134        LiptonReduction]: Checked pairs total: 10005
[2024-03-11 22:54:36,236 INFO  L136        LiptonReduction]: Total number of compositions: 67
[2024-03-11 22:54:36,238 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-11 22:54:36,239 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;@13cb7aed, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2024-03-11 22:54:36,239 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2024-03-11 22:54:36,239 INFO  L130       PetriNetUnfolder]: 0/4 cut-off events.
[2024-03-11 22:54:36,239 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2024-03-11 22:54:36,240 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:54:36,240 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1]
[2024-03-11 22:54:36,240 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2024-03-11 22:54:36,240 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:54:36,240 INFO  L85        PathProgramCache]: Analyzing trace with hash 593873, now seen corresponding path program 1 times
[2024-03-11 22:54:36,240 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:54:36,240 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883036661]
[2024-03-11 22:54:36,240 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:54:36,240 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:54:36,247 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:54:36,266 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:54:36,266 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:54:36,266 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883036661]
[2024-03-11 22:54:36,266 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883036661] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:54:36,266 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:54:36,266 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-11 22:54:36,266 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418272191]
[2024-03-11 22:54:36,267 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:54:36,267 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-11 22:54:36,267 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:54:36,267 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-11 22:54:36,267 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-11 22:54:36,280 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 90 out of 168
[2024-03-11 22:54:36,280 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 38 transitions, 106 flow. Second operand  has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:36,280 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:54:36,280 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 168
[2024-03-11 22:54:36,280 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:54:36,592 INFO  L130       PetriNetUnfolder]: 2727/4870 cut-off events.
[2024-03-11 22:54:36,592 INFO  L131       PetriNetUnfolder]: For 394/394 co-relation queries the response was YES.
[2024-03-11 22:54:36,596 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9218 conditions, 4870 events. 2727/4870 cut-off events. For 394/394 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 32396 event pairs, 1717 based on Foata normal form. 0/4412 useless extension candidates. Maximal degree in co-relation 1279. Up to 4052 conditions per place. 
[2024-03-11 22:54:36,610 INFO  L137   encePairwiseOnDemand]: 164/168 looper letters, 29 selfloop transitions, 2 changer transitions 0/43 dead transitions.
[2024-03-11 22:54:36,610 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 43 transitions, 178 flow
[2024-03-11 22:54:36,611 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-11 22:54:36,611 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-11 22:54:36,611 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 303 transitions.
[2024-03-11 22:54:36,612 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6011904761904762
[2024-03-11 22:54:36,612 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 303 transitions.
[2024-03-11 22:54:36,612 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 303 transitions.
[2024-03-11 22:54:36,612 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:54:36,612 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 303 transitions.
[2024-03-11 22:54:36,613 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:36,614 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:36,614 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:36,614 INFO  L175             Difference]: Start difference. First operand has 42 places, 38 transitions, 106 flow. Second operand 3 states and 303 transitions.
[2024-03-11 22:54:36,614 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 43 transitions, 178 flow
[2024-03-11 22:54:36,615 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 43 transitions, 178 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-11 22:54:36,616 INFO  L231             Difference]: Finished difference. Result has 44 places, 38 transitions, 116 flow
[2024-03-11 22:54:36,616 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=44, PETRI_TRANSITIONS=38}
[2024-03-11 22:54:36,617 INFO  L288   CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places.
[2024-03-11 22:54:36,617 INFO  L495      AbstractCegarLoop]: Abstraction has has 44 places, 38 transitions, 116 flow
[2024-03-11 22:54:36,617 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:36,617 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:54:36,617 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:54:36,617 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-03-11 22:54:36,617 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2024-03-11 22:54:36,618 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:54:36,618 INFO  L85        PathProgramCache]: Analyzing trace with hash -688259915, now seen corresponding path program 1 times
[2024-03-11 22:54:36,618 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:54:36,618 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069116612]
[2024-03-11 22:54:36,618 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:54:36,618 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:54:36,625 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:54:36,636 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:54:36,636 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:54:36,636 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069116612]
[2024-03-11 22:54:36,636 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069116612] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:54:36,636 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:54:36,637 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-11 22:54:36,637 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119507114]
[2024-03-11 22:54:36,637 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:54:36,637 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-11 22:54:36,637 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:54:36,637 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-11 22:54:36,637 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-11 22:54:36,654 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 85 out of 168
[2024-03-11 22:54:36,654 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 38 transitions, 116 flow. Second operand  has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 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)
[2024-03-11 22:54:36,654 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:54:36,654 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 168
[2024-03-11 22:54:36,654 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:54:37,277 INFO  L130       PetriNetUnfolder]: 5894/9408 cut-off events.
[2024-03-11 22:54:37,277 INFO  L131       PetriNetUnfolder]: For 1266/1266 co-relation queries the response was YES.
[2024-03-11 22:54:37,285 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19069 conditions, 9408 events. 5894/9408 cut-off events. For 1266/1266 co-relation queries the response was YES. Maximal size of possible extension queue 382. Compared 59256 event pairs, 4789 based on Foata normal form. 0/8587 useless extension candidates. Maximal degree in co-relation 19018. Up to 7622 conditions per place. 
[2024-03-11 22:54:37,318 INFO  L137   encePairwiseOnDemand]: 162/168 looper letters, 47 selfloop transitions, 5 changer transitions 0/60 dead transitions.
[2024-03-11 22:54:37,318 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 60 transitions, 289 flow
[2024-03-11 22:54:37,318 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-11 22:54:37,319 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-11 22:54:37,319 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 306 transitions.
[2024-03-11 22:54:37,319 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6071428571428571
[2024-03-11 22:54:37,320 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 306 transitions.
[2024-03-11 22:54:37,320 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 306 transitions.
[2024-03-11 22:54:37,320 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:54:37,320 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 306 transitions.
[2024-03-11 22:54:37,321 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:37,322 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:37,322 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:37,323 INFO  L175             Difference]: Start difference. First operand has 44 places, 38 transitions, 116 flow. Second operand 3 states and 306 transitions.
[2024-03-11 22:54:37,323 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 60 transitions, 289 flow
[2024-03-11 22:54:37,324 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 60 transitions, 286 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-11 22:54:37,325 INFO  L231             Difference]: Finished difference. Result has 46 places, 42 transitions, 147 flow
[2024-03-11 22:54:37,325 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=147, PETRI_PLACES=46, PETRI_TRANSITIONS=42}
[2024-03-11 22:54:37,325 INFO  L288   CegarLoopForPetriNet]: 42 programPoint places, 4 predicate places.
[2024-03-11 22:54:37,326 INFO  L495      AbstractCegarLoop]: Abstraction has has 46 places, 42 transitions, 147 flow
[2024-03-11 22:54:37,326 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 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)
[2024-03-11 22:54:37,326 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:54:37,326 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:54:37,326 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-03-11 22:54:37,326 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2024-03-11 22:54:37,326 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:54:37,326 INFO  L85        PathProgramCache]: Analyzing trace with hash 748844, now seen corresponding path program 1 times
[2024-03-11 22:54:37,327 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:54:37,327 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281171959]
[2024-03-11 22:54:37,327 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:54:37,327 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:54:37,332 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:54:37,359 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-11 22:54:37,360 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:54:37,360 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281171959]
[2024-03-11 22:54:37,360 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281171959] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:54:37,360 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:54:37,360 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-03-11 22:54:37,360 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372475532]
[2024-03-11 22:54:37,360 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:54:37,360 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-03-11 22:54:37,361 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:54:37,361 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-03-11 22:54:37,361 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-03-11 22:54:37,383 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 88 out of 168
[2024-03-11 22:54:37,384 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 42 transitions, 147 flow. Second operand  has 4 states, 4 states have (on average 89.5) internal successors, (358), 4 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:37,384 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:54:37,384 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 168
[2024-03-11 22:54:37,384 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:54:37,811 INFO  L130       PetriNetUnfolder]: 3162/5514 cut-off events.
[2024-03-11 22:54:37,812 INFO  L131       PetriNetUnfolder]: For 1355/2003 co-relation queries the response was YES.
[2024-03-11 22:54:37,817 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12182 conditions, 5514 events. 3162/5514 cut-off events. For 1355/2003 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 36320 event pairs, 1811 based on Foata normal form. 532/5797 useless extension candidates. Maximal degree in co-relation 4425. Up to 2993 conditions per place. 
[2024-03-11 22:54:37,830 INFO  L137   encePairwiseOnDemand]: 164/168 looper letters, 44 selfloop transitions, 3 changer transitions 0/60 dead transitions.
[2024-03-11 22:54:37,831 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 60 transitions, 291 flow
[2024-03-11 22:54:37,831 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-03-11 22:54:37,831 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-03-11 22:54:37,832 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 396 transitions.
[2024-03-11 22:54:37,832 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5892857142857143
[2024-03-11 22:54:37,832 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 396 transitions.
[2024-03-11 22:54:37,832 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 396 transitions.
[2024-03-11 22:54:37,833 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:54:37,833 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 396 transitions.
[2024-03-11 22:54:37,834 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 99.0) internal successors, (396), 4 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:37,834 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 168.0) internal successors, (840), 5 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:37,835 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 168.0) internal successors, (840), 5 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:37,835 INFO  L175             Difference]: Start difference. First operand has 46 places, 42 transitions, 147 flow. Second operand 4 states and 396 transitions.
[2024-03-11 22:54:37,835 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 60 transitions, 291 flow
[2024-03-11 22:54:37,837 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 60 transitions, 285 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-11 22:54:37,838 INFO  L231             Difference]: Finished difference. Result has 49 places, 43 transitions, 158 flow
[2024-03-11 22:54:37,838 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=158, PETRI_PLACES=49, PETRI_TRANSITIONS=43}
[2024-03-11 22:54:37,838 INFO  L288   CegarLoopForPetriNet]: 42 programPoint places, 7 predicate places.
[2024-03-11 22:54:37,839 INFO  L495      AbstractCegarLoop]: Abstraction has has 49 places, 43 transitions, 158 flow
[2024-03-11 22:54:37,839 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 89.5) internal successors, (358), 4 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:37,839 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:54:37,839 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:54:37,839 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-03-11 22:54:37,839 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2024-03-11 22:54:37,839 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:54:37,839 INFO  L85        PathProgramCache]: Analyzing trace with hash 1458128080, now seen corresponding path program 1 times
[2024-03-11 22:54:37,839 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:54:37,839 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729768453]
[2024-03-11 22:54:37,840 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:54:37,840 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:54:37,846 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:54:37,858 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2024-03-11 22:54:37,858 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:54:37,858 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729768453]
[2024-03-11 22:54:37,858 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729768453] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:54:37,858 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:54:37,858 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-11 22:54:37,858 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663110988]
[2024-03-11 22:54:37,859 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:54:37,859 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-11 22:54:37,859 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:54:37,859 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-11 22:54:37,859 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-11 22:54:37,873 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 85 out of 168
[2024-03-11 22:54:37,874 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 43 transitions, 158 flow. Second operand  has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:37,874 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:54:37,874 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 168
[2024-03-11 22:54:37,874 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:54:38,401 INFO  L130       PetriNetUnfolder]: 5570/9148 cut-off events.
[2024-03-11 22:54:38,402 INFO  L131       PetriNetUnfolder]: For 4659/4832 co-relation queries the response was YES.
[2024-03-11 22:54:38,413 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21462 conditions, 9148 events. 5570/9148 cut-off events. For 4659/4832 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 58817 event pairs, 3584 based on Foata normal form. 0/8675 useless extension candidates. Maximal degree in co-relation 8932. Up to 6345 conditions per place. 
[2024-03-11 22:54:38,438 INFO  L137   encePairwiseOnDemand]: 161/168 looper letters, 49 selfloop transitions, 9 changer transitions 0/67 dead transitions.
[2024-03-11 22:54:38,438 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 67 transitions, 360 flow
[2024-03-11 22:54:38,439 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-11 22:54:38,439 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-11 22:54:38,440 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 306 transitions.
[2024-03-11 22:54:38,440 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6071428571428571
[2024-03-11 22:54:38,440 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 306 transitions.
[2024-03-11 22:54:38,440 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 306 transitions.
[2024-03-11 22:54:38,440 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:54:38,440 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 306 transitions.
[2024-03-11 22:54:38,441 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:38,442 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:38,442 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:38,442 INFO  L175             Difference]: Start difference. First operand has 49 places, 43 transitions, 158 flow. Second operand 3 states and 306 transitions.
[2024-03-11 22:54:38,442 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 67 transitions, 360 flow
[2024-03-11 22:54:38,449 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 67 transitions, 355 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-11 22:54:38,449 INFO  L231             Difference]: Finished difference. Result has 51 places, 50 transitions, 234 flow
[2024-03-11 22:54:38,450 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=234, PETRI_PLACES=51, PETRI_TRANSITIONS=50}
[2024-03-11 22:54:38,450 INFO  L288   CegarLoopForPetriNet]: 42 programPoint places, 9 predicate places.
[2024-03-11 22:54:38,450 INFO  L495      AbstractCegarLoop]: Abstraction has has 51 places, 50 transitions, 234 flow
[2024-03-11 22:54:38,450 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:38,450 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:54:38,451 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:54:38,451 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-03-11 22:54:38,451 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2024-03-11 22:54:38,451 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:54:38,451 INFO  L85        PathProgramCache]: Analyzing trace with hash 758787877, now seen corresponding path program 1 times
[2024-03-11 22:54:38,451 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:54:38,451 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498731811]
[2024-03-11 22:54:38,451 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:54:38,451 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:54:38,461 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:54:38,502 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-11 22:54:38,503 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:54:38,503 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498731811]
[2024-03-11 22:54:38,503 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498731811] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:54:38,503 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:54:38,503 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-03-11 22:54:38,503 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772827308]
[2024-03-11 22:54:38,503 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:54:38,503 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-11 22:54:38,503 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:54:38,504 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-11 22:54:38,504 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-11 22:54:38,518 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 86 out of 168
[2024-03-11 22:54:38,518 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 50 transitions, 234 flow. Second operand  has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:38,518 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:54:38,518 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 168
[2024-03-11 22:54:38,518 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:54:38,654 INFO  L130       PetriNetUnfolder]: 597/1538 cut-off events.
[2024-03-11 22:54:38,654 INFO  L131       PetriNetUnfolder]: For 1066/1084 co-relation queries the response was YES.
[2024-03-11 22:54:38,656 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4020 conditions, 1538 events. 597/1538 cut-off events. For 1066/1084 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 10684 event pairs, 59 based on Foata normal form. 300/1765 useless extension candidates. Maximal degree in co-relation 1509. Up to 905 conditions per place. 
[2024-03-11 22:54:38,660 INFO  L137   encePairwiseOnDemand]: 162/168 looper letters, 36 selfloop transitions, 7 changer transitions 0/56 dead transitions.
[2024-03-11 22:54:38,660 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 56 transitions, 331 flow
[2024-03-11 22:54:38,661 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-11 22:54:38,661 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-11 22:54:38,662 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 297 transitions.
[2024-03-11 22:54:38,662 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5892857142857143
[2024-03-11 22:54:38,662 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 297 transitions.
[2024-03-11 22:54:38,662 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 297 transitions.
[2024-03-11 22:54:38,662 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:54:38,663 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 297 transitions.
[2024-03-11 22:54:38,663 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:38,664 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:38,664 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:38,664 INFO  L175             Difference]: Start difference. First operand has 51 places, 50 transitions, 234 flow. Second operand 3 states and 297 transitions.
[2024-03-11 22:54:38,664 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 56 transitions, 331 flow
[2024-03-11 22:54:38,667 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 56 transitions, 319 flow, removed 2 selfloop flow, removed 2 redundant places.
[2024-03-11 22:54:38,668 INFO  L231             Difference]: Finished difference. Result has 51 places, 44 transitions, 188 flow
[2024-03-11 22:54:38,668 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=188, PETRI_PLACES=51, PETRI_TRANSITIONS=44}
[2024-03-11 22:54:38,669 INFO  L288   CegarLoopForPetriNet]: 42 programPoint places, 9 predicate places.
[2024-03-11 22:54:38,669 INFO  L495      AbstractCegarLoop]: Abstraction has has 51 places, 44 transitions, 188 flow
[2024-03-11 22:54:38,669 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:38,669 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:54:38,669 INFO  L209   CegarLoopForPetriNet]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1]
[2024-03-11 22:54:38,669 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-03-11 22:54:38,670 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2024-03-11 22:54:38,670 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:54:38,670 INFO  L85        PathProgramCache]: Analyzing trace with hash 1193880284, now seen corresponding path program 1 times
[2024-03-11 22:54:38,670 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:54:38,670 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875234226]
[2024-03-11 22:54:38,670 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:54:38,670 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:54:38,680 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-11 22:54:38,680 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-03-11 22:54:38,686 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-11 22:54:38,690 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-03-11 22:54:38,690 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-03-11 22:54:38,690 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining)
[2024-03-11 22:54:38,690 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining)
[2024-03-11 22:54:38,690 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining)
[2024-03-11 22:54:38,690 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining)
[2024-03-11 22:54:38,690 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining)
[2024-03-11 22:54:38,690 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining)
[2024-03-11 22:54:38,690 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining)
[2024-03-11 22:54:38,691 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-03-11 22:54:38,691 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1]
[2024-03-11 22:54:38,691 WARN  L233   ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-03-11 22:54:38,691 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances.
[2024-03-11 22:54:38,705 INFO  L144    ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions.
[2024-03-11 22:54:38,707 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 120 places, 117 transitions, 278 flow
[2024-03-11 22:54:38,765 INFO  L130       PetriNetUnfolder]: 42/501 cut-off events.
[2024-03-11 22:54:38,765 INFO  L131       PetriNetUnfolder]: For 48/48 co-relation queries the response was YES.
[2024-03-11 22:54:38,766 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 556 conditions, 501 events. 42/501 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1935 event pairs, 6 based on Foata normal form. 0/423 useless extension candidates. Maximal degree in co-relation 306. Up to 32 conditions per place. 
[2024-03-11 22:54:38,766 INFO  L82        GeneralOperation]: Start removeDead. Operand has 120 places, 117 transitions, 278 flow
[2024-03-11 22:54:38,767 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 120 places, 117 transitions, 278 flow
[2024-03-11 22:54:38,767 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2024-03-11 22:54:38,767 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 117 transitions, 278 flow
[2024-03-11 22:54:38,768 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 117 transitions, 278 flow
[2024-03-11 22:54:38,768 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 120 places, 117 transitions, 278 flow
[2024-03-11 22:54:38,794 INFO  L130       PetriNetUnfolder]: 42/501 cut-off events.
[2024-03-11 22:54:38,794 INFO  L131       PetriNetUnfolder]: For 48/48 co-relation queries the response was YES.
[2024-03-11 22:54:38,795 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 556 conditions, 501 events. 42/501 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1935 event pairs, 6 based on Foata normal form. 0/423 useless extension candidates. Maximal degree in co-relation 306. Up to 32 conditions per place. 
[2024-03-11 22:54:38,803 INFO  L119        LiptonReduction]: Number of co-enabled transitions 6664
[2024-03-11 22:54:39,953 INFO  L134        LiptonReduction]: Checked pairs total: 16804
[2024-03-11 22:54:39,954 INFO  L136        LiptonReduction]: Total number of compositions: 75
[2024-03-11 22:54:39,955 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-11 22:54:39,955 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;@13cb7aed, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2024-03-11 22:54:39,955 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 8 error locations.
[2024-03-11 22:54:39,956 INFO  L130       PetriNetUnfolder]: 0/5 cut-off events.
[2024-03-11 22:54:39,956 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2024-03-11 22:54:39,956 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:54:39,956 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1]
[2024-03-11 22:54:39,956 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2024-03-11 22:54:39,957 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:54:39,957 INFO  L85        PathProgramCache]: Analyzing trace with hash 800324, now seen corresponding path program 1 times
[2024-03-11 22:54:39,957 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:54:39,957 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042223035]
[2024-03-11 22:54:39,957 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:54:39,957 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:54:39,960 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:54:40,031 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:54:40,031 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:54:40,032 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042223035]
[2024-03-11 22:54:40,032 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042223035] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:54:40,032 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:54:40,032 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-11 22:54:40,032 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281995590]
[2024-03-11 22:54:40,032 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:54:40,032 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-11 22:54:40,032 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:54:40,033 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-11 22:54:40,033 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-11 22:54:40,050 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 104 out of 192
[2024-03-11 22:54:40,051 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 46 transitions, 136 flow. Second operand  has 3 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)
[2024-03-11 22:54:40,051 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:54:40,051 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 192
[2024-03-11 22:54:40,051 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:54:42,051 INFO  L130       PetriNetUnfolder]: 24683/37289 cut-off events.
[2024-03-11 22:54:42,052 INFO  L131       PetriNetUnfolder]: For 3846/3846 co-relation queries the response was YES.
[2024-03-11 22:54:42,090 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 72857 conditions, 37289 events. 24683/37289 cut-off events. For 3846/3846 co-relation queries the response was YES. Maximal size of possible extension queue 1215. Compared 266543 event pairs, 18101 based on Foata normal form. 0/34309 useless extension candidates. Maximal degree in co-relation 10581. Up to 33442 conditions per place. 
[2024-03-11 22:54:42,199 INFO  L137   encePairwiseOnDemand]: 188/192 looper letters, 36 selfloop transitions, 2 changer transitions 0/51 dead transitions.
[2024-03-11 22:54:42,199 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 51 transitions, 222 flow
[2024-03-11 22:54:42,200 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-11 22:54:42,200 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-11 22:54:42,200 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 352 transitions.
[2024-03-11 22:54:42,200 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6111111111111112
[2024-03-11 22:54:42,200 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 352 transitions.
[2024-03-11 22:54:42,200 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 352 transitions.
[2024-03-11 22:54:42,201 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:54:42,201 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 352 transitions.
[2024-03-11 22:54:42,201 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:42,202 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:42,202 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:42,202 INFO  L175             Difference]: Start difference. First operand has 51 places, 46 transitions, 136 flow. Second operand 3 states and 352 transitions.
[2024-03-11 22:54:42,202 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 51 transitions, 222 flow
[2024-03-11 22:54:42,203 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 51 transitions, 222 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-11 22:54:42,204 INFO  L231             Difference]: Finished difference. Result has 53 places, 46 transitions, 146 flow
[2024-03-11 22:54:42,204 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=146, PETRI_PLACES=53, PETRI_TRANSITIONS=46}
[2024-03-11 22:54:42,205 INFO  L288   CegarLoopForPetriNet]: 51 programPoint places, 2 predicate places.
[2024-03-11 22:54:42,205 INFO  L495      AbstractCegarLoop]: Abstraction has has 53 places, 46 transitions, 146 flow
[2024-03-11 22:54:42,205 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 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)
[2024-03-11 22:54:42,205 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:54:42,205 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:54:42,205 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-03-11 22:54:42,205 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2024-03-11 22:54:42,205 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:54:42,206 INFO  L85        PathProgramCache]: Analyzing trace with hash 1106516575, now seen corresponding path program 1 times
[2024-03-11 22:54:42,206 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:54:42,206 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225178491]
[2024-03-11 22:54:42,206 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:54:42,206 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:54:42,211 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:54:42,219 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:54:42,220 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:54:42,220 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225178491]
[2024-03-11 22:54:42,220 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225178491] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:54:42,220 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:54:42,220 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-11 22:54:42,220 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923857212]
[2024-03-11 22:54:42,220 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:54:42,220 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-11 22:54:42,220 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:54:42,221 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-11 22:54:42,221 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-11 22:54:42,236 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 98 out of 192
[2024-03-11 22:54:42,237 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 146 flow. Second operand  has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:42,237 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:54:42,237 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 192
[2024-03-11 22:54:42,237 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:54:46,603 INFO  L130       PetriNetUnfolder]: 60474/86524 cut-off events.
[2024-03-11 22:54:46,604 INFO  L131       PetriNetUnfolder]: For 12171/12171 co-relation queries the response was YES.
[2024-03-11 22:54:46,719 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 175776 conditions, 86524 events. 60474/86524 cut-off events. For 12171/12171 co-relation queries the response was YES. Maximal size of possible extension queue 2442. Compared 607233 event pairs, 42366 based on Foata normal form. 0/80211 useless extension candidates. Maximal degree in co-relation 175724. Up to 63347 conditions per place. 
[2024-03-11 22:54:46,962 INFO  L137   encePairwiseOnDemand]: 184/192 looper letters, 60 selfloop transitions, 7 changer transitions 0/76 dead transitions.
[2024-03-11 22:54:46,963 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 76 transitions, 377 flow
[2024-03-11 22:54:46,963 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-11 22:54:46,963 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-11 22:54:46,964 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 360 transitions.
[2024-03-11 22:54:46,964 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.625
[2024-03-11 22:54:46,964 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 360 transitions.
[2024-03-11 22:54:46,964 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 360 transitions.
[2024-03-11 22:54:46,964 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:54:46,964 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 360 transitions.
[2024-03-11 22:54:46,965 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:46,966 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:46,966 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:46,966 INFO  L175             Difference]: Start difference. First operand has 53 places, 46 transitions, 146 flow. Second operand 3 states and 360 transitions.
[2024-03-11 22:54:46,966 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 76 transitions, 377 flow
[2024-03-11 22:54:46,968 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 76 transitions, 374 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-11 22:54:46,969 INFO  L231             Difference]: Finished difference. Result has 56 places, 52 transitions, 198 flow
[2024-03-11 22:54:46,969 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=198, PETRI_PLACES=56, PETRI_TRANSITIONS=52}
[2024-03-11 22:54:46,970 INFO  L288   CegarLoopForPetriNet]: 51 programPoint places, 5 predicate places.
[2024-03-11 22:54:46,970 INFO  L495      AbstractCegarLoop]: Abstraction has has 56 places, 52 transitions, 198 flow
[2024-03-11 22:54:46,970 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:46,970 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:54:46,970 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:54:46,970 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-03-11 22:54:46,970 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2024-03-11 22:54:46,970 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:54:46,970 INFO  L85        PathProgramCache]: Analyzing trace with hash -212253915, now seen corresponding path program 1 times
[2024-03-11 22:54:46,970 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:54:46,971 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424717762]
[2024-03-11 22:54:46,971 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:54:46,971 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:54:46,975 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:54:46,997 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-11 22:54:46,997 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:54:46,997 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424717762]
[2024-03-11 22:54:46,997 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424717762] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:54:46,997 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:54:46,997 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-03-11 22:54:46,997 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947363224]
[2024-03-11 22:54:46,997 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:54:46,997 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-03-11 22:54:46,997 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:54:46,998 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-03-11 22:54:46,998 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-03-11 22:54:47,026 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 102 out of 192
[2024-03-11 22:54:47,027 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 52 transitions, 198 flow. Second operand  has 4 states, 4 states have (on average 103.5) internal successors, (414), 4 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)
[2024-03-11 22:54:47,027 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:54:47,027 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 192
[2024-03-11 22:54:47,027 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:54:50,083 INFO  L130       PetriNetUnfolder]: 38334/57310 cut-off events.
[2024-03-11 22:54:50,083 INFO  L131       PetriNetUnfolder]: For 26058/31476 co-relation queries the response was YES.
[2024-03-11 22:54:50,195 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 133333 conditions, 57310 events. 38334/57310 cut-off events. For 26058/31476 co-relation queries the response was YES. Maximal size of possible extension queue 1672. Compared 426369 event pairs, 21787 based on Foata normal form. 3440/57900 useless extension candidates. Maximal degree in co-relation 40685. Up to 34292 conditions per place. 
[2024-03-11 22:54:50,380 INFO  L137   encePairwiseOnDemand]: 188/192 looper letters, 61 selfloop transitions, 3 changer transitions 0/78 dead transitions.
[2024-03-11 22:54:50,381 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 78 transitions, 408 flow
[2024-03-11 22:54:50,381 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-03-11 22:54:50,381 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-03-11 22:54:50,382 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 465 transitions.
[2024-03-11 22:54:50,382 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.60546875
[2024-03-11 22:54:50,382 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 465 transitions.
[2024-03-11 22:54:50,382 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 465 transitions.
[2024-03-11 22:54:50,383 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:54:50,383 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 465 transitions.
[2024-03-11 22:54:50,384 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 116.25) internal successors, (465), 4 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:50,384 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 192.0) internal successors, (960), 5 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:50,385 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 192.0) internal successors, (960), 5 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:50,385 INFO  L175             Difference]: Start difference. First operand has 56 places, 52 transitions, 198 flow. Second operand 4 states and 465 transitions.
[2024-03-11 22:54:50,385 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 78 transitions, 408 flow
[2024-03-11 22:54:50,442 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 78 transitions, 388 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-11 22:54:50,443 INFO  L231             Difference]: Finished difference. Result has 58 places, 53 transitions, 200 flow
[2024-03-11 22:54:50,443 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=200, PETRI_PLACES=58, PETRI_TRANSITIONS=53}
[2024-03-11 22:54:50,444 INFO  L288   CegarLoopForPetriNet]: 51 programPoint places, 7 predicate places.
[2024-03-11 22:54:50,444 INFO  L495      AbstractCegarLoop]: Abstraction has has 58 places, 53 transitions, 200 flow
[2024-03-11 22:54:50,444 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 103.5) internal successors, (414), 4 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)
[2024-03-11 22:54:50,444 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:54:50,444 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:54:50,444 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-03-11 22:54:50,444 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2024-03-11 22:54:50,445 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:54:50,445 INFO  L85        PathProgramCache]: Analyzing trace with hash -331384400, now seen corresponding path program 1 times
[2024-03-11 22:54:50,445 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:54:50,445 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873255618]
[2024-03-11 22:54:50,445 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:54:50,445 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:54:50,452 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:54:50,464 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2024-03-11 22:54:50,464 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:54:50,464 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873255618]
[2024-03-11 22:54:50,464 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873255618] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:54:50,464 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:54:50,464 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-11 22:54:50,464 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487486890]
[2024-03-11 22:54:50,465 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:54:50,465 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-11 22:54:50,465 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:54:50,465 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-11 22:54:50,465 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-11 22:54:50,498 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 98 out of 192
[2024-03-11 22:54:50,499 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 53 transitions, 200 flow. Second operand  has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:50,499 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:54:50,499 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 192
[2024-03-11 22:54:50,499 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:54:55,483 INFO  L130       PetriNetUnfolder]: 57579/84704 cut-off events.
[2024-03-11 22:54:55,483 INFO  L131       PetriNetUnfolder]: For 41510/43076 co-relation queries the response was YES.
[2024-03-11 22:54:55,620 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 200941 conditions, 84704 events. 57579/84704 cut-off events. For 41510/43076 co-relation queries the response was YES. Maximal size of possible extension queue 2210. Compared 616654 event pairs, 43300 based on Foata normal form. 13/80715 useless extension candidates. Maximal degree in co-relation 77115. Up to 69982 conditions per place. 
[2024-03-11 22:54:55,883 INFO  L137   encePairwiseOnDemand]: 185/192 looper letters, 64 selfloop transitions, 10 changer transitions 0/84 dead transitions.
[2024-03-11 22:54:55,883 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 84 transitions, 466 flow
[2024-03-11 22:54:55,884 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-11 22:54:55,884 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-11 22:54:55,884 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 358 transitions.
[2024-03-11 22:54:55,885 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6215277777777778
[2024-03-11 22:54:55,885 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 358 transitions.
[2024-03-11 22:54:55,885 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 358 transitions.
[2024-03-11 22:54:55,885 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:54:55,885 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 358 transitions.
[2024-03-11 22:54:55,886 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:55,886 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:55,886 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:55,887 INFO  L175             Difference]: Start difference. First operand has 58 places, 53 transitions, 200 flow. Second operand 3 states and 358 transitions.
[2024-03-11 22:54:55,887 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 84 transitions, 466 flow
[2024-03-11 22:54:56,086 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 84 transitions, 461 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-11 22:54:56,087 INFO  L231             Difference]: Finished difference. Result has 59 places, 61 transitions, 278 flow
[2024-03-11 22:54:56,087 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=278, PETRI_PLACES=59, PETRI_TRANSITIONS=61}
[2024-03-11 22:54:56,088 INFO  L288   CegarLoopForPetriNet]: 51 programPoint places, 8 predicate places.
[2024-03-11 22:54:56,088 INFO  L495      AbstractCegarLoop]: Abstraction has has 59 places, 61 transitions, 278 flow
[2024-03-11 22:54:56,088 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:56,088 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:54:56,088 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:54:56,088 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-03-11 22:54:56,088 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2024-03-11 22:54:56,089 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:54:56,089 INFO  L85        PathProgramCache]: Analyzing trace with hash -1115597400, now seen corresponding path program 1 times
[2024-03-11 22:54:56,089 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:54:56,089 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987342639]
[2024-03-11 22:54:56,089 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:54:56,089 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:54:56,101 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:54:56,127 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-11 22:54:56,127 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:54:56,127 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987342639]
[2024-03-11 22:54:56,127 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987342639] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:54:56,128 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:54:56,128 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-03-11 22:54:56,128 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638667454]
[2024-03-11 22:54:56,128 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:54:56,128 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-11 22:54:56,128 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:54:56,128 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-11 22:54:56,128 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-11 22:54:56,143 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 98 out of 192
[2024-03-11 22:54:56,143 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 61 transitions, 278 flow. Second operand  has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:56,143 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:54:56,143 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 192
[2024-03-11 22:54:56,144 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:54:56,670 INFO  L130       PetriNetUnfolder]: 2527/6028 cut-off events.
[2024-03-11 22:54:56,670 INFO  L131       PetriNetUnfolder]: For 4664/4747 co-relation queries the response was YES.
[2024-03-11 22:54:56,679 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15416 conditions, 6028 events. 2527/6028 cut-off events. For 4664/4747 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 53051 event pairs, 222 based on Foata normal form. 1888/7602 useless extension candidates. Maximal degree in co-relation 5671. Up to 3800 conditions per place. 
[2024-03-11 22:54:56,690 INFO  L137   encePairwiseOnDemand]: 184/192 looper letters, 43 selfloop transitions, 9 changer transitions 0/66 dead transitions.
[2024-03-11 22:54:56,691 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 66 transitions, 394 flow
[2024-03-11 22:54:56,691 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-11 22:54:56,691 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-11 22:54:56,692 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 343 transitions.
[2024-03-11 22:54:56,692 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5954861111111112
[2024-03-11 22:54:56,692 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 343 transitions.
[2024-03-11 22:54:56,692 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 343 transitions.
[2024-03-11 22:54:56,692 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:54:56,692 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 343 transitions.
[2024-03-11 22:54:56,693 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:56,694 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:56,694 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:56,694 INFO  L175             Difference]: Start difference. First operand has 59 places, 61 transitions, 278 flow. Second operand 3 states and 343 transitions.
[2024-03-11 22:54:56,694 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 66 transitions, 394 flow
[2024-03-11 22:54:56,703 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 66 transitions, 387 flow, removed 2 selfloop flow, removed 1 redundant places.
[2024-03-11 22:54:56,704 INFO  L231             Difference]: Finished difference. Result has 60 places, 52 transitions, 226 flow
[2024-03-11 22:54:56,704 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=226, PETRI_PLACES=60, PETRI_TRANSITIONS=52}
[2024-03-11 22:54:56,705 INFO  L288   CegarLoopForPetriNet]: 51 programPoint places, 9 predicate places.
[2024-03-11 22:54:56,705 INFO  L495      AbstractCegarLoop]: Abstraction has has 60 places, 52 transitions, 226 flow
[2024-03-11 22:54:56,705 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:56,705 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:54:56,705 INFO  L209   CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:54:56,705 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-03-11 22:54:56,705 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2024-03-11 22:54:56,706 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:54:56,706 INFO  L85        PathProgramCache]: Analyzing trace with hash 1876298133, now seen corresponding path program 1 times
[2024-03-11 22:54:56,706 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:54:56,706 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445618329]
[2024-03-11 22:54:56,706 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:54:56,706 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:54:56,712 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:54:56,722 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2024-03-11 22:54:56,722 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:54:56,722 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445618329]
[2024-03-11 22:54:56,722 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445618329] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:54:56,722 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:54:56,723 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-11 22:54:56,723 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062258454]
[2024-03-11 22:54:56,723 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:54:56,723 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-11 22:54:56,723 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:54:56,723 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-11 22:54:56,723 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-11 22:54:56,744 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 98 out of 192
[2024-03-11 22:54:56,744 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 52 transitions, 226 flow. Second operand  has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:56,744 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:54:56,744 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 192
[2024-03-11 22:54:56,744 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:54:57,160 INFO  L130       PetriNetUnfolder]: 3015/7284 cut-off events.
[2024-03-11 22:54:57,160 INFO  L131       PetriNetUnfolder]: For 6022/6152 co-relation queries the response was YES.
[2024-03-11 22:54:57,170 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19234 conditions, 7284 events. 3015/7284 cut-off events. For 6022/6152 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 63661 event pairs, 2646 based on Foata normal form. 0/6889 useless extension candidates. Maximal degree in co-relation 4922. Up to 5565 conditions per place. 
[2024-03-11 22:54:57,184 INFO  L137   encePairwiseOnDemand]: 188/192 looper letters, 50 selfloop transitions, 3 changer transitions 0/63 dead transitions.
[2024-03-11 22:54:57,184 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 63 transitions, 384 flow
[2024-03-11 22:54:57,185 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-11 22:54:57,185 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-11 22:54:57,185 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 342 transitions.
[2024-03-11 22:54:57,185 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.59375
[2024-03-11 22:54:57,185 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 342 transitions.
[2024-03-11 22:54:57,186 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 342 transitions.
[2024-03-11 22:54:57,186 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:54:57,186 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 342 transitions.
[2024-03-11 22:54:57,186 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:57,187 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:57,187 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:57,187 INFO  L175             Difference]: Start difference. First operand has 60 places, 52 transitions, 226 flow. Second operand 3 states and 342 transitions.
[2024-03-11 22:54:57,187 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 63 transitions, 384 flow
[2024-03-11 22:54:57,193 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 63 transitions, 375 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-11 22:54:57,194 INFO  L231             Difference]: Finished difference. Result has 62 places, 54 transitions, 242 flow
[2024-03-11 22:54:57,194 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=242, PETRI_PLACES=62, PETRI_TRANSITIONS=54}
[2024-03-11 22:54:57,195 INFO  L288   CegarLoopForPetriNet]: 51 programPoint places, 11 predicate places.
[2024-03-11 22:54:57,195 INFO  L495      AbstractCegarLoop]: Abstraction has has 62 places, 54 transitions, 242 flow
[2024-03-11 22:54:57,195 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:57,195 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:54:57,195 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:54:57,195 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-03-11 22:54:57,195 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2024-03-11 22:54:57,195 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:54:57,196 INFO  L85        PathProgramCache]: Analyzing trace with hash -80043298, now seen corresponding path program 1 times
[2024-03-11 22:54:57,196 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:54:57,196 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059335858]
[2024-03-11 22:54:57,196 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:54:57,196 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:54:57,205 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:54:57,220 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2024-03-11 22:54:57,220 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:54:57,220 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059335858]
[2024-03-11 22:54:57,220 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059335858] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:54:57,220 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:54:57,220 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-11 22:54:57,220 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128910492]
[2024-03-11 22:54:57,221 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:54:57,221 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-11 22:54:57,221 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:54:57,221 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-11 22:54:57,221 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-11 22:54:57,239 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 100 out of 192
[2024-03-11 22:54:57,240 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 54 transitions, 242 flow. Second operand  has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:57,240 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:54:57,240 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 192
[2024-03-11 22:54:57,240 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:54:57,862 INFO  L130       PetriNetUnfolder]: 4287/9592 cut-off events.
[2024-03-11 22:54:57,862 INFO  L131       PetriNetUnfolder]: For 8855/8972 co-relation queries the response was YES.
[2024-03-11 22:54:57,877 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26109 conditions, 9592 events. 4287/9592 cut-off events. For 8855/8972 co-relation queries the response was YES. Maximal size of possible extension queue 379. Compared 82167 event pairs, 2429 based on Foata normal form. 0/9269 useless extension candidates. Maximal degree in co-relation 9272. Up to 6045 conditions per place. 
[2024-03-11 22:54:57,895 INFO  L137   encePairwiseOnDemand]: 185/192 looper letters, 58 selfloop transitions, 9 changer transitions 0/76 dead transitions.
[2024-03-11 22:54:57,895 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 76 transitions, 456 flow
[2024-03-11 22:54:57,896 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-11 22:54:57,896 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-11 22:54:57,897 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 360 transitions.
[2024-03-11 22:54:57,897 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.625
[2024-03-11 22:54:57,897 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 360 transitions.
[2024-03-11 22:54:57,897 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 360 transitions.
[2024-03-11 22:54:57,898 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:54:57,898 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 360 transitions.
[2024-03-11 22:54:57,898 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:57,899 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:57,899 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:57,900 INFO  L175             Difference]: Start difference. First operand has 62 places, 54 transitions, 242 flow. Second operand 3 states and 360 transitions.
[2024-03-11 22:54:57,900 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 76 transitions, 456 flow
[2024-03-11 22:54:57,908 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 76 transitions, 447 flow, removed 2 selfloop flow, removed 1 redundant places.
[2024-03-11 22:54:57,910 INFO  L231             Difference]: Finished difference. Result has 65 places, 59 transitions, 311 flow
[2024-03-11 22:54:57,910 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=311, PETRI_PLACES=65, PETRI_TRANSITIONS=59}
[2024-03-11 22:54:57,911 INFO  L288   CegarLoopForPetriNet]: 51 programPoint places, 14 predicate places.
[2024-03-11 22:54:57,911 INFO  L495      AbstractCegarLoop]: Abstraction has has 65 places, 59 transitions, 311 flow
[2024-03-11 22:54:57,911 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:57,911 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:54:57,911 INFO  L209   CegarLoopForPetriNet]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:54:57,911 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2024-03-11 22:54:57,912 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2024-03-11 22:54:57,912 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:54:57,912 INFO  L85        PathProgramCache]: Analyzing trace with hash -578804479, now seen corresponding path program 1 times
[2024-03-11 22:54:57,912 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:54:57,913 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430597362]
[2024-03-11 22:54:57,913 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:54:57,913 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:54:57,927 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:54:58,000 INFO  L134       CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:54:58,000 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:54:58,000 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430597362]
[2024-03-11 22:54:58,000 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430597362] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 22:54:58,000 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [920447871]
[2024-03-11 22:54:58,000 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:54:58,001 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:54:58,001 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:54:58,005 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-11 22:54:58,013 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-03-11 22:54:58,152 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:54:58,154 INFO  L263         TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 7 conjunts are in the unsatisfiable core
[2024-03-11 22:54:58,156 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 22:54:58,297 INFO  L134       CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:54:58,298 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-03-11 22:54:58,298 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [920447871] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:54:58,298 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-03-11 22:54:58,298 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11
[2024-03-11 22:54:58,298 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412888740]
[2024-03-11 22:54:58,298 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:54:58,298 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-03-11 22:54:58,299 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:54:58,299 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-03-11 22:54:58,299 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132
[2024-03-11 22:54:58,338 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 103 out of 192
[2024-03-11 22:54:58,338 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 59 transitions, 311 flow. Second operand  has 7 states, 7 states have (on average 105.0) internal successors, (735), 7 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:58,339 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:54:58,339 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 192
[2024-03-11 22:54:58,339 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:54:59,082 INFO  L130       PetriNetUnfolder]: 3360/8640 cut-off events.
[2024-03-11 22:54:59,082 INFO  L131       PetriNetUnfolder]: For 11492/12199 co-relation queries the response was YES.
[2024-03-11 22:54:59,098 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 24433 conditions, 8640 events. 3360/8640 cut-off events. For 11492/12199 co-relation queries the response was YES. Maximal size of possible extension queue 373. Compared 79798 event pairs, 496 based on Foata normal form. 482/8986 useless extension candidates. Maximal degree in co-relation 10397. Up to 4963 conditions per place. 
[2024-03-11 22:54:59,112 INFO  L137   encePairwiseOnDemand]: 189/192 looper letters, 104 selfloop transitions, 5 changer transitions 8/134 dead transitions.
[2024-03-11 22:54:59,113 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 134 transitions, 865 flow
[2024-03-11 22:54:59,113 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-03-11 22:54:59,113 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-03-11 22:54:59,114 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 819 transitions.
[2024-03-11 22:54:59,115 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.609375
[2024-03-11 22:54:59,115 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 819 transitions.
[2024-03-11 22:54:59,115 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 819 transitions.
[2024-03-11 22:54:59,115 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:54:59,115 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 819 transitions.
[2024-03-11 22:54:59,117 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 117.0) internal successors, (819), 7 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:59,118 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 192.0) internal successors, (1536), 8 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:59,118 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 192.0) internal successors, (1536), 8 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:59,119 INFO  L175             Difference]: Start difference. First operand has 65 places, 59 transitions, 311 flow. Second operand 7 states and 819 transitions.
[2024-03-11 22:54:59,119 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 134 transitions, 865 flow
[2024-03-11 22:54:59,192 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 134 transitions, 827 flow, removed 0 selfloop flow, removed 4 redundant places.
[2024-03-11 22:54:59,193 INFO  L231             Difference]: Finished difference. Result has 67 places, 60 transitions, 300 flow
[2024-03-11 22:54:59,193 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=300, PETRI_PLACES=67, PETRI_TRANSITIONS=60}
[2024-03-11 22:54:59,193 INFO  L288   CegarLoopForPetriNet]: 51 programPoint places, 16 predicate places.
[2024-03-11 22:54:59,193 INFO  L495      AbstractCegarLoop]: Abstraction has has 67 places, 60 transitions, 300 flow
[2024-03-11 22:54:59,194 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 105.0) internal successors, (735), 7 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:59,194 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:54:59,194 INFO  L209   CegarLoopForPetriNet]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:54:59,204 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2024-03-11 22:54:59,396 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20
[2024-03-11 22:54:59,396 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2024-03-11 22:54:59,397 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:54:59,397 INFO  L85        PathProgramCache]: Analyzing trace with hash -573613133, now seen corresponding path program 1 times
[2024-03-11 22:54:59,397 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:54:59,397 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999472704]
[2024-03-11 22:54:59,398 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:54:59,398 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:54:59,409 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:54:59,422 INFO  L134       CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked.
[2024-03-11 22:54:59,423 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:54:59,423 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999472704]
[2024-03-11 22:54:59,423 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999472704] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:54:59,423 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:54:59,423 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-11 22:54:59,423 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724554331]
[2024-03-11 22:54:59,423 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:54:59,423 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-11 22:54:59,424 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:54:59,424 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-11 22:54:59,424 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-11 22:54:59,443 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 98 out of 192
[2024-03-11 22:54:59,443 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 60 transitions, 300 flow. Second operand  has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:59,443 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:54:59,443 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 192
[2024-03-11 22:54:59,443 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:55:00,187 INFO  L130       PetriNetUnfolder]: 3905/9449 cut-off events.
[2024-03-11 22:55:00,187 INFO  L131       PetriNetUnfolder]: For 12716/12924 co-relation queries the response was YES.
[2024-03-11 22:55:00,203 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27511 conditions, 9449 events. 3905/9449 cut-off events. For 12716/12924 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 86695 event pairs, 2981 based on Foata normal form. 0/9159 useless extension candidates. Maximal degree in co-relation 5967. Up to 7702 conditions per place. 
[2024-03-11 22:55:00,218 INFO  L137   encePairwiseOnDemand]: 188/192 looper letters, 54 selfloop transitions, 4 changer transitions 1/69 dead transitions.
[2024-03-11 22:55:00,218 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 69 transitions, 464 flow
[2024-03-11 22:55:00,219 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-11 22:55:00,219 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-11 22:55:00,219 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 340 transitions.
[2024-03-11 22:55:00,220 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5902777777777778
[2024-03-11 22:55:00,220 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 340 transitions.
[2024-03-11 22:55:00,220 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 340 transitions.
[2024-03-11 22:55:00,220 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:55:00,220 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 340 transitions.
[2024-03-11 22:55:00,221 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:55:00,221 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:55:00,222 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:55:00,222 INFO  L175             Difference]: Start difference. First operand has 67 places, 60 transitions, 300 flow. Second operand 3 states and 340 transitions.
[2024-03-11 22:55:00,222 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 69 transitions, 464 flow
[2024-03-11 22:55:00,228 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 69 transitions, 461 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-11 22:55:00,229 INFO  L231             Difference]: Finished difference. Result has 68 places, 62 transitions, 329 flow
[2024-03-11 22:55:00,229 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=329, PETRI_PLACES=68, PETRI_TRANSITIONS=62}
[2024-03-11 22:55:00,230 INFO  L288   CegarLoopForPetriNet]: 51 programPoint places, 17 predicate places.
[2024-03-11 22:55:00,230 INFO  L495      AbstractCegarLoop]: Abstraction has has 68 places, 62 transitions, 329 flow
[2024-03-11 22:55:00,230 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:55:00,230 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:55:00,230 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:55:00,231 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2024-03-11 22:55:00,231 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2024-03-11 22:55:00,231 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:55:00,231 INFO  L85        PathProgramCache]: Analyzing trace with hash -1073911570, now seen corresponding path program 1 times
[2024-03-11 22:55:00,232 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:55:00,232 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16323660]
[2024-03-11 22:55:00,232 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:55:00,232 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:55:00,246 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:55:00,301 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2024-03-11 22:55:00,301 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:55:00,302 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16323660]
[2024-03-11 22:55:00,302 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16323660] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 22:55:00,302 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1002214118]
[2024-03-11 22:55:00,302 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:55:00,302 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:55:00,302 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:55:00,303 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)
[2024-03-11 22:55:00,310 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
[2024-03-11 22:55:00,401 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:55:00,402 INFO  L263         TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 5 conjunts are in the unsatisfiable core
[2024-03-11 22:55:00,403 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 22:55:00,466 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-11 22:55:00,467 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 22:55:00,506 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-11 22:55:00,506 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1002214118] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 22:55:00,506 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 22:55:00,506 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10
[2024-03-11 22:55:00,506 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790202274]
[2024-03-11 22:55:00,506 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 22:55:00,507 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-03-11 22:55:00,507 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:55:00,507 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-03-11 22:55:00,507 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110
[2024-03-11 22:55:00,587 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 98 out of 192
[2024-03-11 22:55:00,588 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 62 transitions, 329 flow. Second operand  has 11 states, 11 states have (on average 102.0) internal successors, (1122), 11 states have internal predecessors, (1122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:55:00,589 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:55:00,589 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 192
[2024-03-11 22:55:00,589 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:55:01,200 INFO  L130       PetriNetUnfolder]: 2229/5093 cut-off events.
[2024-03-11 22:55:01,201 INFO  L131       PetriNetUnfolder]: For 7932/8466 co-relation queries the response was YES.
[2024-03-11 22:55:01,209 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14371 conditions, 5093 events. 2229/5093 cut-off events. For 7932/8466 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 38021 event pairs, 94 based on Foata normal form. 586/5594 useless extension candidates. Maximal degree in co-relation 5145. Up to 1849 conditions per place. 
[2024-03-11 22:55:01,217 INFO  L137   encePairwiseOnDemand]: 187/192 looper letters, 128 selfloop transitions, 8 changer transitions 0/151 dead transitions.
[2024-03-11 22:55:01,218 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 151 transitions, 921 flow
[2024-03-11 22:55:01,218 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-03-11 22:55:01,218 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-03-11 22:55:01,220 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1012 transitions.
[2024-03-11 22:55:01,220 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5856481481481481
[2024-03-11 22:55:01,220 INFO  L72            ComplementDD]: Start complementDD. Operand 9 states and 1012 transitions.
[2024-03-11 22:55:01,220 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 9 states and 1012 transitions.
[2024-03-11 22:55:01,221 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:55:01,221 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1012 transitions.
[2024-03-11 22:55:01,223 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 10 states, 9 states have (on average 112.44444444444444) internal successors, (1012), 9 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)
[2024-03-11 22:55:01,224 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 10 states, 10 states have (on average 192.0) internal successors, (1920), 10 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:55:01,225 INFO  L81            ComplementDD]: Finished complementDD. Result  has 10 states, 10 states have (on average 192.0) internal successors, (1920), 10 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:55:01,225 INFO  L175             Difference]: Start difference. First operand has 68 places, 62 transitions, 329 flow. Second operand 9 states and 1012 transitions.
[2024-03-11 22:55:01,225 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 151 transitions, 921 flow
[2024-03-11 22:55:01,233 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 151 transitions, 899 flow, removed 6 selfloop flow, removed 1 redundant places.
[2024-03-11 22:55:01,234 INFO  L231             Difference]: Finished difference. Result has 76 places, 63 transitions, 347 flow
[2024-03-11 22:55:01,234 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=347, PETRI_PLACES=76, PETRI_TRANSITIONS=63}
[2024-03-11 22:55:01,235 INFO  L288   CegarLoopForPetriNet]: 51 programPoint places, 25 predicate places.
[2024-03-11 22:55:01,235 INFO  L495      AbstractCegarLoop]: Abstraction has has 76 places, 63 transitions, 347 flow
[2024-03-11 22:55:01,235 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 102.0) internal successors, (1122), 11 states have internal predecessors, (1122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:55:01,236 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:55:01,236 INFO  L209   CegarLoopForPetriNet]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:55:01,251 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2024-03-11 22:55:01,436 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,3 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:55:01,437 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2024-03-11 22:55:01,437 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:55:01,437 INFO  L85        PathProgramCache]: Analyzing trace with hash 331255352, now seen corresponding path program 1 times
[2024-03-11 22:55:01,438 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:55:01,438 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694204833]
[2024-03-11 22:55:01,438 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:55:01,438 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:55:01,472 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:55:02,248 INFO  L134       CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:55:02,249 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:55:02,249 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694204833]
[2024-03-11 22:55:02,249 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694204833] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 22:55:02,249 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326627521]
[2024-03-11 22:55:02,249 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:55:02,249 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:55:02,249 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:55:02,250 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)
[2024-03-11 22:55:02,252 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
[2024-03-11 22:55:02,375 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:55:02,377 INFO  L263         TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 31 conjunts are in the unsatisfiable core
[2024-03-11 22:55:02,379 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 22:55:02,581 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13
[2024-03-11 22:55:02,706 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:55:02,706 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 37
[2024-03-11 22:55:02,816 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14
[2024-03-11 22:55:02,852 INFO  L134       CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:55:02,852 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 22:55:03,724 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 93
[2024-03-11 22:55:03,730 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 389 treesize of output 357
[2024-03-11 22:55:03,859 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 93
[2024-03-11 22:55:03,875 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 164
[2024-03-11 22:55:05,012 INFO  L134       CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:55:05,013 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1326627521] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 22:55:05,013 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 22:55:05,013 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 31
[2024-03-11 22:55:05,013 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076477358]
[2024-03-11 22:55:05,013 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 22:55:05,013 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2024-03-11 22:55:05,013 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:55:05,014 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2024-03-11 22:55:05,014 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=879, Unknown=0, NotChecked=0, Total=992
[2024-03-11 22:55:08,717 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 93 out of 192
[2024-03-11 22:55:08,720 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 63 transitions, 347 flow. Second operand  has 32 states, 32 states have (on average 95.96875) internal successors, (3071), 32 states have internal predecessors, (3071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:55:08,720 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:55:08,720 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 192
[2024-03-11 22:55:08,721 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:55:11,138 INFO  L130       PetriNetUnfolder]: 2703/5719 cut-off events.
[2024-03-11 22:55:11,138 INFO  L131       PetriNetUnfolder]: For 6879/7328 co-relation queries the response was YES.
[2024-03-11 22:55:11,148 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16959 conditions, 5719 events. 2703/5719 cut-off events. For 6879/7328 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 40755 event pairs, 454 based on Foata normal form. 407/6058 useless extension candidates. Maximal degree in co-relation 7406. Up to 1935 conditions per place. 
[2024-03-11 22:55:11,159 INFO  L137   encePairwiseOnDemand]: 181/192 looper letters, 152 selfloop transitions, 14 changer transitions 23/202 dead transitions.
[2024-03-11 22:55:11,159 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 202 transitions, 1211 flow
[2024-03-11 22:55:11,162 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2024-03-11 22:55:11,163 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 13 states.
[2024-03-11 22:55:11,167 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1383 transitions.
[2024-03-11 22:55:11,168 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5540865384615384
[2024-03-11 22:55:11,168 INFO  L72            ComplementDD]: Start complementDD. Operand 13 states and 1383 transitions.
[2024-03-11 22:55:11,168 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 13 states and 1383 transitions.
[2024-03-11 22:55:11,169 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:55:11,170 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1383 transitions.
[2024-03-11 22:55:11,173 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 14 states, 13 states have (on average 106.38461538461539) internal successors, (1383), 13 states have internal predecessors, (1383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:55:11,177 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 14 states, 14 states have (on average 192.0) internal successors, (2688), 14 states have internal predecessors, (2688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:55:11,177 INFO  L81            ComplementDD]: Finished complementDD. Result  has 14 states, 14 states have (on average 192.0) internal successors, (2688), 14 states have internal predecessors, (2688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:55:11,178 INFO  L175             Difference]: Start difference. First operand has 76 places, 63 transitions, 347 flow. Second operand 13 states and 1383 transitions.
[2024-03-11 22:55:11,178 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 202 transitions, 1211 flow
[2024-03-11 22:55:11,190 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 202 transitions, 1194 flow, removed 2 selfloop flow, removed 7 redundant places.
[2024-03-11 22:55:11,191 INFO  L231             Difference]: Finished difference. Result has 86 places, 68 transitions, 396 flow
[2024-03-11 22:55:11,192 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=396, PETRI_PLACES=86, PETRI_TRANSITIONS=68}
[2024-03-11 22:55:11,192 INFO  L288   CegarLoopForPetriNet]: 51 programPoint places, 35 predicate places.
[2024-03-11 22:55:11,192 INFO  L495      AbstractCegarLoop]: Abstraction has has 86 places, 68 transitions, 396 flow
[2024-03-11 22:55:11,193 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 32 states, 32 states have (on average 95.96875) internal successors, (3071), 32 states have internal predecessors, (3071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:55:11,193 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:55:11,193 INFO  L209   CegarLoopForPetriNet]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:55:11,197 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
[2024-03-11 22:55:11,397 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23
[2024-03-11 22:55:11,398 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2024-03-11 22:55:11,398 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:55:11,399 INFO  L85        PathProgramCache]: Analyzing trace with hash 1880617726, now seen corresponding path program 2 times
[2024-03-11 22:55:11,399 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:55:11,399 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63949293]
[2024-03-11 22:55:11,399 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:55:11,400 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:55:11,425 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:55:12,107 INFO  L134       CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:55:12,107 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:55:12,107 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63949293]
[2024-03-11 22:55:12,108 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63949293] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 22:55:12,108 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1841076251]
[2024-03-11 22:55:12,108 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-03-11 22:55:12,108 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:55:12,108 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:55:12,109 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-11 22:55:12,110 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2024-03-11 22:55:12,234 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-03-11 22:55:12,234 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-11 22:55:12,235 INFO  L263         TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 35 conjunts are in the unsatisfiable core
[2024-03-11 22:55:12,239 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 22:55:12,480 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13
[2024-03-11 22:55:12,611 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:55:12,612 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 37
[2024-03-11 22:55:12,728 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14
[2024-03-11 22:55:12,762 INFO  L134       CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:55:12,763 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 22:55:13,602 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 93
[2024-03-11 22:55:13,607 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 164
[2024-03-11 22:55:13,768 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 93
[2024-03-11 22:55:13,776 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 389 treesize of output 357
[2024-03-11 22:55:15,584 INFO  L134       CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:55:15,584 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1841076251] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 22:55:15,585 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 22:55:15,585 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 34
[2024-03-11 22:55:15,585 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977917500]
[2024-03-11 22:55:15,585 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 22:55:15,586 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 35 states
[2024-03-11 22:55:15,586 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:55:15,587 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants.
[2024-03-11 22:55:15,588 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1064, Unknown=0, NotChecked=0, Total=1190
[2024-03-11 22:55:22,363 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 93 out of 192
[2024-03-11 22:55:22,366 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 68 transitions, 396 flow. Second operand  has 35 states, 35 states have (on average 95.71428571428571) internal successors, (3350), 35 states have internal predecessors, (3350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:55:22,366 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:55:22,366 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 192
[2024-03-11 22:55:22,366 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:55:25,754 INFO  L130       PetriNetUnfolder]: 2514/5340 cut-off events.
[2024-03-11 22:55:25,754 INFO  L131       PetriNetUnfolder]: For 7683/8114 co-relation queries the response was YES.
[2024-03-11 22:55:25,766 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17607 conditions, 5340 events. 2514/5340 cut-off events. For 7683/8114 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 37453 event pairs, 426 based on Foata normal form. 397/5679 useless extension candidates. Maximal degree in co-relation 7983. Up to 1784 conditions per place. 
[2024-03-11 22:55:25,775 INFO  L137   encePairwiseOnDemand]: 181/192 looper letters, 142 selfloop transitions, 15 changer transitions 23/193 dead transitions.
[2024-03-11 22:55:25,775 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 193 transitions, 1211 flow
[2024-03-11 22:55:25,776 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2024-03-11 22:55:25,776 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 14 states.
[2024-03-11 22:55:25,778 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1467 transitions.
[2024-03-11 22:55:25,778 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5457589285714286
[2024-03-11 22:55:25,779 INFO  L72            ComplementDD]: Start complementDD. Operand 14 states and 1467 transitions.
[2024-03-11 22:55:25,779 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 14 states and 1467 transitions.
[2024-03-11 22:55:25,779 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:55:25,779 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1467 transitions.
[2024-03-11 22:55:25,781 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 15 states, 14 states have (on average 104.78571428571429) internal successors, (1467), 14 states have internal predecessors, (1467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:55:25,784 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 15 states, 15 states have (on average 192.0) internal successors, (2880), 15 states have internal predecessors, (2880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:55:25,784 INFO  L81            ComplementDD]: Finished complementDD. Result  has 15 states, 15 states have (on average 192.0) internal successors, (2880), 15 states have internal predecessors, (2880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:55:25,784 INFO  L175             Difference]: Start difference. First operand has 86 places, 68 transitions, 396 flow. Second operand 14 states and 1467 transitions.
[2024-03-11 22:55:25,784 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 193 transitions, 1211 flow
[2024-03-11 22:55:25,798 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 193 transitions, 1190 flow, removed 3 selfloop flow, removed 7 redundant places.
[2024-03-11 22:55:25,799 INFO  L231             Difference]: Finished difference. Result has 95 places, 70 transitions, 430 flow
[2024-03-11 22:55:25,800 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=376, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=430, PETRI_PLACES=95, PETRI_TRANSITIONS=70}
[2024-03-11 22:55:25,800 INFO  L288   CegarLoopForPetriNet]: 51 programPoint places, 44 predicate places.
[2024-03-11 22:55:25,800 INFO  L495      AbstractCegarLoop]: Abstraction has has 95 places, 70 transitions, 430 flow
[2024-03-11 22:55:25,801 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 35 states, 35 states have (on average 95.71428571428571) internal successors, (3350), 35 states have internal predecessors, (3350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:55:25,801 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:55:25,801 INFO  L209   CegarLoopForPetriNet]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:55:25,808 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2024-03-11 22:55:26,002 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,5 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:55:26,002 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2024-03-11 22:55:26,003 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:55:26,003 INFO  L85        PathProgramCache]: Analyzing trace with hash 995416140, now seen corresponding path program 1 times
[2024-03-11 22:55:26,003 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:55:26,004 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064953095]
[2024-03-11 22:55:26,004 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:55:26,005 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:55:26,024 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-11 22:55:26,024 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-03-11 22:55:26,033 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-11 22:55:26,041 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-03-11 22:55:26,041 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-03-11 22:55:26,042 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (7 of 8 remaining)
[2024-03-11 22:55:26,042 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 8 remaining)
[2024-03-11 22:55:26,042 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 8 remaining)
[2024-03-11 22:55:26,042 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining)
[2024-03-11 22:55:26,042 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 8 remaining)
[2024-03-11 22:55:26,042 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 8 remaining)
[2024-03-11 22:55:26,042 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 8 remaining)
[2024-03-11 22:55:26,043 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 8 remaining)
[2024-03-11 22:55:26,043 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2024-03-11 22:55:26,043 INFO  L445         BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:55:26,047 INFO  L228   ceAbstractionStarter]: Analysis of concurrent program completed with 4 thread instances
[2024-03-11 22:55:26,047 INFO  L178   ceAbstractionStarter]: Computing trace abstraction results
[2024-03-11 22:55:26,098 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.03 10:55:26 BasicIcfg
[2024-03-11 22:55:26,098 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-03-11 22:55:26,098 INFO  L113        PluginConnector]: ------------------------Witness Printer----------------------------
[2024-03-11 22:55:26,098 INFO  L271        PluginConnector]: Initializing Witness Printer...
[2024-03-11 22:55:26,099 INFO  L275        PluginConnector]: Witness Printer initialized
[2024-03-11 22:55:26,099 INFO  L185        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 10:54:31" (3/4) ...
[2024-03-11 22:55:26,102 INFO  L140         WitnessPrinter]: No result that supports witness generation found
[2024-03-11 22:55:26,102 INFO  L132        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-03-11 22:55:26,102 INFO  L158              Benchmark]: Toolchain (without parser) took 55740.28ms. Allocated memory was 98.6MB in the beginning and 7.8GB in the end (delta: 7.7GB). Free memory was 40.2MB in the beginning and 5.8GB in the end (delta: -5.7GB). Peak memory consumption was 2.0GB. Max. memory is 16.1GB.
[2024-03-11 22:55:26,102 INFO  L158              Benchmark]: CDTParser took 0.15ms. Allocated memory is still 98.6MB. Free memory is still 62.4MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-03-11 22:55:26,103 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 312.30ms. Allocated memory was 98.6MB in the beginning and 119.5MB in the end (delta: 21.0MB). Free memory was 40.0MB in the beginning and 81.1MB in the end (delta: -41.1MB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB.
[2024-03-11 22:55:26,103 INFO  L158              Benchmark]: Boogie Procedure Inliner took 32.12ms. Allocated memory is still 119.5MB. Free memory was 81.1MB in the beginning and 79.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-03-11 22:55:26,103 INFO  L158              Benchmark]: Boogie Preprocessor took 22.99ms. Allocated memory is still 119.5MB. Free memory was 79.0MB in the beginning and 77.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-03-11 22:55:26,103 INFO  L158              Benchmark]: RCFGBuilder took 346.04ms. Allocated memory is still 119.5MB. Free memory was 77.6MB in the beginning and 64.8MB in the end (delta: 12.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB.
[2024-03-11 22:55:26,104 INFO  L158              Benchmark]: TraceAbstraction took 55017.65ms. Allocated memory was 119.5MB in the beginning and 7.8GB in the end (delta: 7.7GB). Free memory was 64.1MB in the beginning and 5.8GB in the end (delta: -5.7GB). Peak memory consumption was 2.0GB. Max. memory is 16.1GB.
[2024-03-11 22:55:26,104 INFO  L158              Benchmark]: Witness Printer took 3.34ms. Allocated memory is still 7.8GB. Free memory was 5.8GB in the beginning and 5.8GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-03-11 22:55:26,105 INFO  L339   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.15ms. Allocated memory is still 98.6MB. Free memory is still 62.4MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 312.30ms. Allocated memory was 98.6MB in the beginning and 119.5MB in the end (delta: 21.0MB). Free memory was 40.0MB in the beginning and 81.1MB in the end (delta: -41.1MB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 32.12ms. Allocated memory is still 119.5MB. Free memory was 81.1MB in the beginning and 79.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 22.99ms. Allocated memory is still 119.5MB. Free memory was 79.0MB in the beginning and 77.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB.
 * RCFGBuilder took 346.04ms. Allocated memory is still 119.5MB. Free memory was 77.6MB in the beginning and 64.8MB in the end (delta: 12.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB.
 * TraceAbstraction took 55017.65ms. Allocated memory was 119.5MB in the beginning and 7.8GB in the end (delta: 7.7GB). Free memory was 64.1MB in the beginning and 5.8GB in the end (delta: -5.7GB). Peak memory consumption was 2.0GB. Max. memory is 16.1GB.
 * Witness Printer took 3.34ms. Allocated memory is still 7.8GB. Free memory was 5.8GB in the beginning and 5.8GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    Lipton Reduction Statistics: ReductionTime: 1.3s, 69 PlacesBefore, 20 PlacesAfterwards, 69 TransitionsBefore, 18 TransitionsAfterwards, 896 CoEnabledTransitionPairs, 5 FixpointIterations, 19 TrivialSequentialCompositions, 29 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 2 ChoiceCompositions, 54 TotalNumberOfCompositions, 1515 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 942, independent: 870, independent conditional: 0, independent unconditional: 870, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 464, independent: 450, independent conditional: 0, independent unconditional: 450, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 942, independent: 420, independent conditional: 0, independent unconditional: 420, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 464, unknown conditional: 0, unknown unconditional: 464] , Statistics on independence cache: Total cache size (in pairs): 24, Positive cache size: 18, Positive conditional cache size: 0, Positive unconditional cache size: 18, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    Lipton Reduction Statistics: ReductionTime: 1.5s, 86 PlacesBefore, 33 PlacesAfterwards, 85 TransitionsBefore, 30 TransitionsAfterwards, 2380 CoEnabledTransitionPairs, 5 FixpointIterations, 18 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 2 ChoiceCompositions, 58 TotalNumberOfCompositions, 5120 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2985, independent: 2845, independent conditional: 0, independent unconditional: 2845, dependent: 140, dependent conditional: 0, dependent unconditional: 140, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1224, independent: 1196, independent conditional: 0, independent unconditional: 1196, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2985, independent: 1649, independent conditional: 0, independent unconditional: 1649, dependent: 112, dependent conditional: 0, dependent unconditional: 112, unknown: 1224, unknown conditional: 0, unknown unconditional: 1224] , Statistics on independence cache: Total cache size (in pairs): 131, Positive cache size: 118, Positive conditional cache size: 0, Positive unconditional cache size: 118, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    Lipton Reduction Statistics: ReductionTime: 1.2s, 103 PlacesBefore, 42 PlacesAfterwards, 101 TransitionsBefore, 38 TransitionsAfterwards, 4284 CoEnabledTransitionPairs, 5 FixpointIterations, 18 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 2 ChoiceCompositions, 67 TotalNumberOfCompositions, 10005 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5229, independent: 5030, independent conditional: 0, independent unconditional: 5030, dependent: 199, dependent conditional: 0, dependent unconditional: 199, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2187, independent: 2147, independent conditional: 0, independent unconditional: 2147, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5229, independent: 2883, independent conditional: 0, independent unconditional: 2883, dependent: 159, dependent conditional: 0, dependent unconditional: 159, unknown: 2187, unknown conditional: 0, unknown unconditional: 2187] , Statistics on independence cache: Total cache size (in pairs): 238, Positive cache size: 216, Positive conditional cache size: 0, Positive unconditional cache size: 216, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    Lipton Reduction Statistics: ReductionTime: 1.2s, 120 PlacesBefore, 51 PlacesAfterwards, 117 TransitionsBefore, 46 TransitionsAfterwards, 6664 CoEnabledTransitionPairs, 5 FixpointIterations, 18 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 2 ChoiceCompositions, 75 TotalNumberOfCompositions, 16804 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 7996, independent: 7737, independent conditional: 0, independent unconditional: 7737, dependent: 259, dependent conditional: 0, dependent unconditional: 259, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3271, independent: 3222, independent conditional: 0, independent unconditional: 3222, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 7996, independent: 4515, independent conditional: 0, independent unconditional: 4515, dependent: 210, dependent conditional: 0, dependent unconditional: 210, unknown: 3271, unknown conditional: 0, unknown unconditional: 3271] , Statistics on independence cache: Total cache size (in pairs): 350, Positive cache size: 320, Positive conditional cache size: 0, Positive unconditional cache size: 320, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0
  - DataRaceFoundResult [Line: 678]: Data race detected
    Data race detected
The following path leads to a data race: 
[L674]               0  int data = 0;
[L675]               0  pthread_mutex_t data_mutex = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } };
[L683]               0  int breads_total = 4;
[L684]               0  pthread_t tids[4];
[L685]               0  int i = 0;
        VAL             [breads_total=4, data=0, data_mutex={1:0}, i=0, tids={5:0}]
[L685]  COND TRUE    0  i < breads_total
[L686]  FCALL, FORK  0  pthread_create(&tids[i], ((void *)0), &thread, ((void *)0))
        VAL             [arg={0:0}, breads_total=4, data=0, data_mutex={1:0}, i=0, pthread_create(&tids[i], ((void *)0), &thread, ((void *)0))=17, tids={5:0}]
[L678]               1  data = __VERIFIER_nondet_int()
        VAL             [__VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}]
[L678]               1  data = __VERIFIER_nondet_int()
[L680]               1  return ((void *)0);
[L685]               0  i++
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, breads_total=4, data=0, data_mutex={1:0}, i=1, tids={5:0}]
[L685]  COND TRUE    0  i < breads_total
[L686]  FCALL, FORK  0  pthread_create(&tids[i], ((void *)0), &thread, ((void *)0))
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, breads_total=4, data=0, data_mutex={1:0}, i=1, pthread_create(&tids[i], ((void *)0), &thread, ((void *)0))=18, tids={5:0}]
[L685]               0  i++
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, breads_total=4, data=0, data_mutex={1:0}, i=2, tids={5:0}]
[L685]  COND TRUE    0  i < breads_total
[L686]  FCALL, FORK  0  pthread_create(&tids[i], ((void *)0), &thread, ((void *)0))
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, breads_total=4, data=0, data_mutex={1:0}, i=2, pthread_create(&tids[i], ((void *)0), &thread, ((void *)0))=19, tids={5:0}]
[L678]               3  data = __VERIFIER_nondet_int()
[L680]               3  return ((void *)0);
[L678]               2  data = __VERIFIER_nondet_int()
        VAL             [\result={0:0}, __VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}]
[L685]               0  i++
        VAL             [\result={0:0}, __VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, breads_total=4, data=0, data_mutex={1:0}, i=3, tids={5:0}]
[L685]  COND TRUE    0  i < breads_total
[L686]  FCALL, FORK  0  pthread_create(&tids[i], ((void *)0), &thread, ((void *)0))
        VAL             [\result={0:0}, __VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, breads_total=4, data=0, data_mutex={1:0}, i=3, pthread_create(&tids[i], ((void *)0), &thread, ((void *)0))=20, tids={5:0}]
[L685]               0  i++
        VAL             [\result={0:0}, __VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, breads_total=4, data=0, data_mutex={1:0}, i=4, tids={5:0}]
[L685]  COND FALSE   0  !(i < breads_total)
[L688]               0  int i = 0;
        VAL             [\result={0:0}, __VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, breads_total=4, data=0, data_mutex={1:0}, i=0, i=4, tids={5:0}]
[L688]  COND TRUE    0  i < breads_total
[L689]  EXPR         0  tids[i]
[L689]               0  pthread_join(tids[i], ((void *)0))
        VAL             [\result={0:0}, __VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, breads_total=4, data=0, data_mutex={1:0}, i=0, i=4, tids={5:0}, tids[i]=17]
[L689]  FCALL, JOIN  1  pthread_join(tids[i], ((void *)0))
        VAL             [\result={0:0}, __VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, breads_total=4, data=0, data_mutex={1:0}, i=4, i=0, tids={5:0}, tids[i]=17]
[L688]               0  i += 2
        VAL             [\result={0:0}, __VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, breads_total=4, data=0, data_mutex={1:0}, i=4, i=2, tids={5:0}]
[L688]  COND TRUE    0  i < breads_total
[L689]  EXPR         0  tids[i]
[L689]               0  pthread_join(tids[i], ((void *)0))
        VAL             [\result={0:0}, __VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, breads_total=4, data=0, data_mutex={1:0}, i=2, i=4, tids={5:0}, tids[i]=19]
[L689]  FCALL, JOIN  3  pthread_join(tids[i], ((void *)0))
        VAL             [\result={0:0}, __VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, breads_total=4, data=0, data_mutex={1:0}, i=2, i=4, tids={5:0}, tids[i]=19]
[L688]               0  i += 2
        VAL             [\result={0:0}, __VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, breads_total=4, data=0, data_mutex={1:0}, i=4, i=4, tids={5:0}]
[L678]               2  data = __VERIFIER_nondet_int()
        VAL             [\result={0:0}, __VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, data=0, data = __VERIFIER_nondet_int()=27, data_mutex={1:0}]
[L688]  COND FALSE   0  !(i < breads_total)
[L691]               0  return data;
        VAL             [\result={0:0}, __VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, breads_total=4, data=0, data = __VERIFIER_nondet_int()=27, data_mutex={1:0}, i=4, i=4, tids={5:0}]
[L678]               2  data = __VERIFIER_nondet_int()
        VAL             [\result={0:0}, __VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, data=0, data = __VERIFIER_nondet_int()=27, data_mutex={1:0}]

Now there is a data race on ~data~0 between 
	C: return data; [691]
and
	C: data = __VERIFIER_nondet_int() [678]

  - UnprovableResult [Line: 691]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 689]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 686]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
    Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
 Reason: Not analyzed. 
  - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
    CFG has 3 procedures, 82 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.8s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 49 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 18 mSDsluCounter, 10 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 82 IncrementalHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 10 mSDtfsCounter, 82 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=2, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 15 NumberOfCodeBlocks, 15 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 7 ConstructedInterpolants, 0 QuantifiedInterpolants, 15 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
  - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances
    CFG has 4 procedures, 97 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.0s, OverallIterations: 4, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 142 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 85 mSDsluCounter, 21 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 201 IncrementalHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 13 mSDtfsCounter, 201 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=130occurred in iteration=3, InterpolantAutomatonStates: 10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 29 NumberOfCodeBlocks, 29 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 15 ConstructedInterpolants, 0 QuantifiedInterpolants, 39 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 1/1 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
  - StatisticsResult: Ultimate Automizer benchmark data with 3 thread instances
    CFG has 5 procedures, 112 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 3.7s, OverallIterations: 6, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 239 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 146 mSDsluCounter, 47 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 403 IncrementalHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 38 mSDtfsCounter, 403 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=234occurred in iteration=4, InterpolantAutomatonStates: 16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 58 NumberOfCodeBlocks, 58 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 38 ConstructedInterpolants, 0 QuantifiedInterpolants, 88 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 5/5 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
  - StatisticsResult: Ultimate Automizer benchmark data with 4 thread instances
    CFG has 6 procedures, 127 locations, 8 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 47.3s, OverallIterations: 13, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 36.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3216 SdHoareTripleChecker+Valid, 15.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2896 mSDsluCounter, 5548 SdHoareTripleChecker+Invalid, 13.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5500 mSDsCounter, 85 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16678 IncrementalHoareTripleChecker+Invalid, 16763 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 85 mSolverCounterUnsat, 48 mSDtfsCounter, 16678 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 291 GetRequests, 182 SyntacticMatches, 6 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 835 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=430occurred in iteration=12, InterpolantAutomatonStates: 68, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 8.0s InterpolantComputationTime, 385 NumberOfCodeBlocks, 385 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 431 ConstructedInterpolants, 13 QuantifiedInterpolants, 10776 SizeOfPredicates, 29 NumberOfNonLiveVariables, 731 ConjunctsInSsa, 78 ConjunctsInUnsatCore, 19 InterpolantComputations, 9 PerfectInterpolantSequences, 116/316 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
[2024-03-11 22:55:26,190 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---

Execution finished normally
Writing output log to file Ultimate.log
Writing human readable error path to file UltimateCounterExample.errorpath
Result:
FALSE
