./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-local-value-cond.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-local-value-cond.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 1e9640d8bd9a430323b6f8257bd04ff8ddca02ab908f7e16e3ca9fd174c3b173
--- Real Ultimate output ---
This is Ultimate 0.2.2-dev-2329fc7
[2024-03-11 23:22:06,611 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2024-03-11 23:22:06,612 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2024-03-11 23:22:06,633 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2024-03-11 23:22:06,633 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2024-03-11 23:22:06,634 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2024-03-11 23:22:06,635 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2024-03-11 23:22:06,636 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2024-03-11 23:22:06,638 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2024-03-11 23:22:06,638 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2024-03-11 23:22:06,639 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2024-03-11 23:22:06,640 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2024-03-11 23:22:06,641 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2024-03-11 23:22:06,641 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2024-03-11 23:22:06,642 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2024-03-11 23:22:06,643 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2024-03-11 23:22:06,644 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2024-03-11 23:22:06,644 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2024-03-11 23:22:06,645 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2024-03-11 23:22:06,647 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2024-03-11 23:22:06,648 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2024-03-11 23:22:06,649 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2024-03-11 23:22:06,649 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2024-03-11 23:22:06,650 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2024-03-11 23:22:06,652 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2024-03-11 23:22:06,653 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2024-03-11 23:22:06,653 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2024-03-11 23:22:06,654 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2024-03-11 23:22:06,654 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2024-03-11 23:22:06,655 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2024-03-11 23:22:06,655 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2024-03-11 23:22:06,655 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2024-03-11 23:22:06,656 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2024-03-11 23:22:06,657 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2024-03-11 23:22:06,657 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2024-03-11 23:22:06,657 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2024-03-11 23:22:06,658 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2024-03-11 23:22:06,658 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2024-03-11 23:22:06,658 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2024-03-11 23:22:06,659 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2024-03-11 23:22:06,659 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2024-03-11 23:22:06,660 INFO  L101        SettingsManager]: Beginning loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2024-03-11 23:22:06,675 INFO  L113        SettingsManager]: Loading preferences was successful
[2024-03-11 23:22:06,675 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2024-03-11 23:22:06,675 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-03-11 23:22:06,676 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-03-11 23:22:06,676 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-03-11 23:22:06,676 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-03-11 23:22:06,677 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-03-11 23:22:06,677 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2024-03-11 23:22:06,677 INFO  L138        SettingsManager]:  * Use SBE=true
[2024-03-11 23:22:06,677 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-03-11 23:22:06,678 INFO  L138        SettingsManager]:  * sizeof long=4
[2024-03-11 23:22:06,678 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2024-03-11 23:22:06,678 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-03-11 23:22:06,678 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2024-03-11 23:22:06,678 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2024-03-11 23:22:06,678 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-03-11 23:22:06,679 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-03-11 23:22:06,679 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-03-11 23:22:06,679 INFO  L138        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2024-03-11 23:22:06,679 INFO  L138        SettingsManager]:  * sizeof long double=12
[2024-03-11 23:22:06,679 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2024-03-11 23:22:06,679 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2024-03-11 23:22:06,680 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-03-11 23:22:06,680 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-03-11 23:22:06,680 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-03-11 23:22:06,680 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-03-11 23:22:06,680 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-03-11 23:22:06,680 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-03-11 23:22:06,681 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-03-11 23:22:06,681 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2024-03-11 23:22:06,681 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-03-11 23:22:06,681 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-03-11 23:22:06,681 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-03-11 23:22:06,681 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-03-11 23:22:06,682 INFO  L138        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-03-11 23:22:06,682 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-03-11 23:22:06,682 INFO  L138        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2024-03-11 23:22:06,682 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 -> 1e9640d8bd9a430323b6f8257bd04ff8ddca02ab908f7e16e3ca9fd174c3b173
[2024-03-11 23:22:06,852 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-03-11 23:22:06,873 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-03-11 23:22:06,875 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-03-11 23:22:06,876 INFO  L271        PluginConnector]: Initializing CDTParser...
[2024-03-11 23:22:06,877 INFO  L275        PluginConnector]: CDTParser initialized
[2024-03-11 23:22:06,878 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/thread-local-value-cond.i
[2024-03-11 23:22:08,006 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2024-03-11 23:22:08,221 INFO  L351              CDTParser]: Found 1 translation units.
[2024-03-11 23:22:08,222 INFO  L172              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/thread-local-value-cond.i
[2024-03-11 23:22:08,234 INFO  L394              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/741988b9f/1b816bb83c3c42bab95ea67bd93e4b0d/FLAG3f386bc76
[2024-03-11 23:22:08,596 INFO  L402              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/741988b9f/1b816bb83c3c42bab95ea67bd93e4b0d
[2024-03-11 23:22:08,598 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-03-11 23:22:08,600 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-03-11 23:22:08,601 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-03-11 23:22:08,601 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-03-11 23:22:08,604 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-03-11 23:22:08,605 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 11:22:08" (1/1) ...
[2024-03-11 23:22:08,606 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@150e6fb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:22:08, skipping insertion in model container
[2024-03-11 23:22:08,606 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 11:22:08" (1/1) ...
[2024-03-11 23:22:08,613 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2024-03-11 23:22:08,645 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2024-03-11 23:22:08,753 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2024-03-11 23:22:08,874 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-03-11 23:22:08,884 INFO  L203         MainTranslator]: Completed pre-run
[2024-03-11 23:22:08,893 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2024-03-11 23:22:08,914 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-03-11 23:22:09,004 INFO  L208         MainTranslator]: Completed translation
[2024-03-11 23:22:09,005 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:22:09 WrapperNode
[2024-03-11 23:22:09,005 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-03-11 23:22:09,006 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-03-11 23:22:09,006 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-03-11 23:22:09,006 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2024-03-11 23:22:09,011 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:22:09" (1/1) ...
[2024-03-11 23:22:09,025 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:22:09" (1/1) ...
[2024-03-11 23:22:09,043 INFO  L138                Inliner]: procedures = 269, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 83
[2024-03-11 23:22:09,044 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-03-11 23:22:09,044 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-03-11 23:22:09,044 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2024-03-11 23:22:09,044 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2024-03-11 23:22:09,052 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:22:09" (1/1) ...
[2024-03-11 23:22:09,052 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:22:09" (1/1) ...
[2024-03-11 23:22:09,056 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:22:09" (1/1) ...
[2024-03-11 23:22:09,057 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:22:09" (1/1) ...
[2024-03-11 23:22:09,063 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:22:09" (1/1) ...
[2024-03-11 23:22:09,065 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:22:09" (1/1) ...
[2024-03-11 23:22:09,067 INFO  L185        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:22:09" (1/1) ...
[2024-03-11 23:22:09,068 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:22:09" (1/1) ...
[2024-03-11 23:22:09,070 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-03-11 23:22:09,071 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-03-11 23:22:09,071 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2024-03-11 23:22:09,071 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2024-03-11 23:22:09,072 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:22:09" (1/1) ...
[2024-03-11 23:22:09,076 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-03-11 23:22:09,101 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 23:22:09,111 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2024-03-11 23:22:09,115 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2024-03-11 23:22:09,229 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2024-03-11 23:22:09,230 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2024-03-11 23:22:09,230 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-03-11 23:22:09,230 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2024-03-11 23:22:09,230 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2024-03-11 23:22:09,230 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2024-03-11 23:22:09,230 INFO  L130     BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock
[2024-03-11 23:22:09,230 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2024-03-11 23:22:09,230 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-03-11 23:22:09,231 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2024-03-11 23:22:09,231 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2024-03-11 23:22:09,231 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2024-03-11 23:22:09,231 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-03-11 23:22:09,231 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-03-11 23:22:09,232 WARN  L209             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2024-03-11 23:22:09,445 INFO  L235             CfgBuilder]: Building ICFG
[2024-03-11 23:22:09,447 INFO  L261             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-03-11 23:22:09,703 INFO  L276             CfgBuilder]: Performing block encoding
[2024-03-11 23:22:09,709 INFO  L295             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-03-11 23:22:09,709 INFO  L300             CfgBuilder]: Removed 2 assume(true) statements.
[2024-03-11 23:22:09,711 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 11:22:09 BoogieIcfgContainer
[2024-03-11 23:22:09,711 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-03-11 23:22:09,713 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-03-11 23:22:09,713 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2024-03-11 23:22:09,766 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2024-03-11 23:22:09,767 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.03 11:22:08" (1/3) ...
[2024-03-11 23:22:09,812 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b20f5b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 11:22:09, skipping insertion in model container
[2024-03-11 23:22:09,812 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:22:09" (2/3) ...
[2024-03-11 23:22:09,813 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b20f5b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 11:22:09, skipping insertion in model container
[2024-03-11 23:22:09,813 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 11:22:09" (3/3) ...
[2024-03-11 23:22:09,815 INFO  L112   eAbstractionObserver]: Analyzing ICFG thread-local-value-cond.i
[2024-03-11 23:22:09,883 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2024-03-11 23:22:09,895 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-03-11 23:22:09,896 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations.
[2024-03-11 23:22:09,896 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-03-11 23:22:09,937 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2024-03-11 23:22:10,009 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 123 places, 126 transitions, 260 flow
[2024-03-11 23:22:10,058 INFO  L130       PetriNetUnfolder]: 8/172 cut-off events.
[2024-03-11 23:22:10,058 INFO  L131       PetriNetUnfolder]: For 1/2 co-relation queries the response was YES.
[2024-03-11 23:22:10,063 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 178 conditions, 172 events. 8/172 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 366 event pairs, 0 based on Foata normal form. 0/148 useless extension candidates. Maximal degree in co-relation 85. Up to 4 conditions per place. 
[2024-03-11 23:22:10,063 INFO  L82        GeneralOperation]: Start removeDead. Operand has 123 places, 126 transitions, 260 flow
[2024-03-11 23:22:10,066 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 123 places, 126 transitions, 260 flow
[2024-03-11 23:22:10,069 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2024-03-11 23:22:10,078 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 126 transitions, 260 flow
[2024-03-11 23:22:10,081 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 126 transitions, 260 flow
[2024-03-11 23:22:10,082 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 123 places, 126 transitions, 260 flow
[2024-03-11 23:22:10,122 INFO  L130       PetriNetUnfolder]: 8/172 cut-off events.
[2024-03-11 23:22:10,123 INFO  L131       PetriNetUnfolder]: For 1/2 co-relation queries the response was YES.
[2024-03-11 23:22:10,124 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 178 conditions, 172 events. 8/172 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 366 event pairs, 0 based on Foata normal form. 0/148 useless extension candidates. Maximal degree in co-relation 85. Up to 4 conditions per place. 
[2024-03-11 23:22:10,125 INFO  L119        LiptonReduction]: Number of co-enabled transitions 3498
[2024-03-11 23:22:14,504 INFO  L134        LiptonReduction]: Checked pairs total: 3236
[2024-03-11 23:22:14,504 INFO  L136        LiptonReduction]: Total number of compositions: 151
[2024-03-11 23:22:14,516 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-11 23:22:14,522 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3a6b3747, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2024-03-11 23:22:14,522 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 15 error locations.
[2024-03-11 23:22:14,524 INFO  L130       PetriNetUnfolder]: 0/2 cut-off events.
[2024-03-11 23:22:14,524 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2024-03-11 23:22:14,524 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 23:22:14,524 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1]
[2024-03-11 23:22:14,524 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-03-11 23:22:14,528 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 23:22:14,529 INFO  L85        PathProgramCache]: Analyzing trace with hash 15848, now seen corresponding path program 1 times
[2024-03-11 23:22:14,535 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 23:22:14,535 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97150423]
[2024-03-11 23:22:14,535 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:22:14,535 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 23:22:14,610 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 23:22:14,657 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 23:22:14,658 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 23:22:14,658 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97150423]
[2024-03-11 23:22:14,658 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97150423] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 23:22:14,659 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 23:22:14,659 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-03-11 23:22:14,661 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003022339]
[2024-03-11 23:22:14,661 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 23:22:14,668 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-03-11 23:22:14,669 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 23:22:14,684 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-03-11 23:22:14,686 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-03-11 23:22:14,688 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 121 out of 277
[2024-03-11 23:22:14,689 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 20 transitions, 48 flow. Second operand  has 2 states, 2 states have (on average 122.0) internal successors, (244), 2 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:22:14,689 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 23:22:14,690 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 277
[2024-03-11 23:22:14,690 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 23:22:14,722 INFO  L130       PetriNetUnfolder]: 6/25 cut-off events.
[2024-03-11 23:22:14,722 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2024-03-11 23:22:14,723 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 56 conditions, 25 events. 6/25 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 45 event pairs, 5 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 32. Up to 25 conditions per place. 
[2024-03-11 23:22:14,723 INFO  L137   encePairwiseOnDemand]: 268/277 looper letters, 5 selfloop transitions, 0 changer transitions 5/11 dead transitions.
[2024-03-11 23:22:14,723 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 14 places, 11 transitions, 50 flow
[2024-03-11 23:22:14,725 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-03-11 23:22:14,726 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2024-03-11 23:22:14,733 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 261 transitions.
[2024-03-11 23:22:14,735 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.4711191335740072
[2024-03-11 23:22:14,736 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 261 transitions.
[2024-03-11 23:22:14,736 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 261 transitions.
[2024-03-11 23:22:14,737 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 23:22:14,739 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 261 transitions.
[2024-03-11 23:22:14,741 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 130.5) internal successors, (261), 2 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:22:14,745 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 277.0) internal successors, (831), 3 states have internal predecessors, (831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:22:14,746 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 277.0) internal successors, (831), 3 states have internal predecessors, (831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:22:14,748 INFO  L175             Difference]: Start difference. First operand has 22 places, 20 transitions, 48 flow. Second operand 2 states and 261 transitions.
[2024-03-11 23:22:14,748 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 14 places, 11 transitions, 50 flow
[2024-03-11 23:22:14,750 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 14 places, 11 transitions, 50 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-11 23:22:14,751 INFO  L231             Difference]: Finished difference. Result has 14 places, 6 transitions, 17 flow
[2024-03-11 23:22:14,752 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=30, PETRI_DIFFERENCE_MINUEND_PLACES=13, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=11, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=17, PETRI_PLACES=14, PETRI_TRANSITIONS=6}
[2024-03-11 23:22:14,755 INFO  L288   CegarLoopForPetriNet]: 22 programPoint places, -8 predicate places.
[2024-03-11 23:22:14,755 INFO  L495      AbstractCegarLoop]: Abstraction has has 14 places, 6 transitions, 17 flow
[2024-03-11 23:22:14,755 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 122.0) internal successors, (244), 2 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:22:14,755 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 23:22:14,756 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1]
[2024-03-11 23:22:14,756 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-03-11 23:22:14,756 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-03-11 23:22:14,756 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 23:22:14,756 INFO  L85        PathProgramCache]: Analyzing trace with hash 1759960203, now seen corresponding path program 1 times
[2024-03-11 23:22:14,757 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 23:22:14,757 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839780859]
[2024-03-11 23:22:14,757 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:22:14,757 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 23:22:14,798 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-11 23:22:14,798 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-03-11 23:22:14,819 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-11 23:22:14,834 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-03-11 23:22:14,835 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-03-11 23:22:14,836 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 15 remaining)
[2024-03-11 23:22:14,837 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining)
[2024-03-11 23:22:14,838 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining)
[2024-03-11 23:22:14,838 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining)
[2024-03-11 23:22:14,838 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining)
[2024-03-11 23:22:14,838 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining)
[2024-03-11 23:22:14,838 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (8 of 15 remaining)
[2024-03-11 23:22:14,839 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining)
[2024-03-11 23:22:14,839 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining)
[2024-03-11 23:22:14,839 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining)
[2024-03-11 23:22:14,839 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 15 remaining)
[2024-03-11 23:22:14,839 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (3 of 15 remaining)
[2024-03-11 23:22:14,840 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining)
[2024-03-11 23:22:14,840 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining)
[2024-03-11 23:22:14,840 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining)
[2024-03-11 23:22:14,840 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-03-11 23:22:14,840 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1]
[2024-03-11 23:22:14,842 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-03-11 23:22:14,842 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2024-03-11 23:22:14,857 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2024-03-11 23:22:14,861 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 157 places, 161 transitions, 340 flow
[2024-03-11 23:22:14,903 INFO  L130       PetriNetUnfolder]: 15/303 cut-off events.
[2024-03-11 23:22:14,903 INFO  L131       PetriNetUnfolder]: For 6/8 co-relation queries the response was YES.
[2024-03-11 23:22:14,904 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 317 conditions, 303 events. 15/303 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 776 event pairs, 0 based on Foata normal form. 0/259 useless extension candidates. Maximal degree in co-relation 174. Up to 8 conditions per place. 
[2024-03-11 23:22:14,904 INFO  L82        GeneralOperation]: Start removeDead. Operand has 157 places, 161 transitions, 340 flow
[2024-03-11 23:22:14,906 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 157 places, 161 transitions, 340 flow
[2024-03-11 23:22:14,906 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2024-03-11 23:22:14,907 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 157 places, 161 transitions, 340 flow
[2024-03-11 23:22:14,907 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 157 places, 161 transitions, 340 flow
[2024-03-11 23:22:14,907 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 157 places, 161 transitions, 340 flow
[2024-03-11 23:22:14,930 INFO  L130       PetriNetUnfolder]: 15/303 cut-off events.
[2024-03-11 23:22:14,931 INFO  L131       PetriNetUnfolder]: For 6/8 co-relation queries the response was YES.
[2024-03-11 23:22:14,932 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 317 conditions, 303 events. 15/303 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 776 event pairs, 0 based on Foata normal form. 0/259 useless extension candidates. Maximal degree in co-relation 174. Up to 8 conditions per place. 
[2024-03-11 23:22:14,937 INFO  L119        LiptonReduction]: Number of co-enabled transitions 10032
[2024-03-11 23:22:18,470 INFO  L134        LiptonReduction]: Checked pairs total: 37118
[2024-03-11 23:22:18,470 INFO  L136        LiptonReduction]: Total number of compositions: 113
[2024-03-11 23:22:18,474 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-11 23:22:18,477 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;@3a6b3747, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2024-03-11 23:22:18,477 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 20 error locations.
[2024-03-11 23:22:18,479 INFO  L130       PetriNetUnfolder]: 0/3 cut-off events.
[2024-03-11 23:22:18,480 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2024-03-11 23:22:18,480 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 23:22:18,480 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1]
[2024-03-11 23:22:18,481 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 17 more)] ===
[2024-03-11 23:22:18,481 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 23:22:18,481 INFO  L85        PathProgramCache]: Analyzing trace with hash 25818, now seen corresponding path program 1 times
[2024-03-11 23:22:18,481 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 23:22:18,481 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737179640]
[2024-03-11 23:22:18,482 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:22:18,482 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 23:22:18,491 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 23:22:18,501 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 23:22:18,502 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 23:22:18,502 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737179640]
[2024-03-11 23:22:18,502 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737179640] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 23:22:18,502 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 23:22:18,502 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-03-11 23:22:18,502 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115426736]
[2024-03-11 23:22:18,503 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 23:22:18,503 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-03-11 23:22:18,503 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 23:22:18,504 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-03-11 23:22:18,504 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-03-11 23:22:18,505 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 154 out of 274
[2024-03-11 23:22:18,505 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 68 transitions, 154 flow. Second operand  has 2 states, 2 states have (on average 155.0) internal successors, (310), 2 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:22:18,505 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 23:22:18,505 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 274
[2024-03-11 23:22:18,505 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 23:22:18,746 INFO  L130       PetriNetUnfolder]: 1043/2485 cut-off events.
[2024-03-11 23:22:18,746 INFO  L131       PetriNetUnfolder]: For 54/54 co-relation queries the response was YES.
[2024-03-11 23:22:18,749 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4139 conditions, 2485 events. 1043/2485 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 17741 event pairs, 800 based on Foata normal form. 0/1965 useless extension candidates. Maximal degree in co-relation 1692. Up to 1593 conditions per place. 
[2024-03-11 23:22:18,757 INFO  L137   encePairwiseOnDemand]: 270/274 looper letters, 29 selfloop transitions, 0 changer transitions 0/64 dead transitions.
[2024-03-11 23:22:18,757 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 64 transitions, 204 flow
[2024-03-11 23:22:18,757 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-03-11 23:22:18,758 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2024-03-11 23:22:18,761 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 341 transitions.
[2024-03-11 23:22:18,762 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6222627737226277
[2024-03-11 23:22:18,763 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 341 transitions.
[2024-03-11 23:22:18,763 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 341 transitions.
[2024-03-11 23:22:18,764 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 23:22:18,764 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 341 transitions.
[2024-03-11 23:22:18,766 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 170.5) internal successors, (341), 2 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:22:18,769 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 274.0) internal successors, (822), 3 states have internal predecessors, (822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:22:18,769 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 274.0) internal successors, (822), 3 states have internal predecessors, (822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:22:18,769 INFO  L175             Difference]: Start difference. First operand has 67 places, 68 transitions, 154 flow. Second operand 2 states and 341 transitions.
[2024-03-11 23:22:18,769 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 64 transitions, 204 flow
[2024-03-11 23:22:18,770 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 64 transitions, 204 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-11 23:22:18,771 INFO  L231             Difference]: Finished difference. Result has 64 places, 64 transitions, 146 flow
[2024-03-11 23:22:18,772 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=146, PETRI_PLACES=64, PETRI_TRANSITIONS=64}
[2024-03-11 23:22:18,772 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, -3 predicate places.
[2024-03-11 23:22:18,772 INFO  L495      AbstractCegarLoop]: Abstraction has has 64 places, 64 transitions, 146 flow
[2024-03-11 23:22:18,773 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 155.0) internal successors, (310), 2 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:22:18,773 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 23:22:18,773 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-03-11 23:22:18,773 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-03-11 23:22:18,773 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 17 more)] ===
[2024-03-11 23:22:18,774 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 23:22:18,774 INFO  L85        PathProgramCache]: Analyzing trace with hash -1905030088, now seen corresponding path program 1 times
[2024-03-11 23:22:18,774 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 23:22:18,774 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519152415]
[2024-03-11 23:22:18,774 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:22:18,775 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 23:22:18,786 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 23:22:18,814 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 23:22:18,814 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 23:22:18,814 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519152415]
[2024-03-11 23:22:18,815 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519152415] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 23:22:18,815 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 23:22:18,815 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-11 23:22:18,815 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111453791]
[2024-03-11 23:22:18,815 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 23:22:18,816 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-11 23:22:18,816 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 23:22:18,816 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-11 23:22:18,816 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-11 23:22:18,846 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 144 out of 274
[2024-03-11 23:22:18,847 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 64 transitions, 146 flow. Second operand  has 3 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:22:18,847 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 23:22:18,847 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 274
[2024-03-11 23:22:18,847 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 23:22:19,114 INFO  L130       PetriNetUnfolder]: 1302/3100 cut-off events.
[2024-03-11 23:22:19,114 INFO  L131       PetriNetUnfolder]: For 61/61 co-relation queries the response was YES.
[2024-03-11 23:22:19,117 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5155 conditions, 3100 events. 1302/3100 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 22868 event pairs, 876 based on Foata normal form. 0/2396 useless extension candidates. Maximal degree in co-relation 5150. Up to 1843 conditions per place. 
[2024-03-11 23:22:19,126 INFO  L137   encePairwiseOnDemand]: 268/274 looper letters, 44 selfloop transitions, 5 changer transitions 0/82 dead transitions.
[2024-03-11 23:22:19,126 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 82 transitions, 288 flow
[2024-03-11 23:22:19,127 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-11 23:22:19,127 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-11 23:22:19,128 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 482 transitions.
[2024-03-11 23:22:19,128 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5863746958637469
[2024-03-11 23:22:19,128 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 482 transitions.
[2024-03-11 23:22:19,129 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 482 transitions.
[2024-03-11 23:22:19,129 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 23:22:19,129 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 482 transitions.
[2024-03-11 23:22:19,130 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 160.66666666666666) internal successors, (482), 3 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:22:19,132 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 274.0) internal successors, (1096), 4 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:22:19,133 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 274.0) internal successors, (1096), 4 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:22:19,133 INFO  L175             Difference]: Start difference. First operand has 64 places, 64 transitions, 146 flow. Second operand 3 states and 482 transitions.
[2024-03-11 23:22:19,133 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 82 transitions, 288 flow
[2024-03-11 23:22:19,135 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 82 transitions, 288 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-11 23:22:19,136 INFO  L231             Difference]: Finished difference. Result has 67 places, 68 transitions, 179 flow
[2024-03-11 23:22:19,136 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=179, PETRI_PLACES=67, PETRI_TRANSITIONS=68}
[2024-03-11 23:22:19,137 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 0 predicate places.
[2024-03-11 23:22:19,137 INFO  L495      AbstractCegarLoop]: Abstraction has has 67 places, 68 transitions, 179 flow
[2024-03-11 23:22:19,138 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:22:19,138 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 23:22:19,138 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 23:22:19,138 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-03-11 23:22:19,138 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 17 more)] ===
[2024-03-11 23:22:19,139 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 23:22:19,139 INFO  L85        PathProgramCache]: Analyzing trace with hash -1077759969, now seen corresponding path program 1 times
[2024-03-11 23:22:19,139 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 23:22:19,139 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784509030]
[2024-03-11 23:22:19,139 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:22:19,140 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 23:22:19,151 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 23:22:19,170 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 23:22:19,171 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 23:22:19,171 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784509030]
[2024-03-11 23:22:19,171 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784509030] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 23:22:19,171 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 23:22:19,172 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-11 23:22:19,172 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787857730]
[2024-03-11 23:22:19,172 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 23:22:19,172 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-11 23:22:19,172 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 23:22:19,173 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-11 23:22:19,173 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-11 23:22:19,199 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 140 out of 274
[2024-03-11 23:22:19,200 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 68 transitions, 179 flow. Second operand  has 3 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:22:19,200 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 23:22:19,200 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 274
[2024-03-11 23:22:19,201 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 23:22:19,618 INFO  L130       PetriNetUnfolder]: 2226/4879 cut-off events.
[2024-03-11 23:22:19,618 INFO  L131       PetriNetUnfolder]: For 536/582 co-relation queries the response was YES.
[2024-03-11 23:22:19,623 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9195 conditions, 4879 events. 2226/4879 cut-off events. For 536/582 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 36560 event pairs, 611 based on Foata normal form. 0/4040 useless extension candidates. Maximal degree in co-relation 9188. Up to 2827 conditions per place. 
[2024-03-11 23:22:19,636 INFO  L137   encePairwiseOnDemand]: 260/274 looper letters, 64 selfloop transitions, 12 changer transitions 0/102 dead transitions.
[2024-03-11 23:22:19,636 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 102 transitions, 427 flow
[2024-03-11 23:22:19,637 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-11 23:22:19,637 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-11 23:22:19,639 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 494 transitions.
[2024-03-11 23:22:19,640 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6009732360097324
[2024-03-11 23:22:19,640 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 494 transitions.
[2024-03-11 23:22:19,640 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 494 transitions.
[2024-03-11 23:22:19,641 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 23:22:19,641 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 494 transitions.
[2024-03-11 23:22:19,644 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:22:19,647 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 274.0) internal successors, (1096), 4 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:22:19,647 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 274.0) internal successors, (1096), 4 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:22:19,648 INFO  L175             Difference]: Start difference. First operand has 67 places, 68 transitions, 179 flow. Second operand 3 states and 494 transitions.
[2024-03-11 23:22:19,648 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 102 transitions, 427 flow
[2024-03-11 23:22:19,652 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 102 transitions, 419 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-11 23:22:19,653 INFO  L231             Difference]: Finished difference. Result has 70 places, 79 transitions, 284 flow
[2024-03-11 23:22:19,653 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=284, PETRI_PLACES=70, PETRI_TRANSITIONS=79}
[2024-03-11 23:22:19,654 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 3 predicate places.
[2024-03-11 23:22:19,654 INFO  L495      AbstractCegarLoop]: Abstraction has has 70 places, 79 transitions, 284 flow
[2024-03-11 23:22:19,654 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:22:19,654 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 23:22:19,655 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 23:22:19,655 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-03-11 23:22:19,655 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 17 more)] ===
[2024-03-11 23:22:19,656 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 23:22:19,656 INFO  L85        PathProgramCache]: Analyzing trace with hash -1445029767, now seen corresponding path program 1 times
[2024-03-11 23:22:19,656 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 23:22:19,656 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576872458]
[2024-03-11 23:22:19,656 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:22:19,657 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 23:22:19,669 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 23:22:19,690 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2024-03-11 23:22:19,690 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 23:22:19,690 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576872458]
[2024-03-11 23:22:19,690 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576872458] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 23:22:19,691 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 23:22:19,691 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-11 23:22:19,691 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490762135]
[2024-03-11 23:22:19,691 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 23:22:19,691 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-11 23:22:19,692 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 23:22:19,692 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-11 23:22:19,692 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-11 23:22:19,717 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 144 out of 274
[2024-03-11 23:22:19,718 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 79 transitions, 284 flow. Second operand  has 3 states, 3 states have (on average 146.66666666666666) internal successors, (440), 3 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:22:19,718 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 23:22:19,718 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 274
[2024-03-11 23:22:19,718 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 23:22:20,134 INFO  L130       PetriNetUnfolder]: 2285/5129 cut-off events.
[2024-03-11 23:22:20,134 INFO  L131       PetriNetUnfolder]: For 1863/1957 co-relation queries the response was YES.
[2024-03-11 23:22:20,140 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10781 conditions, 5129 events. 2285/5129 cut-off events. For 1863/1957 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 40018 event pairs, 1156 based on Foata normal form. 6/4239 useless extension candidates. Maximal degree in co-relation 10773. Up to 2863 conditions per place. 
[2024-03-11 23:22:20,156 INFO  L137   encePairwiseOnDemand]: 267/274 looper letters, 54 selfloop transitions, 11 changer transitions 0/101 dead transitions.
[2024-03-11 23:22:20,156 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 101 transitions, 491 flow
[2024-03-11 23:22:20,157 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-11 23:22:20,157 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-11 23:22:20,158 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 484 transitions.
[2024-03-11 23:22:20,158 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5888077858880778
[2024-03-11 23:22:20,158 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 484 transitions.
[2024-03-11 23:22:20,158 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 484 transitions.
[2024-03-11 23:22:20,159 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 23:22:20,159 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 484 transitions.
[2024-03-11 23:22:20,160 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:22:20,161 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 274.0) internal successors, (1096), 4 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:22:20,162 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 274.0) internal successors, (1096), 4 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:22:20,162 INFO  L175             Difference]: Start difference. First operand has 70 places, 79 transitions, 284 flow. Second operand 3 states and 484 transitions.
[2024-03-11 23:22:20,162 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 101 transitions, 491 flow
[2024-03-11 23:22:20,166 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 101 transitions, 461 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-11 23:22:20,167 INFO  L231             Difference]: Finished difference. Result has 72 places, 86 transitions, 354 flow
[2024-03-11 23:22:20,167 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=354, PETRI_PLACES=72, PETRI_TRANSITIONS=86}
[2024-03-11 23:22:20,168 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 5 predicate places.
[2024-03-11 23:22:20,168 INFO  L495      AbstractCegarLoop]: Abstraction has has 72 places, 86 transitions, 354 flow
[2024-03-11 23:22:20,168 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 146.66666666666666) internal successors, (440), 3 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:22:20,168 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 23:22:20,169 INFO  L209   CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1]
[2024-03-11 23:22:20,169 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-03-11 23:22:20,169 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 17 more)] ===
[2024-03-11 23:22:20,169 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 23:22:20,169 INFO  L85        PathProgramCache]: Analyzing trace with hash -1849390170, now seen corresponding path program 1 times
[2024-03-11 23:22:20,169 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 23:22:20,169 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146313856]
[2024-03-11 23:22:20,170 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:22:20,170 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 23:22:20,190 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-11 23:22:20,191 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-03-11 23:22:20,203 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-11 23:22:20,208 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-03-11 23:22:20,208 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-03-11 23:22:20,209 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 20 remaining)
[2024-03-11 23:22:20,209 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (18 of 20 remaining)
[2024-03-11 23:22:20,209 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (17 of 20 remaining)
[2024-03-11 23:22:20,209 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (16 of 20 remaining)
[2024-03-11 23:22:20,209 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (15 of 20 remaining)
[2024-03-11 23:22:20,209 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (14 of 20 remaining)
[2024-03-11 23:22:20,210 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (13 of 20 remaining)
[2024-03-11 23:22:20,210 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (12 of 20 remaining)
[2024-03-11 23:22:20,210 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (11 of 20 remaining)
[2024-03-11 23:22:20,210 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (10 of 20 remaining)
[2024-03-11 23:22:20,210 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (9 of 20 remaining)
[2024-03-11 23:22:20,210 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (8 of 20 remaining)
[2024-03-11 23:22:20,210 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (7 of 20 remaining)
[2024-03-11 23:22:20,211 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (6 of 20 remaining)
[2024-03-11 23:22:20,211 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (5 of 20 remaining)
[2024-03-11 23:22:20,211 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 20 remaining)
[2024-03-11 23:22:20,211 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (3 of 20 remaining)
[2024-03-11 23:22:20,211 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (2 of 20 remaining)
[2024-03-11 23:22:20,211 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (1 of 20 remaining)
[2024-03-11 23:22:20,211 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (0 of 20 remaining)
[2024-03-11 23:22:20,211 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-03-11 23:22:20,212 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1]
[2024-03-11 23:22:20,212 WARN  L233   ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-03-11 23:22:20,212 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances.
[2024-03-11 23:22:20,230 INFO  L144    ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions.
[2024-03-11 23:22:20,233 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 191 places, 196 transitions, 422 flow
[2024-03-11 23:22:20,281 INFO  L130       PetriNetUnfolder]: 27/513 cut-off events.
[2024-03-11 23:22:20,281 INFO  L131       PetriNetUnfolder]: For 19/22 co-relation queries the response was YES.
[2024-03-11 23:22:20,283 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 541 conditions, 513 events. 27/513 cut-off events. For 19/22 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1645 event pairs, 1 based on Foata normal form. 0/439 useless extension candidates. Maximal degree in co-relation 311. Up to 16 conditions per place. 
[2024-03-11 23:22:20,283 INFO  L82        GeneralOperation]: Start removeDead. Operand has 191 places, 196 transitions, 422 flow
[2024-03-11 23:22:20,286 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 191 places, 196 transitions, 422 flow
[2024-03-11 23:22:20,286 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2024-03-11 23:22:20,286 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 191 places, 196 transitions, 422 flow
[2024-03-11 23:22:20,287 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 191 places, 196 transitions, 422 flow
[2024-03-11 23:22:20,287 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 191 places, 196 transitions, 422 flow
[2024-03-11 23:22:20,331 INFO  L130       PetriNetUnfolder]: 27/513 cut-off events.
[2024-03-11 23:22:20,332 INFO  L131       PetriNetUnfolder]: For 19/22 co-relation queries the response was YES.
[2024-03-11 23:22:20,333 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 541 conditions, 513 events. 27/513 cut-off events. For 19/22 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1645 event pairs, 1 based on Foata normal form. 0/439 useless extension candidates. Maximal degree in co-relation 311. Up to 16 conditions per place. 
[2024-03-11 23:22:20,346 INFO  L119        LiptonReduction]: Number of co-enabled transitions 18612
[2024-03-11 23:22:24,445 INFO  L134        LiptonReduction]: Checked pairs total: 93204
[2024-03-11 23:22:24,446 INFO  L136        LiptonReduction]: Total number of compositions: 129
[2024-03-11 23:22:24,447 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-11 23:22:24,448 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;@3a6b3747, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2024-03-11 23:22:24,448 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 25 error locations.
[2024-03-11 23:22:24,449 INFO  L130       PetriNetUnfolder]: 0/3 cut-off events.
[2024-03-11 23:22:24,449 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2024-03-11 23:22:24,449 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 23:22:24,449 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1]
[2024-03-11 23:22:24,450 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] ===
[2024-03-11 23:22:24,450 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 23:22:24,450 INFO  L85        PathProgramCache]: Analyzing trace with hash 37336, now seen corresponding path program 1 times
[2024-03-11 23:22:24,450 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 23:22:24,450 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45038439]
[2024-03-11 23:22:24,450 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:22:24,450 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 23:22:24,458 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 23:22:24,465 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 23:22:24,465 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 23:22:24,465 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45038439]
[2024-03-11 23:22:24,465 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45038439] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 23:22:24,465 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 23:22:24,465 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-03-11 23:22:24,466 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006321139]
[2024-03-11 23:22:24,466 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 23:22:24,466 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-03-11 23:22:24,466 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 23:22:24,466 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-03-11 23:22:24,466 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-03-11 23:22:24,467 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 187 out of 325
[2024-03-11 23:22:24,467 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 95 transitions, 220 flow. Second operand  has 2 states, 2 states have (on average 188.0) internal successors, (376), 2 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:22:24,467 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 23:22:24,467 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 325
[2024-03-11 23:22:24,467 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 23:22:26,092 INFO  L130       PetriNetUnfolder]: 12759/24620 cut-off events.
[2024-03-11 23:22:26,093 INFO  L131       PetriNetUnfolder]: For 914/914 co-relation queries the response was YES.
[2024-03-11 23:22:26,119 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 42398 conditions, 24620 events. 12759/24620 cut-off events. For 914/914 co-relation queries the response was YES. Maximal size of possible extension queue 845. Compared 228376 event pairs, 9715 based on Foata normal form. 0/20299 useless extension candidates. Maximal degree in co-relation 5495. Up to 17100 conditions per place. 
[2024-03-11 23:22:26,201 INFO  L137   encePairwiseOnDemand]: 321/325 looper letters, 38 selfloop transitions, 0 changer transitions 0/91 dead transitions.
[2024-03-11 23:22:26,202 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 91 transitions, 288 flow
[2024-03-11 23:22:26,202 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-03-11 23:22:26,202 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2024-03-11 23:22:26,203 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 416 transitions.
[2024-03-11 23:22:26,203 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.64
[2024-03-11 23:22:26,203 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 416 transitions.
[2024-03-11 23:22:26,203 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 416 transitions.
[2024-03-11 23:22:26,204 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 23:22:26,204 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 416 transitions.
[2024-03-11 23:22:26,205 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 208.0) internal successors, (416), 2 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:22:26,206 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 325.0) internal successors, (975), 3 states have internal predecessors, (975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:22:26,206 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 325.0) internal successors, (975), 3 states have internal predecessors, (975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:22:26,206 INFO  L175             Difference]: Start difference. First operand has 93 places, 95 transitions, 220 flow. Second operand 2 states and 416 transitions.
[2024-03-11 23:22:26,206 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 91 transitions, 288 flow
[2024-03-11 23:22:26,207 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 91 transitions, 288 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-11 23:22:26,208 INFO  L231             Difference]: Finished difference. Result has 90 places, 91 transitions, 212 flow
[2024-03-11 23:22:26,208 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=212, PETRI_PLACES=90, PETRI_TRANSITIONS=91}
[2024-03-11 23:22:26,209 INFO  L288   CegarLoopForPetriNet]: 93 programPoint places, -3 predicate places.
[2024-03-11 23:22:26,209 INFO  L495      AbstractCegarLoop]: Abstraction has has 90 places, 91 transitions, 212 flow
[2024-03-11 23:22:26,210 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 188.0) internal successors, (376), 2 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:22:26,210 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 23:22:26,210 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-03-11 23:22:26,210 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-03-11 23:22:26,210 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] ===
[2024-03-11 23:22:26,210 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 23:22:26,210 INFO  L85        PathProgramCache]: Analyzing trace with hash 150868486, now seen corresponding path program 1 times
[2024-03-11 23:22:26,210 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 23:22:26,210 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228219565]
[2024-03-11 23:22:26,210 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:22:26,211 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 23:22:26,218 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 23:22:26,231 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 23:22:26,231 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 23:22:26,231 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228219565]
[2024-03-11 23:22:26,231 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228219565] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 23:22:26,231 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 23:22:26,231 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-11 23:22:26,231 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912265780]
[2024-03-11 23:22:26,231 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 23:22:26,232 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-11 23:22:26,232 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 23:22:26,232 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-11 23:22:26,232 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-11 23:22:26,267 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 174 out of 325
[2024-03-11 23:22:26,268 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 91 transitions, 212 flow. Second operand  has 3 states, 3 states have (on average 176.0) internal successors, (528), 3 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:22:26,268 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 23:22:26,268 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 325
[2024-03-11 23:22:26,268 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 23:22:28,530 INFO  L130       PetriNetUnfolder]: 22109/39767 cut-off events.
[2024-03-11 23:22:28,530 INFO  L131       PetriNetUnfolder]: For 1448/1448 co-relation queries the response was YES.
[2024-03-11 23:22:28,581 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 70441 conditions, 39767 events. 22109/39767 cut-off events. For 1448/1448 co-relation queries the response was YES. Maximal size of possible extension queue 1308. Compared 365128 event pairs, 13618 based on Foata normal form. 0/32471 useless extension candidates. Maximal degree in co-relation 70435. Up to 25338 conditions per place. 
[2024-03-11 23:22:28,716 INFO  L137   encePairwiseOnDemand]: 315/325 looper letters, 63 selfloop transitions, 9 changer transitions 0/121 dead transitions.
[2024-03-11 23:22:28,716 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 121 transitions, 434 flow
[2024-03-11 23:22:28,717 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-11 23:22:28,717 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-11 23:22:28,718 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 595 transitions.
[2024-03-11 23:22:28,718 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6102564102564103
[2024-03-11 23:22:28,718 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 595 transitions.
[2024-03-11 23:22:28,718 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 595 transitions.
[2024-03-11 23:22:28,719 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 23:22:28,719 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 595 transitions.
[2024-03-11 23:22:28,720 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 198.33333333333334) internal successors, (595), 3 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:22:28,722 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 325.0) internal successors, (1300), 4 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:22:28,722 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 325.0) internal successors, (1300), 4 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:22:28,722 INFO  L175             Difference]: Start difference. First operand has 90 places, 91 transitions, 212 flow. Second operand 3 states and 595 transitions.
[2024-03-11 23:22:28,722 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 121 transitions, 434 flow
[2024-03-11 23:22:28,723 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 121 transitions, 434 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-11 23:22:28,725 INFO  L231             Difference]: Finished difference. Result has 94 places, 99 transitions, 282 flow
[2024-03-11 23:22:28,725 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=282, PETRI_PLACES=94, PETRI_TRANSITIONS=99}
[2024-03-11 23:22:28,725 INFO  L288   CegarLoopForPetriNet]: 93 programPoint places, 1 predicate places.
[2024-03-11 23:22:28,725 INFO  L495      AbstractCegarLoop]: Abstraction has has 94 places, 99 transitions, 282 flow
[2024-03-11 23:22:28,726 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 176.0) internal successors, (528), 3 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:22:28,726 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 23:22:28,726 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 23:22:28,726 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-03-11 23:22:28,726 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] ===
[2024-03-11 23:22:28,726 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 23:22:28,726 INFO  L85        PathProgramCache]: Analyzing trace with hash -1044238809, now seen corresponding path program 1 times
[2024-03-11 23:22:28,726 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 23:22:28,726 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917703031]
[2024-03-11 23:22:28,727 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:22:28,727 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 23:22:28,734 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 23:22:28,747 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 23:22:28,747 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 23:22:28,747 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917703031]
[2024-03-11 23:22:28,747 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917703031] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 23:22:28,747 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 23:22:28,747 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-11 23:22:28,747 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326197929]
[2024-03-11 23:22:28,748 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 23:22:28,748 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-11 23:22:28,748 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 23:22:28,748 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-11 23:22:28,748 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-11 23:22:28,778 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 166 out of 325
[2024-03-11 23:22:28,779 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 99 transitions, 282 flow. Second operand  has 3 states, 3 states have (on average 168.33333333333334) internal successors, (505), 3 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:22:28,779 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 23:22:28,779 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 325
[2024-03-11 23:22:28,779 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 23:22:34,343 INFO  L130       PetriNetUnfolder]: 52300/95562 cut-off events.
[2024-03-11 23:22:34,344 INFO  L131       PetriNetUnfolder]: For 24238/26818 co-relation queries the response was YES.
[2024-03-11 23:22:34,519 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 192752 conditions, 95562 events. 52300/95562 cut-off events. For 24238/26818 co-relation queries the response was YES. Maximal size of possible extension queue 2771. Compared 962655 event pairs, 15680 based on Foata normal form. 672/81172 useless extension candidates. Maximal degree in co-relation 192744. Up to 59933 conditions per place. 
[2024-03-11 23:22:34,857 INFO  L137   encePairwiseOnDemand]: 304/325 looper letters, 88 selfloop transitions, 22 changer transitions 0/150 dead transitions.
[2024-03-11 23:22:34,857 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 150 transitions, 671 flow
[2024-03-11 23:22:34,858 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-11 23:22:34,858 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-11 23:22:34,859 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 600 transitions.
[2024-03-11 23:22:34,860 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6153846153846154
[2024-03-11 23:22:34,860 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 600 transitions.
[2024-03-11 23:22:34,860 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 600 transitions.
[2024-03-11 23:22:34,861 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 23:22:34,861 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 600 transitions.
[2024-03-11 23:22:34,862 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 200.0) internal successors, (600), 3 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:22:34,864 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 325.0) internal successors, (1300), 4 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:22:34,864 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 325.0) internal successors, (1300), 4 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:22:34,864 INFO  L175             Difference]: Start difference. First operand has 94 places, 99 transitions, 282 flow. Second operand 3 states and 600 transitions.
[2024-03-11 23:22:34,864 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 150 transitions, 671 flow
[2024-03-11 23:22:35,018 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 150 transitions, 637 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-11 23:22:35,020 INFO  L231             Difference]: Finished difference. Result has 96 places, 121 transitions, 482 flow
[2024-03-11 23:22:35,020 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=482, PETRI_PLACES=96, PETRI_TRANSITIONS=121}
[2024-03-11 23:22:35,021 INFO  L288   CegarLoopForPetriNet]: 93 programPoint places, 3 predicate places.
[2024-03-11 23:22:35,021 INFO  L495      AbstractCegarLoop]: Abstraction has has 96 places, 121 transitions, 482 flow
[2024-03-11 23:22:35,021 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 168.33333333333334) internal successors, (505), 3 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:22:35,022 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 23:22:35,022 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 23:22:35,022 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-03-11 23:22:35,022 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] ===
[2024-03-11 23:22:35,022 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 23:22:35,022 INFO  L85        PathProgramCache]: Analyzing trace with hash 2130394789, now seen corresponding path program 1 times
[2024-03-11 23:22:35,022 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 23:22:35,022 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082303013]
[2024-03-11 23:22:35,022 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:22:35,023 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 23:22:35,034 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 23:22:35,047 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2024-03-11 23:22:35,048 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 23:22:35,048 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082303013]
[2024-03-11 23:22:35,048 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082303013] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 23:22:35,048 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 23:22:35,048 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-11 23:22:35,048 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026217367]
[2024-03-11 23:22:35,048 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 23:22:35,049 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-11 23:22:35,049 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 23:22:35,049 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-11 23:22:35,049 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-11 23:22:35,081 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 174 out of 325
[2024-03-11 23:22:35,081 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 121 transitions, 482 flow. Second operand  has 3 states, 3 states have (on average 176.66666666666666) internal successors, (530), 3 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:22:35,082 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 23:22:35,082 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 325
[2024-03-11 23:22:35,082 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 23:22:39,576 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1039] L1020-2-->L1020-4: Formula: (= v_~shared~0_74 (+ |v_threadThread1of3ForFork0_#t~post5_11| 1))  InVars {threadThread1of3ForFork0_#t~post5=|v_threadThread1of3ForFork0_#t~post5_11|}  OutVars{threadThread1of3ForFork0_#t~post5=|v_threadThread1of3ForFork0_#t~post5_11|, ~shared~0=v_~shared~0_74, threadThread1of3ForFork0_#t~nondet6=|v_threadThread1of3ForFork0_#t~nondet6_15|}  AuxVars[]  AssignedVars[~shared~0, threadThread1of3ForFork0_#t~nondet6][79], [Black: 203#true, 211#(= |threadThread2of3ForFork0_#t~nondet3| |#race~data~0|), 40#L1020-4true, 205#(= |#race~data~0| 0), 194#true, Black: 199#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet3|), 82#L1016-4true, threadThread1of3ForFork0InUse, 163#L1033-5true, threadThread2of3ForFork0InUse, threadThread3of3ForFork0NotInUse])
[2024-03-11 23:22:39,576 INFO  L383   tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event
[2024-03-11 23:22:39,576 INFO  L386   tUnfolder$Statistics]:   existing Event has 23 ancestors and is cut-off event
[2024-03-11 23:22:39,576 INFO  L386   tUnfolder$Statistics]:   existing Event has 23 ancestors and is cut-off event
[2024-03-11 23:22:39,576 INFO  L386   tUnfolder$Statistics]:   existing Event has 24 ancestors and is cut-off event
[2024-03-11 23:22:39,761 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1039] L1020-2-->L1020-4: Formula: (= v_~shared~0_74 (+ |v_threadThread1of3ForFork0_#t~post5_11| 1))  InVars {threadThread1of3ForFork0_#t~post5=|v_threadThread1of3ForFork0_#t~post5_11|}  OutVars{threadThread1of3ForFork0_#t~post5=|v_threadThread1of3ForFork0_#t~post5_11|, ~shared~0=v_~shared~0_74, threadThread1of3ForFork0_#t~nondet6=|v_threadThread1of3ForFork0_#t~nondet6_15|}  AuxVars[]  AssignedVars[~shared~0, threadThread1of3ForFork0_#t~nondet6][79], [Black: 203#true, 211#(= |threadThread2of3ForFork0_#t~nondet3| |#race~data~0|), 40#L1020-4true, 205#(= |#race~data~0| 0), 194#true, 32#L1034-12true, Black: 199#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet3|), 82#L1016-4true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, threadThread3of3ForFork0NotInUse])
[2024-03-11 23:22:39,762 INFO  L383   tUnfolder$Statistics]: this new event has 47 ancestors and is cut-off event
[2024-03-11 23:22:39,762 INFO  L386   tUnfolder$Statistics]:   existing Event has 24 ancestors and is cut-off event
[2024-03-11 23:22:39,762 INFO  L386   tUnfolder$Statistics]:   existing Event has 25 ancestors and is cut-off event
[2024-03-11 23:22:39,762 INFO  L386   tUnfolder$Statistics]:   existing Event has 24 ancestors and is cut-off event
[2024-03-11 23:22:39,762 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1039] L1020-2-->L1020-4: Formula: (= v_~shared~0_74 (+ |v_threadThread1of3ForFork0_#t~post5_11| 1))  InVars {threadThread1of3ForFork0_#t~post5=|v_threadThread1of3ForFork0_#t~post5_11|}  OutVars{threadThread1of3ForFork0_#t~post5=|v_threadThread1of3ForFork0_#t~post5_11|, ~shared~0=v_~shared~0_74, threadThread1of3ForFork0_#t~nondet6=|v_threadThread1of3ForFork0_#t~nondet6_15|}  AuxVars[]  AssignedVars[~shared~0, threadThread1of3ForFork0_#t~nondet6][79], [Black: 203#true, 211#(= |threadThread2of3ForFork0_#t~nondet3| |#race~data~0|), 40#L1020-4true, 205#(= |#race~data~0| 0), 194#true, 2#ULTIMATE.startEXITtrue, Black: 199#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet3|), 82#L1016-4true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, threadThread3of3ForFork0NotInUse])
[2024-03-11 23:22:39,762 INFO  L383   tUnfolder$Statistics]: this new event has 47 ancestors and is cut-off event
[2024-03-11 23:22:39,763 INFO  L386   tUnfolder$Statistics]:   existing Event has 24 ancestors and is cut-off event
[2024-03-11 23:22:39,763 INFO  L386   tUnfolder$Statistics]:   existing Event has 24 ancestors and is cut-off event
[2024-03-11 23:22:39,763 INFO  L386   tUnfolder$Statistics]:   existing Event has 25 ancestors and is cut-off event
[2024-03-11 23:22:41,497 INFO  L130       PetriNetUnfolder]: 56576/105812 cut-off events.
[2024-03-11 23:22:41,497 INFO  L131       PetriNetUnfolder]: For 82203/87061 co-relation queries the response was YES.
[2024-03-11 23:22:41,733 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 245386 conditions, 105812 events. 56576/105812 cut-off events. For 82203/87061 co-relation queries the response was YES. Maximal size of possible extension queue 3178. Compared 1114027 event pairs, 25811 based on Foata normal form. 1102/88999 useless extension candidates. Maximal degree in co-relation 245377. Up to 61835 conditions per place. 
[2024-03-11 23:22:42,128 INFO  L137   encePairwiseOnDemand]: 315/325 looper letters, 81 selfloop transitions, 27 changer transitions 0/164 dead transitions.
[2024-03-11 23:22:42,128 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 164 transitions, 897 flow
[2024-03-11 23:22:42,129 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-11 23:22:42,129 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-11 23:22:42,130 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 594 transitions.
[2024-03-11 23:22:42,131 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6092307692307692
[2024-03-11 23:22:42,131 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 594 transitions.
[2024-03-11 23:22:42,131 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 594 transitions.
[2024-03-11 23:22:42,131 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 23:22:42,131 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 594 transitions.
[2024-03-11 23:22:42,132 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 198.0) internal successors, (594), 3 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:22:42,133 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 325.0) internal successors, (1300), 4 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:22:42,134 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 325.0) internal successors, (1300), 4 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:22:42,134 INFO  L175             Difference]: Start difference. First operand has 96 places, 121 transitions, 482 flow. Second operand 3 states and 594 transitions.
[2024-03-11 23:22:42,134 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 164 transitions, 897 flow
[2024-03-11 23:22:42,209 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 164 transitions, 833 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-11 23:22:42,212 INFO  L231             Difference]: Finished difference. Result has 98 places, 143 transitions, 716 flow
[2024-03-11 23:22:42,212 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=438, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=716, PETRI_PLACES=98, PETRI_TRANSITIONS=143}
[2024-03-11 23:22:42,213 INFO  L288   CegarLoopForPetriNet]: 93 programPoint places, 5 predicate places.
[2024-03-11 23:22:42,213 INFO  L495      AbstractCegarLoop]: Abstraction has has 98 places, 143 transitions, 716 flow
[2024-03-11 23:22:42,213 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 176.66666666666666) internal successors, (530), 3 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:22:42,213 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 23:22:42,213 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 23:22:42,213 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-03-11 23:22:42,213 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] ===
[2024-03-11 23:22:42,214 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 23:22:42,214 INFO  L85        PathProgramCache]: Analyzing trace with hash -469230994, now seen corresponding path program 1 times
[2024-03-11 23:22:42,214 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 23:22:42,214 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709308714]
[2024-03-11 23:22:42,214 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:22:42,214 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 23:22:42,222 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 23:22:42,238 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 23:22:42,238 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 23:22:42,239 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709308714]
[2024-03-11 23:22:42,239 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709308714] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 23:22:42,239 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 23:22:42,239 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-03-11 23:22:42,239 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864154077]
[2024-03-11 23:22:42,239 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 23:22:42,239 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-11 23:22:42,239 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 23:22:42,240 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-11 23:22:42,240 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-11 23:22:42,261 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 171 out of 325
[2024-03-11 23:22:42,262 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 143 transitions, 716 flow. Second operand  has 3 states, 3 states have (on average 173.0) internal successors, (519), 3 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:22:42,262 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 23:22:42,262 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 325
[2024-03-11 23:22:42,262 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 23:22:49,964 INFO  L130       PetriNetUnfolder]: 63804/114087 cut-off events.
[2024-03-11 23:22:49,965 INFO  L131       PetriNetUnfolder]: For 193740/215850 co-relation queries the response was YES.
[2024-03-11 23:22:50,242 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 309338 conditions, 114087 events. 63804/114087 cut-off events. For 193740/215850 co-relation queries the response was YES. Maximal size of possible extension queue 2827. Compared 1140459 event pairs, 23061 based on Foata normal form. 5148/101981 useless extension candidates. Maximal degree in co-relation 309328. Up to 85596 conditions per place. 
[2024-03-11 23:22:50,683 INFO  L137   encePairwiseOnDemand]: 316/325 looper letters, 83 selfloop transitions, 3 changer transitions 0/144 dead transitions.
[2024-03-11 23:22:50,683 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 144 transitions, 902 flow
[2024-03-11 23:22:50,684 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-11 23:22:50,684 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-11 23:22:50,685 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 570 transitions.
[2024-03-11 23:22:50,686 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5846153846153846
[2024-03-11 23:22:50,686 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 570 transitions.
[2024-03-11 23:22:50,686 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 570 transitions.
[2024-03-11 23:22:50,686 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 23:22:50,686 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 570 transitions.
[2024-03-11 23:22:50,687 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 190.0) internal successors, (570), 3 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:22:50,688 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 325.0) internal successors, (1300), 4 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:22:50,689 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 325.0) internal successors, (1300), 4 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:22:50,689 INFO  L175             Difference]: Start difference. First operand has 98 places, 143 transitions, 716 flow. Second operand 3 states and 570 transitions.
[2024-03-11 23:22:50,689 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 144 transitions, 902 flow
[2024-03-11 23:22:50,933 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 144 transitions, 848 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-11 23:22:50,934 INFO  L231             Difference]: Finished difference. Result has 96 places, 137 transitions, 665 flow
[2024-03-11 23:22:50,934 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=644, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=665, PETRI_PLACES=96, PETRI_TRANSITIONS=137}
[2024-03-11 23:22:50,935 INFO  L288   CegarLoopForPetriNet]: 93 programPoint places, 3 predicate places.
[2024-03-11 23:22:50,935 INFO  L495      AbstractCegarLoop]: Abstraction has has 96 places, 137 transitions, 665 flow
[2024-03-11 23:22:50,935 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 173.0) internal successors, (519), 3 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:22:50,935 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 23:22:50,935 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 23:22:50,935 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-03-11 23:22:50,936 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] ===
[2024-03-11 23:22:50,936 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 23:22:50,936 INFO  L85        PathProgramCache]: Analyzing trace with hash -1349427277, now seen corresponding path program 1 times
[2024-03-11 23:22:50,936 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 23:22:50,936 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368348950]
[2024-03-11 23:22:50,936 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:22:50,936 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 23:22:50,953 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-11 23:22:50,954 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-03-11 23:22:50,961 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-11 23:22:50,965 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-03-11 23:22:50,965 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-03-11 23:22:50,965 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (24 of 25 remaining)
[2024-03-11 23:22:50,965 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (23 of 25 remaining)
[2024-03-11 23:22:50,966 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (22 of 25 remaining)
[2024-03-11 23:22:50,966 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (21 of 25 remaining)
[2024-03-11 23:22:50,966 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (20 of 25 remaining)
[2024-03-11 23:22:50,966 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 25 remaining)
[2024-03-11 23:22:50,966 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (18 of 25 remaining)
[2024-03-11 23:22:50,966 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (17 of 25 remaining)
[2024-03-11 23:22:50,966 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (16 of 25 remaining)
[2024-03-11 23:22:50,966 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (15 of 25 remaining)
[2024-03-11 23:22:50,966 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (14 of 25 remaining)
[2024-03-11 23:22:50,966 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (13 of 25 remaining)
[2024-03-11 23:22:50,966 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (12 of 25 remaining)
[2024-03-11 23:22:50,966 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (11 of 25 remaining)
[2024-03-11 23:22:50,967 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (10 of 25 remaining)
[2024-03-11 23:22:50,967 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (9 of 25 remaining)
[2024-03-11 23:22:50,967 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (8 of 25 remaining)
[2024-03-11 23:22:50,967 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (7 of 25 remaining)
[2024-03-11 23:22:50,967 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (6 of 25 remaining)
[2024-03-11 23:22:50,967 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (5 of 25 remaining)
[2024-03-11 23:22:50,967 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (4 of 25 remaining)
[2024-03-11 23:22:50,967 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (3 of 25 remaining)
[2024-03-11 23:22:50,967 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (2 of 25 remaining)
[2024-03-11 23:22:50,967 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (1 of 25 remaining)
[2024-03-11 23:22:50,968 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (0 of 25 remaining)
[2024-03-11 23:22:50,968 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-03-11 23:22:50,968 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1]
[2024-03-11 23:22:50,971 INFO  L228   ceAbstractionStarter]: Analysis of concurrent program completed with 3 thread instances
[2024-03-11 23:22:50,971 INFO  L178   ceAbstractionStarter]: Computing trace abstraction results
[2024-03-11 23:22:50,995 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.03 11:22:50 BasicIcfg
[2024-03-11 23:22:50,996 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-03-11 23:22:50,996 INFO  L113        PluginConnector]: ------------------------Witness Printer----------------------------
[2024-03-11 23:22:50,996 INFO  L271        PluginConnector]: Initializing Witness Printer...
[2024-03-11 23:22:50,996 INFO  L275        PluginConnector]: Witness Printer initialized
[2024-03-11 23:22:50,996 INFO  L185        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 11:22:09" (3/4) ...
[2024-03-11 23:22:50,998 INFO  L140         WitnessPrinter]: No result that supports witness generation found
[2024-03-11 23:22:50,998 INFO  L132        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-03-11 23:22:50,999 INFO  L158              Benchmark]: Toolchain (without parser) took 42399.54ms. Allocated memory was 107.0MB in the beginning and 7.9GB in the end (delta: 7.8GB). Free memory was 66.3MB in the beginning and 4.7GB in the end (delta: -4.7GB). Peak memory consumption was 3.2GB. Max. memory is 16.1GB.
[2024-03-11 23:22:50,999 INFO  L158              Benchmark]: CDTParser took 0.10ms. Allocated memory is still 107.0MB. Free memory is still 81.9MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-03-11 23:22:50,999 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 403.96ms. Allocated memory was 107.0MB in the beginning and 130.0MB in the end (delta: 23.1MB). Free memory was 66.0MB in the beginning and 97.5MB in the end (delta: -31.4MB). Peak memory consumption was 32.6MB. Max. memory is 16.1GB.
[2024-03-11 23:22:50,999 INFO  L158              Benchmark]: Boogie Procedure Inliner took 38.29ms. Allocated memory is still 130.0MB. Free memory was 97.5MB in the beginning and 94.7MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-03-11 23:22:50,999 INFO  L158              Benchmark]: Boogie Preprocessor took 25.94ms. Allocated memory is still 130.0MB. Free memory was 94.7MB in the beginning and 92.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-03-11 23:22:51,000 INFO  L158              Benchmark]: RCFGBuilder took 640.36ms. Allocated memory is still 130.0MB. Free memory was 92.7MB in the beginning and 75.7MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2024-03-11 23:22:51,000 INFO  L158              Benchmark]: TraceAbstraction took 41282.97ms. Allocated memory was 130.0MB in the beginning and 7.9GB in the end (delta: 7.8GB). Free memory was 75.0MB in the beginning and 4.7GB in the end (delta: -4.6GB). Peak memory consumption was 3.2GB. Max. memory is 16.1GB.
[2024-03-11 23:22:51,000 INFO  L158              Benchmark]: Witness Printer took 2.32ms. Allocated memory is still 7.9GB. Free memory is still 4.7GB. There was no memory consumed. Max. memory is 16.1GB.
[2024-03-11 23:22:51,001 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.10ms. Allocated memory is still 107.0MB. Free memory is still 81.9MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 403.96ms. Allocated memory was 107.0MB in the beginning and 130.0MB in the end (delta: 23.1MB). Free memory was 66.0MB in the beginning and 97.5MB in the end (delta: -31.4MB). Peak memory consumption was 32.6MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 38.29ms. Allocated memory is still 130.0MB. Free memory was 97.5MB in the beginning and 94.7MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 25.94ms. Allocated memory is still 130.0MB. Free memory was 94.7MB in the beginning and 92.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
 * RCFGBuilder took 640.36ms. Allocated memory is still 130.0MB. Free memory was 92.7MB in the beginning and 75.7MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
 * TraceAbstraction took 41282.97ms. Allocated memory was 130.0MB in the beginning and 7.9GB in the end (delta: 7.8GB). Free memory was 75.0MB in the beginning and 4.7GB in the end (delta: -4.6GB). Peak memory consumption was 3.2GB. Max. memory is 16.1GB.
 * Witness Printer took 2.32ms. Allocated memory is still 7.9GB. Free memory is still 4.7GB. 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: 4.4s, 123 PlacesBefore, 22 PlacesAfterwards, 126 TransitionsBefore, 20 TransitionsAfterwards, 3498 CoEnabledTransitionPairs, 8 FixpointIterations, 37 TrivialSequentialCompositions, 97 ConcurrentSequentialCompositions, 4 TrivialYvCompositions, 8 ConcurrentYvCompositions, 5 ChoiceCompositions, 151 TotalNumberOfCompositions, 3236 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3236, independent: 3236, independent conditional: 0, independent unconditional: 3236, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1910, independent: 1910, independent conditional: 0, independent unconditional: 1910, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3236, independent: 1326, independent conditional: 0, independent unconditional: 1326, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1910, unknown conditional: 0, unknown unconditional: 1910] , Statistics on independence cache: Total cache size (in pairs): 20, Positive cache size: 20, Positive conditional cache size: 0, Positive unconditional cache size: 20, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    Lipton Reduction Statistics: ReductionTime: 3.6s, 157 PlacesBefore, 67 PlacesAfterwards, 161 TransitionsBefore, 68 TransitionsAfterwards, 10032 CoEnabledTransitionPairs, 6 FixpointIterations, 30 TrivialSequentialCompositions, 62 ConcurrentSequentialCompositions, 4 TrivialYvCompositions, 14 ConcurrentYvCompositions, 3 ChoiceCompositions, 113 TotalNumberOfCompositions, 37118 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 17340, independent: 16751, independent conditional: 0, independent unconditional: 16751, dependent: 589, dependent conditional: 0, dependent unconditional: 589, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 5024, independent: 4955, independent conditional: 0, independent unconditional: 4955, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 17340, independent: 11796, independent conditional: 0, independent unconditional: 11796, dependent: 520, dependent conditional: 0, dependent unconditional: 520, unknown: 5024, unknown conditional: 0, unknown unconditional: 5024] , Statistics on independence cache: Total cache size (in pairs): 897, Positive cache size: 858, Positive conditional cache size: 0, Positive unconditional cache size: 858, Negative cache size: 39, Negative conditional cache size: 0, Negative unconditional cache size: 39, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    Lipton Reduction Statistics: ReductionTime: 4.2s, 191 PlacesBefore, 93 PlacesAfterwards, 196 TransitionsBefore, 95 TransitionsAfterwards, 18612 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 70 ConcurrentSequentialCompositions, 4 TrivialYvCompositions, 19 ConcurrentYvCompositions, 3 ChoiceCompositions, 129 TotalNumberOfCompositions, 93204 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 26880, independent: 25859, independent conditional: 0, independent unconditional: 25859, dependent: 1021, dependent conditional: 0, dependent unconditional: 1021, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 8690, independent: 8551, independent conditional: 0, independent unconditional: 8551, dependent: 139, dependent conditional: 0, dependent unconditional: 139, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 26880, independent: 17308, independent conditional: 0, independent unconditional: 17308, dependent: 882, dependent conditional: 0, dependent unconditional: 882, unknown: 8690, unknown conditional: 0, unknown unconditional: 8690] , Statistics on independence cache: Total cache size (in pairs): 1396, Positive cache size: 1305, Positive conditional cache size: 0, Positive unconditional cache size: 1305, Negative cache size: 91, Negative conditional cache size: 0, Negative unconditional cache size: 91, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0
  - DataRaceFoundResult [Line: 1016]: Data race detected
    Data race detected
The following path leads to a data race: 
[L1012]               0  int data = 0;
[L1013]               0  int shared = 0;
[L1014]               0  pthread_mutex_t shared_mutex = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } };
[L1027]               0  int breads_total = __VERIFIER_nondet_int();
[L1028]  CALL         0  assume_abort_if_not(breads_total >= 0)
[L1009]  COND FALSE   0  !(!cond)
[L1028]  RET          0  assume_abort_if_not(breads_total >= 0)
[L1029]               0  pthread_t *tids = malloc(breads_total * sizeof(pthread_t));
[L1029]               0  pthread_t *tids = malloc(breads_total * sizeof(pthread_t));
[L1030]               0  int i = 0;
         VAL             [breads_total=5, data=0, i=0, shared=0, shared_mutex={1:0}, tids={5:0}]
[L1030]  COND TRUE    0  i < breads_total
[L1031]  EXPR         0  \read(*tids)
[L1031]  EXPR         0  tids[i]
[L1031]  FCALL, FORK  0  pthread_create(&tids[i], ((void *)0), &thread, ((void *)0))
         VAL             [\read(*tids)={-2:0}, arg={0:0}, breads_total=5, data=0, i=0, pthread_create(&tids[i], ((void *)0), &thread, ((void *)0))=-1, shared=0, shared_mutex={1:0}, tids={5:0}]
[L1030]               0  i++
         VAL             [arg={0:0}, breads_total=5, data=0, i=1, shared=0, shared_mutex={1:0}, tids={5:0}]
[L1030]  COND TRUE    0  i < breads_total
[L1031]  EXPR         0  \read(*tids)
[L1031]  EXPR         0  tids[i]
[L1031]  FCALL, FORK  0  pthread_create(&tids[i], ((void *)0), &thread, ((void *)0))
         VAL             [\read(*tids)={-2:0}, arg={0:0}, breads_total=5, data=0, i=1, pthread_create(&tids[i], ((void *)0), &thread, ((void *)0))=0, shared=0, shared_mutex={1:0}, tids={5:0}]
[L1016]               1  data = 1
         VAL             [arg={0:0}, arg={0:0}, data=1, data = 1=25, shared=0, shared_mutex={1:0}]
[L1016]               2  data = 1
         VAL             [arg={0:0}, arg={0:0}, data=1, data = 1=26, shared=0, shared_mutex={1:0}]

Now there is a data race, but we were unable to determine exactly which statements and variables are involved. There could be a race between one of the statements
	* C: tids[i] [1031]
	* C: tids[i] [1031]
	* C: tids[i] [1031]
	* C: tids[i] [1031]
and
	C: data = 1 [1016]

  - UnprovableResult [Line: 1031]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1034]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1036]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1034]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1031]: 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. 
  - UnprovableResult [Line: 1017]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1020]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1020]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1021]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
    CFG has 3 procedures, 153 locations, 15 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.8s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10 IncrementalHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 0 mSDtfsCounter, 10 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=0, InterpolantAutomatonStates: 2, 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.0s InterpolantComputationTime, 8 NumberOfCodeBlocks, 8 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 1 ConstructedInterpolants, 0 QuantifiedInterpolants, 1 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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, 185 locations, 20 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: 5.4s, OverallIterations: 5, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 174 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 86 mSDsluCounter, 10 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 328 IncrementalHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 10 mSDtfsCounter, 328 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=354occurred in iteration=4, InterpolantAutomatonStates: 11, 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, 37 NumberOfCodeBlocks, 37 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 22 ConstructedInterpolants, 0 QuantifiedInterpolants, 28 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 2/2 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, 217 locations, 25 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: 30.7s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 26.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 280 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 161 mSDsluCounter, 30 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 60 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 520 IncrementalHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 60 mSolverCounterUnsat, 30 mSDtfsCounter, 520 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=716occurred in iteration=4, InterpolantAutomatonStates: 14, 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, 49 NumberOfCodeBlocks, 49 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 32 ConstructedInterpolants, 0 QuantifiedInterpolants, 48 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 2/2 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
[2024-03-11 23:22:51,186 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
