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


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


Checking for data races
Using default analysis
Version 2329fc70
Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data -tc /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/AutomizerReach.xml -i /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/thread-join-array-const.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 88f4de446c7de3b680a0fa97a4f03fff2a2808b9a411e3c087c1aea639ead9d9
--- Real Ultimate output ---
This is Ultimate 0.2.2-dev-2329fc7
[2023-10-25 15:19:24,699 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2023-10-25 15:19:24,708 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2023-10-25 15:19:24,759 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2023-10-25 15:19:24,760 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2023-10-25 15:19:24,776 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2023-10-25 15:19:24,777 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2023-10-25 15:19:24,779 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2023-10-25 15:19:24,781 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2023-10-25 15:19:24,785 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2023-10-25 15:19:24,786 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2023-10-25 15:19:24,788 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2023-10-25 15:19:24,788 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2023-10-25 15:19:24,790 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2023-10-25 15:19:24,791 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2023-10-25 15:19:24,792 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2023-10-25 15:19:24,793 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2023-10-25 15:19:24,794 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2023-10-25 15:19:24,794 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2023-10-25 15:19:24,798 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2023-10-25 15:19:24,799 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2023-10-25 15:19:24,808 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2023-10-25 15:19:24,809 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2023-10-25 15:19:24,810 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2023-10-25 15:19:24,815 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2023-10-25 15:19:24,816 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2023-10-25 15:19:24,816 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2023-10-25 15:19:24,817 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2023-10-25 15:19:24,818 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2023-10-25 15:19:24,818 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2023-10-25 15:19:24,818 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2023-10-25 15:19:24,819 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2023-10-25 15:19:24,830 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2023-10-25 15:19:24,832 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2023-10-25 15:19:24,832 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2023-10-25 15:19:24,833 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2023-10-25 15:19:24,833 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2023-10-25 15:19:24,834 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2023-10-25 15:19:24,834 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2023-10-25 15:19:24,835 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2023-10-25 15:19:24,835 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2023-10-25 15:19:24,836 INFO  L101        SettingsManager]: Beginning loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2023-10-25 15:19:24,872 INFO  L113        SettingsManager]: Loading preferences was successful
[2023-10-25 15:19:24,872 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2023-10-25 15:19:24,873 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-10-25 15:19:24,873 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-10-25 15:19:24,874 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-10-25 15:19:24,874 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-10-25 15:19:24,874 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-10-25 15:19:24,874 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2023-10-25 15:19:24,874 INFO  L138        SettingsManager]:  * Use SBE=true
[2023-10-25 15:19:24,875 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-10-25 15:19:24,875 INFO  L138        SettingsManager]:  * sizeof long=4
[2023-10-25 15:19:24,876 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2023-10-25 15:19:24,876 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2023-10-25 15:19:24,876 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2023-10-25 15:19:24,876 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2023-10-25 15:19:24,876 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2023-10-25 15:19:24,876 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-10-25 15:19:24,877 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2023-10-25 15:19:24,877 INFO  L138        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2023-10-25 15:19:24,877 INFO  L138        SettingsManager]:  * sizeof long double=12
[2023-10-25 15:19:24,877 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2023-10-25 15:19:24,889 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2023-10-25 15:19:24,889 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2023-10-25 15:19:24,890 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-10-25 15:19:24,890 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2023-10-25 15:19:24,890 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2023-10-25 15:19:24,890 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-10-25 15:19:24,890 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-10-25 15:19:24,891 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2023-10-25 15:19:24,891 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2023-10-25 15:19:24,891 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2023-10-25 15:19:24,891 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-10-25 15:19:24,892 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2023-10-25 15:19:24,892 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-10-25 15:19:24,892 INFO  L138        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2023-10-25 15:19:24,892 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2023-10-25 15:19:24,892 INFO  L138        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2023-10-25 15:19:24,892 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 -> 88f4de446c7de3b680a0fa97a4f03fff2a2808b9a411e3c087c1aea639ead9d9
[2023-10-25 15:19:25,249 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2023-10-25 15:19:25,269 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-10-25 15:19:25,271 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-10-25 15:19:25,272 INFO  L271        PluginConnector]: Initializing CDTParser...
[2023-10-25 15:19:25,272 INFO  L275        PluginConnector]: CDTParser initialized
[2023-10-25 15:19:25,273 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/thread-join-array-const.i
[2023-10-25 15:19:26,901 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2023-10-25 15:19:27,233 INFO  L351              CDTParser]: Found 1 translation units.
[2023-10-25 15:19:27,240 INFO  L172              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/thread-join-array-const.i
[2023-10-25 15:19:27,253 INFO  L394              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/ce62fa2bc/5c6a5067867d478b9326d404eaa8fcad/FLAGe7329c843
[2023-10-25 15:19:27,289 INFO  L402              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/ce62fa2bc/5c6a5067867d478b9326d404eaa8fcad
[2023-10-25 15:19:27,291 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-10-25 15:19:27,292 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2023-10-25 15:19:27,301 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-10-25 15:19:27,302 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-10-25 15:19:27,304 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2023-10-25 15:19:27,306 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 03:19:27" (1/1) ...
[2023-10-25 15:19:27,307 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9e485a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:19:27, skipping insertion in model container
[2023-10-25 15:19:27,309 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 03:19:27" (1/1) ...
[2023-10-25 15:19:27,319 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2023-10-25 15:19:27,380 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2023-10-25 15:19:27,814 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-10-25 15:19:27,841 INFO  L203         MainTranslator]: Completed pre-run
[2023-10-25 15:19:27,921 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-10-25 15:19:27,975 INFO  L208         MainTranslator]: Completed translation
[2023-10-25 15:19:27,989 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:19:27 WrapperNode
[2023-10-25 15:19:27,989 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-10-25 15:19:27,991 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-10-25 15:19:27,991 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-10-25 15:19:27,991 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2023-10-25 15:19:27,996 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:19:27" (1/1) ...
[2023-10-25 15:19:28,032 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:19:27" (1/1) ...
[2023-10-25 15:19:28,057 INFO  L138                Inliner]: procedures = 156, calls = 15, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 53
[2023-10-25 15:19:28,058 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-10-25 15:19:28,058 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-10-25 15:19:28,058 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2023-10-25 15:19:28,060 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2023-10-25 15:19:28,081 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:19:27" (1/1) ...
[2023-10-25 15:19:28,081 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:19:27" (1/1) ...
[2023-10-25 15:19:28,083 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:19:27" (1/1) ...
[2023-10-25 15:19:28,083 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:19:27" (1/1) ...
[2023-10-25 15:19:28,087 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:19:27" (1/1) ...
[2023-10-25 15:19:28,090 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:19:27" (1/1) ...
[2023-10-25 15:19:28,108 INFO  L185        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:19:27" (1/1) ...
[2023-10-25 15:19:28,109 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:19:27" (1/1) ...
[2023-10-25 15:19:28,111 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-10-25 15:19:28,118 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-10-25 15:19:28,118 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2023-10-25 15:19:28,119 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2023-10-25 15:19:28,120 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:19:27" (1/1) ...
[2023-10-25 15:19:28,124 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-10-25 15:19:28,139 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 15:19:28,151 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2023-10-25 15:19:28,174 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2023-10-25 15:19:28,183 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2023-10-25 15:19:28,184 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2023-10-25 15:19:28,184 INFO  L130     BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock
[2023-10-25 15:19:28,184 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2023-10-25 15:19:28,184 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2023-10-25 15:19:28,184 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-10-25 15:19:28,187 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2023-10-25 15:19:28,187 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2023-10-25 15:19:28,187 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2023-10-25 15:19:28,187 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-10-25 15:19:28,187 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-10-25 15:19:28,188 WARN  L209             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2023-10-25 15:19:28,369 INFO  L235             CfgBuilder]: Building ICFG
[2023-10-25 15:19:28,377 INFO  L261             CfgBuilder]: Building CFG for each procedure with an implementation
[2023-10-25 15:19:28,676 INFO  L276             CfgBuilder]: Performing block encoding
[2023-10-25 15:19:28,681 INFO  L295             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-10-25 15:19:28,697 INFO  L300             CfgBuilder]: Removed 2 assume(true) statements.
[2023-10-25 15:19:28,698 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 03:19:28 BoogieIcfgContainer
[2023-10-25 15:19:28,699 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-10-25 15:19:28,700 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-10-25 15:19:28,700 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2023-10-25 15:19:28,703 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2023-10-25 15:19:28,703 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 03:19:27" (1/3) ...
[2023-10-25 15:19:28,703 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@209488e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 03:19:28, skipping insertion in model container
[2023-10-25 15:19:28,703 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:19:27" (2/3) ...
[2023-10-25 15:19:28,704 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@209488e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 03:19:28, skipping insertion in model container
[2023-10-25 15:19:28,704 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 03:19:28" (3/3) ...
[2023-10-25 15:19:28,705 INFO  L112   eAbstractionObserver]: Analyzing ICFG thread-join-array-const.i
[2023-10-25 15:19:28,711 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2023-10-25 15:19:28,726 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-10-25 15:19:28,737 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations.
[2023-10-25 15:19:28,737 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2023-10-25 15:19:28,803 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2023-10-25 15:19:28,855 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 71 places, 71 transitions, 150 flow
[2023-10-25 15:19:28,940 INFO  L130       PetriNetUnfolder]: 5/97 cut-off events.
[2023-10-25 15:19:28,941 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-10-25 15:19:28,944 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 103 conditions, 97 events. 5/97 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 189 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 45. Up to 4 conditions per place. 
[2023-10-25 15:19:28,944 INFO  L82        GeneralOperation]: Start removeDead. Operand has 71 places, 71 transitions, 150 flow
[2023-10-25 15:19:28,947 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 71 places, 71 transitions, 150 flow
[2023-10-25 15:19:28,953 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-10-25 15:19:28,977 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 71 transitions, 150 flow
[2023-10-25 15:19:28,981 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 71 transitions, 150 flow
[2023-10-25 15:19:28,981 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 71 places, 71 transitions, 150 flow
[2023-10-25 15:19:29,007 INFO  L130       PetriNetUnfolder]: 5/97 cut-off events.
[2023-10-25 15:19:29,011 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-10-25 15:19:29,014 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 103 conditions, 97 events. 5/97 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 189 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 45. Up to 4 conditions per place. 
[2023-10-25 15:19:29,016 INFO  L119        LiptonReduction]: Number of co-enabled transitions 896
[2023-10-25 15:19:31,139 INFO  L134        LiptonReduction]: Checked pairs total: 1340
[2023-10-25 15:19:31,139 INFO  L136        LiptonReduction]: Total number of compositions: 56
[2023-10-25 15:19:31,158 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-10-25 15:19:31,179 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;@425a5f48, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-10-25 15:19:31,180 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 5 error locations.
[2023-10-25 15:19:31,185 INFO  L130       PetriNetUnfolder]: 0/4 cut-off events.
[2023-10-25 15:19:31,185 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-25 15:19:31,186 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:19:31,186 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1]
[2023-10-25 15:19:31,187 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2023-10-25 15:19:31,191 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:19:31,191 INFO  L85        PathProgramCache]: Analyzing trace with hash 259358, now seen corresponding path program 1 times
[2023-10-25 15:19:31,199 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:19:31,213 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326726755]
[2023-10-25 15:19:31,213 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:19:31,214 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:19:31,368 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:19:31,574 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:19:31,575 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:19:31,576 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326726755]
[2023-10-25 15:19:31,576 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326726755] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:19:31,577 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:19:31,577 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 15:19:31,578 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670503785]
[2023-10-25 15:19:31,578 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:19:31,584 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:19:31,584 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:19:31,620 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:19:31,621 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:19:31,668 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 64 out of 127
[2023-10-25 15:19:31,670 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 18 transitions, 44 flow. Second operand  has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:31,670 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:19:31,670 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 127
[2023-10-25 15:19:31,671 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:19:31,750 INFO  L130       PetriNetUnfolder]: 18/68 cut-off events.
[2023-10-25 15:19:31,750 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-10-25 15:19:31,751 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 131 conditions, 68 events. 18/68 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 212 event pairs, 0 based on Foata normal form. 0/54 useless extension candidates. Maximal degree in co-relation 99. Up to 48 conditions per place. 
[2023-10-25 15:19:31,757 INFO  L137   encePairwiseOnDemand]: 123/127 looper letters, 15 selfloop transitions, 2 changer transitions 0/21 dead transitions.
[2023-10-25 15:19:31,758 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 21 transitions, 84 flow
[2023-10-25 15:19:31,759 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:19:31,760 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:19:31,770 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 211 transitions.
[2023-10-25 15:19:31,773 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5538057742782152
[2023-10-25 15:19:31,773 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 211 transitions.
[2023-10-25 15:19:31,774 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 211 transitions.
[2023-10-25 15:19:31,775 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:19:31,777 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 211 transitions.
[2023-10-25 15:19:31,783 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:31,789 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:31,790 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:31,792 INFO  L175             Difference]: Start difference. First operand has 20 places, 18 transitions, 44 flow. Second operand 3 states and 211 transitions.
[2023-10-25 15:19:31,792 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 21 transitions, 84 flow
[2023-10-25 15:19:31,795 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 21 transitions, 84 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-25 15:19:31,811 INFO  L231             Difference]: Finished difference. Result has 22 places, 17 transitions, 50 flow
[2023-10-25 15:19:31,813 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=127, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=22, PETRI_TRANSITIONS=17}
[2023-10-25 15:19:31,830 INFO  L288   CegarLoopForPetriNet]: 20 programPoint places, 2 predicate places.
[2023-10-25 15:19:31,831 INFO  L495      AbstractCegarLoop]: Abstraction has has 22 places, 17 transitions, 50 flow
[2023-10-25 15:19:31,831 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:31,831 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:19:31,831 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2023-10-25 15:19:31,832 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-10-25 15:19:31,832 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2023-10-25 15:19:31,832 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:19:31,832 INFO  L85        PathProgramCache]: Analyzing trace with hash -845397772, now seen corresponding path program 1 times
[2023-10-25 15:19:31,833 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:19:31,834 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738179698]
[2023-10-25 15:19:31,834 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:19:31,836 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:19:31,860 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:19:31,941 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:19:31,942 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:19:31,942 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738179698]
[2023-10-25 15:19:31,942 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738179698] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:19:31,943 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:19:31,943 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 15:19:31,944 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174850147]
[2023-10-25 15:19:31,946 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:19:31,947 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:19:31,947 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:19:31,948 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:19:31,948 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:19:31,960 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 61 out of 127
[2023-10-25 15:19:31,961 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 17 transitions, 50 flow. Second operand  has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:31,977 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:19:31,977 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 127
[2023-10-25 15:19:31,977 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:19:32,035 INFO  L130       PetriNetUnfolder]: 20/70 cut-off events.
[2023-10-25 15:19:32,036 INFO  L131       PetriNetUnfolder]: For 7/7 co-relation queries the response was YES.
[2023-10-25 15:19:32,036 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 151 conditions, 70 events. 20/70 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 208 event pairs, 13 based on Foata normal form. 0/58 useless extension candidates. Maximal degree in co-relation 122. Up to 48 conditions per place. 
[2023-10-25 15:19:32,037 INFO  L137   encePairwiseOnDemand]: 123/127 looper letters, 17 selfloop transitions, 3 changer transitions 1/24 dead transitions.
[2023-10-25 15:19:32,037 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 24 transitions, 111 flow
[2023-10-25 15:19:32,038 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:19:32,038 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:19:32,042 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 205 transitions.
[2023-10-25 15:19:32,043 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5380577427821522
[2023-10-25 15:19:32,043 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 205 transitions.
[2023-10-25 15:19:32,043 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 205 transitions.
[2023-10-25 15:19:32,043 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:19:32,044 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 205 transitions.
[2023-10-25 15:19:32,045 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:32,047 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:32,048 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:32,048 INFO  L175             Difference]: Start difference. First operand has 22 places, 17 transitions, 50 flow. Second operand 3 states and 205 transitions.
[2023-10-25 15:19:32,048 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 24 transitions, 111 flow
[2023-10-25 15:19:32,049 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 24 transitions, 105 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-25 15:19:32,049 INFO  L231             Difference]: Finished difference. Result has 23 places, 19 transitions, 65 flow
[2023-10-25 15:19:32,049 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=127, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=65, PETRI_PLACES=23, PETRI_TRANSITIONS=19}
[2023-10-25 15:19:32,050 INFO  L288   CegarLoopForPetriNet]: 20 programPoint places, 3 predicate places.
[2023-10-25 15:19:32,050 INFO  L495      AbstractCegarLoop]: Abstraction has has 23 places, 19 transitions, 65 flow
[2023-10-25 15:19:32,051 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:32,051 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:19:32,051 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1]
[2023-10-25 15:19:32,051 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-10-25 15:19:32,051 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2023-10-25 15:19:32,051 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:19:32,052 INFO  L85        PathProgramCache]: Analyzing trace with hash -845390790, now seen corresponding path program 1 times
[2023-10-25 15:19:32,052 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:19:32,052 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647013643]
[2023-10-25 15:19:32,052 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:19:32,053 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:19:32,081 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-25 15:19:32,093 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-10-25 15:19:32,118 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-25 15:19:32,153 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-10-25 15:19:32,154 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-10-25 15:19:32,155 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining)
[2023-10-25 15:19:32,156 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (3 of 5 remaining)
[2023-10-25 15:19:32,156 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (2 of 5 remaining)
[2023-10-25 15:19:32,157 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 5 remaining)
[2023-10-25 15:19:32,157 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 5 remaining)
[2023-10-25 15:19:32,157 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-10-25 15:19:32,157 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1]
[2023-10-25 15:19:32,159 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-10-25 15:19:32,173 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2023-10-25 15:19:32,195 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2023-10-25 15:19:32,215 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 88 places, 87 transitions, 192 flow
[2023-10-25 15:19:32,241 INFO  L130       PetriNetUnfolder]: 10/173 cut-off events.
[2023-10-25 15:19:32,242 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2023-10-25 15:19:32,257 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 187 conditions, 173 events. 10/173 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 414 event pairs, 0 based on Foata normal form. 0/149 useless extension candidates. Maximal degree in co-relation 99. Up to 8 conditions per place. 
[2023-10-25 15:19:32,257 INFO  L82        GeneralOperation]: Start removeDead. Operand has 88 places, 87 transitions, 192 flow
[2023-10-25 15:19:32,260 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 88 places, 87 transitions, 192 flow
[2023-10-25 15:19:32,260 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-10-25 15:19:32,260 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 87 transitions, 192 flow
[2023-10-25 15:19:32,264 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 87 transitions, 192 flow
[2023-10-25 15:19:32,264 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 88 places, 87 transitions, 192 flow
[2023-10-25 15:19:32,278 INFO  L130       PetriNetUnfolder]: 10/173 cut-off events.
[2023-10-25 15:19:32,278 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2023-10-25 15:19:32,289 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 187 conditions, 173 events. 10/173 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 414 event pairs, 0 based on Foata normal form. 0/149 useless extension candidates. Maximal degree in co-relation 99. Up to 8 conditions per place. 
[2023-10-25 15:19:32,291 INFO  L119        LiptonReduction]: Number of co-enabled transitions 2492
[2023-10-25 15:19:34,125 INFO  L134        LiptonReduction]: Checked pairs total: 5100
[2023-10-25 15:19:34,125 INFO  L136        LiptonReduction]: Total number of compositions: 61
[2023-10-25 15:19:34,126 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-10-25 15:19:34,127 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;@425a5f48, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-10-25 15:19:34,127 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2023-10-25 15:19:34,139 INFO  L130       PetriNetUnfolder]: 0/5 cut-off events.
[2023-10-25 15:19:34,139 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-25 15:19:34,139 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:19:34,140 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1]
[2023-10-25 15:19:34,140 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2023-10-25 15:19:34,140 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:19:34,141 INFO  L85        PathProgramCache]: Analyzing trace with hash 422177, now seen corresponding path program 1 times
[2023-10-25 15:19:34,141 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:19:34,141 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502490952]
[2023-10-25 15:19:34,141 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:19:34,141 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:19:34,170 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:19:34,226 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:19:34,227 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:19:34,227 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502490952]
[2023-10-25 15:19:34,227 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502490952] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:19:34,228 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:19:34,228 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 15:19:34,229 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667693010]
[2023-10-25 15:19:34,231 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:19:34,231 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:19:34,232 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:19:34,232 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:19:34,232 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:19:34,260 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 78 out of 148
[2023-10-25 15:19:34,260 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 30 transitions, 78 flow. Second operand  has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:34,260 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:19:34,260 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 148
[2023-10-25 15:19:34,260 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:19:34,440 INFO  L130       PetriNetUnfolder]: 381/817 cut-off events.
[2023-10-25 15:19:34,441 INFO  L131       PetriNetUnfolder]: For 33/33 co-relation queries the response was YES.
[2023-10-25 15:19:34,443 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1537 conditions, 817 events. 381/817 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 4395 event pairs, 164 based on Foata normal form. 0/720 useless extension candidates. Maximal degree in co-relation 243. Up to 664 conditions per place. 
[2023-10-25 15:19:34,445 INFO  L137   encePairwiseOnDemand]: 144/148 looper letters, 26 selfloop transitions, 2 changer transitions 0/36 dead transitions.
[2023-10-25 15:19:34,446 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 36 transitions, 146 flow
[2023-10-25 15:19:34,446 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:19:34,446 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:19:34,447 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 264 transitions.
[2023-10-25 15:19:34,447 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5945945945945946
[2023-10-25 15:19:34,447 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 264 transitions.
[2023-10-25 15:19:34,448 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 264 transitions.
[2023-10-25 15:19:34,450 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:19:34,450 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 264 transitions.
[2023-10-25 15:19:34,451 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:34,452 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:34,453 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:34,469 INFO  L175             Difference]: Start difference. First operand has 33 places, 30 transitions, 78 flow. Second operand 3 states and 264 transitions.
[2023-10-25 15:19:34,469 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 36 transitions, 146 flow
[2023-10-25 15:19:34,471 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 36 transitions, 146 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-25 15:19:34,471 INFO  L231             Difference]: Finished difference. Result has 35 places, 30 transitions, 88 flow
[2023-10-25 15:19:34,472 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=35, PETRI_TRANSITIONS=30}
[2023-10-25 15:19:34,474 INFO  L288   CegarLoopForPetriNet]: 33 programPoint places, 2 predicate places.
[2023-10-25 15:19:34,475 INFO  L495      AbstractCegarLoop]: Abstraction has has 35 places, 30 transitions, 88 flow
[2023-10-25 15:19:34,475 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:34,475 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:19:34,475 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:19:34,475 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2023-10-25 15:19:34,476 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2023-10-25 15:19:34,476 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:19:34,476 INFO  L85        PathProgramCache]: Analyzing trace with hash -308595878, now seen corresponding path program 1 times
[2023-10-25 15:19:34,476 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:19:34,477 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43357852]
[2023-10-25 15:19:34,477 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:19:34,478 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:19:34,494 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:19:34,524 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:19:34,524 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:19:34,524 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43357852]
[2023-10-25 15:19:34,524 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43357852] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:19:34,529 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:19:34,529 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 15:19:34,529 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839938637]
[2023-10-25 15:19:34,529 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:19:34,530 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:19:34,530 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:19:34,530 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:19:34,534 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:19:34,562 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 74 out of 148
[2023-10-25 15:19:34,563 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 30 transitions, 88 flow. Second operand  has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:34,563 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:19:34,563 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 148
[2023-10-25 15:19:34,563 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:19:34,843 INFO  L130       PetriNetUnfolder]: 549/1049 cut-off events.
[2023-10-25 15:19:34,844 INFO  L131       PetriNetUnfolder]: For 137/137 co-relation queries the response was YES.
[2023-10-25 15:19:34,845 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2152 conditions, 1049 events. 549/1049 cut-off events. For 137/137 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 5541 event pairs, 436 based on Foata normal form. 0/935 useless extension candidates. Maximal degree in co-relation 2102. Up to 835 conditions per place. 
[2023-10-25 15:19:34,847 INFO  L137   encePairwiseOnDemand]: 143/148 looper letters, 36 selfloop transitions, 4 changer transitions 0/46 dead transitions.
[2023-10-25 15:19:34,847 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 46 transitions, 215 flow
[2023-10-25 15:19:34,849 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:19:34,849 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:19:34,850 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 261 transitions.
[2023-10-25 15:19:34,850 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5878378378378378
[2023-10-25 15:19:34,850 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 261 transitions.
[2023-10-25 15:19:34,850 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 261 transitions.
[2023-10-25 15:19:34,851 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:19:34,851 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 261 transitions.
[2023-10-25 15:19:34,851 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 87.0) internal successors, (261), 3 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)
[2023-10-25 15:19:34,852 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:34,852 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:34,853 INFO  L175             Difference]: Start difference. First operand has 35 places, 30 transitions, 88 flow. Second operand 3 states and 261 transitions.
[2023-10-25 15:19:34,853 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 46 transitions, 215 flow
[2023-10-25 15:19:34,854 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 46 transitions, 212 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-10-25 15:19:34,854 INFO  L231             Difference]: Finished difference. Result has 37 places, 33 transitions, 112 flow
[2023-10-25 15:19:34,854 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=37, PETRI_TRANSITIONS=33}
[2023-10-25 15:19:34,855 INFO  L288   CegarLoopForPetriNet]: 33 programPoint places, 4 predicate places.
[2023-10-25 15:19:34,862 INFO  L495      AbstractCegarLoop]: Abstraction has has 37 places, 33 transitions, 112 flow
[2023-10-25 15:19:34,862 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:34,862 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:19:34,862 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:19:34,862 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2023-10-25 15:19:34,862 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2023-10-25 15:19:34,863 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:19:34,863 INFO  L85        PathProgramCache]: Analyzing trace with hash -1090130490, now seen corresponding path program 1 times
[2023-10-25 15:19:34,863 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:19:34,863 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604430164]
[2023-10-25 15:19:34,863 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:19:34,863 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:19:34,871 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:19:34,956 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-10-25 15:19:34,957 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:19:34,957 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604430164]
[2023-10-25 15:19:34,958 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604430164] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:19:34,958 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:19:34,972 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-10-25 15:19:34,972 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256444357]
[2023-10-25 15:19:34,973 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:19:34,973 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-10-25 15:19:34,973 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:19:34,973 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-10-25 15:19:34,974 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2023-10-25 15:19:35,004 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 76 out of 148
[2023-10-25 15:19:35,005 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 33 transitions, 112 flow. Second operand  has 4 states, 4 states have (on average 77.5) internal successors, (310), 4 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)
[2023-10-25 15:19:35,005 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:19:35,005 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 148
[2023-10-25 15:19:35,005 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:19:35,163 INFO  L130       PetriNetUnfolder]: 333/695 cut-off events.
[2023-10-25 15:19:35,164 INFO  L131       PetriNetUnfolder]: For 284/304 co-relation queries the response was YES.
[2023-10-25 15:19:35,165 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1610 conditions, 695 events. 333/695 cut-off events. For 284/304 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3396 event pairs, 180 based on Foata normal form. 55/733 useless extension candidates. Maximal degree in co-relation 589. Up to 369 conditions per place. 
[2023-10-25 15:19:35,167 INFO  L137   encePairwiseOnDemand]: 144/148 looper letters, 35 selfloop transitions, 3 changer transitions 0/47 dead transitions.
[2023-10-25 15:19:35,167 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 47 transitions, 230 flow
[2023-10-25 15:19:35,167 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-10-25 15:19:35,167 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-10-25 15:19:35,168 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 339 transitions.
[2023-10-25 15:19:35,168 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5726351351351351
[2023-10-25 15:19:35,168 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 339 transitions.
[2023-10-25 15:19:35,168 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 339 transitions.
[2023-10-25 15:19:35,168 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:19:35,169 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 339 transitions.
[2023-10-25 15:19:35,169 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 84.75) internal successors, (339), 4 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:35,170 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 148.0) internal successors, (740), 5 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:35,171 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 148.0) internal successors, (740), 5 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:35,171 INFO  L175             Difference]: Start difference. First operand has 37 places, 33 transitions, 112 flow. Second operand 4 states and 339 transitions.
[2023-10-25 15:19:35,171 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 47 transitions, 230 flow
[2023-10-25 15:19:35,185 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 47 transitions, 224 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-10-25 15:19:35,186 INFO  L231             Difference]: Finished difference. Result has 40 places, 34 transitions, 124 flow
[2023-10-25 15:19:35,186 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=124, PETRI_PLACES=40, PETRI_TRANSITIONS=34}
[2023-10-25 15:19:35,189 INFO  L288   CegarLoopForPetriNet]: 33 programPoint places, 7 predicate places.
[2023-10-25 15:19:35,189 INFO  L495      AbstractCegarLoop]: Abstraction has has 40 places, 34 transitions, 124 flow
[2023-10-25 15:19:35,189 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 77.5) internal successors, (310), 4 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)
[2023-10-25 15:19:35,190 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:19:35,190 INFO  L209   CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1]
[2023-10-25 15:19:35,190 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2023-10-25 15:19:35,190 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2023-10-25 15:19:35,190 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:19:35,190 INFO  L85        PathProgramCache]: Analyzing trace with hash -1177317092, now seen corresponding path program 1 times
[2023-10-25 15:19:35,191 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:19:35,191 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879682109]
[2023-10-25 15:19:35,191 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:19:35,191 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:19:35,223 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-25 15:19:35,223 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-10-25 15:19:35,234 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-25 15:19:35,243 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-10-25 15:19:35,243 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-10-25 15:19:35,243 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining)
[2023-10-25 15:19:35,243 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 6 remaining)
[2023-10-25 15:19:35,247 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (3 of 6 remaining)
[2023-10-25 15:19:35,247 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 6 remaining)
[2023-10-25 15:19:35,247 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 6 remaining)
[2023-10-25 15:19:35,248 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 6 remaining)
[2023-10-25 15:19:35,248 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2023-10-25 15:19:35,248 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1]
[2023-10-25 15:19:35,249 WARN  L233   ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-10-25 15:19:35,249 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances.
[2023-10-25 15:19:35,287 INFO  L144    ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions.
[2023-10-25 15:19:35,292 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 105 places, 103 transitions, 236 flow
[2023-10-25 15:19:35,327 INFO  L130       PetriNetUnfolder]: 20/300 cut-off events.
[2023-10-25 15:19:35,327 INFO  L131       PetriNetUnfolder]: For 19/19 co-relation queries the response was YES.
[2023-10-25 15:19:35,328 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 328 conditions, 300 events. 20/300 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 897 event pairs, 1 based on Foata normal form. 0/257 useless extension candidates. Maximal degree in co-relation 181. Up to 16 conditions per place. 
[2023-10-25 15:19:35,328 INFO  L82        GeneralOperation]: Start removeDead. Operand has 105 places, 103 transitions, 236 flow
[2023-10-25 15:19:35,330 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 105 places, 103 transitions, 236 flow
[2023-10-25 15:19:35,330 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-10-25 15:19:35,330 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 103 transitions, 236 flow
[2023-10-25 15:19:35,330 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 103 transitions, 236 flow
[2023-10-25 15:19:35,330 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 105 places, 103 transitions, 236 flow
[2023-10-25 15:19:35,376 INFO  L130       PetriNetUnfolder]: 20/300 cut-off events.
[2023-10-25 15:19:35,376 INFO  L131       PetriNetUnfolder]: For 19/19 co-relation queries the response was YES.
[2023-10-25 15:19:35,377 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 328 conditions, 300 events. 20/300 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 897 event pairs, 1 based on Foata normal form. 0/257 useless extension candidates. Maximal degree in co-relation 181. Up to 16 conditions per place. 
[2023-10-25 15:19:35,381 INFO  L119        LiptonReduction]: Number of co-enabled transitions 4452
[2023-10-25 15:19:37,280 INFO  L134        LiptonReduction]: Checked pairs total: 11117
[2023-10-25 15:19:37,280 INFO  L136        LiptonReduction]: Total number of compositions: 69
[2023-10-25 15:19:37,281 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-10-25 15:19:37,282 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;@425a5f48, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-10-25 15:19:37,282 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2023-10-25 15:19:37,282 INFO  L130       PetriNetUnfolder]: 0/4 cut-off events.
[2023-10-25 15:19:37,282 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-25 15:19:37,282 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:19:37,283 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1]
[2023-10-25 15:19:37,283 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2023-10-25 15:19:37,283 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:19:37,283 INFO  L85        PathProgramCache]: Analyzing trace with hash 608861, now seen corresponding path program 1 times
[2023-10-25 15:19:37,283 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:19:37,283 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023228963]
[2023-10-25 15:19:37,283 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:19:37,283 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:19:37,318 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:19:37,340 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:19:37,340 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:19:37,341 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023228963]
[2023-10-25 15:19:37,341 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023228963] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:19:37,341 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:19:37,341 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 15:19:37,341 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706762306]
[2023-10-25 15:19:37,341 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:19:37,342 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:19:37,342 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:19:37,342 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:19:37,343 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:19:37,374 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 92 out of 172
[2023-10-25 15:19:37,374 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 38 transitions, 106 flow. Second operand  has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:37,374 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:19:37,374 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 172
[2023-10-25 15:19:37,375 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:19:38,295 INFO  L130       PetriNetUnfolder]: 4797/7749 cut-off events.
[2023-10-25 15:19:38,295 INFO  L131       PetriNetUnfolder]: For 553/553 co-relation queries the response was YES.
[2023-10-25 15:19:38,301 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15209 conditions, 7749 events. 4797/7749 cut-off events. For 553/553 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 46768 event pairs, 3056 based on Foata normal form. 0/7044 useless extension candidates. Maximal degree in co-relation 1739. Up to 7065 conditions per place. 
[2023-10-25 15:19:38,353 INFO  L137   encePairwiseOnDemand]: 168/172 looper letters, 34 selfloop transitions, 2 changer transitions 0/44 dead transitions.
[2023-10-25 15:19:38,364 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 44 transitions, 190 flow
[2023-10-25 15:19:38,365 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:19:38,365 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:19:38,365 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 314 transitions.
[2023-10-25 15:19:38,366 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6085271317829457
[2023-10-25 15:19:38,366 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 314 transitions.
[2023-10-25 15:19:38,366 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 314 transitions.
[2023-10-25 15:19:38,366 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:19:38,366 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 314 transitions.
[2023-10-25 15:19:38,367 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:38,368 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:38,375 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:38,375 INFO  L175             Difference]: Start difference. First operand has 42 places, 38 transitions, 106 flow. Second operand 3 states and 314 transitions.
[2023-10-25 15:19:38,375 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 44 transitions, 190 flow
[2023-10-25 15:19:38,376 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 44 transitions, 190 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-25 15:19:38,377 INFO  L231             Difference]: Finished difference. Result has 44 places, 38 transitions, 116 flow
[2023-10-25 15:19:38,377 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=44, PETRI_TRANSITIONS=38}
[2023-10-25 15:19:38,377 INFO  L288   CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places.
[2023-10-25 15:19:38,377 INFO  L495      AbstractCegarLoop]: Abstraction has has 44 places, 38 transitions, 116 flow
[2023-10-25 15:19:38,378 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:38,378 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:19:38,388 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:19:38,389 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2023-10-25 15:19:38,389 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2023-10-25 15:19:38,389 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:19:38,389 INFO  L85        PathProgramCache]: Analyzing trace with hash -19105322, now seen corresponding path program 1 times
[2023-10-25 15:19:38,389 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:19:38,390 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627463344]
[2023-10-25 15:19:38,390 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:19:38,390 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:19:38,406 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:19:38,426 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:19:38,426 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:19:38,426 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627463344]
[2023-10-25 15:19:38,427 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627463344] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:19:38,427 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:19:38,427 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 15:19:38,427 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355404176]
[2023-10-25 15:19:38,427 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:19:38,427 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:19:38,427 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:19:38,428 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:19:38,428 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:19:38,457 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 87 out of 172
[2023-10-25 15:19:38,458 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 38 transitions, 116 flow. Second operand  has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:38,458 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:19:38,458 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 172
[2023-10-25 15:19:38,458 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:19:39,647 INFO  L130       PetriNetUnfolder]: 6702/10525 cut-off events.
[2023-10-25 15:19:39,661 INFO  L131       PetriNetUnfolder]: For 1382/1382 co-relation queries the response was YES.
[2023-10-25 15:19:39,672 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21498 conditions, 10525 events. 6702/10525 cut-off events. For 1382/1382 co-relation queries the response was YES. Maximal size of possible extension queue 426. Compared 66378 event pairs, 4536 based on Foata normal form. 0/9659 useless extension candidates. Maximal degree in co-relation 21447. Up to 7566 conditions per place. 
[2023-10-25 15:19:39,749 INFO  L137   encePairwiseOnDemand]: 165/172 looper letters, 49 selfloop transitions, 6 changer transitions 0/62 dead transitions.
[2023-10-25 15:19:39,765 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 62 transitions, 299 flow
[2023-10-25 15:19:39,766 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:19:39,766 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:19:39,767 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 315 transitions.
[2023-10-25 15:19:39,767 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6104651162790697
[2023-10-25 15:19:39,767 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 315 transitions.
[2023-10-25 15:19:39,767 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 315 transitions.
[2023-10-25 15:19:39,767 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:19:39,767 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 315 transitions.
[2023-10-25 15:19:39,768 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:39,769 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:39,769 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:39,770 INFO  L175             Difference]: Start difference. First operand has 44 places, 38 transitions, 116 flow. Second operand 3 states and 315 transitions.
[2023-10-25 15:19:39,770 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 62 transitions, 299 flow
[2023-10-25 15:19:39,773 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 62 transitions, 296 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-10-25 15:19:39,774 INFO  L231             Difference]: Finished difference. Result has 47 places, 43 transitions, 160 flow
[2023-10-25 15:19:39,774 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=160, PETRI_PLACES=47, PETRI_TRANSITIONS=43}
[2023-10-25 15:19:39,775 INFO  L288   CegarLoopForPetriNet]: 42 programPoint places, 5 predicate places.
[2023-10-25 15:19:39,775 INFO  L495      AbstractCegarLoop]: Abstraction has has 47 places, 43 transitions, 160 flow
[2023-10-25 15:19:39,776 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:39,776 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:19:39,776 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:19:39,776 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2023-10-25 15:19:39,776 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2023-10-25 15:19:39,776 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:19:39,777 INFO  L85        PathProgramCache]: Analyzing trace with hash -726703818, now seen corresponding path program 1 times
[2023-10-25 15:19:39,777 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:19:39,777 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237991217]
[2023-10-25 15:19:39,777 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:19:39,777 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:19:39,785 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:19:39,832 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-10-25 15:19:39,833 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:19:39,833 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237991217]
[2023-10-25 15:19:39,834 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237991217] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:19:39,834 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:19:39,834 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-10-25 15:19:39,834 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270758911]
[2023-10-25 15:19:39,836 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:19:39,837 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-10-25 15:19:39,837 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:19:39,837 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-10-25 15:19:39,838 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2023-10-25 15:19:39,880 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 90 out of 172
[2023-10-25 15:19:39,881 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 43 transitions, 160 flow. Second operand  has 4 states, 4 states have (on average 91.5) internal successors, (366), 4 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:39,881 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:19:39,881 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 172
[2023-10-25 15:19:39,881 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:19:40,825 INFO  L130       PetriNetUnfolder]: 4867/7979 cut-off events.
[2023-10-25 15:19:40,825 INFO  L131       PetriNetUnfolder]: For 4560/4730 co-relation queries the response was YES.
[2023-10-25 15:19:40,832 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19486 conditions, 7979 events. 4867/7979 cut-off events. For 4560/4730 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 49530 event pairs, 2656 based on Foata normal form. 343/8140 useless extension candidates. Maximal degree in co-relation 5763. Up to 4719 conditions per place. 
[2023-10-25 15:19:40,883 INFO  L137   encePairwiseOnDemand]: 168/172 looper letters, 56 selfloop transitions, 3 changer transitions 0/67 dead transitions.
[2023-10-25 15:19:40,883 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 67 transitions, 363 flow
[2023-10-25 15:19:40,883 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-10-25 15:19:40,883 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-10-25 15:19:40,884 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 410 transitions.
[2023-10-25 15:19:40,885 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5959302325581395
[2023-10-25 15:19:40,885 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 410 transitions.
[2023-10-25 15:19:40,885 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 410 transitions.
[2023-10-25 15:19:40,885 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:19:40,885 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 410 transitions.
[2023-10-25 15:19:40,886 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 102.5) internal successors, (410), 4 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:40,887 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 172.0) internal successors, (860), 5 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:40,887 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 172.0) internal successors, (860), 5 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:40,888 INFO  L175             Difference]: Start difference. First operand has 47 places, 43 transitions, 160 flow. Second operand 4 states and 410 transitions.
[2023-10-25 15:19:40,888 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 67 transitions, 363 flow
[2023-10-25 15:19:40,911 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 67 transitions, 341 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-25 15:19:40,913 INFO  L231             Difference]: Finished difference. Result has 49 places, 44 transitions, 164 flow
[2023-10-25 15:19:40,913 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=164, PETRI_PLACES=49, PETRI_TRANSITIONS=44}
[2023-10-25 15:19:40,916 INFO  L288   CegarLoopForPetriNet]: 42 programPoint places, 7 predicate places.
[2023-10-25 15:19:40,916 INFO  L495      AbstractCegarLoop]: Abstraction has has 49 places, 44 transitions, 164 flow
[2023-10-25 15:19:40,916 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 91.5) internal successors, (366), 4 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:40,916 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:19:40,916 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:19:40,917 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2023-10-25 15:19:40,917 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2023-10-25 15:19:40,917 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:19:40,917 INFO  L85        PathProgramCache]: Analyzing trace with hash 2028505559, now seen corresponding path program 1 times
[2023-10-25 15:19:40,917 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:19:40,917 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785436337]
[2023-10-25 15:19:40,918 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:19:40,918 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:19:40,938 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:19:40,972 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2023-10-25 15:19:40,972 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:19:40,972 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785436337]
[2023-10-25 15:19:40,972 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785436337] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:19:40,972 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:19:40,973 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 15:19:40,973 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199576733]
[2023-10-25 15:19:40,973 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:19:40,973 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:19:40,973 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:19:40,974 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:19:40,974 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:19:40,986 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 87 out of 172
[2023-10-25 15:19:40,987 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 44 transitions, 164 flow. Second operand  has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:40,987 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:19:40,987 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 172
[2023-10-25 15:19:40,987 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:19:41,934 INFO  L130       PetriNetUnfolder]: 6475/10410 cut-off events.
[2023-10-25 15:19:41,935 INFO  L131       PetriNetUnfolder]: For 5663/5788 co-relation queries the response was YES.
[2023-10-25 15:19:41,950 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25224 conditions, 10410 events. 6475/10410 cut-off events. For 5663/5788 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 65976 event pairs, 3931 based on Foata normal form. 0/9937 useless extension candidates. Maximal degree in co-relation 10057. Up to 7374 conditions per place. 
[2023-10-25 15:19:42,019 INFO  L137   encePairwiseOnDemand]: 165/172 looper letters, 55 selfloop transitions, 9 changer transitions 0/71 dead transitions.
[2023-10-25 15:19:42,019 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 71 transitions, 393 flow
[2023-10-25 15:19:42,019 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:19:42,020 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:19:42,020 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 314 transitions.
[2023-10-25 15:19:42,020 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6085271317829457
[2023-10-25 15:19:42,021 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 314 transitions.
[2023-10-25 15:19:42,021 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 314 transitions.
[2023-10-25 15:19:42,021 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:19:42,021 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 314 transitions.
[2023-10-25 15:19:42,022 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:42,022 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:42,023 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:42,023 INFO  L175             Difference]: Start difference. First operand has 49 places, 44 transitions, 164 flow. Second operand 3 states and 314 transitions.
[2023-10-25 15:19:42,023 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 71 transitions, 393 flow
[2023-10-25 15:19:42,044 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 71 transitions, 387 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-25 15:19:42,045 INFO  L231             Difference]: Finished difference. Result has 51 places, 51 transitions, 240 flow
[2023-10-25 15:19:42,046 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=240, PETRI_PLACES=51, PETRI_TRANSITIONS=51}
[2023-10-25 15:19:42,046 INFO  L288   CegarLoopForPetriNet]: 42 programPoint places, 9 predicate places.
[2023-10-25 15:19:42,047 INFO  L495      AbstractCegarLoop]: Abstraction has has 51 places, 51 transitions, 240 flow
[2023-10-25 15:19:42,047 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:42,047 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:19:42,047 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:19:42,047 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2023-10-25 15:19:42,047 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2023-10-25 15:19:42,048 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:19:42,048 INFO  L85        PathProgramCache]: Analyzing trace with hash -891645950, now seen corresponding path program 1 times
[2023-10-25 15:19:42,050 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:19:42,050 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512464895]
[2023-10-25 15:19:42,050 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:19:42,050 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:19:42,181 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:19:42,252 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-10-25 15:19:42,252 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:19:42,253 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512464895]
[2023-10-25 15:19:42,253 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512464895] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:19:42,253 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:19:42,253 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-10-25 15:19:42,253 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916810535]
[2023-10-25 15:19:42,253 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:19:42,254 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:19:42,261 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:19:42,261 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:19:42,262 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:19:42,276 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 88 out of 172
[2023-10-25 15:19:42,276 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 51 transitions, 240 flow. Second operand  has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:42,276 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:19:42,276 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 172
[2023-10-25 15:19:42,276 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:19:42,462 INFO  L130       PetriNetUnfolder]: 808/1836 cut-off events.
[2023-10-25 15:19:42,462 INFO  L131       PetriNetUnfolder]: For 1421/1431 co-relation queries the response was YES.
[2023-10-25 15:19:42,464 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5054 conditions, 1836 events. 808/1836 cut-off events. For 1421/1431 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 12050 event pairs, 162 based on Foata normal form. 416/2207 useless extension candidates. Maximal degree in co-relation 1793. Up to 1308 conditions per place. 
[2023-10-25 15:19:42,490 INFO  L137   encePairwiseOnDemand]: 166/172 looper letters, 43 selfloop transitions, 8 changer transitions 0/59 dead transitions.
[2023-10-25 15:19:42,490 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 59 transitions, 361 flow
[2023-10-25 15:19:42,490 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:19:42,490 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:19:42,491 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 308 transitions.
[2023-10-25 15:19:42,491 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5968992248062015
[2023-10-25 15:19:42,492 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 308 transitions.
[2023-10-25 15:19:42,492 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 308 transitions.
[2023-10-25 15:19:42,492 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:19:42,492 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 308 transitions.
[2023-10-25 15:19:42,493 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:42,494 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:42,494 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:42,494 INFO  L175             Difference]: Start difference. First operand has 51 places, 51 transitions, 240 flow. Second operand 3 states and 308 transitions.
[2023-10-25 15:19:42,494 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 59 transitions, 361 flow
[2023-10-25 15:19:42,498 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 59 transitions, 349 flow, removed 2 selfloop flow, removed 2 redundant places.
[2023-10-25 15:19:42,499 INFO  L231             Difference]: Finished difference. Result has 51 places, 45 transitions, 196 flow
[2023-10-25 15:19:42,499 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=196, PETRI_PLACES=51, PETRI_TRANSITIONS=45}
[2023-10-25 15:19:42,500 INFO  L288   CegarLoopForPetriNet]: 42 programPoint places, 9 predicate places.
[2023-10-25 15:19:42,500 INFO  L495      AbstractCegarLoop]: Abstraction has has 51 places, 45 transitions, 196 flow
[2023-10-25 15:19:42,500 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:42,500 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:19:42,501 INFO  L209   CegarLoopForPetriNet]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1]
[2023-10-25 15:19:42,501 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2023-10-25 15:19:42,501 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2023-10-25 15:19:42,501 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:19:42,501 INFO  L85        PathProgramCache]: Analyzing trace with hash -1406223222, now seen corresponding path program 1 times
[2023-10-25 15:19:42,501 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:19:42,502 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183090274]
[2023-10-25 15:19:42,502 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:19:42,502 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:19:42,524 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-25 15:19:42,524 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-10-25 15:19:42,543 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-25 15:19:42,547 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-10-25 15:19:42,548 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-10-25 15:19:42,548 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining)
[2023-10-25 15:19:42,548 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining)
[2023-10-25 15:19:42,548 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining)
[2023-10-25 15:19:42,548 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining)
[2023-10-25 15:19:42,549 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining)
[2023-10-25 15:19:42,549 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining)
[2023-10-25 15:19:42,549 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining)
[2023-10-25 15:19:42,549 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2023-10-25 15:19:42,549 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1]
[2023-10-25 15:19:42,550 WARN  L233   ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-10-25 15:19:42,550 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances.
[2023-10-25 15:19:42,593 INFO  L144    ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions.
[2023-10-25 15:19:42,597 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 122 places, 119 transitions, 282 flow
[2023-10-25 15:19:42,665 INFO  L130       PetriNetUnfolder]: 42/531 cut-off events.
[2023-10-25 15:19:42,665 INFO  L131       PetriNetUnfolder]: For 48/48 co-relation queries the response was YES.
[2023-10-25 15:19:42,667 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 586 conditions, 531 events. 42/531 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2087 event pairs, 6 based on Foata normal form. 0/453 useless extension candidates. Maximal degree in co-relation 320. Up to 32 conditions per place. 
[2023-10-25 15:19:42,681 INFO  L82        GeneralOperation]: Start removeDead. Operand has 122 places, 119 transitions, 282 flow
[2023-10-25 15:19:42,683 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 122 places, 119 transitions, 282 flow
[2023-10-25 15:19:42,683 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-10-25 15:19:42,683 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 119 transitions, 282 flow
[2023-10-25 15:19:42,683 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 119 transitions, 282 flow
[2023-10-25 15:19:42,683 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 122 places, 119 transitions, 282 flow
[2023-10-25 15:19:42,735 INFO  L130       PetriNetUnfolder]: 42/531 cut-off events.
[2023-10-25 15:19:42,735 INFO  L131       PetriNetUnfolder]: For 48/48 co-relation queries the response was YES.
[2023-10-25 15:19:42,736 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 586 conditions, 531 events. 42/531 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2087 event pairs, 6 based on Foata normal form. 0/453 useless extension candidates. Maximal degree in co-relation 320. Up to 32 conditions per place. 
[2023-10-25 15:19:42,744 INFO  L119        LiptonReduction]: Number of co-enabled transitions 6888
[2023-10-25 15:19:44,845 INFO  L134        LiptonReduction]: Checked pairs total: 17075
[2023-10-25 15:19:44,846 INFO  L136        LiptonReduction]: Total number of compositions: 77
[2023-10-25 15:19:44,847 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-10-25 15:19:44,847 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;@425a5f48, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-10-25 15:19:44,847 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 8 error locations.
[2023-10-25 15:19:44,848 INFO  L130       PetriNetUnfolder]: 0/4 cut-off events.
[2023-10-25 15:19:44,848 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-25 15:19:44,848 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:19:44,848 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1]
[2023-10-25 15:19:44,848 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2023-10-25 15:19:44,848 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:19:44,848 INFO  L85        PathProgramCache]: Analyzing trace with hash 819222, now seen corresponding path program 1 times
[2023-10-25 15:19:44,848 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:19:44,848 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986736185]
[2023-10-25 15:19:44,848 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:19:44,848 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:19:44,853 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:19:44,880 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:19:44,881 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:19:44,881 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986736185]
[2023-10-25 15:19:44,881 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986736185] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:19:44,881 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:19:44,881 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 15:19:44,881 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555538842]
[2023-10-25 15:19:44,882 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:19:44,882 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:19:44,882 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:19:44,882 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:19:44,882 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:19:44,904 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 106 out of 196
[2023-10-25 15:19:44,907 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 46 transitions, 136 flow. Second operand  has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:44,907 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:19:44,908 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 196
[2023-10-25 15:19:44,908 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:19:48,716 INFO  L130       PetriNetUnfolder]: 26270/40764 cut-off events.
[2023-10-25 15:19:48,717 INFO  L131       PetriNetUnfolder]: For 4122/4122 co-relation queries the response was YES.
[2023-10-25 15:19:48,771 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 78996 conditions, 40764 events. 26270/40764 cut-off events. For 4122/4122 co-relation queries the response was YES. Maximal size of possible extension queue 1301. Compared 303118 event pairs, 19290 based on Foata normal form. 0/37722 useless extension candidates. Maximal degree in co-relation 11331. Up to 35881 conditions per place. 
[2023-10-25 15:19:49,059 INFO  L137   encePairwiseOnDemand]: 192/196 looper letters, 37 selfloop transitions, 2 changer transitions 0/51 dead transitions.
[2023-10-25 15:19:49,059 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 51 transitions, 224 flow
[2023-10-25 15:19:49,060 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:19:49,060 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:19:49,067 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 359 transitions.
[2023-10-25 15:19:49,067 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6105442176870748
[2023-10-25 15:19:49,068 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 359 transitions.
[2023-10-25 15:19:49,068 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 359 transitions.
[2023-10-25 15:19:49,068 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:19:49,068 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 359 transitions.
[2023-10-25 15:19:49,076 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:49,079 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:49,079 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:49,079 INFO  L175             Difference]: Start difference. First operand has 51 places, 46 transitions, 136 flow. Second operand 3 states and 359 transitions.
[2023-10-25 15:19:49,080 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 51 transitions, 224 flow
[2023-10-25 15:19:49,088 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 51 transitions, 224 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-25 15:19:49,089 INFO  L231             Difference]: Finished difference. Result has 53 places, 46 transitions, 146 flow
[2023-10-25 15:19:49,089 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=146, PETRI_PLACES=53, PETRI_TRANSITIONS=46}
[2023-10-25 15:19:49,090 INFO  L288   CegarLoopForPetriNet]: 51 programPoint places, 2 predicate places.
[2023-10-25 15:19:49,090 INFO  L495      AbstractCegarLoop]: Abstraction has has 53 places, 46 transitions, 146 flow
[2023-10-25 15:19:49,090 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:49,090 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:19:49,090 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:19:49,090 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2023-10-25 15:19:49,091 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2023-10-25 15:19:49,091 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:19:49,091 INFO  L85        PathProgramCache]: Analyzing trace with hash 1292687696, now seen corresponding path program 1 times
[2023-10-25 15:19:49,091 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:19:49,091 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790903341]
[2023-10-25 15:19:49,091 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:19:49,092 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:19:49,113 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:19:49,124 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:19:49,124 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:19:49,124 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790903341]
[2023-10-25 15:19:49,124 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790903341] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:19:49,124 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:19:49,124 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 15:19:49,124 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986505791]
[2023-10-25 15:19:49,125 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:19:49,125 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:19:49,125 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:19:49,125 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:19:49,125 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:19:49,156 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 100 out of 196
[2023-10-25 15:19:49,156 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 146 flow. Second operand  has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:49,156 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:19:49,157 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 196
[2023-10-25 15:19:49,157 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:19:55,343 INFO  L130       PetriNetUnfolder]: 56821/81374 cut-off events.
[2023-10-25 15:19:55,343 INFO  L131       PetriNetUnfolder]: For 11034/11034 co-relation queries the response was YES.
[2023-10-25 15:19:55,476 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 165575 conditions, 81374 events. 56821/81374 cut-off events. For 11034/11034 co-relation queries the response was YES. Maximal size of possible extension queue 2184. Compared 558654 event pairs, 46946 based on Foata normal form. 0/75443 useless extension candidates. Maximal degree in co-relation 165523. Up to 68383 conditions per place. 
[2023-10-25 15:19:55,841 INFO  L137   encePairwiseOnDemand]: 189/196 looper letters, 62 selfloop transitions, 6 changer transitions 0/76 dead transitions.
[2023-10-25 15:19:55,841 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 76 transitions, 379 flow
[2023-10-25 15:19:55,842 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:19:55,842 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:19:55,842 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 367 transitions.
[2023-10-25 15:19:55,842 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6241496598639455
[2023-10-25 15:19:55,843 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 367 transitions.
[2023-10-25 15:19:55,843 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 367 transitions.
[2023-10-25 15:19:55,843 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:19:55,843 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 367 transitions.
[2023-10-25 15:19:55,844 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:55,852 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:55,852 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:55,853 INFO  L175             Difference]: Start difference. First operand has 53 places, 46 transitions, 146 flow. Second operand 3 states and 367 transitions.
[2023-10-25 15:19:55,853 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 76 transitions, 379 flow
[2023-10-25 15:19:55,859 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 76 transitions, 376 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-10-25 15:19:55,862 INFO  L231             Difference]: Finished difference. Result has 55 places, 51 transitions, 184 flow
[2023-10-25 15:19:55,863 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=184, PETRI_PLACES=55, PETRI_TRANSITIONS=51}
[2023-10-25 15:19:55,863 INFO  L288   CegarLoopForPetriNet]: 51 programPoint places, 4 predicate places.
[2023-10-25 15:19:55,863 INFO  L495      AbstractCegarLoop]: Abstraction has has 55 places, 51 transitions, 184 flow
[2023-10-25 15:19:55,864 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:55,864 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:19:55,864 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:19:55,864 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2023-10-25 15:19:55,864 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2023-10-25 15:19:55,865 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:19:55,865 INFO  L85        PathProgramCache]: Analyzing trace with hash 1252527573, now seen corresponding path program 1 times
[2023-10-25 15:19:55,865 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:19:55,865 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271037122]
[2023-10-25 15:19:55,865 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:19:55,865 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:19:55,901 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:19:55,936 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-10-25 15:19:55,936 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:19:55,936 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271037122]
[2023-10-25 15:19:55,936 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271037122] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:19:55,936 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:19:55,936 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-10-25 15:19:55,938 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733703258]
[2023-10-25 15:19:55,938 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:19:55,938 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-10-25 15:19:55,939 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:19:55,939 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-10-25 15:19:55,939 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2023-10-25 15:19:55,979 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 104 out of 196
[2023-10-25 15:19:55,980 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 51 transitions, 184 flow. Second operand  has 4 states, 4 states have (on average 105.5) internal successors, (422), 4 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:55,980 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:19:55,980 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 196
[2023-10-25 15:19:55,980 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:19:59,882 INFO  L130       PetriNetUnfolder]: 34262/52446 cut-off events.
[2023-10-25 15:19:59,882 INFO  L131       PetriNetUnfolder]: For 14424/19295 co-relation queries the response was YES.
[2023-10-25 15:19:59,970 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 117075 conditions, 52446 events. 34262/52446 cut-off events. For 14424/19295 co-relation queries the response was YES. Maximal size of possible extension queue 1518. Compared 395231 event pairs, 20480 based on Foata normal form. 3766/53979 useless extension candidates. Maximal degree in co-relation 42195. Up to 29996 conditions per place. 
[2023-10-25 15:20:00,134 INFO  L137   encePairwiseOnDemand]: 192/196 looper letters, 59 selfloop transitions, 3 changer transitions 0/76 dead transitions.
[2023-10-25 15:20:00,134 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 76 transitions, 380 flow
[2023-10-25 15:20:00,135 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-10-25 15:20:00,135 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-10-25 15:20:00,136 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 473 transitions.
[2023-10-25 15:20:00,136 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6033163265306123
[2023-10-25 15:20:00,136 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 473 transitions.
[2023-10-25 15:20:00,136 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 473 transitions.
[2023-10-25 15:20:00,146 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:20:00,146 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 473 transitions.
[2023-10-25 15:20:00,147 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 118.25) internal successors, (473), 4 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:00,148 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 196.0) internal successors, (980), 5 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:00,149 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 196.0) internal successors, (980), 5 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:00,149 INFO  L175             Difference]: Start difference. First operand has 55 places, 51 transitions, 184 flow. Second operand 4 states and 473 transitions.
[2023-10-25 15:20:00,149 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 76 transitions, 380 flow
[2023-10-25 15:20:00,226 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 76 transitions, 372 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-10-25 15:20:00,235 INFO  L231             Difference]: Finished difference. Result has 58 places, 52 transitions, 194 flow
[2023-10-25 15:20:00,236 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=194, PETRI_PLACES=58, PETRI_TRANSITIONS=52}
[2023-10-25 15:20:00,236 INFO  L288   CegarLoopForPetriNet]: 51 programPoint places, 7 predicate places.
[2023-10-25 15:20:00,237 INFO  L495      AbstractCegarLoop]: Abstraction has has 58 places, 52 transitions, 194 flow
[2023-10-25 15:20:00,237 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 105.5) internal successors, (422), 4 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:00,237 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:20:00,237 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:20:00,237 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2023-10-25 15:20:00,237 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2023-10-25 15:20:00,238 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:20:00,238 INFO  L85        PathProgramCache]: Analyzing trace with hash 18506108, now seen corresponding path program 1 times
[2023-10-25 15:20:00,238 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:20:00,238 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488960847]
[2023-10-25 15:20:00,238 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:20:00,238 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:20:00,261 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:20:00,271 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2023-10-25 15:20:00,272 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:20:00,272 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488960847]
[2023-10-25 15:20:00,272 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488960847] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:20:00,272 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:20:00,272 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 15:20:00,272 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338546133]
[2023-10-25 15:20:00,272 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:20:00,273 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:20:00,273 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:20:00,273 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:20:00,273 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:20:00,290 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 100 out of 196
[2023-10-25 15:20:00,291 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 52 transitions, 194 flow. Second operand  has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:00,291 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:20:00,291 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 196
[2023-10-25 15:20:00,291 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:20:06,533 INFO  L130       PetriNetUnfolder]: 61433/89147 cut-off events.
[2023-10-25 15:20:06,534 INFO  L131       PetriNetUnfolder]: For 41463/42612 co-relation queries the response was YES.
[2023-10-25 15:20:06,705 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 209218 conditions, 89147 events. 61433/89147 cut-off events. For 41463/42612 co-relation queries the response was YES. Maximal size of possible extension queue 2203. Compared 633309 event pairs, 41061 based on Foata normal form. 0/85250 useless extension candidates. Maximal degree in co-relation 75012. Up to 66048 conditions per place. 
[2023-10-25 15:20:07,123 INFO  L137   encePairwiseOnDemand]: 188/196 looper letters, 67 selfloop transitions, 11 changer transitions 0/86 dead transitions.
[2023-10-25 15:20:07,124 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 86 transitions, 477 flow
[2023-10-25 15:20:07,124 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:20:07,124 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:20:07,125 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 367 transitions.
[2023-10-25 15:20:07,126 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6241496598639455
[2023-10-25 15:20:07,126 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 367 transitions.
[2023-10-25 15:20:07,126 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 367 transitions.
[2023-10-25 15:20:07,126 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:20:07,126 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 367 transitions.
[2023-10-25 15:20:07,127 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:07,128 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:07,128 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:07,128 INFO  L175             Difference]: Start difference. First operand has 58 places, 52 transitions, 194 flow. Second operand 3 states and 367 transitions.
[2023-10-25 15:20:07,129 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 86 transitions, 477 flow
[2023-10-25 15:20:07,383 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 86 transitions, 471 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-25 15:20:07,385 INFO  L231             Difference]: Finished difference. Result has 60 places, 61 transitions, 290 flow
[2023-10-25 15:20:07,386 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=290, PETRI_PLACES=60, PETRI_TRANSITIONS=61}
[2023-10-25 15:20:07,386 INFO  L288   CegarLoopForPetriNet]: 51 programPoint places, 9 predicate places.
[2023-10-25 15:20:07,386 INFO  L495      AbstractCegarLoop]: Abstraction has has 60 places, 61 transitions, 290 flow
[2023-10-25 15:20:07,387 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:07,387 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:20:07,387 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:20:07,388 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2023-10-25 15:20:07,388 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2023-10-25 15:20:07,388 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:20:07,388 INFO  L85        PathProgramCache]: Analyzing trace with hash 1876309929, now seen corresponding path program 1 times
[2023-10-25 15:20:07,388 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:20:07,388 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986749908]
[2023-10-25 15:20:07,388 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:20:07,389 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:20:07,427 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:20:07,500 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-10-25 15:20:07,500 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:20:07,501 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986749908]
[2023-10-25 15:20:07,501 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986749908] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:20:07,501 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:20:07,501 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-10-25 15:20:07,501 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066557228]
[2023-10-25 15:20:07,501 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:20:07,501 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:20:07,502 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:20:07,502 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:20:07,502 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:20:07,517 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 100 out of 196
[2023-10-25 15:20:07,518 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 61 transitions, 290 flow. Second operand  has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 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)
[2023-10-25 15:20:07,518 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:20:07,518 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 196
[2023-10-25 15:20:07,519 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:20:07,970 INFO  L130       PetriNetUnfolder]: 2932/6773 cut-off events.
[2023-10-25 15:20:07,971 INFO  L131       PetriNetUnfolder]: For 5762/5800 co-relation queries the response was YES.
[2023-10-25 15:20:07,980 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17713 conditions, 6773 events. 2932/6773 cut-off events. For 5762/5800 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 57547 event pairs, 659 based on Foata normal form. 2100/8709 useless extension candidates. Maximal degree in co-relation 6015. Up to 4411 conditions per place. 
[2023-10-25 15:20:07,992 INFO  L137   encePairwiseOnDemand]: 188/196 looper letters, 47 selfloop transitions, 9 changer transitions 0/68 dead transitions.
[2023-10-25 15:20:07,993 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 68 transitions, 415 flow
[2023-10-25 15:20:07,993 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:20:07,993 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:20:07,994 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 351 transitions.
[2023-10-25 15:20:07,994 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5969387755102041
[2023-10-25 15:20:07,994 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 351 transitions.
[2023-10-25 15:20:07,994 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 351 transitions.
[2023-10-25 15:20:07,994 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:20:07,994 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 351 transitions.
[2023-10-25 15:20:07,995 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:08,022 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:08,023 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:08,023 INFO  L175             Difference]: Start difference. First operand has 60 places, 61 transitions, 290 flow. Second operand 3 states and 351 transitions.
[2023-10-25 15:20:08,023 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 68 transitions, 415 flow
[2023-10-25 15:20:08,033 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 68 transitions, 403 flow, removed 2 selfloop flow, removed 2 redundant places.
[2023-10-25 15:20:08,034 INFO  L231             Difference]: Finished difference. Result has 60 places, 52 transitions, 226 flow
[2023-10-25 15:20:08,034 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=226, PETRI_PLACES=60, PETRI_TRANSITIONS=52}
[2023-10-25 15:20:08,035 INFO  L288   CegarLoopForPetriNet]: 51 programPoint places, 9 predicate places.
[2023-10-25 15:20:08,035 INFO  L495      AbstractCegarLoop]: Abstraction has has 60 places, 52 transitions, 226 flow
[2023-10-25 15:20:08,035 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 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)
[2023-10-25 15:20:08,035 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:20:08,035 INFO  L209   CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:20:08,035 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2023-10-25 15:20:08,035 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2023-10-25 15:20:08,036 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:20:08,036 INFO  L85        PathProgramCache]: Analyzing trace with hash -1917547087, now seen corresponding path program 1 times
[2023-10-25 15:20:08,036 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:20:08,036 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490935480]
[2023-10-25 15:20:08,036 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:20:08,036 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:20:08,057 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:20:08,079 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2023-10-25 15:20:08,079 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:20:08,079 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490935480]
[2023-10-25 15:20:08,080 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490935480] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:20:08,080 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:20:08,080 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 15:20:08,080 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492108491]
[2023-10-25 15:20:08,080 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:20:08,080 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:20:08,081 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:20:08,081 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:20:08,081 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:20:08,109 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 100 out of 196
[2023-10-25 15:20:08,109 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 52 transitions, 226 flow. Second operand  has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 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)
[2023-10-25 15:20:08,109 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:20:08,109 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 196
[2023-10-25 15:20:08,110 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:20:08,758 INFO  L130       PetriNetUnfolder]: 3391/7796 cut-off events.
[2023-10-25 15:20:08,759 INFO  L131       PetriNetUnfolder]: For 6308/6346 co-relation queries the response was YES.
[2023-10-25 15:20:08,768 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20991 conditions, 7796 events. 3391/7796 cut-off events. For 6308/6346 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 65696 event pairs, 3007 based on Foata normal form. 0/7409 useless extension candidates. Maximal degree in co-relation 5282. Up to 6329 conditions per place. 
[2023-10-25 15:20:08,783 INFO  L137   encePairwiseOnDemand]: 192/196 looper letters, 54 selfloop transitions, 3 changer transitions 0/65 dead transitions.
[2023-10-25 15:20:08,783 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 65 transitions, 400 flow
[2023-10-25 15:20:08,783 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:20:08,783 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:20:08,789 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 350 transitions.
[2023-10-25 15:20:08,789 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5952380952380952
[2023-10-25 15:20:08,790 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 350 transitions.
[2023-10-25 15:20:08,790 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 350 transitions.
[2023-10-25 15:20:08,790 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:20:08,790 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 350 transitions.
[2023-10-25 15:20:08,791 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:08,791 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:08,792 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:08,792 INFO  L175             Difference]: Start difference. First operand has 60 places, 52 transitions, 226 flow. Second operand 3 states and 350 transitions.
[2023-10-25 15:20:08,792 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 65 transitions, 400 flow
[2023-10-25 15:20:08,802 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 65 transitions, 391 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-10-25 15:20:08,804 INFO  L231             Difference]: Finished difference. Result has 62 places, 54 transitions, 242 flow
[2023-10-25 15:20:08,804 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=242, PETRI_PLACES=62, PETRI_TRANSITIONS=54}
[2023-10-25 15:20:08,809 INFO  L288   CegarLoopForPetriNet]: 51 programPoint places, 11 predicate places.
[2023-10-25 15:20:08,809 INFO  L495      AbstractCegarLoop]: Abstraction has has 62 places, 54 transitions, 242 flow
[2023-10-25 15:20:08,810 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 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)
[2023-10-25 15:20:08,810 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:20:08,810 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:20:08,810 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2023-10-25 15:20:08,810 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2023-10-25 15:20:08,810 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:20:08,811 INFO  L85        PathProgramCache]: Analyzing trace with hash -188693244, now seen corresponding path program 1 times
[2023-10-25 15:20:08,811 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:20:08,811 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30593772]
[2023-10-25 15:20:08,811 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:20:08,811 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:20:08,856 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:20:08,896 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2023-10-25 15:20:08,897 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:20:08,897 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30593772]
[2023-10-25 15:20:08,897 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30593772] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:20:08,897 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:20:08,897 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 15:20:08,897 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297889989]
[2023-10-25 15:20:08,897 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:20:08,898 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:20:08,898 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:20:08,899 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:20:08,899 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:20:08,914 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 102 out of 196
[2023-10-25 15:20:08,915 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 54 transitions, 242 flow. Second operand  has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:08,915 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:20:08,915 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 196
[2023-10-25 15:20:08,915 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:20:09,920 INFO  L130       PetriNetUnfolder]: 4657/10054 cut-off events.
[2023-10-25 15:20:09,921 INFO  L131       PetriNetUnfolder]: For 8911/8968 co-relation queries the response was YES.
[2023-10-25 15:20:09,932 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27762 conditions, 10054 events. 4657/10054 cut-off events. For 8911/8968 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 83593 event pairs, 2815 based on Foata normal form. 0/9753 useless extension candidates. Maximal degree in co-relation 9812. Up to 6857 conditions per place. 
[2023-10-25 15:20:09,946 INFO  L137   encePairwiseOnDemand]: 189/196 looper letters, 60 selfloop transitions, 9 changer transitions 0/76 dead transitions.
[2023-10-25 15:20:09,946 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 76 transitions, 460 flow
[2023-10-25 15:20:09,947 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:20:09,947 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:20:09,961 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 367 transitions.
[2023-10-25 15:20:09,961 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6241496598639455
[2023-10-25 15:20:09,961 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 367 transitions.
[2023-10-25 15:20:09,961 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 367 transitions.
[2023-10-25 15:20:09,961 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:20:09,966 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 367 transitions.
[2023-10-25 15:20:09,967 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:09,967 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:09,968 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:09,968 INFO  L175             Difference]: Start difference. First operand has 62 places, 54 transitions, 242 flow. Second operand 3 states and 367 transitions.
[2023-10-25 15:20:09,968 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 76 transitions, 460 flow
[2023-10-25 15:20:09,978 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 76 transitions, 451 flow, removed 2 selfloop flow, removed 1 redundant places.
[2023-10-25 15:20:09,986 INFO  L231             Difference]: Finished difference. Result has 65 places, 59 transitions, 311 flow
[2023-10-25 15:20:09,987 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=311, PETRI_PLACES=65, PETRI_TRANSITIONS=59}
[2023-10-25 15:20:09,987 INFO  L288   CegarLoopForPetriNet]: 51 programPoint places, 14 predicate places.
[2023-10-25 15:20:09,987 INFO  L495      AbstractCegarLoop]: Abstraction has has 65 places, 59 transitions, 311 flow
[2023-10-25 15:20:09,987 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:09,987 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:20:09,988 INFO  L209   CegarLoopForPetriNet]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:20:09,988 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2023-10-25 15:20:09,988 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2023-10-25 15:20:09,988 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:20:09,988 INFO  L85        PathProgramCache]: Analyzing trace with hash 944452700, now seen corresponding path program 1 times
[2023-10-25 15:20:09,989 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:20:09,989 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099492191]
[2023-10-25 15:20:09,989 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:20:09,989 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:20:10,018 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:20:10,118 INFO  L134       CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:20:10,118 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:20:10,118 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099492191]
[2023-10-25 15:20:10,118 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099492191] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 15:20:10,118 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137924247]
[2023-10-25 15:20:10,118 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:20:10,119 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 15:20:10,119 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 15:20:10,130 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-25 15:20:10,173 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2023-10-25 15:20:10,263 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:20:10,265 INFO  L263         TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 7 conjunts are in the unsatisfiable core
[2023-10-25 15:20:10,267 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 15:20:10,553 INFO  L134       CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:20:10,554 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-10-25 15:20:10,554 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1137924247] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:20:10,554 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2023-10-25 15:20:10,554 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11
[2023-10-25 15:20:10,554 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774768229]
[2023-10-25 15:20:10,555 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:20:10,555 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2023-10-25 15:20:10,555 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:20:10,555 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2023-10-25 15:20:10,555 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132
[2023-10-25 15:20:10,608 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 105 out of 196
[2023-10-25 15:20:10,617 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 59 transitions, 311 flow. Second operand  has 7 states, 7 states have (on average 107.0) internal successors, (749), 7 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:10,618 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:20:10,618 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 196
[2023-10-25 15:20:10,618 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:20:11,736 INFO  L130       PetriNetUnfolder]: 3812/9141 cut-off events.
[2023-10-25 15:20:11,736 INFO  L131       PetriNetUnfolder]: For 9895/10505 co-relation queries the response was YES.
[2023-10-25 15:20:11,748 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26314 conditions, 9141 events. 3812/9141 cut-off events. For 9895/10505 co-relation queries the response was YES. Maximal size of possible extension queue 373. Compared 81025 event pairs, 495 based on Foata normal form. 409/9377 useless extension candidates. Maximal degree in co-relation 12220. Up to 5596 conditions per place. 
[2023-10-25 15:20:11,761 INFO  L137   encePairwiseOnDemand]: 193/196 looper letters, 113 selfloop transitions, 5 changer transitions 10/143 dead transitions.
[2023-10-25 15:20:11,761 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 143 transitions, 941 flow
[2023-10-25 15:20:11,762 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2023-10-25 15:20:11,762 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-10-25 15:20:11,777 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 839 transitions.
[2023-10-25 15:20:11,778 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6115160349854227
[2023-10-25 15:20:11,778 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 839 transitions.
[2023-10-25 15:20:11,778 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 839 transitions.
[2023-10-25 15:20:11,779 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:20:11,779 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 839 transitions.
[2023-10-25 15:20:11,780 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 119.85714285714286) internal successors, (839), 7 states have internal predecessors, (839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:11,782 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 196.0) internal successors, (1568), 8 states have internal predecessors, (1568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:11,784 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 196.0) internal successors, (1568), 8 states have internal predecessors, (1568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:11,791 INFO  L175             Difference]: Start difference. First operand has 65 places, 59 transitions, 311 flow. Second operand 7 states and 839 transitions.
[2023-10-25 15:20:11,792 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 143 transitions, 941 flow
[2023-10-25 15:20:11,808 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 143 transitions, 899 flow, removed 0 selfloop flow, removed 4 redundant places.
[2023-10-25 15:20:11,818 INFO  L231             Difference]: Finished difference. Result has 67 places, 60 transitions, 300 flow
[2023-10-25 15:20:11,827 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=300, PETRI_PLACES=67, PETRI_TRANSITIONS=60}
[2023-10-25 15:20:11,827 INFO  L288   CegarLoopForPetriNet]: 51 programPoint places, 16 predicate places.
[2023-10-25 15:20:11,828 INFO  L495      AbstractCegarLoop]: Abstraction has has 67 places, 60 transitions, 300 flow
[2023-10-25 15:20:11,828 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 107.0) internal successors, (749), 7 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:11,828 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:20:11,828 INFO  L209   CegarLoopForPetriNet]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:20:11,836 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2023-10-25 15:20:12,033 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20
[2023-10-25 15:20:12,034 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2023-10-25 15:20:12,035 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:20:12,035 INFO  L85        PathProgramCache]: Analyzing trace with hash 949438609, now seen corresponding path program 1 times
[2023-10-25 15:20:12,035 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:20:12,035 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036804378]
[2023-10-25 15:20:12,036 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:20:12,036 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:20:12,053 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:20:12,087 INFO  L134       CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked.
[2023-10-25 15:20:12,088 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:20:12,088 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036804378]
[2023-10-25 15:20:12,088 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036804378] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:20:12,088 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:20:12,088 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 15:20:12,089 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598901461]
[2023-10-25 15:20:12,089 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:20:12,089 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:20:12,090 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:20:12,090 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:20:12,090 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:20:12,124 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 100 out of 196
[2023-10-25 15:20:12,124 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 60 transitions, 300 flow. Second operand  has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:12,124 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:20:12,124 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 196
[2023-10-25 15:20:12,125 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:20:13,265 INFO  L130       PetriNetUnfolder]: 4370/10023 cut-off events.
[2023-10-25 15:20:13,265 INFO  L131       PetriNetUnfolder]: For 12518/12596 co-relation queries the response was YES.
[2023-10-25 15:20:13,279 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 29611 conditions, 10023 events. 4370/10023 cut-off events. For 12518/12596 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 88454 event pairs, 3427 based on Foata normal form. 0/9748 useless extension candidates. Maximal degree in co-relation 6469. Up to 8591 conditions per place. 
[2023-10-25 15:20:13,292 INFO  L137   encePairwiseOnDemand]: 192/196 looper letters, 58 selfloop transitions, 4 changer transitions 1/71 dead transitions.
[2023-10-25 15:20:13,292 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 71 transitions, 480 flow
[2023-10-25 15:20:13,293 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:20:13,293 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:20:13,301 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 348 transitions.
[2023-10-25 15:20:13,301 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5918367346938775
[2023-10-25 15:20:13,301 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 348 transitions.
[2023-10-25 15:20:13,302 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 348 transitions.
[2023-10-25 15:20:13,302 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:20:13,302 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 348 transitions.
[2023-10-25 15:20:13,303 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:13,303 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:13,303 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:13,304 INFO  L175             Difference]: Start difference. First operand has 67 places, 60 transitions, 300 flow. Second operand 3 states and 348 transitions.
[2023-10-25 15:20:13,304 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 71 transitions, 480 flow
[2023-10-25 15:20:13,310 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 71 transitions, 477 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-25 15:20:13,310 INFO  L231             Difference]: Finished difference. Result has 68 places, 62 transitions, 329 flow
[2023-10-25 15:20:13,310 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=329, PETRI_PLACES=68, PETRI_TRANSITIONS=62}
[2023-10-25 15:20:13,311 INFO  L288   CegarLoopForPetriNet]: 51 programPoint places, 17 predicate places.
[2023-10-25 15:20:13,320 INFO  L495      AbstractCegarLoop]: Abstraction has has 68 places, 62 transitions, 329 flow
[2023-10-25 15:20:13,320 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:13,320 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:20:13,320 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:20:13,320 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2023-10-25 15:20:13,321 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2023-10-25 15:20:13,321 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:20:13,321 INFO  L85        PathProgramCache]: Analyzing trace with hash -775708388, now seen corresponding path program 1 times
[2023-10-25 15:20:13,321 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:20:13,321 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017664934]
[2023-10-25 15:20:13,321 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:20:13,321 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:20:13,354 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:20:13,440 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-10-25 15:20:13,440 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:20:13,451 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017664934]
[2023-10-25 15:20:13,451 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017664934] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 15:20:13,451 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [406530010]
[2023-10-25 15:20:13,451 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:20:13,452 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 15:20:13,452 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 15:20:13,453 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-25 15:20:13,496 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2023-10-25 15:20:13,587 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:20:13,597 INFO  L263         TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 5 conjunts are in the unsatisfiable core
[2023-10-25 15:20:13,599 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 15:20:13,693 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-10-25 15:20:13,693 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-25 15:20:13,741 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-10-25 15:20:13,746 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [406530010] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-25 15:20:13,747 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-25 15:20:13,747 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8
[2023-10-25 15:20:13,748 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358491535]
[2023-10-25 15:20:13,748 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-25 15:20:13,749 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2023-10-25 15:20:13,749 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:20:13,749 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2023-10-25 15:20:13,749 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=37, Unknown=0, NotChecked=0, Total=72
[2023-10-25 15:20:13,799 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 103 out of 196
[2023-10-25 15:20:13,800 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 62 transitions, 329 flow. Second operand  has 9 states, 9 states have (on average 107.11111111111111) internal successors, (964), 9 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:13,800 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:20:13,800 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 196
[2023-10-25 15:20:13,800 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:20:14,629 INFO  L130       PetriNetUnfolder]: 3219/7555 cut-off events.
[2023-10-25 15:20:14,630 INFO  L131       PetriNetUnfolder]: For 8668/9276 co-relation queries the response was YES.
[2023-10-25 15:20:14,642 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21935 conditions, 7555 events. 3219/7555 cut-off events. For 8668/9276 co-relation queries the response was YES. Maximal size of possible extension queue 356. Compared 64563 event pairs, 419 based on Foata normal form. 356/7665 useless extension candidates. Maximal degree in co-relation 7914. Up to 5708 conditions per place. 
[2023-10-25 15:20:14,653 INFO  L137   encePairwiseOnDemand]: 193/196 looper letters, 88 selfloop transitions, 5 changer transitions 0/108 dead transitions.
[2023-10-25 15:20:14,653 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 108 transitions, 678 flow
[2023-10-25 15:20:14,653 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-25 15:20:14,654 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-25 15:20:14,654 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 703 transitions.
[2023-10-25 15:20:14,655 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5977891156462585
[2023-10-25 15:20:14,655 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 703 transitions.
[2023-10-25 15:20:14,655 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 703 transitions.
[2023-10-25 15:20:14,655 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:20:14,655 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 703 transitions.
[2023-10-25 15:20:14,668 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 117.16666666666667) internal successors, (703), 6 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:14,669 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 196.0) internal successors, (1372), 7 states have internal predecessors, (1372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:14,685 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 196.0) internal successors, (1372), 7 states have internal predecessors, (1372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:14,685 INFO  L175             Difference]: Start difference. First operand has 68 places, 62 transitions, 329 flow. Second operand 6 states and 703 transitions.
[2023-10-25 15:20:14,685 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 108 transitions, 678 flow
[2023-10-25 15:20:14,694 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 108 transitions, 661 flow, removed 6 selfloop flow, removed 1 redundant places.
[2023-10-25 15:20:14,695 INFO  L231             Difference]: Finished difference. Result has 75 places, 62 transitions, 335 flow
[2023-10-25 15:20:14,695 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=335, PETRI_PLACES=75, PETRI_TRANSITIONS=62}
[2023-10-25 15:20:14,695 INFO  L288   CegarLoopForPetriNet]: 51 programPoint places, 24 predicate places.
[2023-10-25 15:20:14,695 INFO  L495      AbstractCegarLoop]: Abstraction has has 75 places, 62 transitions, 335 flow
[2023-10-25 15:20:14,696 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 107.11111111111111) internal successors, (964), 9 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:14,696 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:20:14,696 INFO  L209   CegarLoopForPetriNet]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:20:14,713 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2023-10-25 15:20:14,900 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,3 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 15:20:14,900 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2023-10-25 15:20:14,901 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:20:14,901 INFO  L85        PathProgramCache]: Analyzing trace with hash -521985787, now seen corresponding path program 1 times
[2023-10-25 15:20:14,901 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:20:14,901 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159115337]
[2023-10-25 15:20:14,901 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:20:14,901 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:20:14,915 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:20:15,005 INFO  L134       CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked.
[2023-10-25 15:20:15,005 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:20:15,005 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159115337]
[2023-10-25 15:20:15,005 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159115337] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 15:20:15,005 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1970501727]
[2023-10-25 15:20:15,005 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:20:15,005 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 15:20:15,006 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 15:20:15,026 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-25 15:20:15,056 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2023-10-25 15:20:15,159 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:20:15,160 INFO  L263         TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 4 conjunts are in the unsatisfiable core
[2023-10-25 15:20:15,162 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 15:20:15,237 INFO  L134       CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked.
[2023-10-25 15:20:15,237 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-25 15:20:15,319 INFO  L134       CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked.
[2023-10-25 15:20:15,319 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1970501727] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-25 15:20:15,319 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-25 15:20:15,319 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9
[2023-10-25 15:20:15,320 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047093693]
[2023-10-25 15:20:15,320 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-25 15:20:15,321 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2023-10-25 15:20:15,321 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:20:15,321 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2023-10-25 15:20:15,321 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90
[2023-10-25 15:20:15,440 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 103 out of 196
[2023-10-25 15:20:15,442 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 62 transitions, 335 flow. Second operand  has 10 states, 10 states have (on average 107.3) internal successors, (1073), 10 states have internal predecessors, (1073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:15,442 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:20:15,442 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 196
[2023-10-25 15:20:15,442 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:20:16,000 INFO  L130       PetriNetUnfolder]: 1763/3818 cut-off events.
[2023-10-25 15:20:16,000 INFO  L131       PetriNetUnfolder]: For 8313/8767 co-relation queries the response was YES.
[2023-10-25 15:20:16,007 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10888 conditions, 3818 events. 1763/3818 cut-off events. For 8313/8767 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 25990 event pairs, 375 based on Foata normal form. 613/4430 useless extension candidates. Maximal degree in co-relation 5233. Up to 1090 conditions per place. 
[2023-10-25 15:20:16,010 INFO  L137   encePairwiseOnDemand]: 191/196 looper letters, 0 selfloop transitions, 0 changer transitions 129/129 dead transitions.
[2023-10-25 15:20:16,010 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 129 transitions, 770 flow
[2023-10-25 15:20:16,010 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2023-10-25 15:20:16,010 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-10-25 15:20:16,011 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 844 transitions.
[2023-10-25 15:20:16,012 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6151603498542274
[2023-10-25 15:20:16,012 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 844 transitions.
[2023-10-25 15:20:16,012 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 844 transitions.
[2023-10-25 15:20:16,012 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:20:16,012 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 844 transitions.
[2023-10-25 15:20:16,014 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 120.57142857142857) internal successors, (844), 7 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:16,016 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 196.0) internal successors, (1568), 8 states have internal predecessors, (1568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:16,016 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 196.0) internal successors, (1568), 8 states have internal predecessors, (1568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:16,016 INFO  L175             Difference]: Start difference. First operand has 75 places, 62 transitions, 335 flow. Second operand 7 states and 844 transitions.
[2023-10-25 15:20:16,016 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 129 transitions, 770 flow
[2023-10-25 15:20:16,037 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 129 transitions, 683 flow, removed 24 selfloop flow, removed 10 redundant places.
[2023-10-25 15:20:16,038 INFO  L231             Difference]: Finished difference. Result has 66 places, 0 transitions, 0 flow
[2023-10-25 15:20:16,038 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=0, PETRI_PLACES=66, PETRI_TRANSITIONS=0}
[2023-10-25 15:20:16,039 INFO  L288   CegarLoopForPetriNet]: 51 programPoint places, 15 predicate places.
[2023-10-25 15:20:16,039 INFO  L495      AbstractCegarLoop]: Abstraction has has 66 places, 0 transitions, 0 flow
[2023-10-25 15:20:16,039 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 107.3) internal successors, (1073), 10 states have internal predecessors, (1073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:16,039 INFO  L805   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (7 of 8 remaining)
[2023-10-25 15:20:16,039 INFO  L805   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 8 remaining)
[2023-10-25 15:20:16,040 INFO  L805   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 8 remaining)
[2023-10-25 15:20:16,040 INFO  L805   garLoopResultBuilder]: Registering result SAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 8 remaining)
[2023-10-25 15:20:16,040 INFO  L805   garLoopResultBuilder]: Registering result SAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 8 remaining)
[2023-10-25 15:20:16,040 INFO  L805   garLoopResultBuilder]: Registering result SAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 8 remaining)
[2023-10-25 15:20:16,040 INFO  L805   garLoopResultBuilder]: Registering result SAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 8 remaining)
[2023-10-25 15:20:16,040 INFO  L805   garLoopResultBuilder]: Registering result SAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 8 remaining)
[2023-10-25 15:20:16,052 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2023-10-25 15:20:16,244 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23
[2023-10-25 15:20:16,245 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:20:16,251 INFO  L228   ceAbstractionStarter]: Analysis of concurrent program completed with 4 thread instances
[2023-10-25 15:20:16,257 INFO  L178   ceAbstractionStarter]: Computing trace abstraction results
[2023-10-25 15:20:16,272 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.10 03:20:16 BasicIcfg
[2023-10-25 15:20:16,272 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2023-10-25 15:20:16,272 INFO  L113        PluginConnector]: ------------------------Witness Printer----------------------------
[2023-10-25 15:20:16,272 INFO  L271        PluginConnector]: Initializing Witness Printer...
[2023-10-25 15:20:16,273 INFO  L275        PluginConnector]: Witness Printer initialized
[2023-10-25 15:20:16,273 INFO  L185        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 03:19:28" (3/4) ...
[2023-10-25 15:20:16,275 INFO  L137         WitnessPrinter]: Generating witness for correct program
[2023-10-25 15:20:16,285 INFO  L361     RCFGBacktranslator]: Ignoring RootEdge to procedure thread
[2023-10-25 15:20:16,291 INFO  L961   BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges
[2023-10-25 15:20:16,292 INFO  L961   BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges
[2023-10-25 15:20:16,292 INFO  L961   BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges
[2023-10-25 15:20:16,368 INFO  L141         WitnessManager]: Wrote witness to /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/witness.graphml
[2023-10-25 15:20:16,368 INFO  L132        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2023-10-25 15:20:16,369 INFO  L158              Benchmark]: Toolchain (without parser) took 49076.78ms. Allocated memory was 45.3MB in the beginning and 825.8MB in the end (delta: 780.5MB). Free memory was 15.1MB in the beginning and 423.6MB in the end (delta: -408.5MB). Peak memory consumption was 372.0MB. Max. memory is 15.6GB.
[2023-10-25 15:20:16,369 INFO  L158              Benchmark]: CDTParser took 0.16ms. Allocated memory is still 41.4MB. Free memory was 16.3MB in the beginning and 16.2MB in the end (delta: 33.9kB). Peak memory consumption was 33.9kB. Max. memory is 15.6GB.
[2023-10-25 15:20:16,370 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 688.33ms. Allocated memory is still 45.3MB. Free memory was 14.8MB in the beginning and 18.7MB in the end (delta: -3.9MB). Peak memory consumption was 4.1MB. Max. memory is 15.6GB.
[2023-10-25 15:20:16,370 INFO  L158              Benchmark]: Boogie Procedure Inliner took 67.30ms. Allocated memory is still 45.3MB. Free memory was 18.7MB in the beginning and 16.8MB in the end (delta: 1.9MB). Peak memory consumption was 1.9MB. Max. memory is 15.6GB.
[2023-10-25 15:20:16,370 INFO  L158              Benchmark]: Boogie Preprocessor took 59.14ms. Allocated memory is still 45.3MB. Free memory was 16.8MB in the beginning and 15.3MB in the end (delta: 1.5MB). Peak memory consumption was 1.5MB. Max. memory is 15.6GB.
[2023-10-25 15:20:16,371 INFO  L158              Benchmark]: RCFGBuilder took 581.10ms. Allocated memory is still 45.3MB. Free memory was 15.3MB in the beginning and 14.9MB in the end (delta: 356.4kB). Peak memory consumption was 5.2MB. Max. memory is 15.6GB.
[2023-10-25 15:20:16,372 INFO  L158              Benchmark]: TraceAbstraction took 47571.72ms. Allocated memory was 45.3MB in the beginning and 825.8MB in the end (delta: 780.5MB). Free memory was 14.3MB in the beginning and 423.6MB in the end (delta: -409.3MB). Peak memory consumption was 371.3MB. Max. memory is 15.6GB.
[2023-10-25 15:20:16,373 INFO  L158              Benchmark]: Witness Printer took 96.23ms. Allocated memory is still 825.8MB. Free memory was 423.6MB in the beginning and 423.6MB in the end (delta: 2.6kB). Peak memory consumption was 2.6kB. Max. memory is 15.6GB.
[2023-10-25 15:20:16,375 INFO  L339   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.16ms. Allocated memory is still 41.4MB. Free memory was 16.3MB in the beginning and 16.2MB in the end (delta: 33.9kB). Peak memory consumption was 33.9kB. Max. memory is 15.6GB.
 * CACSL2BoogieTranslator took 688.33ms. Allocated memory is still 45.3MB. Free memory was 14.8MB in the beginning and 18.7MB in the end (delta: -3.9MB). Peak memory consumption was 4.1MB. Max. memory is 15.6GB.
 * Boogie Procedure Inliner took 67.30ms. Allocated memory is still 45.3MB. Free memory was 18.7MB in the beginning and 16.8MB in the end (delta: 1.9MB). Peak memory consumption was 1.9MB. Max. memory is 15.6GB.
 * Boogie Preprocessor took 59.14ms. Allocated memory is still 45.3MB. Free memory was 16.8MB in the beginning and 15.3MB in the end (delta: 1.5MB). Peak memory consumption was 1.5MB. Max. memory is 15.6GB.
 * RCFGBuilder took 581.10ms. Allocated memory is still 45.3MB. Free memory was 15.3MB in the beginning and 14.9MB in the end (delta: 356.4kB). Peak memory consumption was 5.2MB. Max. memory is 15.6GB.
 * TraceAbstraction took 47571.72ms. Allocated memory was 45.3MB in the beginning and 825.8MB in the end (delta: 780.5MB). Free memory was 14.3MB in the beginning and 423.6MB in the end (delta: -409.3MB). Peak memory consumption was 371.3MB. Max. memory is 15.6GB.
 * Witness Printer took 96.23ms. Allocated memory is still 825.8MB. Free memory was 423.6MB in the beginning and 423.6MB in the end (delta: 2.6kB). Peak memory consumption was 2.6kB. Max. memory is 15.6GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    Lipton Reduction Statistics: ReductionTime: 2.2s, 71 PlacesBefore, 20 PlacesAfterwards, 71 TransitionsBefore, 18 TransitionsAfterwards, 896 CoEnabledTransitionPairs, 6 FixpointIterations, 21 TrivialSequentialCompositions, 29 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 2 ChoiceCompositions, 56 TotalNumberOfCompositions, 1340 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1019, independent: 943, independent conditional: 0, independent unconditional: 943, dependent: 76, dependent conditional: 0, dependent unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 494, independent: 484, independent conditional: 0, independent unconditional: 484, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1019, independent: 459, independent conditional: 0, independent unconditional: 459, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 494, unknown conditional: 0, unknown unconditional: 494] , Statistics on independence cache: Total cache size (in pairs): 33, Positive cache size: 28, Positive conditional cache size: 0, Positive unconditional cache size: 28, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    Lipton Reduction Statistics: ReductionTime: 1.9s, 88 PlacesBefore, 33 PlacesAfterwards, 87 TransitionsBefore, 30 TransitionsAfterwards, 2492 CoEnabledTransitionPairs, 5 FixpointIterations, 18 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 2 ChoiceCompositions, 61 TotalNumberOfCompositions, 5100 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3007, independent: 2868, independent conditional: 0, independent unconditional: 2868, dependent: 139, dependent conditional: 0, dependent unconditional: 139, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1300, independent: 1275, independent conditional: 0, independent unconditional: 1275, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3007, independent: 1593, independent conditional: 0, independent unconditional: 1593, dependent: 114, dependent conditional: 0, dependent unconditional: 114, unknown: 1300, unknown conditional: 0, unknown unconditional: 1300] , Statistics on independence cache: Total cache size (in pairs): 132, Positive cache size: 119, Positive conditional cache size: 0, Positive unconditional cache size: 119, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    Lipton Reduction Statistics: ReductionTime: 1.9s, 105 PlacesBefore, 42 PlacesAfterwards, 103 TransitionsBefore, 38 TransitionsAfterwards, 4452 CoEnabledTransitionPairs, 6 FixpointIterations, 18 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 2 ChoiceCompositions, 69 TotalNumberOfCompositions, 11117 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5556, independent: 5322, independent conditional: 0, independent unconditional: 5322, dependent: 234, dependent conditional: 0, dependent unconditional: 234, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2167, independent: 2131, independent conditional: 0, independent unconditional: 2131, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5556, independent: 3191, independent conditional: 0, independent unconditional: 3191, dependent: 198, dependent conditional: 0, dependent unconditional: 198, unknown: 2167, unknown conditional: 0, unknown unconditional: 2167] , Statistics on independence cache: Total cache size (in pairs): 175, Positive cache size: 155, Positive conditional cache size: 0, Positive unconditional cache size: 155, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    Lipton Reduction Statistics: ReductionTime: 2.2s, 122 PlacesBefore, 51 PlacesAfterwards, 119 TransitionsBefore, 46 TransitionsAfterwards, 6888 CoEnabledTransitionPairs, 5 FixpointIterations, 18 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 2 ChoiceCompositions, 77 TotalNumberOfCompositions, 17075 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8478, independent: 8216, independent conditional: 0, independent unconditional: 8216, dependent: 262, dependent conditional: 0, dependent unconditional: 262, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3480, independent: 3427, independent conditional: 0, independent unconditional: 3427, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 8478, independent: 4789, independent conditional: 0, independent unconditional: 4789, dependent: 209, dependent conditional: 0, dependent unconditional: 209, unknown: 3480, unknown conditional: 0, unknown unconditional: 3480] , Statistics on independence cache: Total cache size (in pairs): 405, Positive cache size: 375, Positive conditional cache size: 0, Positive unconditional cache size: 375, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0
  - PositiveResult [Line: 690]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 688]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 677]: there are no data races
    For all program executions holds that there are no data races at this location
  - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
    CFG has 3 procedures, 84 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 3.3s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 53 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 19 mSDsluCounter, 20 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 84 IncrementalHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 20 mSDtfsCounter, 84 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=2, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 15 NumberOfCodeBlocks, 15 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 7 ConstructedInterpolants, 0 QuantifiedInterpolants, 15 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
  - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances
    CFG has 4 procedures, 99 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 3.1s, OverallIterations: 4, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 144 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 84 mSDsluCounter, 13 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 224 IncrementalHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 3 mSDtfsCounter, 224 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=124occurred in iteration=3, InterpolantAutomatonStates: 10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 29 NumberOfCodeBlocks, 29 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 15 ConstructedInterpolants, 0 QuantifiedInterpolants, 39 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 1/1 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
  - StatisticsResult: Ultimate Automizer benchmark data with 3 thread instances
    CFG has 5 procedures, 114 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 7.3s, OverallIterations: 6, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 259 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 157 mSDsluCounter, 25 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 448 IncrementalHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 17 mSDtfsCounter, 448 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=240occurred in iteration=4, InterpolantAutomatonStates: 16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 58 NumberOfCodeBlocks, 58 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 38 ConstructedInterpolants, 0 QuantifiedInterpolants, 88 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 5/5 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
  - StatisticsResult: Ultimate Automizer benchmark data with 4 thread instances
    CFG has 6 procedures, 129 locations, 8 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 33.7s, OverallIterations: 11, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 28.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1039 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 792 mSDsluCounter, 82 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16 mSDsCounter, 56 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1680 IncrementalHoareTripleChecker+Invalid, 1736 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 56 mSolverCounterUnsat, 66 mSDtfsCounter, 1680 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 160 GetRequests, 122 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=335occurred in iteration=10, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 244 NumberOfCodeBlocks, 244 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 284 ConstructedInterpolants, 0 QuantifiedInterpolants, 916 SizeOfPredicates, 6 NumberOfNonLiveVariables, 460 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 16 InterpolantComputations, 9 PerfectInterpolantSequences, 171/205 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
  - AllSpecificationsHoldResult: All specifications hold
    3 specifications checked. All of them hold
RESULT: Ultimate proved your program to be correct!
[2023-10-25 15:20:16,414 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
--- End real Ultimate output ---

Execution finished normally
Writing output log to file Ultimate.log
Result:
TRUE
