./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 6522688b75eabd4613afff43fc24a072ce425cbb7b76f809d7e56aded5f14999
--- Real Ultimate output ---
This is Ultimate 0.2.2-dev-2329fc7
[2023-11-01 17:47:23,106 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2023-11-01 17:47:23,107 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2023-11-01 17:47:23,127 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2023-11-01 17:47:23,128 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2023-11-01 17:47:23,129 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2023-11-01 17:47:23,129 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2023-11-01 17:47:23,130 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2023-11-01 17:47:23,132 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2023-11-01 17:47:23,132 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2023-11-01 17:47:23,133 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2023-11-01 17:47:23,134 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2023-11-01 17:47:23,134 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2023-11-01 17:47:23,135 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2023-11-01 17:47:23,136 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2023-11-01 17:47:23,137 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2023-11-01 17:47:23,137 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2023-11-01 17:47:23,138 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2023-11-01 17:47:23,139 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2023-11-01 17:47:23,140 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2023-11-01 17:47:23,141 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2023-11-01 17:47:23,142 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2023-11-01 17:47:23,143 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2023-11-01 17:47:23,143 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2023-11-01 17:47:23,146 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2023-11-01 17:47:23,146 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2023-11-01 17:47:23,146 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2023-11-01 17:47:23,147 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2023-11-01 17:47:23,147 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2023-11-01 17:47:23,148 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2023-11-01 17:47:23,148 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2023-11-01 17:47:23,148 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2023-11-01 17:47:23,149 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2023-11-01 17:47:23,149 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2023-11-01 17:47:23,150 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2023-11-01 17:47:23,150 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2023-11-01 17:47:23,150 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2023-11-01 17:47:23,151 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2023-11-01 17:47:23,151 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2023-11-01 17:47:23,151 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2023-11-01 17:47:23,152 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2023-11-01 17:47:23,152 INFO  L101        SettingsManager]: Beginning loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2023-11-01 17:47:23,169 INFO  L113        SettingsManager]: Loading preferences was successful
[2023-11-01 17:47:23,169 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2023-11-01 17:47:23,169 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-11-01 17:47:23,169 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-11-01 17:47:23,170 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-11-01 17:47:23,170 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-11-01 17:47:23,170 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-11-01 17:47:23,170 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2023-11-01 17:47:23,171 INFO  L138        SettingsManager]:  * Use SBE=true
[2023-11-01 17:47:23,171 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-11-01 17:47:23,171 INFO  L138        SettingsManager]:  * sizeof long=4
[2023-11-01 17:47:23,171 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2023-11-01 17:47:23,171 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2023-11-01 17:47:23,171 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2023-11-01 17:47:23,171 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2023-11-01 17:47:23,171 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2023-11-01 17:47:23,171 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-11-01 17:47:23,172 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2023-11-01 17:47:23,172 INFO  L138        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2023-11-01 17:47:23,172 INFO  L138        SettingsManager]:  * sizeof long double=12
[2023-11-01 17:47:23,172 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2023-11-01 17:47:23,172 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2023-11-01 17:47:23,172 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2023-11-01 17:47:23,172 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-11-01 17:47:23,172 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2023-11-01 17:47:23,172 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2023-11-01 17:47:23,173 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-01 17:47:23,173 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-11-01 17:47:23,173 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2023-11-01 17:47:23,173 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2023-11-01 17:47:23,173 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2023-11-01 17:47:23,173 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-11-01 17:47:23,173 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2023-11-01 17:47:23,173 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-11-01 17:47:23,173 INFO  L138        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2023-11-01 17:47:23,174 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2023-11-01 17:47:23,174 INFO  L138        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2023-11-01 17:47:23,174 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 -> 6522688b75eabd4613afff43fc24a072ce425cbb7b76f809d7e56aded5f14999
[2023-11-01 17:47:23,385 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2023-11-01 17:47:23,405 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-11-01 17:47:23,407 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-11-01 17:47:23,409 INFO  L271        PluginConnector]: Initializing CDTParser...
[2023-11-01 17:47:23,409 INFO  L275        PluginConnector]: CDTParser initialized
[2023-11-01 17:47:23,410 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
[2023-11-01 17:47:24,441 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2023-11-01 17:47:24,668 INFO  L351              CDTParser]: Found 1 translation units.
[2023-11-01 17:47:24,669 INFO  L172              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/thread-join-array-const-race-2.i
[2023-11-01 17:47:24,677 INFO  L394              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/4beba3f08/d9f2dfeee21b46729e7ea7e8f74f6b1b/FLAGfb19bd8ec
[2023-11-01 17:47:25,048 INFO  L402              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/4beba3f08/d9f2dfeee21b46729e7ea7e8f74f6b1b
[2023-11-01 17:47:25,051 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-11-01 17:47:25,052 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2023-11-01 17:47:25,053 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-11-01 17:47:25,053 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-11-01 17:47:25,057 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2023-11-01 17:47:25,057 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.11 05:47:25" (1/1) ...
[2023-11-01 17:47:25,058 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f35780e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 05:47:25, skipping insertion in model container
[2023-11-01 17:47:25,058 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.11 05:47:25" (1/1) ...
[2023-11-01 17:47:25,064 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2023-11-01 17:47:25,095 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2023-11-01 17:47:25,291 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-11-01 17:47:25,300 INFO  L203         MainTranslator]: Completed pre-run
[2023-11-01 17:47:25,331 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-11-01 17:47:25,353 INFO  L208         MainTranslator]: Completed translation
[2023-11-01 17:47:25,354 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 05:47:25 WrapperNode
[2023-11-01 17:47:25,354 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-11-01 17:47:25,355 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-11-01 17:47:25,355 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-11-01 17:47:25,355 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2023-11-01 17:47:25,360 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 05:47:25" (1/1) ...
[2023-11-01 17:47:25,370 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 05:47:25" (1/1) ...
[2023-11-01 17:47:25,383 INFO  L138                Inliner]: procedures = 157, calls = 15, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 51
[2023-11-01 17:47:25,384 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-11-01 17:47:25,384 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-11-01 17:47:25,384 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2023-11-01 17:47:25,384 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2023-11-01 17:47:25,391 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 05:47:25" (1/1) ...
[2023-11-01 17:47:25,391 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 05:47:25" (1/1) ...
[2023-11-01 17:47:25,394 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 05:47:25" (1/1) ...
[2023-11-01 17:47:25,394 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 05:47:25" (1/1) ...
[2023-11-01 17:47:25,399 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 05:47:25" (1/1) ...
[2023-11-01 17:47:25,401 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 05:47:25" (1/1) ...
[2023-11-01 17:47:25,402 INFO  L185        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 05:47:25" (1/1) ...
[2023-11-01 17:47:25,403 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 05:47:25" (1/1) ...
[2023-11-01 17:47:25,404 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-11-01 17:47:25,405 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-11-01 17:47:25,405 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2023-11-01 17:47:25,405 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2023-11-01 17:47:25,406 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 05:47:25" (1/1) ...
[2023-11-01 17:47:25,411 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-01 17:47:25,419 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-01 17:47:25,430 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2023-11-01 17:47:25,433 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2023-11-01 17:47:25,455 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2023-11-01 17:47:25,456 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2023-11-01 17:47:25,456 INFO  L130     BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock
[2023-11-01 17:47:25,456 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2023-11-01 17:47:25,456 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2023-11-01 17:47:25,456 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-11-01 17:47:25,456 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2023-11-01 17:47:25,456 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2023-11-01 17:47:25,456 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2023-11-01 17:47:25,456 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-11-01 17:47:25,456 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-11-01 17:47:25,457 WARN  L209             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2023-11-01 17:47:25,561 INFO  L235             CfgBuilder]: Building ICFG
[2023-11-01 17:47:25,562 INFO  L261             CfgBuilder]: Building CFG for each procedure with an implementation
[2023-11-01 17:47:25,711 INFO  L276             CfgBuilder]: Performing block encoding
[2023-11-01 17:47:25,717 INFO  L295             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-11-01 17:47:25,717 INFO  L300             CfgBuilder]: Removed 2 assume(true) statements.
[2023-11-01 17:47:25,718 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.11 05:47:25 BoogieIcfgContainer
[2023-11-01 17:47:25,718 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-11-01 17:47:25,720 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-11-01 17:47:25,720 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2023-11-01 17:47:25,723 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2023-11-01 17:47:25,723 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.11 05:47:25" (1/3) ...
[2023-11-01 17:47:25,724 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@102e8829 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.11 05:47:25, skipping insertion in model container
[2023-11-01 17:47:25,724 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 05:47:25" (2/3) ...
[2023-11-01 17:47:25,724 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@102e8829 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.11 05:47:25, skipping insertion in model container
[2023-11-01 17:47:25,724 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.11 05:47:25" (3/3) ...
[2023-11-01 17:47:25,725 INFO  L112   eAbstractionObserver]: Analyzing ICFG thread-join-array-const-race-2.i
[2023-11-01 17:47:25,731 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2023-11-01 17:47:25,739 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-11-01 17:47:25,739 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations.
[2023-11-01 17:47:25,739 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2023-11-01 17:47:25,777 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2023-11-01 17:47:25,805 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 69 places, 69 transitions, 146 flow
[2023-11-01 17:47:25,842 INFO  L130       PetriNetUnfolder]: 5/95 cut-off events.
[2023-11-01 17:47:25,842 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-11-01 17:47:25,846 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. 
[2023-11-01 17:47:25,846 INFO  L82        GeneralOperation]: Start removeDead. Operand has 69 places, 69 transitions, 146 flow
[2023-11-01 17:47:25,849 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 69 places, 69 transitions, 146 flow
[2023-11-01 17:47:25,851 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-11-01 17:47:25,859 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 69 transitions, 146 flow
[2023-11-01 17:47:25,861 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 69 transitions, 146 flow
[2023-11-01 17:47:25,862 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 69 places, 69 transitions, 146 flow
[2023-11-01 17:47:25,881 INFO  L130       PetriNetUnfolder]: 5/95 cut-off events.
[2023-11-01 17:47:25,881 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-11-01 17:47:25,882 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. 
[2023-11-01 17:47:25,883 INFO  L119        LiptonReduction]: Number of co-enabled transitions 896
[2023-11-01 17:47:27,170 INFO  L134        LiptonReduction]: Checked pairs total: 1515
[2023-11-01 17:47:27,170 INFO  L136        LiptonReduction]: Total number of compositions: 54
[2023-11-01 17:47:27,184 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-01 17:47:27,189 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;@313263ec, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-11-01 17:47:27,189 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 5 error locations.
[2023-11-01 17:47:27,191 INFO  L130       PetriNetUnfolder]: 0/5 cut-off events.
[2023-11-01 17:47:27,192 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-11-01 17:47:27,192 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 17:47:27,192 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1]
[2023-11-01 17:47:27,193 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)] ===
[2023-11-01 17:47:27,196 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 17:47:27,197 INFO  L85        PathProgramCache]: Analyzing trace with hash 253400, now seen corresponding path program 1 times
[2023-11-01 17:47:27,203 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 17:47:27,203 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979984869]
[2023-11-01 17:47:27,204 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:47:27,204 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 17:47:27,275 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 17:47:27,361 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 17:47:27,362 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 17:47:27,363 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979984869]
[2023-11-01 17:47:27,363 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979984869] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-01 17:47:27,363 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-01 17:47:27,363 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-01 17:47:27,364 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669491818]
[2023-11-01 17:47:27,365 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-01 17:47:27,371 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-01 17:47:27,371 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 17:47:27,386 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-01 17:47:27,387 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-01 17:47:27,420 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 62 out of 123
[2023-11-01 17:47:27,422 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)
[2023-11-01 17:47:27,422 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 17:47:27,422 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 123
[2023-11-01 17:47:27,423 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 17:47:27,478 INFO  L130       PetriNetUnfolder]: 12/52 cut-off events.
[2023-11-01 17:47:27,478 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-11-01 17:47:27,479 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. 
[2023-11-01 17:47:27,481 INFO  L137   encePairwiseOnDemand]: 119/123 looper letters, 13 selfloop transitions, 2 changer transitions 0/20 dead transitions.
[2023-11-01 17:47:27,481 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 20 transitions, 78 flow
[2023-11-01 17:47:27,483 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-01 17:47:27,485 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-01 17:47:27,492 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 203 transitions.
[2023-11-01 17:47:27,494 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5501355013550135
[2023-11-01 17:47:27,495 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 203 transitions.
[2023-11-01 17:47:27,495 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 203 transitions.
[2023-11-01 17:47:27,496 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 17:47:27,498 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 203 transitions.
[2023-11-01 17:47:27,500 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)
[2023-11-01 17:47:27,504 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)
[2023-11-01 17:47:27,505 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)
[2023-11-01 17:47:27,506 INFO  L175             Difference]: Start difference. First operand has 20 places, 18 transitions, 44 flow. Second operand 3 states and 203 transitions.
[2023-11-01 17:47:27,507 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 20 transitions, 78 flow
[2023-11-01 17:47:27,508 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 20 transitions, 78 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-01 17:47:27,510 INFO  L231             Difference]: Finished difference. Result has 22 places, 17 transitions, 50 flow
[2023-11-01 17:47:27,511 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}
[2023-11-01 17:47:27,513 INFO  L288   CegarLoopForPetriNet]: 20 programPoint places, 2 predicate places.
[2023-11-01 17:47:27,514 INFO  L495      AbstractCegarLoop]: Abstraction has has 22 places, 17 transitions, 50 flow
[2023-11-01 17:47:27,514 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)
[2023-11-01 17:47:27,514 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 17:47:27,514 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2023-11-01 17:47:27,514 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-11-01 17:47:27,515 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)] ===
[2023-11-01 17:47:27,515 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 17:47:27,515 INFO  L85        PathProgramCache]: Analyzing trace with hash -1030225790, now seen corresponding path program 1 times
[2023-11-01 17:47:27,515 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 17:47:27,515 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733902625]
[2023-11-01 17:47:27,516 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:47:27,516 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 17:47:27,531 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 17:47:27,560 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 17:47:27,560 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 17:47:27,560 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733902625]
[2023-11-01 17:47:27,560 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733902625] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-01 17:47:27,560 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-01 17:47:27,560 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-01 17:47:27,561 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237653329]
[2023-11-01 17:47:27,561 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-01 17:47:27,562 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-01 17:47:27,562 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 17:47:27,563 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-01 17:47:27,563 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-01 17:47:27,578 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 59 out of 123
[2023-11-01 17:47:27,578 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)
[2023-11-01 17:47:27,579 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 17:47:27,579 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 123
[2023-11-01 17:47:27,579 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 17:47:27,628 INFO  L130       PetriNetUnfolder]: 20/71 cut-off events.
[2023-11-01 17:47:27,629 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2023-11-01 17:47:27,629 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. 
[2023-11-01 17:47:27,630 INFO  L137   encePairwiseOnDemand]: 119/123 looper letters, 17 selfloop transitions, 3 changer transitions 1/24 dead transitions.
[2023-11-01 17:47:27,630 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 24 transitions, 111 flow
[2023-11-01 17:47:27,630 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-01 17:47:27,631 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-01 17:47:27,631 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 199 transitions.
[2023-11-01 17:47:27,632 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5392953929539296
[2023-11-01 17:47:27,632 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 199 transitions.
[2023-11-01 17:47:27,632 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 199 transitions.
[2023-11-01 17:47:27,633 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 17:47:27,633 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 199 transitions.
[2023-11-01 17:47:27,634 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)
[2023-11-01 17:47:27,635 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)
[2023-11-01 17:47:27,635 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)
[2023-11-01 17:47:27,635 INFO  L175             Difference]: Start difference. First operand has 22 places, 17 transitions, 50 flow. Second operand 3 states and 199 transitions.
[2023-11-01 17:47:27,636 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 24 transitions, 111 flow
[2023-11-01 17:47:27,636 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 24 transitions, 105 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-01 17:47:27,637 INFO  L231             Difference]: Finished difference. Result has 23 places, 19 transitions, 65 flow
[2023-11-01 17:47:27,637 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}
[2023-11-01 17:47:27,638 INFO  L288   CegarLoopForPetriNet]: 20 programPoint places, 3 predicate places.
[2023-11-01 17:47:27,638 INFO  L495      AbstractCegarLoop]: Abstraction has has 23 places, 19 transitions, 65 flow
[2023-11-01 17:47:27,638 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)
[2023-11-01 17:47:27,638 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 17:47:27,638 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1]
[2023-11-01 17:47:27,638 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-11-01 17:47:27,638 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)] ===
[2023-11-01 17:47:27,639 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 17:47:27,639 INFO  L85        PathProgramCache]: Analyzing trace with hash -1030223241, now seen corresponding path program 1 times
[2023-11-01 17:47:27,639 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 17:47:27,640 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393086196]
[2023-11-01 17:47:27,640 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:47:27,640 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 17:47:27,656 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-01 17:47:27,657 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-11-01 17:47:27,666 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-01 17:47:27,682 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-11-01 17:47:27,682 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-11-01 17:47:27,683 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining)
[2023-11-01 17:47:27,685 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (3 of 5 remaining)
[2023-11-01 17:47:27,685 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (2 of 5 remaining)
[2023-11-01 17:47:27,685 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 5 remaining)
[2023-11-01 17:47:27,685 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 5 remaining)
[2023-11-01 17:47:27,685 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-11-01 17:47:27,685 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1]
[2023-11-01 17:47:27,687 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-11-01 17:47:27,687 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2023-11-01 17:47:27,701 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2023-11-01 17:47:27,703 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 86 places, 85 transitions, 188 flow
[2023-11-01 17:47:27,721 INFO  L130       PetriNetUnfolder]: 10/167 cut-off events.
[2023-11-01 17:47:27,721 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2023-11-01 17:47:27,721 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. 
[2023-11-01 17:47:27,721 INFO  L82        GeneralOperation]: Start removeDead. Operand has 86 places, 85 transitions, 188 flow
[2023-11-01 17:47:27,722 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 86 places, 85 transitions, 188 flow
[2023-11-01 17:47:27,722 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-11-01 17:47:27,723 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 86 places, 85 transitions, 188 flow
[2023-11-01 17:47:27,723 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 85 transitions, 188 flow
[2023-11-01 17:47:27,723 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 86 places, 85 transitions, 188 flow
[2023-11-01 17:47:27,736 INFO  L130       PetriNetUnfolder]: 10/167 cut-off events.
[2023-11-01 17:47:27,736 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2023-11-01 17:47:27,736 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. 
[2023-11-01 17:47:27,738 INFO  L119        LiptonReduction]: Number of co-enabled transitions 2380
[2023-11-01 17:47:28,996 INFO  L134        LiptonReduction]: Checked pairs total: 5120
[2023-11-01 17:47:28,996 INFO  L136        LiptonReduction]: Total number of compositions: 58
[2023-11-01 17:47:28,998 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-01 17:47:28,999 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;@313263ec, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-11-01 17:47:29,000 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2023-11-01 17:47:29,001 INFO  L130       PetriNetUnfolder]: 0/4 cut-off events.
[2023-11-01 17:47:29,002 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-11-01 17:47:29,002 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 17:47:29,002 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1]
[2023-11-01 17:47:29,002 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)] ===
[2023-11-01 17:47:29,003 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 17:47:29,003 INFO  L85        PathProgramCache]: Analyzing trace with hash 411287, now seen corresponding path program 1 times
[2023-11-01 17:47:29,003 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 17:47:29,003 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176778751]
[2023-11-01 17:47:29,004 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:47:29,004 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 17:47:29,013 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 17:47:29,045 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 17:47:29,045 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 17:47:29,045 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176778751]
[2023-11-01 17:47:29,046 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176778751] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-01 17:47:29,046 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-01 17:47:29,046 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-01 17:47:29,047 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510653464]
[2023-11-01 17:47:29,047 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-01 17:47:29,047 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-01 17:47:29,047 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 17:47:29,048 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-01 17:47:29,048 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-01 17:47:29,064 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 76 out of 143
[2023-11-01 17:47:29,064 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)
[2023-11-01 17:47:29,064 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 17:47:29,065 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 143
[2023-11-01 17:47:29,065 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 17:47:29,148 INFO  L130       PetriNetUnfolder]: 372/753 cut-off events.
[2023-11-01 17:47:29,148 INFO  L131       PetriNetUnfolder]: For 33/33 co-relation queries the response was YES.
[2023-11-01 17:47:29,150 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. 
[2023-11-01 17:47:29,152 INFO  L137   encePairwiseOnDemand]: 139/143 looper letters, 24 selfloop transitions, 2 changer transitions 0/35 dead transitions.
[2023-11-01 17:47:29,153 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 35 transitions, 140 flow
[2023-11-01 17:47:29,153 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-01 17:47:29,153 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-01 17:47:29,154 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 256 transitions.
[2023-11-01 17:47:29,155 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5967365967365967
[2023-11-01 17:47:29,155 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 256 transitions.
[2023-11-01 17:47:29,155 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 256 transitions.
[2023-11-01 17:47:29,156 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 17:47:29,156 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 256 transitions.
[2023-11-01 17:47:29,156 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)
[2023-11-01 17:47:29,158 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)
[2023-11-01 17:47:29,158 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)
[2023-11-01 17:47:29,158 INFO  L175             Difference]: Start difference. First operand has 33 places, 30 transitions, 78 flow. Second operand 3 states and 256 transitions.
[2023-11-01 17:47:29,158 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 35 transitions, 140 flow
[2023-11-01 17:47:29,159 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 35 transitions, 140 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-01 17:47:29,180 INFO  L231             Difference]: Finished difference. Result has 35 places, 30 transitions, 88 flow
[2023-11-01 17:47:29,180 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}
[2023-11-01 17:47:29,181 INFO  L288   CegarLoopForPetriNet]: 33 programPoint places, 2 predicate places.
[2023-11-01 17:47:29,182 INFO  L495      AbstractCegarLoop]: Abstraction has has 35 places, 30 transitions, 88 flow
[2023-11-01 17:47:29,182 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)
[2023-11-01 17:47:29,182 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 17:47:29,182 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-11-01 17:47:29,183 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2023-11-01 17:47:29,183 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)] ===
[2023-11-01 17:47:29,183 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 17:47:29,184 INFO  L85        PathProgramCache]: Analyzing trace with hash -2032684283, now seen corresponding path program 1 times
[2023-11-01 17:47:29,184 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 17:47:29,184 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926634141]
[2023-11-01 17:47:29,184 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:47:29,185 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 17:47:29,196 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 17:47:29,214 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 17:47:29,215 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 17:47:29,215 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926634141]
[2023-11-01 17:47:29,215 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926634141] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-01 17:47:29,215 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-01 17:47:29,215 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-01 17:47:29,215 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774835223]
[2023-11-01 17:47:29,215 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-01 17:47:29,216 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-01 17:47:29,216 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 17:47:29,216 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-01 17:47:29,216 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-01 17:47:29,232 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 72 out of 143
[2023-11-01 17:47:29,233 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)
[2023-11-01 17:47:29,233 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 17:47:29,233 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 143
[2023-11-01 17:47:29,233 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 17:47:29,358 INFO  L130       PetriNetUnfolder]: 505/980 cut-off events.
[2023-11-01 17:47:29,358 INFO  L131       PetriNetUnfolder]: For 130/130 co-relation queries the response was YES.
[2023-11-01 17:47:29,360 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. 
[2023-11-01 17:47:29,364 INFO  L137   encePairwiseOnDemand]: 137/143 looper letters, 33 selfloop transitions, 5 changer transitions 0/46 dead transitions.
[2023-11-01 17:47:29,364 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 46 transitions, 211 flow
[2023-11-01 17:47:29,364 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-01 17:47:29,364 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-01 17:47:29,365 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 253 transitions.
[2023-11-01 17:47:29,365 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5897435897435898
[2023-11-01 17:47:29,366 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 253 transitions.
[2023-11-01 17:47:29,366 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 253 transitions.
[2023-11-01 17:47:29,366 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 17:47:29,366 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 253 transitions.
[2023-11-01 17:47:29,367 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)
[2023-11-01 17:47:29,368 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)
[2023-11-01 17:47:29,369 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)
[2023-11-01 17:47:29,369 INFO  L175             Difference]: Start difference. First operand has 35 places, 30 transitions, 88 flow. Second operand 3 states and 253 transitions.
[2023-11-01 17:47:29,369 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 46 transitions, 211 flow
[2023-11-01 17:47:29,370 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 46 transitions, 208 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-11-01 17:47:29,371 INFO  L231             Difference]: Finished difference. Result has 38 places, 34 transitions, 124 flow
[2023-11-01 17:47:29,371 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}
[2023-11-01 17:47:29,372 INFO  L288   CegarLoopForPetriNet]: 33 programPoint places, 5 predicate places.
[2023-11-01 17:47:29,372 INFO  L495      AbstractCegarLoop]: Abstraction has has 38 places, 34 transitions, 124 flow
[2023-11-01 17:47:29,372 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)
[2023-11-01 17:47:29,372 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 17:47:29,372 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-01 17:47:29,372 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2023-11-01 17:47:29,372 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)] ===
[2023-11-01 17:47:29,373 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 17:47:29,373 INFO  L85        PathProgramCache]: Analyzing trace with hash 1288850991, now seen corresponding path program 1 times
[2023-11-01 17:47:29,373 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 17:47:29,373 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830114986]
[2023-11-01 17:47:29,373 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:47:29,373 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 17:47:29,382 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 17:47:29,422 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-11-01 17:47:29,423 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 17:47:29,423 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830114986]
[2023-11-01 17:47:29,423 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830114986] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-01 17:47:29,423 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-01 17:47:29,423 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-01 17:47:29,423 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994780879]
[2023-11-01 17:47:29,424 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-01 17:47:29,424 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-11-01 17:47:29,424 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 17:47:29,424 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-11-01 17:47:29,425 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2023-11-01 17:47:29,463 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 74 out of 143
[2023-11-01 17:47:29,464 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)
[2023-11-01 17:47:29,464 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 17:47:29,464 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 143
[2023-11-01 17:47:29,464 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 17:47:29,592 INFO  L130       PetriNetUnfolder]: 338/685 cut-off events.
[2023-11-01 17:47:29,592 INFO  L131       PetriNetUnfolder]: For 464/478 co-relation queries the response was YES.
[2023-11-01 17:47:29,593 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. 
[2023-11-01 17:47:29,596 INFO  L137   encePairwiseOnDemand]: 139/143 looper letters, 39 selfloop transitions, 3 changer transitions 0/50 dead transitions.
[2023-11-01 17:47:29,596 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 50 transitions, 268 flow
[2023-11-01 17:47:29,597 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-11-01 17:47:29,597 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-11-01 17:47:29,599 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 331 transitions.
[2023-11-01 17:47:29,599 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5786713286713286
[2023-11-01 17:47:29,599 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 331 transitions.
[2023-11-01 17:47:29,599 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 331 transitions.
[2023-11-01 17:47:29,600 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 17:47:29,600 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 331 transitions.
[2023-11-01 17:47:29,602 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)
[2023-11-01 17:47:29,603 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)
[2023-11-01 17:47:29,604 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)
[2023-11-01 17:47:29,604 INFO  L175             Difference]: Start difference. First operand has 38 places, 34 transitions, 124 flow. Second operand 4 states and 331 transitions.
[2023-11-01 17:47:29,604 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 50 transitions, 268 flow
[2023-11-01 17:47:29,606 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 50 transitions, 250 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-01 17:47:29,606 INFO  L231             Difference]: Finished difference. Result has 40 places, 35 transitions, 130 flow
[2023-11-01 17:47:29,607 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}
[2023-11-01 17:47:29,607 INFO  L288   CegarLoopForPetriNet]: 33 programPoint places, 7 predicate places.
[2023-11-01 17:47:29,607 INFO  L495      AbstractCegarLoop]: Abstraction has has 40 places, 35 transitions, 130 flow
[2023-11-01 17:47:29,608 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)
[2023-11-01 17:47:29,608 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 17:47:29,608 INFO  L209   CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1]
[2023-11-01 17:47:29,608 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2023-11-01 17:47:29,608 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)] ===
[2023-11-01 17:47:29,608 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 17:47:29,608 INFO  L85        PathProgramCache]: Analyzing trace with hash -451073316, now seen corresponding path program 1 times
[2023-11-01 17:47:29,609 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 17:47:29,609 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396512574]
[2023-11-01 17:47:29,609 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:47:29,609 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 17:47:29,620 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-01 17:47:29,621 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-11-01 17:47:29,627 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-01 17:47:29,632 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-11-01 17:47:29,632 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-11-01 17:47:29,633 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining)
[2023-11-01 17:47:29,633 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 6 remaining)
[2023-11-01 17:47:29,633 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (3 of 6 remaining)
[2023-11-01 17:47:29,633 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 6 remaining)
[2023-11-01 17:47:29,633 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 6 remaining)
[2023-11-01 17:47:29,633 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 6 remaining)
[2023-11-01 17:47:29,634 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2023-11-01 17:47:29,634 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1]
[2023-11-01 17:47:29,634 WARN  L233   ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-11-01 17:47:29,634 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances.
[2023-11-01 17:47:29,651 INFO  L144    ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions.
[2023-11-01 17:47:29,653 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 103 places, 101 transitions, 232 flow
[2023-11-01 17:47:29,671 INFO  L130       PetriNetUnfolder]: 20/286 cut-off events.
[2023-11-01 17:47:29,671 INFO  L131       PetriNetUnfolder]: For 19/19 co-relation queries the response was YES.
[2023-11-01 17:47:29,672 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. 
[2023-11-01 17:47:29,673 INFO  L82        GeneralOperation]: Start removeDead. Operand has 103 places, 101 transitions, 232 flow
[2023-11-01 17:47:29,674 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 103 places, 101 transitions, 232 flow
[2023-11-01 17:47:29,674 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-11-01 17:47:29,674 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 101 transitions, 232 flow
[2023-11-01 17:47:29,674 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 101 transitions, 232 flow
[2023-11-01 17:47:29,675 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 103 places, 101 transitions, 232 flow
[2023-11-01 17:47:29,701 INFO  L130       PetriNetUnfolder]: 20/286 cut-off events.
[2023-11-01 17:47:29,702 INFO  L131       PetriNetUnfolder]: For 19/19 co-relation queries the response was YES.
[2023-11-01 17:47:29,703 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. 
[2023-11-01 17:47:29,708 INFO  L119        LiptonReduction]: Number of co-enabled transitions 4284
[2023-11-01 17:47:31,256 INFO  L134        LiptonReduction]: Checked pairs total: 10005
[2023-11-01 17:47:31,256 INFO  L136        LiptonReduction]: Total number of compositions: 67
[2023-11-01 17:47:31,258 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-01 17:47:31,260 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;@313263ec, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-11-01 17:47:31,260 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2023-11-01 17:47:31,262 INFO  L130       PetriNetUnfolder]: 0/4 cut-off events.
[2023-11-01 17:47:31,262 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-11-01 17:47:31,262 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 17:47:31,262 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1]
[2023-11-01 17:47:31,263 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)] ===
[2023-11-01 17:47:31,263 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 17:47:31,263 INFO  L85        PathProgramCache]: Analyzing trace with hash 593873, now seen corresponding path program 1 times
[2023-11-01 17:47:31,263 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 17:47:31,264 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092594335]
[2023-11-01 17:47:31,264 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:47:31,264 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 17:47:31,270 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 17:47:31,292 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 17:47:31,292 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 17:47:31,292 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092594335]
[2023-11-01 17:47:31,293 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092594335] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-01 17:47:31,293 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-01 17:47:31,293 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-01 17:47:31,293 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173121513]
[2023-11-01 17:47:31,293 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-01 17:47:31,293 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-01 17:47:31,294 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 17:47:31,294 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-01 17:47:31,294 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-01 17:47:31,315 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 90 out of 168
[2023-11-01 17:47:31,315 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)
[2023-11-01 17:47:31,315 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 17:47:31,315 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 168
[2023-11-01 17:47:31,315 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 17:47:31,613 INFO  L130       PetriNetUnfolder]: 2727/4870 cut-off events.
[2023-11-01 17:47:31,613 INFO  L131       PetriNetUnfolder]: For 394/394 co-relation queries the response was YES.
[2023-11-01 17:47:31,619 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. 
[2023-11-01 17:47:31,637 INFO  L137   encePairwiseOnDemand]: 164/168 looper letters, 29 selfloop transitions, 2 changer transitions 0/43 dead transitions.
[2023-11-01 17:47:31,637 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 43 transitions, 178 flow
[2023-11-01 17:47:31,638 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-01 17:47:31,638 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-01 17:47:31,639 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 303 transitions.
[2023-11-01 17:47:31,639 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6011904761904762
[2023-11-01 17:47:31,639 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 303 transitions.
[2023-11-01 17:47:31,639 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 303 transitions.
[2023-11-01 17:47:31,639 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 17:47:31,639 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 303 transitions.
[2023-11-01 17:47:31,640 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)
[2023-11-01 17:47:31,641 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)
[2023-11-01 17:47:31,641 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)
[2023-11-01 17:47:31,641 INFO  L175             Difference]: Start difference. First operand has 42 places, 38 transitions, 106 flow. Second operand 3 states and 303 transitions.
[2023-11-01 17:47:31,641 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 43 transitions, 178 flow
[2023-11-01 17:47:31,642 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 43 transitions, 178 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-01 17:47:31,643 INFO  L231             Difference]: Finished difference. Result has 44 places, 38 transitions, 116 flow
[2023-11-01 17:47:31,643 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}
[2023-11-01 17:47:31,644 INFO  L288   CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places.
[2023-11-01 17:47:31,644 INFO  L495      AbstractCegarLoop]: Abstraction has has 44 places, 38 transitions, 116 flow
[2023-11-01 17:47:31,644 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)
[2023-11-01 17:47:31,644 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 17:47:31,644 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-11-01 17:47:31,644 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2023-11-01 17:47:31,644 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)] ===
[2023-11-01 17:47:31,645 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 17:47:31,645 INFO  L85        PathProgramCache]: Analyzing trace with hash -688259915, now seen corresponding path program 1 times
[2023-11-01 17:47:31,645 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 17:47:31,645 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525477105]
[2023-11-01 17:47:31,645 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:47:31,645 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 17:47:31,652 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 17:47:31,666 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 17:47:31,666 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 17:47:31,666 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525477105]
[2023-11-01 17:47:31,666 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525477105] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-01 17:47:31,667 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-01 17:47:31,667 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-01 17:47:31,667 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047140924]
[2023-11-01 17:47:31,667 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-01 17:47:31,667 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-01 17:47:31,667 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 17:47:31,667 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-01 17:47:31,668 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-01 17:47:31,692 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 85 out of 168
[2023-11-01 17:47:31,693 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)
[2023-11-01 17:47:31,693 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 17:47:31,693 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 168
[2023-11-01 17:47:31,693 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 17:47:32,246 INFO  L130       PetriNetUnfolder]: 5894/9408 cut-off events.
[2023-11-01 17:47:32,246 INFO  L131       PetriNetUnfolder]: For 1266/1266 co-relation queries the response was YES.
[2023-11-01 17:47:32,256 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. 
[2023-11-01 17:47:32,294 INFO  L137   encePairwiseOnDemand]: 162/168 looper letters, 47 selfloop transitions, 5 changer transitions 0/60 dead transitions.
[2023-11-01 17:47:32,295 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 60 transitions, 289 flow
[2023-11-01 17:47:32,295 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-01 17:47:32,295 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-01 17:47:32,296 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 306 transitions.
[2023-11-01 17:47:32,296 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6071428571428571
[2023-11-01 17:47:32,296 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 306 transitions.
[2023-11-01 17:47:32,296 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 306 transitions.
[2023-11-01 17:47:32,297 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 17:47:32,297 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 306 transitions.
[2023-11-01 17:47:32,298 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)
[2023-11-01 17:47:32,299 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)
[2023-11-01 17:47:32,299 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)
[2023-11-01 17:47:32,299 INFO  L175             Difference]: Start difference. First operand has 44 places, 38 transitions, 116 flow. Second operand 3 states and 306 transitions.
[2023-11-01 17:47:32,299 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 60 transitions, 289 flow
[2023-11-01 17:47:32,301 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 60 transitions, 286 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-11-01 17:47:32,301 INFO  L231             Difference]: Finished difference. Result has 46 places, 42 transitions, 147 flow
[2023-11-01 17:47:32,302 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}
[2023-11-01 17:47:32,302 INFO  L288   CegarLoopForPetriNet]: 42 programPoint places, 4 predicate places.
[2023-11-01 17:47:32,302 INFO  L495      AbstractCegarLoop]: Abstraction has has 46 places, 42 transitions, 147 flow
[2023-11-01 17:47:32,303 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)
[2023-11-01 17:47:32,303 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 17:47:32,303 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-01 17:47:32,303 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2023-11-01 17:47:32,303 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)] ===
[2023-11-01 17:47:32,303 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 17:47:32,303 INFO  L85        PathProgramCache]: Analyzing trace with hash 748844, now seen corresponding path program 1 times
[2023-11-01 17:47:32,303 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 17:47:32,303 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048244612]
[2023-11-01 17:47:32,304 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:47:32,304 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 17:47:32,310 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 17:47:32,345 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-11-01 17:47:32,345 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 17:47:32,345 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048244612]
[2023-11-01 17:47:32,346 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048244612] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-01 17:47:32,346 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-01 17:47:32,346 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-01 17:47:32,346 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186950676]
[2023-11-01 17:47:32,346 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-01 17:47:32,347 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-11-01 17:47:32,347 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 17:47:32,347 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-11-01 17:47:32,348 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2023-11-01 17:47:32,380 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 88 out of 168
[2023-11-01 17:47:32,381 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)
[2023-11-01 17:47:32,381 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 17:47:32,381 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 168
[2023-11-01 17:47:32,381 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 17:47:32,763 INFO  L130       PetriNetUnfolder]: 3162/5514 cut-off events.
[2023-11-01 17:47:32,764 INFO  L131       PetriNetUnfolder]: For 1355/2003 co-relation queries the response was YES.
[2023-11-01 17:47:32,769 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. 
[2023-11-01 17:47:32,782 INFO  L137   encePairwiseOnDemand]: 164/168 looper letters, 44 selfloop transitions, 3 changer transitions 0/60 dead transitions.
[2023-11-01 17:47:32,782 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 60 transitions, 291 flow
[2023-11-01 17:47:32,783 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-11-01 17:47:32,783 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-11-01 17:47:32,784 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 396 transitions.
[2023-11-01 17:47:32,784 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5892857142857143
[2023-11-01 17:47:32,784 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 396 transitions.
[2023-11-01 17:47:32,784 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 396 transitions.
[2023-11-01 17:47:32,785 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 17:47:32,785 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 396 transitions.
[2023-11-01 17:47:32,786 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)
[2023-11-01 17:47:32,786 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)
[2023-11-01 17:47:32,787 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)
[2023-11-01 17:47:32,787 INFO  L175             Difference]: Start difference. First operand has 46 places, 42 transitions, 147 flow. Second operand 4 states and 396 transitions.
[2023-11-01 17:47:32,787 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 60 transitions, 291 flow
[2023-11-01 17:47:32,790 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 60 transitions, 285 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-11-01 17:47:32,790 INFO  L231             Difference]: Finished difference. Result has 49 places, 43 transitions, 158 flow
[2023-11-01 17:47:32,791 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}
[2023-11-01 17:47:32,791 INFO  L288   CegarLoopForPetriNet]: 42 programPoint places, 7 predicate places.
[2023-11-01 17:47:32,791 INFO  L495      AbstractCegarLoop]: Abstraction has has 49 places, 43 transitions, 158 flow
[2023-11-01 17:47:32,791 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)
[2023-11-01 17:47:32,791 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 17:47:32,792 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-01 17:47:32,792 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2023-11-01 17:47:32,792 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)] ===
[2023-11-01 17:47:32,792 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 17:47:32,792 INFO  L85        PathProgramCache]: Analyzing trace with hash 1458128080, now seen corresponding path program 1 times
[2023-11-01 17:47:32,792 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 17:47:32,792 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697078403]
[2023-11-01 17:47:32,792 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:47:32,792 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 17:47:32,799 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 17:47:32,815 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2023-11-01 17:47:32,815 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 17:47:32,815 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697078403]
[2023-11-01 17:47:32,815 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697078403] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-01 17:47:32,815 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-01 17:47:32,815 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-01 17:47:32,815 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449990619]
[2023-11-01 17:47:32,815 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-01 17:47:32,816 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-01 17:47:32,816 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 17:47:32,816 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-01 17:47:32,816 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-01 17:47:32,837 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 85 out of 168
[2023-11-01 17:47:32,837 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)
[2023-11-01 17:47:32,837 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 17:47:32,837 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 168
[2023-11-01 17:47:32,837 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 17:47:33,377 INFO  L130       PetriNetUnfolder]: 5570/9148 cut-off events.
[2023-11-01 17:47:33,377 INFO  L131       PetriNetUnfolder]: For 4659/4832 co-relation queries the response was YES.
[2023-11-01 17:47:33,386 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. 
[2023-11-01 17:47:33,408 INFO  L137   encePairwiseOnDemand]: 161/168 looper letters, 49 selfloop transitions, 9 changer transitions 0/67 dead transitions.
[2023-11-01 17:47:33,408 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 67 transitions, 360 flow
[2023-11-01 17:47:33,408 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-01 17:47:33,408 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-01 17:47:33,409 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 306 transitions.
[2023-11-01 17:47:33,409 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6071428571428571
[2023-11-01 17:47:33,409 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 306 transitions.
[2023-11-01 17:47:33,409 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 306 transitions.
[2023-11-01 17:47:33,410 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 17:47:33,410 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 306 transitions.
[2023-11-01 17:47:33,410 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)
[2023-11-01 17:47:33,411 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)
[2023-11-01 17:47:33,411 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)
[2023-11-01 17:47:33,411 INFO  L175             Difference]: Start difference. First operand has 49 places, 43 transitions, 158 flow. Second operand 3 states and 306 transitions.
[2023-11-01 17:47:33,411 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 67 transitions, 360 flow
[2023-11-01 17:47:33,421 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 67 transitions, 355 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-01 17:47:33,422 INFO  L231             Difference]: Finished difference. Result has 51 places, 50 transitions, 234 flow
[2023-11-01 17:47:33,422 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}
[2023-11-01 17:47:33,423 INFO  L288   CegarLoopForPetriNet]: 42 programPoint places, 9 predicate places.
[2023-11-01 17:47:33,423 INFO  L495      AbstractCegarLoop]: Abstraction has has 51 places, 50 transitions, 234 flow
[2023-11-01 17:47:33,423 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)
[2023-11-01 17:47:33,424 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 17:47:33,424 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-01 17:47:33,424 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2023-11-01 17:47:33,424 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)] ===
[2023-11-01 17:47:33,424 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 17:47:33,424 INFO  L85        PathProgramCache]: Analyzing trace with hash 758787877, now seen corresponding path program 1 times
[2023-11-01 17:47:33,425 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 17:47:33,425 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989807368]
[2023-11-01 17:47:33,425 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:47:33,425 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 17:47:33,437 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 17:47:33,485 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-11-01 17:47:33,485 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 17:47:33,485 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989807368]
[2023-11-01 17:47:33,485 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989807368] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-01 17:47:33,485 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-01 17:47:33,486 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-01 17:47:33,486 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367151777]
[2023-11-01 17:47:33,486 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-01 17:47:33,486 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-01 17:47:33,486 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 17:47:33,486 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-01 17:47:33,486 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-01 17:47:33,505 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 86 out of 168
[2023-11-01 17:47:33,506 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)
[2023-11-01 17:47:33,506 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 17:47:33,506 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 168
[2023-11-01 17:47:33,506 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 17:47:33,664 INFO  L130       PetriNetUnfolder]: 597/1538 cut-off events.
[2023-11-01 17:47:33,664 INFO  L131       PetriNetUnfolder]: For 1066/1084 co-relation queries the response was YES.
[2023-11-01 17:47:33,665 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. 
[2023-11-01 17:47:33,668 INFO  L137   encePairwiseOnDemand]: 162/168 looper letters, 36 selfloop transitions, 7 changer transitions 0/56 dead transitions.
[2023-11-01 17:47:33,668 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 56 transitions, 331 flow
[2023-11-01 17:47:33,668 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-01 17:47:33,668 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-01 17:47:33,669 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 297 transitions.
[2023-11-01 17:47:33,669 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5892857142857143
[2023-11-01 17:47:33,669 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 297 transitions.
[2023-11-01 17:47:33,669 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 297 transitions.
[2023-11-01 17:47:33,670 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 17:47:33,670 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 297 transitions.
[2023-11-01 17:47:33,670 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)
[2023-11-01 17:47:33,671 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)
[2023-11-01 17:47:33,671 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)
[2023-11-01 17:47:33,671 INFO  L175             Difference]: Start difference. First operand has 51 places, 50 transitions, 234 flow. Second operand 3 states and 297 transitions.
[2023-11-01 17:47:33,671 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 56 transitions, 331 flow
[2023-11-01 17:47:33,674 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 56 transitions, 319 flow, removed 2 selfloop flow, removed 2 redundant places.
[2023-11-01 17:47:33,675 INFO  L231             Difference]: Finished difference. Result has 51 places, 44 transitions, 188 flow
[2023-11-01 17:47:33,675 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}
[2023-11-01 17:47:33,675 INFO  L288   CegarLoopForPetriNet]: 42 programPoint places, 9 predicate places.
[2023-11-01 17:47:33,676 INFO  L495      AbstractCegarLoop]: Abstraction has has 51 places, 44 transitions, 188 flow
[2023-11-01 17:47:33,676 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)
[2023-11-01 17:47:33,676 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 17:47:33,676 INFO  L209   CegarLoopForPetriNet]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1]
[2023-11-01 17:47:33,676 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2023-11-01 17:47:33,676 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)] ===
[2023-11-01 17:47:33,676 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 17:47:33,676 INFO  L85        PathProgramCache]: Analyzing trace with hash 1193880284, now seen corresponding path program 1 times
[2023-11-01 17:47:33,677 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 17:47:33,677 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699792671]
[2023-11-01 17:47:33,677 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:47:33,677 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 17:47:33,687 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-01 17:47:33,687 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-11-01 17:47:33,694 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-01 17:47:33,698 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-11-01 17:47:33,698 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-11-01 17:47:33,698 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining)
[2023-11-01 17:47:33,698 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining)
[2023-11-01 17:47:33,698 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining)
[2023-11-01 17:47:33,698 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining)
[2023-11-01 17:47:33,699 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining)
[2023-11-01 17:47:33,699 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining)
[2023-11-01 17:47:33,699 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining)
[2023-11-01 17:47:33,699 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2023-11-01 17:47:33,699 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1]
[2023-11-01 17:47:33,699 WARN  L233   ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-11-01 17:47:33,699 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances.
[2023-11-01 17:47:33,720 INFO  L144    ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions.
[2023-11-01 17:47:33,722 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 120 places, 117 transitions, 278 flow
[2023-11-01 17:47:33,753 INFO  L130       PetriNetUnfolder]: 42/501 cut-off events.
[2023-11-01 17:47:33,753 INFO  L131       PetriNetUnfolder]: For 48/48 co-relation queries the response was YES.
[2023-11-01 17:47:33,755 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. 
[2023-11-01 17:47:33,755 INFO  L82        GeneralOperation]: Start removeDead. Operand has 120 places, 117 transitions, 278 flow
[2023-11-01 17:47:33,756 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 120 places, 117 transitions, 278 flow
[2023-11-01 17:47:33,757 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-11-01 17:47:33,757 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 117 transitions, 278 flow
[2023-11-01 17:47:33,757 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 117 transitions, 278 flow
[2023-11-01 17:47:33,757 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 120 places, 117 transitions, 278 flow
[2023-11-01 17:47:33,786 INFO  L130       PetriNetUnfolder]: 42/501 cut-off events.
[2023-11-01 17:47:33,786 INFO  L131       PetriNetUnfolder]: For 48/48 co-relation queries the response was YES.
[2023-11-01 17:47:33,787 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. 
[2023-11-01 17:47:33,795 INFO  L119        LiptonReduction]: Number of co-enabled transitions 6664
[2023-11-01 17:47:35,263 INFO  L134        LiptonReduction]: Checked pairs total: 16804
[2023-11-01 17:47:35,263 INFO  L136        LiptonReduction]: Total number of compositions: 75
[2023-11-01 17:47:35,265 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-01 17:47:35,266 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;@313263ec, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-11-01 17:47:35,266 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 8 error locations.
[2023-11-01 17:47:35,267 INFO  L130       PetriNetUnfolder]: 0/5 cut-off events.
[2023-11-01 17:47:35,267 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-11-01 17:47:35,267 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 17:47:35,267 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1]
[2023-11-01 17:47:35,268 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)] ===
[2023-11-01 17:47:35,268 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 17:47:35,268 INFO  L85        PathProgramCache]: Analyzing trace with hash 800324, now seen corresponding path program 1 times
[2023-11-01 17:47:35,268 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 17:47:35,268 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986081432]
[2023-11-01 17:47:35,268 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:47:35,269 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 17:47:35,273 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 17:47:35,288 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 17:47:35,288 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 17:47:35,288 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986081432]
[2023-11-01 17:47:35,289 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986081432] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-01 17:47:35,289 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-01 17:47:35,289 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-01 17:47:35,289 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348179042]
[2023-11-01 17:47:35,289 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-01 17:47:35,289 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-01 17:47:35,289 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 17:47:35,289 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-01 17:47:35,289 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-01 17:47:35,305 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 104 out of 192
[2023-11-01 17:47:35,306 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)
[2023-11-01 17:47:35,306 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 17:47:35,306 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 192
[2023-11-01 17:47:35,306 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 17:47:37,358 INFO  L130       PetriNetUnfolder]: 24683/37289 cut-off events.
[2023-11-01 17:47:37,358 INFO  L131       PetriNetUnfolder]: For 3846/3846 co-relation queries the response was YES.
[2023-11-01 17:47:37,397 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. 
[2023-11-01 17:47:37,496 INFO  L137   encePairwiseOnDemand]: 188/192 looper letters, 36 selfloop transitions, 2 changer transitions 0/51 dead transitions.
[2023-11-01 17:47:37,496 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 51 transitions, 222 flow
[2023-11-01 17:47:37,497 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-01 17:47:37,497 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-01 17:47:37,497 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 352 transitions.
[2023-11-01 17:47:37,498 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6111111111111112
[2023-11-01 17:47:37,498 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 352 transitions.
[2023-11-01 17:47:37,498 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 352 transitions.
[2023-11-01 17:47:37,498 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 17:47:37,498 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 352 transitions.
[2023-11-01 17:47:37,499 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)
[2023-11-01 17:47:37,499 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)
[2023-11-01 17:47:37,500 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)
[2023-11-01 17:47:37,500 INFO  L175             Difference]: Start difference. First operand has 51 places, 46 transitions, 136 flow. Second operand 3 states and 352 transitions.
[2023-11-01 17:47:37,500 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 51 transitions, 222 flow
[2023-11-01 17:47:37,501 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 51 transitions, 222 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-01 17:47:37,501 INFO  L231             Difference]: Finished difference. Result has 53 places, 46 transitions, 146 flow
[2023-11-01 17:47:37,501 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}
[2023-11-01 17:47:37,502 INFO  L288   CegarLoopForPetriNet]: 51 programPoint places, 2 predicate places.
[2023-11-01 17:47:37,502 INFO  L495      AbstractCegarLoop]: Abstraction has has 53 places, 46 transitions, 146 flow
[2023-11-01 17:47:37,502 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)
[2023-11-01 17:47:37,502 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 17:47:37,502 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-11-01 17:47:37,502 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2023-11-01 17:47:37,502 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)] ===
[2023-11-01 17:47:37,503 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 17:47:37,503 INFO  L85        PathProgramCache]: Analyzing trace with hash 1106516575, now seen corresponding path program 1 times
[2023-11-01 17:47:37,503 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 17:47:37,503 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514510027]
[2023-11-01 17:47:37,503 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:47:37,503 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 17:47:37,508 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 17:47:37,519 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 17:47:37,519 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 17:47:37,519 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514510027]
[2023-11-01 17:47:37,519 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514510027] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-01 17:47:37,520 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-01 17:47:37,520 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-01 17:47:37,520 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316867575]
[2023-11-01 17:47:37,520 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-01 17:47:37,520 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-01 17:47:37,520 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 17:47:37,520 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-01 17:47:37,520 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-01 17:47:37,538 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 98 out of 192
[2023-11-01 17:47:37,539 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)
[2023-11-01 17:47:37,539 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 17:47:37,539 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 192
[2023-11-01 17:47:37,539 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 17:47:41,933 INFO  L130       PetriNetUnfolder]: 60474/86524 cut-off events.
[2023-11-01 17:47:41,934 INFO  L131       PetriNetUnfolder]: For 12171/12171 co-relation queries the response was YES.
[2023-11-01 17:47:42,076 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. 
[2023-11-01 17:47:42,425 INFO  L137   encePairwiseOnDemand]: 184/192 looper letters, 60 selfloop transitions, 7 changer transitions 0/76 dead transitions.
[2023-11-01 17:47:42,426 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 76 transitions, 377 flow
[2023-11-01 17:47:42,427 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-01 17:47:42,427 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-01 17:47:42,428 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 360 transitions.
[2023-11-01 17:47:42,428 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.625
[2023-11-01 17:47:42,428 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 360 transitions.
[2023-11-01 17:47:42,428 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 360 transitions.
[2023-11-01 17:47:42,429 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 17:47:42,429 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 360 transitions.
[2023-11-01 17:47:42,430 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)
[2023-11-01 17:47:42,431 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)
[2023-11-01 17:47:42,431 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)
[2023-11-01 17:47:42,431 INFO  L175             Difference]: Start difference. First operand has 53 places, 46 transitions, 146 flow. Second operand 3 states and 360 transitions.
[2023-11-01 17:47:42,431 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 76 transitions, 377 flow
[2023-11-01 17:47:42,434 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 76 transitions, 374 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-11-01 17:47:42,435 INFO  L231             Difference]: Finished difference. Result has 56 places, 52 transitions, 198 flow
[2023-11-01 17:47:42,435 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}
[2023-11-01 17:47:42,435 INFO  L288   CegarLoopForPetriNet]: 51 programPoint places, 5 predicate places.
[2023-11-01 17:47:42,435 INFO  L495      AbstractCegarLoop]: Abstraction has has 56 places, 52 transitions, 198 flow
[2023-11-01 17:47:42,435 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)
[2023-11-01 17:47:42,436 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 17:47:42,436 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-01 17:47:42,436 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2023-11-01 17:47:42,436 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)] ===
[2023-11-01 17:47:42,436 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 17:47:42,436 INFO  L85        PathProgramCache]: Analyzing trace with hash -212253915, now seen corresponding path program 1 times
[2023-11-01 17:47:42,436 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 17:47:42,436 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197970791]
[2023-11-01 17:47:42,437 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:47:42,437 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 17:47:42,442 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 17:47:42,468 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-11-01 17:47:42,469 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 17:47:42,469 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197970791]
[2023-11-01 17:47:42,469 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197970791] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-01 17:47:42,469 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-01 17:47:42,469 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-01 17:47:42,469 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688447703]
[2023-11-01 17:47:42,469 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-01 17:47:42,469 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-11-01 17:47:42,470 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 17:47:42,470 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-11-01 17:47:42,470 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2023-11-01 17:47:42,508 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 102 out of 192
[2023-11-01 17:47:42,508 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)
[2023-11-01 17:47:42,509 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 17:47:42,509 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 192
[2023-11-01 17:47:42,509 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 17:47:46,084 INFO  L130       PetriNetUnfolder]: 38334/57310 cut-off events.
[2023-11-01 17:47:46,084 INFO  L131       PetriNetUnfolder]: For 26058/31476 co-relation queries the response was YES.
[2023-11-01 17:47:46,222 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. 
[2023-11-01 17:47:46,461 INFO  L137   encePairwiseOnDemand]: 188/192 looper letters, 61 selfloop transitions, 3 changer transitions 0/78 dead transitions.
[2023-11-01 17:47:46,462 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 78 transitions, 408 flow
[2023-11-01 17:47:46,463 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-11-01 17:47:46,463 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-11-01 17:47:46,465 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 465 transitions.
[2023-11-01 17:47:46,465 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.60546875
[2023-11-01 17:47:46,466 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 465 transitions.
[2023-11-01 17:47:46,466 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 465 transitions.
[2023-11-01 17:47:46,466 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 17:47:46,467 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 465 transitions.
[2023-11-01 17:47:46,469 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)
[2023-11-01 17:47:46,471 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)
[2023-11-01 17:47:46,472 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)
[2023-11-01 17:47:46,472 INFO  L175             Difference]: Start difference. First operand has 56 places, 52 transitions, 198 flow. Second operand 4 states and 465 transitions.
[2023-11-01 17:47:46,472 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 78 transitions, 408 flow
[2023-11-01 17:47:46,543 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 78 transitions, 388 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-01 17:47:46,544 INFO  L231             Difference]: Finished difference. Result has 58 places, 53 transitions, 200 flow
[2023-11-01 17:47:46,545 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}
[2023-11-01 17:47:46,545 INFO  L288   CegarLoopForPetriNet]: 51 programPoint places, 7 predicate places.
[2023-11-01 17:47:46,545 INFO  L495      AbstractCegarLoop]: Abstraction has has 58 places, 53 transitions, 200 flow
[2023-11-01 17:47:46,545 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)
[2023-11-01 17:47:46,545 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 17:47:46,546 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-01 17:47:46,546 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2023-11-01 17:47:46,546 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)] ===
[2023-11-01 17:47:46,546 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 17:47:46,546 INFO  L85        PathProgramCache]: Analyzing trace with hash -331384400, now seen corresponding path program 1 times
[2023-11-01 17:47:46,546 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 17:47:46,546 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347315158]
[2023-11-01 17:47:46,546 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:47:46,547 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 17:47:46,554 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 17:47:46,566 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2023-11-01 17:47:46,566 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 17:47:46,567 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347315158]
[2023-11-01 17:47:46,567 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347315158] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-01 17:47:46,567 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-01 17:47:46,567 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-01 17:47:46,567 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770196992]
[2023-11-01 17:47:46,567 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-01 17:47:46,567 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-01 17:47:46,567 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 17:47:46,568 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-01 17:47:46,568 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-01 17:47:46,595 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 98 out of 192
[2023-11-01 17:47:46,595 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)
[2023-11-01 17:47:46,595 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 17:47:46,596 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 192
[2023-11-01 17:47:46,596 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 17:47:51,502 INFO  L130       PetriNetUnfolder]: 57579/84704 cut-off events.
[2023-11-01 17:47:51,502 INFO  L131       PetriNetUnfolder]: For 41510/43076 co-relation queries the response was YES.
[2023-11-01 17:47:51,661 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. 
[2023-11-01 17:47:51,976 INFO  L137   encePairwiseOnDemand]: 185/192 looper letters, 64 selfloop transitions, 10 changer transitions 0/84 dead transitions.
[2023-11-01 17:47:51,976 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 84 transitions, 466 flow
[2023-11-01 17:47:51,977 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-01 17:47:51,977 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-01 17:47:51,978 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 358 transitions.
[2023-11-01 17:47:51,978 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6215277777777778
[2023-11-01 17:47:51,978 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 358 transitions.
[2023-11-01 17:47:51,979 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 358 transitions.
[2023-11-01 17:47:51,979 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 17:47:51,979 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 358 transitions.
[2023-11-01 17:47:51,980 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)
[2023-11-01 17:47:51,980 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)
[2023-11-01 17:47:51,981 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)
[2023-11-01 17:47:51,981 INFO  L175             Difference]: Start difference. First operand has 58 places, 53 transitions, 200 flow. Second operand 3 states and 358 transitions.
[2023-11-01 17:47:51,981 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 84 transitions, 466 flow
[2023-11-01 17:47:52,218 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 84 transitions, 461 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-01 17:47:52,219 INFO  L231             Difference]: Finished difference. Result has 59 places, 61 transitions, 278 flow
[2023-11-01 17:47:52,220 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}
[2023-11-01 17:47:52,220 INFO  L288   CegarLoopForPetriNet]: 51 programPoint places, 8 predicate places.
[2023-11-01 17:47:52,220 INFO  L495      AbstractCegarLoop]: Abstraction has has 59 places, 61 transitions, 278 flow
[2023-11-01 17:47:52,220 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)
[2023-11-01 17:47:52,220 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 17:47:52,220 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-01 17:47:52,221 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2023-11-01 17:47:52,221 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)] ===
[2023-11-01 17:47:52,221 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 17:47:52,221 INFO  L85        PathProgramCache]: Analyzing trace with hash -1115597400, now seen corresponding path program 1 times
[2023-11-01 17:47:52,221 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 17:47:52,221 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959360464]
[2023-11-01 17:47:52,221 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:47:52,222 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 17:47:52,229 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 17:47:52,263 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-11-01 17:47:52,264 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 17:47:52,264 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959360464]
[2023-11-01 17:47:52,264 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959360464] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-01 17:47:52,264 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-01 17:47:52,264 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-01 17:47:52,264 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637013468]
[2023-11-01 17:47:52,264 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-01 17:47:52,264 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-01 17:47:52,264 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 17:47:52,265 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-01 17:47:52,265 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-01 17:47:52,287 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 98 out of 192
[2023-11-01 17:47:52,288 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)
[2023-11-01 17:47:52,288 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 17:47:52,288 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 192
[2023-11-01 17:47:52,288 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 17:47:52,772 INFO  L130       PetriNetUnfolder]: 2527/6028 cut-off events.
[2023-11-01 17:47:52,772 INFO  L131       PetriNetUnfolder]: For 4664/4747 co-relation queries the response was YES.
[2023-11-01 17:47:52,781 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. 
[2023-11-01 17:47:52,792 INFO  L137   encePairwiseOnDemand]: 184/192 looper letters, 43 selfloop transitions, 9 changer transitions 0/66 dead transitions.
[2023-11-01 17:47:52,792 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 66 transitions, 394 flow
[2023-11-01 17:47:52,793 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-01 17:47:52,793 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-01 17:47:52,793 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 343 transitions.
[2023-11-01 17:47:52,794 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5954861111111112
[2023-11-01 17:47:52,794 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 343 transitions.
[2023-11-01 17:47:52,794 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 343 transitions.
[2023-11-01 17:47:52,794 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 17:47:52,794 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 343 transitions.
[2023-11-01 17:47:52,795 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)
[2023-11-01 17:47:52,796 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)
[2023-11-01 17:47:52,796 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)
[2023-11-01 17:47:52,796 INFO  L175             Difference]: Start difference. First operand has 59 places, 61 transitions, 278 flow. Second operand 3 states and 343 transitions.
[2023-11-01 17:47:52,796 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 66 transitions, 394 flow
[2023-11-01 17:47:52,806 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 66 transitions, 387 flow, removed 2 selfloop flow, removed 1 redundant places.
[2023-11-01 17:47:52,807 INFO  L231             Difference]: Finished difference. Result has 60 places, 52 transitions, 226 flow
[2023-11-01 17:47:52,807 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}
[2023-11-01 17:47:52,807 INFO  L288   CegarLoopForPetriNet]: 51 programPoint places, 9 predicate places.
[2023-11-01 17:47:52,807 INFO  L495      AbstractCegarLoop]: Abstraction has has 60 places, 52 transitions, 226 flow
[2023-11-01 17:47:52,808 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)
[2023-11-01 17:47:52,808 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 17:47:52,808 INFO  L209   CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-01 17:47:52,808 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2023-11-01 17:47:52,808 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)] ===
[2023-11-01 17:47:52,808 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 17:47:52,808 INFO  L85        PathProgramCache]: Analyzing trace with hash 1876298133, now seen corresponding path program 1 times
[2023-11-01 17:47:52,808 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 17:47:52,808 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179166949]
[2023-11-01 17:47:52,808 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:47:52,809 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 17:47:52,820 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 17:47:52,835 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2023-11-01 17:47:52,835 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 17:47:52,835 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179166949]
[2023-11-01 17:47:52,836 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179166949] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-01 17:47:52,836 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-01 17:47:52,836 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-01 17:47:52,836 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465803596]
[2023-11-01 17:47:52,836 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-01 17:47:52,836 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-01 17:47:52,836 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 17:47:52,836 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-01 17:47:52,837 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-01 17:47:52,861 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 98 out of 192
[2023-11-01 17:47:52,861 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)
[2023-11-01 17:47:52,861 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 17:47:52,861 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 192
[2023-11-01 17:47:52,861 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 17:47:53,370 INFO  L130       PetriNetUnfolder]: 3015/7284 cut-off events.
[2023-11-01 17:47:53,371 INFO  L131       PetriNetUnfolder]: For 6022/6152 co-relation queries the response was YES.
[2023-11-01 17:47:53,382 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. 
[2023-11-01 17:47:53,396 INFO  L137   encePairwiseOnDemand]: 188/192 looper letters, 50 selfloop transitions, 3 changer transitions 0/63 dead transitions.
[2023-11-01 17:47:53,396 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 63 transitions, 384 flow
[2023-11-01 17:47:53,397 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-01 17:47:53,397 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-01 17:47:53,398 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 342 transitions.
[2023-11-01 17:47:53,398 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.59375
[2023-11-01 17:47:53,398 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 342 transitions.
[2023-11-01 17:47:53,398 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 342 transitions.
[2023-11-01 17:47:53,398 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 17:47:53,398 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 342 transitions.
[2023-11-01 17:47:53,399 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)
[2023-11-01 17:47:53,400 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)
[2023-11-01 17:47:53,400 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)
[2023-11-01 17:47:53,400 INFO  L175             Difference]: Start difference. First operand has 60 places, 52 transitions, 226 flow. Second operand 3 states and 342 transitions.
[2023-11-01 17:47:53,400 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 63 transitions, 384 flow
[2023-11-01 17:47:53,405 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 63 transitions, 375 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-11-01 17:47:53,406 INFO  L231             Difference]: Finished difference. Result has 62 places, 54 transitions, 242 flow
[2023-11-01 17:47:53,406 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}
[2023-11-01 17:47:53,407 INFO  L288   CegarLoopForPetriNet]: 51 programPoint places, 11 predicate places.
[2023-11-01 17:47:53,407 INFO  L495      AbstractCegarLoop]: Abstraction has has 62 places, 54 transitions, 242 flow
[2023-11-01 17:47:53,407 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)
[2023-11-01 17:47:53,407 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 17:47:53,407 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-01 17:47:53,407 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2023-11-01 17:47:53,407 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)] ===
[2023-11-01 17:47:53,408 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 17:47:53,408 INFO  L85        PathProgramCache]: Analyzing trace with hash -80043298, now seen corresponding path program 1 times
[2023-11-01 17:47:53,408 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 17:47:53,408 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749774875]
[2023-11-01 17:47:53,408 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:47:53,408 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 17:47:53,428 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 17:47:53,446 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2023-11-01 17:47:53,446 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 17:47:53,446 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749774875]
[2023-11-01 17:47:53,446 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749774875] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-01 17:47:53,446 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-01 17:47:53,446 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-01 17:47:53,446 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666601095]
[2023-11-01 17:47:53,446 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-01 17:47:53,447 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-01 17:47:53,447 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 17:47:53,447 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-01 17:47:53,447 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-01 17:47:53,468 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 100 out of 192
[2023-11-01 17:47:53,469 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)
[2023-11-01 17:47:53,469 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 17:47:53,469 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 192
[2023-11-01 17:47:53,469 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 17:47:54,270 INFO  L130       PetriNetUnfolder]: 4287/9592 cut-off events.
[2023-11-01 17:47:54,270 INFO  L131       PetriNetUnfolder]: For 8855/8972 co-relation queries the response was YES.
[2023-11-01 17:47:54,281 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. 
[2023-11-01 17:47:54,294 INFO  L137   encePairwiseOnDemand]: 185/192 looper letters, 58 selfloop transitions, 9 changer transitions 0/76 dead transitions.
[2023-11-01 17:47:54,295 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 76 transitions, 456 flow
[2023-11-01 17:47:54,295 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-01 17:47:54,295 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-01 17:47:54,296 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 360 transitions.
[2023-11-01 17:47:54,296 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.625
[2023-11-01 17:47:54,296 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 360 transitions.
[2023-11-01 17:47:54,296 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 360 transitions.
[2023-11-01 17:47:54,296 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 17:47:54,297 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 360 transitions.
[2023-11-01 17:47:54,297 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)
[2023-11-01 17:47:54,298 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)
[2023-11-01 17:47:54,298 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)
[2023-11-01 17:47:54,298 INFO  L175             Difference]: Start difference. First operand has 62 places, 54 transitions, 242 flow. Second operand 3 states and 360 transitions.
[2023-11-01 17:47:54,299 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 76 transitions, 456 flow
[2023-11-01 17:47:54,305 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 76 transitions, 447 flow, removed 2 selfloop flow, removed 1 redundant places.
[2023-11-01 17:47:54,306 INFO  L231             Difference]: Finished difference. Result has 65 places, 59 transitions, 311 flow
[2023-11-01 17:47:54,306 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}
[2023-11-01 17:47:54,307 INFO  L288   CegarLoopForPetriNet]: 51 programPoint places, 14 predicate places.
[2023-11-01 17:47:54,307 INFO  L495      AbstractCegarLoop]: Abstraction has has 65 places, 59 transitions, 311 flow
[2023-11-01 17:47:54,307 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)
[2023-11-01 17:47:54,307 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 17:47:54,307 INFO  L209   CegarLoopForPetriNet]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1]
[2023-11-01 17:47:54,307 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2023-11-01 17:47:54,308 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)] ===
[2023-11-01 17:47:54,308 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 17:47:54,308 INFO  L85        PathProgramCache]: Analyzing trace with hash -578804479, now seen corresponding path program 1 times
[2023-11-01 17:47:54,308 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 17:47:54,308 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031436785]
[2023-11-01 17:47:54,308 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:47:54,308 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 17:47:54,318 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 17:47:54,386 INFO  L134       CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 17:47:54,387 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 17:47:54,387 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031436785]
[2023-11-01 17:47:54,387 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031436785] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-01 17:47:54,387 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655531947]
[2023-11-01 17:47:54,387 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:47:54,387 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-01 17:47:54,387 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-01 17:47:54,389 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-01 17:47:54,392 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2023-11-01 17:47:54,475 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 17:47:54,478 INFO  L263         TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 7 conjunts are in the unsatisfiable core
[2023-11-01 17:47:54,480 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-01 17:47:54,673 INFO  L134       CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 17:47:54,673 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-11-01 17:47:54,673 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [655531947] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-01 17:47:54,673 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2023-11-01 17:47:54,674 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11
[2023-11-01 17:47:54,674 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363774585]
[2023-11-01 17:47:54,674 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-01 17:47:54,674 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2023-11-01 17:47:54,674 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 17:47:54,675 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2023-11-01 17:47:54,675 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132
[2023-11-01 17:47:54,716 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 103 out of 192
[2023-11-01 17:47:54,717 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)
[2023-11-01 17:47:54,717 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 17:47:54,717 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 192
[2023-11-01 17:47:54,717 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 17:47:55,403 INFO  L130       PetriNetUnfolder]: 3360/8640 cut-off events.
[2023-11-01 17:47:55,403 INFO  L131       PetriNetUnfolder]: For 11492/12199 co-relation queries the response was YES.
[2023-11-01 17:47:55,418 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. 
[2023-11-01 17:47:55,433 INFO  L137   encePairwiseOnDemand]: 189/192 looper letters, 104 selfloop transitions, 5 changer transitions 8/134 dead transitions.
[2023-11-01 17:47:55,433 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 134 transitions, 865 flow
[2023-11-01 17:47:55,434 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2023-11-01 17:47:55,434 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-11-01 17:47:55,435 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 819 transitions.
[2023-11-01 17:47:55,436 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.609375
[2023-11-01 17:47:55,436 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 819 transitions.
[2023-11-01 17:47:55,436 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 819 transitions.
[2023-11-01 17:47:55,436 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 17:47:55,437 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 819 transitions.
[2023-11-01 17:47:55,438 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)
[2023-11-01 17:47:55,439 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)
[2023-11-01 17:47:55,440 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)
[2023-11-01 17:47:55,440 INFO  L175             Difference]: Start difference. First operand has 65 places, 59 transitions, 311 flow. Second operand 7 states and 819 transitions.
[2023-11-01 17:47:55,440 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 134 transitions, 865 flow
[2023-11-01 17:47:55,511 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 134 transitions, 827 flow, removed 0 selfloop flow, removed 4 redundant places.
[2023-11-01 17:47:55,513 INFO  L231             Difference]: Finished difference. Result has 67 places, 60 transitions, 300 flow
[2023-11-01 17:47:55,513 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}
[2023-11-01 17:47:55,513 INFO  L288   CegarLoopForPetriNet]: 51 programPoint places, 16 predicate places.
[2023-11-01 17:47:55,513 INFO  L495      AbstractCegarLoop]: Abstraction has has 67 places, 60 transitions, 300 flow
[2023-11-01 17:47:55,514 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)
[2023-11-01 17:47:55,514 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 17:47:55,514 INFO  L209   CegarLoopForPetriNet]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-01 17:47:55,527 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2023-11-01 17:47:55,715 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
[2023-11-01 17:47:55,716 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)] ===
[2023-11-01 17:47:55,717 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 17:47:55,717 INFO  L85        PathProgramCache]: Analyzing trace with hash -573613133, now seen corresponding path program 1 times
[2023-11-01 17:47:55,717 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 17:47:55,718 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918474413]
[2023-11-01 17:47:55,718 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:47:55,718 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 17:47:55,729 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 17:47:55,744 INFO  L134       CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked.
[2023-11-01 17:47:55,744 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 17:47:55,744 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918474413]
[2023-11-01 17:47:55,745 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918474413] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-01 17:47:55,745 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-01 17:47:55,745 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-01 17:47:55,745 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063066283]
[2023-11-01 17:47:55,745 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-01 17:47:55,745 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-01 17:47:55,746 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 17:47:55,746 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-01 17:47:55,746 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-01 17:47:55,772 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 98 out of 192
[2023-11-01 17:47:55,773 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)
[2023-11-01 17:47:55,773 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 17:47:55,773 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 192
[2023-11-01 17:47:55,773 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 17:47:56,415 INFO  L130       PetriNetUnfolder]: 3905/9449 cut-off events.
[2023-11-01 17:47:56,416 INFO  L131       PetriNetUnfolder]: For 12716/12924 co-relation queries the response was YES.
[2023-11-01 17:47:56,432 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. 
[2023-11-01 17:47:56,448 INFO  L137   encePairwiseOnDemand]: 188/192 looper letters, 54 selfloop transitions, 4 changer transitions 1/69 dead transitions.
[2023-11-01 17:47:56,448 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 69 transitions, 464 flow
[2023-11-01 17:47:56,449 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-01 17:47:56,449 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-01 17:47:56,451 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 340 transitions.
[2023-11-01 17:47:56,452 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5902777777777778
[2023-11-01 17:47:56,452 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 340 transitions.
[2023-11-01 17:47:56,452 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 340 transitions.
[2023-11-01 17:47:56,453 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 17:47:56,453 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 340 transitions.
[2023-11-01 17:47:56,455 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)
[2023-11-01 17:47:56,456 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)
[2023-11-01 17:47:56,456 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)
[2023-11-01 17:47:56,456 INFO  L175             Difference]: Start difference. First operand has 67 places, 60 transitions, 300 flow. Second operand 3 states and 340 transitions.
[2023-11-01 17:47:56,456 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 69 transitions, 464 flow
[2023-11-01 17:47:56,462 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 69 transitions, 461 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-01 17:47:56,463 INFO  L231             Difference]: Finished difference. Result has 68 places, 62 transitions, 329 flow
[2023-11-01 17:47:56,464 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}
[2023-11-01 17:47:56,464 INFO  L288   CegarLoopForPetriNet]: 51 programPoint places, 17 predicate places.
[2023-11-01 17:47:56,464 INFO  L495      AbstractCegarLoop]: Abstraction has has 68 places, 62 transitions, 329 flow
[2023-11-01 17:47:56,464 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)
[2023-11-01 17:47:56,465 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 17:47:56,465 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]
[2023-11-01 17:47:56,465 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2023-11-01 17:47:56,465 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)] ===
[2023-11-01 17:47:56,466 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 17:47:56,466 INFO  L85        PathProgramCache]: Analyzing trace with hash -1073911570, now seen corresponding path program 1 times
[2023-11-01 17:47:56,466 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 17:47:56,466 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422981599]
[2023-11-01 17:47:56,467 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:47:56,467 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 17:47:56,477 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 17:47:56,525 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2023-11-01 17:47:56,525 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 17:47:56,526 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422981599]
[2023-11-01 17:47:56,526 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422981599] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-01 17:47:56,526 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [89124977]
[2023-11-01 17:47:56,526 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:47:56,526 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-01 17:47:56,526 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-01 17:47:56,528 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-01 17:47:56,529 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2023-11-01 17:47:56,599 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 17:47:56,600 INFO  L263         TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 5 conjunts are in the unsatisfiable core
[2023-11-01 17:47:56,601 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-01 17:47:56,681 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-11-01 17:47:56,682 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-01 17:47:56,725 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-11-01 17:47:56,726 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [89124977] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-01 17:47:56,726 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-01 17:47:56,726 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10
[2023-11-01 17:47:56,726 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113478593]
[2023-11-01 17:47:56,726 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-01 17:47:56,727 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2023-11-01 17:47:56,727 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 17:47:56,727 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2023-11-01 17:47:56,727 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110
[2023-11-01 17:47:56,801 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 98 out of 192
[2023-11-01 17:47:56,802 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)
[2023-11-01 17:47:56,802 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 17:47:56,802 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 192
[2023-11-01 17:47:56,803 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 17:47:57,478 INFO  L130       PetriNetUnfolder]: 2229/5093 cut-off events.
[2023-11-01 17:47:57,478 INFO  L131       PetriNetUnfolder]: For 7932/8466 co-relation queries the response was YES.
[2023-11-01 17:47:57,485 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. 
[2023-11-01 17:47:57,491 INFO  L137   encePairwiseOnDemand]: 187/192 looper letters, 128 selfloop transitions, 8 changer transitions 0/151 dead transitions.
[2023-11-01 17:47:57,492 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 151 transitions, 921 flow
[2023-11-01 17:47:57,492 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2023-11-01 17:47:57,493 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2023-11-01 17:47:57,494 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1012 transitions.
[2023-11-01 17:47:57,495 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5856481481481481
[2023-11-01 17:47:57,495 INFO  L72            ComplementDD]: Start complementDD. Operand 9 states and 1012 transitions.
[2023-11-01 17:47:57,495 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 9 states and 1012 transitions.
[2023-11-01 17:47:57,495 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 17:47:57,495 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1012 transitions.
[2023-11-01 17:47:57,497 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)
[2023-11-01 17:47:57,499 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)
[2023-11-01 17:47:57,499 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)
[2023-11-01 17:47:57,499 INFO  L175             Difference]: Start difference. First operand has 68 places, 62 transitions, 329 flow. Second operand 9 states and 1012 transitions.
[2023-11-01 17:47:57,500 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 151 transitions, 921 flow
[2023-11-01 17:47:57,506 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 151 transitions, 899 flow, removed 6 selfloop flow, removed 1 redundant places.
[2023-11-01 17:47:57,507 INFO  L231             Difference]: Finished difference. Result has 76 places, 63 transitions, 347 flow
[2023-11-01 17:47:57,507 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}
[2023-11-01 17:47:57,508 INFO  L288   CegarLoopForPetriNet]: 51 programPoint places, 25 predicate places.
[2023-11-01 17:47:57,508 INFO  L495      AbstractCegarLoop]: Abstraction has has 76 places, 63 transitions, 347 flow
[2023-11-01 17:47:57,508 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)
[2023-11-01 17:47:57,508 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 17:47:57,508 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]
[2023-11-01 17:47:57,516 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2023-11-01 17:47:57,709 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
[2023-11-01 17:47:57,710 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)] ===
[2023-11-01 17:47:57,711 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 17:47:57,711 INFO  L85        PathProgramCache]: Analyzing trace with hash 331255352, now seen corresponding path program 1 times
[2023-11-01 17:47:57,711 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 17:47:57,712 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133912526]
[2023-11-01 17:47:57,712 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:47:57,712 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 17:47:57,746 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 17:47:58,520 INFO  L134       CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 17:47:58,520 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 17:47:58,520 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133912526]
[2023-11-01 17:47:58,520 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133912526] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-01 17:47:58,521 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [950959509]
[2023-11-01 17:47:58,521 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:47:58,521 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-01 17:47:58,521 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-01 17:47:58,523 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-01 17:47:58,524 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2023-11-01 17:47:58,630 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 17:47:58,633 INFO  L263         TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 31 conjunts are in the unsatisfiable core
[2023-11-01 17:47:58,638 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-01 17:47:58,853 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
[2023-11-01 17:47:58,987 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 17:47:58,988 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
[2023-11-01 17:47:59,101 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
[2023-11-01 17:47:59,139 INFO  L134       CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 17:47:59,139 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-01 17:48:00,081 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
[2023-11-01 17:48:00,089 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
[2023-11-01 17:48:00,224 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
[2023-11-01 17:48:00,236 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
[2023-11-01 17:48:01,368 INFO  L134       CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 17:48:01,369 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [950959509] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-01 17:48:01,369 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-01 17:48:01,369 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 31
[2023-11-01 17:48:01,370 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452497668]
[2023-11-01 17:48:01,370 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-01 17:48:01,371 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2023-11-01 17:48:01,371 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 17:48:01,371 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2023-11-01 17:48:01,371 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=879, Unknown=0, NotChecked=0, Total=992
[2023-11-01 17:48:05,327 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 93 out of 192
[2023-11-01 17:48:05,331 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)
[2023-11-01 17:48:05,331 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 17:48:05,331 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 192
[2023-11-01 17:48:05,331 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 17:48:08,139 INFO  L130       PetriNetUnfolder]: 2703/5719 cut-off events.
[2023-11-01 17:48:08,139 INFO  L131       PetriNetUnfolder]: For 6879/7328 co-relation queries the response was YES.
[2023-11-01 17:48:08,151 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. 
[2023-11-01 17:48:08,163 INFO  L137   encePairwiseOnDemand]: 181/192 looper letters, 152 selfloop transitions, 14 changer transitions 23/202 dead transitions.
[2023-11-01 17:48:08,163 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 202 transitions, 1211 flow
[2023-11-01 17:48:08,164 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2023-11-01 17:48:08,164 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 13 states.
[2023-11-01 17:48:08,166 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1383 transitions.
[2023-11-01 17:48:08,167 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5540865384615384
[2023-11-01 17:48:08,167 INFO  L72            ComplementDD]: Start complementDD. Operand 13 states and 1383 transitions.
[2023-11-01 17:48:08,167 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 13 states and 1383 transitions.
[2023-11-01 17:48:08,168 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 17:48:08,168 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1383 transitions.
[2023-11-01 17:48:08,170 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)
[2023-11-01 17:48:08,173 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)
[2023-11-01 17:48:08,173 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)
[2023-11-01 17:48:08,173 INFO  L175             Difference]: Start difference. First operand has 76 places, 63 transitions, 347 flow. Second operand 13 states and 1383 transitions.
[2023-11-01 17:48:08,173 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 202 transitions, 1211 flow
[2023-11-01 17:48:08,187 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 202 transitions, 1194 flow, removed 2 selfloop flow, removed 7 redundant places.
[2023-11-01 17:48:08,189 INFO  L231             Difference]: Finished difference. Result has 86 places, 68 transitions, 396 flow
[2023-11-01 17:48:08,189 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}
[2023-11-01 17:48:08,189 INFO  L288   CegarLoopForPetriNet]: 51 programPoint places, 35 predicate places.
[2023-11-01 17:48:08,189 INFO  L495      AbstractCegarLoop]: Abstraction has has 86 places, 68 transitions, 396 flow
[2023-11-01 17:48:08,190 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)
[2023-11-01 17:48:08,190 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 17:48:08,191 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]
[2023-11-01 17:48:08,198 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2023-11-01 17:48:08,391 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
[2023-11-01 17:48:08,392 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)] ===
[2023-11-01 17:48:08,392 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 17:48:08,393 INFO  L85        PathProgramCache]: Analyzing trace with hash 1880617726, now seen corresponding path program 2 times
[2023-11-01 17:48:08,393 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 17:48:08,394 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328017695]
[2023-11-01 17:48:08,394 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:48:08,394 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 17:48:08,422 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 17:48:09,243 INFO  L134       CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 17:48:09,243 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 17:48:09,244 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328017695]
[2023-11-01 17:48:09,244 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328017695] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-01 17:48:09,244 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1525029080]
[2023-11-01 17:48:09,244 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2023-11-01 17:48:09,244 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-01 17:48:09,244 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-01 17:48:09,246 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-01 17:48:09,248 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2023-11-01 17:48:09,355 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2023-11-01 17:48:09,355 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-11-01 17:48:09,358 INFO  L263         TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 35 conjunts are in the unsatisfiable core
[2023-11-01 17:48:09,361 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-01 17:48:09,589 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
[2023-11-01 17:48:09,692 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 17:48:09,693 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
[2023-11-01 17:48:09,794 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
[2023-11-01 17:48:09,829 INFO  L134       CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 17:48:09,829 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-01 17:48:10,642 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
[2023-11-01 17:48:10,648 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
[2023-11-01 17:48:10,791 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
[2023-11-01 17:48:10,800 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
[2023-11-01 17:48:12,253 INFO  L134       CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 17:48:12,253 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1525029080] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-01 17:48:12,253 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-01 17:48:12,254 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 34
[2023-11-01 17:48:12,254 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566469180]
[2023-11-01 17:48:12,254 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-01 17:48:12,254 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 35 states
[2023-11-01 17:48:12,255 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 17:48:12,255 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants.
[2023-11-01 17:48:12,255 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1064, Unknown=0, NotChecked=0, Total=1190
[2023-11-01 17:48:17,781 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 93 out of 192
[2023-11-01 17:48:17,784 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)
[2023-11-01 17:48:17,784 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 17:48:17,785 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 192
[2023-11-01 17:48:17,785 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 17:48:21,037 INFO  L130       PetriNetUnfolder]: 2514/5340 cut-off events.
[2023-11-01 17:48:21,037 INFO  L131       PetriNetUnfolder]: For 7683/8114 co-relation queries the response was YES.
[2023-11-01 17:48:21,049 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. 
[2023-11-01 17:48:21,058 INFO  L137   encePairwiseOnDemand]: 181/192 looper letters, 142 selfloop transitions, 15 changer transitions 23/193 dead transitions.
[2023-11-01 17:48:21,058 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 193 transitions, 1211 flow
[2023-11-01 17:48:21,059 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2023-11-01 17:48:21,059 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 14 states.
[2023-11-01 17:48:21,061 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1467 transitions.
[2023-11-01 17:48:21,061 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5457589285714286
[2023-11-01 17:48:21,062 INFO  L72            ComplementDD]: Start complementDD. Operand 14 states and 1467 transitions.
[2023-11-01 17:48:21,062 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 14 states and 1467 transitions.
[2023-11-01 17:48:21,062 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 17:48:21,062 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1467 transitions.
[2023-11-01 17:48:21,065 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)
[2023-11-01 17:48:21,067 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)
[2023-11-01 17:48:21,067 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)
[2023-11-01 17:48:21,067 INFO  L175             Difference]: Start difference. First operand has 86 places, 68 transitions, 396 flow. Second operand 14 states and 1467 transitions.
[2023-11-01 17:48:21,067 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 193 transitions, 1211 flow
[2023-11-01 17:48:21,081 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 193 transitions, 1190 flow, removed 3 selfloop flow, removed 7 redundant places.
[2023-11-01 17:48:21,083 INFO  L231             Difference]: Finished difference. Result has 95 places, 70 transitions, 430 flow
[2023-11-01 17:48:21,083 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}
[2023-11-01 17:48:21,083 INFO  L288   CegarLoopForPetriNet]: 51 programPoint places, 44 predicate places.
[2023-11-01 17:48:21,084 INFO  L495      AbstractCegarLoop]: Abstraction has has 95 places, 70 transitions, 430 flow
[2023-11-01 17:48:21,084 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)
[2023-11-01 17:48:21,084 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 17:48:21,085 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]
[2023-11-01 17:48:21,092 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0
[2023-11-01 17:48:21,285 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
[2023-11-01 17:48:21,286 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)] ===
[2023-11-01 17:48:21,287 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 17:48:21,287 INFO  L85        PathProgramCache]: Analyzing trace with hash 995416140, now seen corresponding path program 1 times
[2023-11-01 17:48:21,287 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 17:48:21,288 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86015255]
[2023-11-01 17:48:21,288 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:48:21,288 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 17:48:21,307 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-01 17:48:21,308 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-11-01 17:48:21,316 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-01 17:48:21,325 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-11-01 17:48:21,325 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-11-01 17:48:21,325 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (7 of 8 remaining)
[2023-11-01 17:48:21,326 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 8 remaining)
[2023-11-01 17:48:21,326 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 8 remaining)
[2023-11-01 17:48:21,326 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining)
[2023-11-01 17:48:21,326 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 8 remaining)
[2023-11-01 17:48:21,326 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 8 remaining)
[2023-11-01 17:48:21,326 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 8 remaining)
[2023-11-01 17:48:21,327 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 8 remaining)
[2023-11-01 17:48:21,327 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2023-11-01 17:48:21,327 INFO  L445         BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-01 17:48:21,331 INFO  L228   ceAbstractionStarter]: Analysis of concurrent program completed with 4 thread instances
[2023-11-01 17:48:21,331 INFO  L178   ceAbstractionStarter]: Computing trace abstraction results
[2023-11-01 17:48:21,382 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.11 05:48:21 BasicIcfg
[2023-11-01 17:48:21,383 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2023-11-01 17:48:21,383 INFO  L113        PluginConnector]: ------------------------Witness Printer----------------------------
[2023-11-01 17:48:21,383 INFO  L271        PluginConnector]: Initializing Witness Printer...
[2023-11-01 17:48:21,384 INFO  L275        PluginConnector]: Witness Printer initialized
[2023-11-01 17:48:21,384 INFO  L185        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.11 05:47:25" (3/4) ...
[2023-11-01 17:48:21,387 INFO  L140         WitnessPrinter]: No result that supports witness generation found
[2023-11-01 17:48:21,387 INFO  L132        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2023-11-01 17:48:21,388 INFO  L158              Benchmark]: Toolchain (without parser) took 56335.67ms. Allocated memory was 216.0MB in the beginning and 5.5GB in the end (delta: 5.3GB). Free memory was 177.2MB in the beginning and 2.5GB in the end (delta: -2.3GB). Peak memory consumption was 3.0GB. Max. memory is 16.1GB.
[2023-11-01 17:48:21,388 INFO  L158              Benchmark]: CDTParser took 0.16ms. Allocated memory is still 216.0MB. Free memory is still 188.5MB. There was no memory consumed. Max. memory is 16.1GB.
[2023-11-01 17:48:21,388 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 301.18ms. Allocated memory is still 216.0MB. Free memory was 176.9MB in the beginning and 158.4MB in the end (delta: 18.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB.
[2023-11-01 17:48:21,389 INFO  L158              Benchmark]: Boogie Procedure Inliner took 29.02ms. Allocated memory is still 216.0MB. Free memory was 158.4MB in the beginning and 156.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2023-11-01 17:48:21,389 INFO  L158              Benchmark]: Boogie Preprocessor took 20.32ms. Allocated memory is still 216.0MB. Free memory was 156.4MB in the beginning and 154.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2023-11-01 17:48:21,389 INFO  L158              Benchmark]: RCFGBuilder took 313.52ms. Allocated memory is still 216.0MB. Free memory was 154.9MB in the beginning and 142.0MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB.
[2023-11-01 17:48:21,390 INFO  L158              Benchmark]: TraceAbstraction took 55662.41ms. Allocated memory was 216.0MB in the beginning and 5.5GB in the end (delta: 5.3GB). Free memory was 141.2MB in the beginning and 2.5GB in the end (delta: -2.4GB). Peak memory consumption was 3.0GB. Max. memory is 16.1GB.
[2023-11-01 17:48:21,390 INFO  L158              Benchmark]: Witness Printer took 3.93ms. Allocated memory is still 5.5GB. Free memory is still 2.5GB. There was no memory consumed. Max. memory is 16.1GB.
[2023-11-01 17:48:21,391 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.16ms. Allocated memory is still 216.0MB. Free memory is still 188.5MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 301.18ms. Allocated memory is still 216.0MB. Free memory was 176.9MB in the beginning and 158.4MB in the end (delta: 18.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 29.02ms. Allocated memory is still 216.0MB. Free memory was 158.4MB in the beginning and 156.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 20.32ms. Allocated memory is still 216.0MB. Free memory was 156.4MB in the beginning and 154.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
 * RCFGBuilder took 313.52ms. Allocated memory is still 216.0MB. Free memory was 154.9MB in the beginning and 142.0MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB.
 * TraceAbstraction took 55662.41ms. Allocated memory was 216.0MB in the beginning and 5.5GB in the end (delta: 5.3GB). Free memory was 141.2MB in the beginning and 2.5GB in the end (delta: -2.4GB). Peak memory consumption was 3.0GB. Max. memory is 16.1GB.
 * Witness Printer took 3.93ms. Allocated memory is still 5.5GB. Free memory is still 2.5GB. 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.3s, 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.6s, 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.5s, 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 threads_total = 4;
[L684]               0  pthread_t tids[4];
[L685]               0  int i = 0;
        VAL             [data=0, data_mutex={1:0}, i=0, threads_total=4, tids={5:0}]
[L685]  COND TRUE    0  i < threads_total
[L686]  FCALL, FORK  0  pthread_create(&tids[i], ((void *)0), &thread, ((void *)0))
        VAL             [arg={0:0}, data=0, data_mutex={1:0}, i=0, pthread_create(&tids[i], ((void *)0), &thread, ((void *)0))=17, threads_total=4, 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}, data=0, data_mutex={1:0}, i=1, threads_total=4, tids={5:0}]
[L685]  COND TRUE    0  i < threads_total
[L686]  FCALL, FORK  0  pthread_create(&tids[i], ((void *)0), &thread, ((void *)0))
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=1, pthread_create(&tids[i], ((void *)0), &thread, ((void *)0))=18, threads_total=4, tids={5:0}]
[L685]               0  i++
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=2, threads_total=4, tids={5:0}]
[L685]  COND TRUE    0  i < threads_total
[L686]  FCALL, FORK  0  pthread_create(&tids[i], ((void *)0), &thread, ((void *)0))
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=2, pthread_create(&tids[i], ((void *)0), &thread, ((void *)0))=19, threads_total=4, 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}, data=0, data_mutex={1:0}, i=3, threads_total=4, tids={5:0}]
[L685]  COND TRUE    0  i < threads_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}, data=0, data_mutex={1:0}, i=3, pthread_create(&tids[i], ((void *)0), &thread, ((void *)0))=20, threads_total=4, tids={5:0}]
[L685]               0  i++
        VAL             [\result={0:0}, __VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=4, threads_total=4, tids={5:0}]
[L685]  COND FALSE   0  !(i < threads_total)
[L688]               0  int i = 0;
        VAL             [\result={0:0}, __VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=0, i=4, threads_total=4, tids={5:0}]
[L688]  COND TRUE    0  i < threads_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}, data=0, data_mutex={1:0}, i=4, i=0, threads_total=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}, data=0, data_mutex={1:0}, i=4, i=0, threads_total=4, tids={5:0}, tids[i]=17]
[L688]               0  i += 2
        VAL             [\result={0:0}, __VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=2, i=4, threads_total=4, tids={5:0}]
[L688]  COND TRUE    0  i < threads_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}, data=0, data_mutex={1:0}, i=4, i=2, threads_total=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}, data=0, data_mutex={1:0}, i=4, i=2, threads_total=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}, data=0, data_mutex={1:0}, i=4, i=4, threads_total=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 < threads_total)
[L691]               0  return data;
        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}, i=4, i=4, threads_total=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.9s, 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: 1.9s, OverallIterations: 4, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 142 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 85 mSDsluCounter, 21 SdHoareTripleChecker+Invalid, 0.2s 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: 4.0s, OverallIterations: 6, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 239 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 146 mSDsluCounter, 47 SdHoareTripleChecker+Invalid, 0.3s 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.6s, OverallIterations: 13, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 36.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3216 SdHoareTripleChecker+Valid, 15.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2896 mSDsluCounter, 5548 SdHoareTripleChecker+Invalid, 13.1s 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, 7.8s 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!
[2023-11-01 17:48:21,465 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
