./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-counter-outer-race-3.i --full-output --architecture 32bit


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


Checking for data races
Using default analysis
Version 0e0057cc
Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data -tc /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/config/AutomizerReach.xml -i /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/thread-join-counter-outer-race-3.i -s /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux --witnessprinter.witness.filename witness --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 4652f4da866d77155a362f7e0d43c417fde934bdeb6599c1ba8014f5bc2bf248
--- Real Ultimate output ---
This is Ultimate 0.2.4-dev-0e0057c
[2024-02-28 21:37:47,951 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-02-28 21:37:47,995 INFO  L114        SettingsManager]: Loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2024-02-28 21:37:47,998 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-02-28 21:37:47,998 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-02-28 21:37:48,013 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-02-28 21:37:48,014 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-02-28 21:37:48,014 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-02-28 21:37:48,014 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-02-28 21:37:48,015 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-02-28 21:37:48,015 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-02-28 21:37:48,016 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-02-28 21:37:48,016 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-02-28 21:37:48,016 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-02-28 21:37:48,017 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-02-28 21:37:48,017 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-02-28 21:37:48,017 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-02-28 21:37:48,018 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-02-28 21:37:48,018 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-02-28 21:37:48,018 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-02-28 21:37:48,019 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-02-28 21:37:48,020 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-02-28 21:37:48,020 INFO  L153        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2024-02-28 21:37:48,020 INFO  L153        SettingsManager]:  * Check unreachability of reach_error function=false
[2024-02-28 21:37:48,021 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-02-28 21:37:48,021 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-02-28 21:37:48,021 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-02-28 21:37:48,022 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-02-28 21:37:48,022 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-02-28 21:37:48,022 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-02-28 21:37:48,022 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-02-28 21:37:48,023 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-02-28 21:37:48,023 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-02-28 21:37:48,023 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-02-28 21:37:48,024 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-02-28 21:37:48,024 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-02-28 21:37:48,024 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-02-28 21:37:48,024 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-02-28 21:37:48,024 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-02-28 21:37:48,025 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-02-28 21:37:48,025 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-02-28 21:37:48,025 INFO  L153        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-pldi24/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-pldi24/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
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 -> 4652f4da866d77155a362f7e0d43c417fde934bdeb6599c1ba8014f5bc2bf248
[2024-02-28 21:37:48,195 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-02-28 21:37:48,220 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-02-28 21:37:48,224 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-02-28 21:37:48,225 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-02-28 21:37:48,229 INFO  L274        PluginConnector]: CDTParser initialized
[2024-02-28 21:37:48,231 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/thread-join-counter-outer-race-3.i
[2024-02-28 21:37:49,367 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-02-28 21:37:49,552 INFO  L384              CDTParser]: Found 1 translation units.
[2024-02-28 21:37:49,553 INFO  L180              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/thread-join-counter-outer-race-3.i
[2024-02-28 21:37:49,562 INFO  L427              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data/376254984/0ec378fe092a4c4faa2f82366d99eafd/FLAG3fede2e90
[2024-02-28 21:37:49,573 INFO  L435              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data/376254984/0ec378fe092a4c4faa2f82366d99eafd
[2024-02-28 21:37:49,574 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-02-28 21:37:49,575 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-02-28 21:37:49,576 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-02-28 21:37:49,576 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-02-28 21:37:49,580 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-02-28 21:37:49,581 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.02 09:37:49" (1/1) ...
[2024-02-28 21:37:49,582 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f98d796 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 09:37:49, skipping insertion in model container
[2024-02-28 21:37:49,582 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.02 09:37:49" (1/1) ...
[2024-02-28 21:37:49,617 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-02-28 21:37:49,820 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2024-02-28 21:37:49,832 INFO  L202         MainTranslator]: Completed pre-run
[2024-02-28 21:37:49,857 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2024-02-28 21:37:49,876 WARN  L675               CHandler]: The function pthread_detach is called, but not defined or handled by StandardFunctionHandler.
[2024-02-28 21:37:49,881 INFO  L206         MainTranslator]: Completed translation
[2024-02-28 21:37:49,881 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 09:37:49 WrapperNode
[2024-02-28 21:37:49,882 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-02-28 21:37:49,882 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-02-28 21:37:49,883 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-02-28 21:37:49,883 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-02-28 21:37:49,887 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 09:37:49" (1/1) ...
[2024-02-28 21:37:49,897 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 09:37:49" (1/1) ...
[2024-02-28 21:37:49,913 INFO  L138                Inliner]: procedures = 160, calls = 42, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 105
[2024-02-28 21:37:49,914 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-02-28 21:37:49,914 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-02-28 21:37:49,915 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-02-28 21:37:49,915 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-02-28 21:37:49,922 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 09:37:49" (1/1) ...
[2024-02-28 21:37:49,922 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 09:37:49" (1/1) ...
[2024-02-28 21:37:49,924 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 09:37:49" (1/1) ...
[2024-02-28 21:37:49,924 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 09:37:49" (1/1) ...
[2024-02-28 21:37:49,929 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 09:37:49" (1/1) ...
[2024-02-28 21:37:49,931 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 09:37:49" (1/1) ...
[2024-02-28 21:37:49,932 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 09:37:49" (1/1) ...
[2024-02-28 21:37:49,933 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 09:37:49" (1/1) ...
[2024-02-28 21:37:49,935 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-02-28 21:37:49,936 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-02-28 21:37:49,936 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-02-28 21:37:49,936 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-02-28 21:37:49,936 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 09:37:49" (1/1) ...
[2024-02-28 21:37:49,941 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-02-28 21:37:49,948 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-02-28 21:37:49,962 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-02-28 21:37:49,984 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-02-28 21:37:49,995 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2024-02-28 21:37:49,996 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2024-02-28 21:37:49,996 INFO  L130     BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock
[2024-02-28 21:37:49,996 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-02-28 21:37:49,996 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2024-02-28 21:37:49,996 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-02-28 21:37:49,996 INFO  L130     BoogieDeclarations]: Found specification of procedure pthread_detach
[2024-02-28 21:37:49,996 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2024-02-28 21:37:49,997 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2024-02-28 21:37:49,997 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2024-02-28 21:37:49,997 INFO  L130     BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock
[2024-02-28 21:37:49,997 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-02-28 21:37:49,997 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-02-28 21:37:49,999 WARN  L213             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-02-28 21:37:50,127 INFO  L241             CfgBuilder]: Building ICFG
[2024-02-28 21:37:50,128 INFO  L267             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-02-28 21:37:50,341 INFO  L282             CfgBuilder]: Performing block encoding
[2024-02-28 21:37:50,365 INFO  L304             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-02-28 21:37:50,365 INFO  L309             CfgBuilder]: Removed 2 assume(true) statements.
[2024-02-28 21:37:50,366 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 09:37:50 BoogieIcfgContainer
[2024-02-28 21:37:50,366 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-02-28 21:37:50,368 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-02-28 21:37:50,368 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-02-28 21:37:50,370 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-02-28 21:37:50,370 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.02 09:37:49" (1/3) ...
[2024-02-28 21:37:50,371 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b7acb60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.02 09:37:50, skipping insertion in model container
[2024-02-28 21:37:50,371 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 09:37:49" (2/3) ...
[2024-02-28 21:37:50,371 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b7acb60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.02 09:37:50, skipping insertion in model container
[2024-02-28 21:37:50,371 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 09:37:50" (3/3) ...
[2024-02-28 21:37:50,372 INFO  L112   eAbstractionObserver]: Analyzing ICFG thread-join-counter-outer-race-3.i
[2024-02-28 21:37:50,378 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2024-02-28 21:37:50,385 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-02-28 21:37:50,386 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations.
[2024-02-28 21:37:50,386 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-02-28 21:37:50,425 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-02-28 21:37:50,451 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 139 places, 140 transitions, 284 flow
[2024-02-28 21:37:50,502 INFO  L124   PetriNetUnfolderBase]: 7/184 cut-off events.
[2024-02-28 21:37:50,502 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-02-28 21:37:50,506 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 188 conditions, 184 events. 7/184 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 258 event pairs, 0 based on Foata normal form. 0/163 useless extension candidates. Maximal degree in co-relation 93. Up to 4 conditions per place. 
[2024-02-28 21:37:50,506 INFO  L82        GeneralOperation]: Start removeDead. Operand has 139 places, 140 transitions, 284 flow
[2024-02-28 21:37:50,509 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 139 places, 140 transitions, 284 flow
[2024-02-28 21:37:50,517 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-02-28 21:37:50,522 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@2d6a85da, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-02-28 21:37:50,522 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 12 error locations.
[2024-02-28 21:37:50,531 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-02-28 21:37:50,531 INFO  L124   PetriNetUnfolderBase]: 2/54 cut-off events.
[2024-02-28 21:37:50,531 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-02-28 21:37:50,531 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 21:37:50,531 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 21:37:50,532 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 9 more)] ===
[2024-02-28 21:37:50,535 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 21:37:50,535 INFO  L85        PathProgramCache]: Analyzing trace with hash -76846849, now seen corresponding path program 1 times
[2024-02-28 21:37:50,542 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 21:37:50,542 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176289551]
[2024-02-28 21:37:50,542 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 21:37:50,543 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 21:37:50,627 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 21:37:50,720 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 21:37:50,720 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 21:37:50,720 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176289551]
[2024-02-28 21:37:50,721 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176289551] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 21:37:50,721 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 21:37:50,721 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-02-28 21:37:50,722 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518734300]
[2024-02-28 21:37:50,723 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 21:37:50,729 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-02-28 21:37:50,733 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 21:37:50,751 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-02-28 21:37:50,751 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-02-28 21:37:50,778 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 115 out of 140
[2024-02-28 21:37:50,780 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 140 transitions, 284 flow. Second operand  has 3 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)
[2024-02-28 21:37:50,780 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 21:37:50,781 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 140
[2024-02-28 21:37:50,781 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 21:37:50,918 INFO  L124   PetriNetUnfolderBase]: 98/626 cut-off events.
[2024-02-28 21:37:50,918 INFO  L125   PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES.
[2024-02-28 21:37:50,920 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 860 conditions, 626 events. 98/626 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 3496 event pairs, 33 based on Foata normal form. 7/568 useless extension candidates. Maximal degree in co-relation 753. Up to 138 conditions per place. 
[2024-02-28 21:37:50,922 INFO  L140   encePairwiseOnDemand]: 126/140 looper letters, 32 selfloop transitions, 8 changer transitions 1/155 dead transitions.
[2024-02-28 21:37:50,922 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 155 transitions, 394 flow
[2024-02-28 21:37:50,924 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-02-28 21:37:50,925 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-02-28 21:37:50,931 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 393 transitions.
[2024-02-28 21:37:50,933 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9357142857142857
[2024-02-28 21:37:50,933 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 393 transitions.
[2024-02-28 21:37:50,934 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 393 transitions.
[2024-02-28 21:37:50,935 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 21:37:50,936 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 393 transitions.
[2024-02-28 21:37:50,941 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:37:50,948 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:37:50,949 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:37:50,952 INFO  L175             Difference]: Start difference. First operand has 139 places, 140 transitions, 284 flow. Second operand 3 states and 393 transitions.
[2024-02-28 21:37:50,952 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 155 transitions, 394 flow
[2024-02-28 21:37:50,955 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 155 transitions, 394 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-02-28 21:37:50,958 INFO  L231             Difference]: Finished difference. Result has 143 places, 144 transitions, 346 flow
[2024-02-28 21:37:50,960 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=346, PETRI_PLACES=143, PETRI_TRANSITIONS=144}
[2024-02-28 21:37:50,963 INFO  L281   CegarLoopForPetriNet]: 139 programPoint places, 4 predicate places.
[2024-02-28 21:37:50,964 INFO  L495      AbstractCegarLoop]: Abstraction has has 143 places, 144 transitions, 346 flow
[2024-02-28 21:37:50,964 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 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)
[2024-02-28 21:37:50,964 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 21:37:50,964 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 21:37:50,964 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-02-28 21:37:50,965 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 9 more)] ===
[2024-02-28 21:37:50,965 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 21:37:50,965 INFO  L85        PathProgramCache]: Analyzing trace with hash -1371708680, now seen corresponding path program 1 times
[2024-02-28 21:37:50,965 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 21:37:50,965 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590150369]
[2024-02-28 21:37:50,966 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 21:37:50,966 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 21:37:50,987 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 21:37:51,030 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 21:37:51,030 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 21:37:51,030 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590150369]
[2024-02-28 21:37:51,031 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590150369] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 21:37:51,031 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 21:37:51,031 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-02-28 21:37:51,031 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761948136]
[2024-02-28 21:37:51,031 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 21:37:51,032 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-02-28 21:37:51,032 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 21:37:51,033 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-02-28 21:37:51,033 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-02-28 21:37:51,068 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 115 out of 140
[2024-02-28 21:37:51,069 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 144 transitions, 346 flow. Second operand  has 3 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)
[2024-02-28 21:37:51,069 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 21:37:51,069 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 140
[2024-02-28 21:37:51,069 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 21:37:51,170 INFO  L124   PetriNetUnfolderBase]: 114/757 cut-off events.
[2024-02-28 21:37:51,170 INFO  L125   PetriNetUnfolderBase]: For 168/173 co-relation queries the response was YES.
[2024-02-28 21:37:51,172 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1193 conditions, 757 events. 114/757 cut-off events. For 168/173 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 4573 event pairs, 72 based on Foata normal form. 4/698 useless extension candidates. Maximal degree in co-relation 1074. Up to 226 conditions per place. 
[2024-02-28 21:37:51,174 INFO  L140   encePairwiseOnDemand]: 134/140 looper letters, 29 selfloop transitions, 7 changer transitions 0/153 dead transitions.
[2024-02-28 21:37:51,174 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 153 transitions, 446 flow
[2024-02-28 21:37:51,175 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-02-28 21:37:51,175 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-02-28 21:37:51,176 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 376 transitions.
[2024-02-28 21:37:51,176 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8952380952380953
[2024-02-28 21:37:51,176 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 376 transitions.
[2024-02-28 21:37:51,176 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 376 transitions.
[2024-02-28 21:37:51,177 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 21:37:51,177 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 376 transitions.
[2024-02-28 21:37:51,178 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:37:51,179 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:37:51,180 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:37:51,180 INFO  L175             Difference]: Start difference. First operand has 143 places, 144 transitions, 346 flow. Second operand 3 states and 376 transitions.
[2024-02-28 21:37:51,180 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 153 transitions, 446 flow
[2024-02-28 21:37:51,182 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 153 transitions, 426 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-02-28 21:37:51,184 INFO  L231             Difference]: Finished difference. Result has 144 places, 149 transitions, 386 flow
[2024-02-28 21:37:51,185 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=386, PETRI_PLACES=144, PETRI_TRANSITIONS=149}
[2024-02-28 21:37:51,185 INFO  L281   CegarLoopForPetriNet]: 139 programPoint places, 5 predicate places.
[2024-02-28 21:37:51,185 INFO  L495      AbstractCegarLoop]: Abstraction has has 144 places, 149 transitions, 386 flow
[2024-02-28 21:37:51,186 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 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)
[2024-02-28 21:37:51,186 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 21:37:51,186 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 21:37:51,186 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-02-28 21:37:51,186 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 9 more)] ===
[2024-02-28 21:37:51,187 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 21:37:51,187 INFO  L85        PathProgramCache]: Analyzing trace with hash 587414492, now seen corresponding path program 1 times
[2024-02-28 21:37:51,187 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 21:37:51,187 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402046321]
[2024-02-28 21:37:51,187 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 21:37:51,188 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 21:37:51,203 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 21:37:51,270 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 21:37:51,270 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 21:37:51,270 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402046321]
[2024-02-28 21:37:51,270 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402046321] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 21:37:51,270 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 21:37:51,270 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-02-28 21:37:51,271 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032773259]
[2024-02-28 21:37:51,271 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 21:37:51,271 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-02-28 21:37:51,271 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 21:37:51,272 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-02-28 21:37:51,272 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-02-28 21:37:51,281 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 122 out of 140
[2024-02-28 21:37:51,282 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 149 transitions, 386 flow. Second operand  has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:37:51,282 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 21:37:51,282 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 140
[2024-02-28 21:37:51,282 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 21:37:51,366 INFO  L124   PetriNetUnfolderBase]: 94/682 cut-off events.
[2024-02-28 21:37:51,366 INFO  L125   PetriNetUnfolderBase]: For 70/74 co-relation queries the response was YES.
[2024-02-28 21:37:51,367 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1013 conditions, 682 events. 94/682 cut-off events. For 70/74 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 4007 event pairs, 56 based on Foata normal form. 3/626 useless extension candidates. Maximal degree in co-relation 909. Up to 144 conditions per place. 
[2024-02-28 21:37:51,369 INFO  L140   encePairwiseOnDemand]: 137/140 looper letters, 15 selfloop transitions, 2 changer transitions 3/154 dead transitions.
[2024-02-28 21:37:51,369 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 154 transitions, 436 flow
[2024-02-28 21:37:51,370 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-02-28 21:37:51,370 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-02-28 21:37:51,371 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 387 transitions.
[2024-02-28 21:37:51,371 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9214285714285714
[2024-02-28 21:37:51,371 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 387 transitions.
[2024-02-28 21:37:51,371 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 387 transitions.
[2024-02-28 21:37:51,372 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 21:37:51,372 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 387 transitions.
[2024-02-28 21:37:51,373 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:37:51,374 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:37:51,374 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:37:51,375 INFO  L175             Difference]: Start difference. First operand has 144 places, 149 transitions, 386 flow. Second operand 3 states and 387 transitions.
[2024-02-28 21:37:51,375 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 154 transitions, 436 flow
[2024-02-28 21:37:51,377 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 154 transitions, 422 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-02-28 21:37:51,379 INFO  L231             Difference]: Finished difference. Result has 145 places, 150 transitions, 384 flow
[2024-02-28 21:37:51,379 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=384, PETRI_PLACES=145, PETRI_TRANSITIONS=150}
[2024-02-28 21:37:51,380 INFO  L281   CegarLoopForPetriNet]: 139 programPoint places, 6 predicate places.
[2024-02-28 21:37:51,380 INFO  L495      AbstractCegarLoop]: Abstraction has has 145 places, 150 transitions, 384 flow
[2024-02-28 21:37:51,381 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:37:51,381 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 21:37:51,381 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 21:37:51,381 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-02-28 21:37:51,381 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 9 more)] ===
[2024-02-28 21:37:51,382 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 21:37:51,382 INFO  L85        PathProgramCache]: Analyzing trace with hash 136620557, now seen corresponding path program 1 times
[2024-02-28 21:37:51,382 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 21:37:51,382 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645059373]
[2024-02-28 21:37:51,383 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 21:37:51,383 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 21:37:51,408 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 21:37:51,737 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 21:37:51,737 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 21:37:51,737 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645059373]
[2024-02-28 21:37:51,738 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645059373] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 21:37:51,738 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 21:37:51,738 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 21:37:51,738 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822739852]
[2024-02-28 21:37:51,738 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 21:37:51,738 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 21:37:51,739 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 21:37:51,739 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 21:37:51,739 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 21:37:51,776 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 115 out of 140
[2024-02-28 21:37:51,777 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 150 transitions, 384 flow. Second operand  has 6 states, 6 states have (on average 116.66666666666667) internal successors, (700), 6 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:37:51,777 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 21:37:51,777 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 140
[2024-02-28 21:37:51,777 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 21:37:51,912 INFO  L124   PetriNetUnfolderBase]: 96/798 cut-off events.
[2024-02-28 21:37:51,912 INFO  L125   PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES.
[2024-02-28 21:37:51,913 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1160 conditions, 798 events. 96/798 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 4752 event pairs, 39 based on Foata normal form. 0/741 useless extension candidates. Maximal degree in co-relation 1077. Up to 127 conditions per place. 
[2024-02-28 21:37:51,915 INFO  L140   encePairwiseOnDemand]: 134/140 looper letters, 32 selfloop transitions, 5 changer transitions 0/165 dead transitions.
[2024-02-28 21:37:51,915 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 165 transitions, 488 flow
[2024-02-28 21:37:51,916 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 21:37:51,916 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 21:37:51,918 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 728 transitions.
[2024-02-28 21:37:51,918 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8666666666666667
[2024-02-28 21:37:51,918 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 728 transitions.
[2024-02-28 21:37:51,918 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 728 transitions.
[2024-02-28 21:37:51,919 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 21:37:51,919 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 728 transitions.
[2024-02-28 21:37:51,920 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 121.33333333333333) internal successors, (728), 6 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:37:51,922 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 140.0) internal successors, (980), 7 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)
[2024-02-28 21:37:51,922 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 140.0) internal successors, (980), 7 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)
[2024-02-28 21:37:51,922 INFO  L175             Difference]: Start difference. First operand has 145 places, 150 transitions, 384 flow. Second operand 6 states and 728 transitions.
[2024-02-28 21:37:51,922 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 165 transitions, 488 flow
[2024-02-28 21:37:51,924 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 165 transitions, 486 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-02-28 21:37:51,926 INFO  L231             Difference]: Finished difference. Result has 148 places, 149 transitions, 390 flow
[2024-02-28 21:37:51,926 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=390, PETRI_PLACES=148, PETRI_TRANSITIONS=149}
[2024-02-28 21:37:51,926 INFO  L281   CegarLoopForPetriNet]: 139 programPoint places, 9 predicate places.
[2024-02-28 21:37:51,927 INFO  L495      AbstractCegarLoop]: Abstraction has has 148 places, 149 transitions, 390 flow
[2024-02-28 21:37:51,927 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 116.66666666666667) internal successors, (700), 6 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:37:51,927 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 21:37:51,928 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 21:37:51,928 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-02-28 21:37:51,928 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 9 more)] ===
[2024-02-28 21:37:51,928 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 21:37:51,928 INFO  L85        PathProgramCache]: Analyzing trace with hash -1455672047, now seen corresponding path program 1 times
[2024-02-28 21:37:51,928 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 21:37:51,929 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463915471]
[2024-02-28 21:37:51,929 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 21:37:51,929 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 21:37:51,941 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 21:37:51,969 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 21:37:51,969 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 21:37:51,969 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463915471]
[2024-02-28 21:37:51,970 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463915471] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 21:37:51,970 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 21:37:51,970 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-02-28 21:37:51,970 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785140518]
[2024-02-28 21:37:51,970 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 21:37:51,971 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-02-28 21:37:51,972 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 21:37:51,972 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-02-28 21:37:51,972 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-02-28 21:37:51,981 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 120 out of 140
[2024-02-28 21:37:51,982 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 149 transitions, 390 flow. Second operand  has 3 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)
[2024-02-28 21:37:51,982 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 21:37:51,982 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 140
[2024-02-28 21:37:51,982 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 21:37:52,054 INFO  L124   PetriNetUnfolderBase]: 93/632 cut-off events.
[2024-02-28 21:37:52,055 INFO  L125   PetriNetUnfolderBase]: For 35/39 co-relation queries the response was YES.
[2024-02-28 21:37:52,056 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 957 conditions, 632 events. 93/632 cut-off events. For 35/39 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3758 event pairs, 55 based on Foata normal form. 0/581 useless extension candidates. Maximal degree in co-relation 854. Up to 131 conditions per place. 
[2024-02-28 21:37:52,057 INFO  L140   encePairwiseOnDemand]: 135/140 looper letters, 22 selfloop transitions, 4 changer transitions 0/158 dead transitions.
[2024-02-28 21:37:52,057 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 158 transitions, 460 flow
[2024-02-28 21:37:52,058 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-02-28 21:37:52,058 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-02-28 21:37:52,059 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 387 transitions.
[2024-02-28 21:37:52,059 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9214285714285714
[2024-02-28 21:37:52,059 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 387 transitions.
[2024-02-28 21:37:52,059 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 387 transitions.
[2024-02-28 21:37:52,059 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 21:37:52,059 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 387 transitions.
[2024-02-28 21:37:52,060 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:37:52,061 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:37:52,061 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:37:52,061 INFO  L175             Difference]: Start difference. First operand has 148 places, 149 transitions, 390 flow. Second operand 3 states and 387 transitions.
[2024-02-28 21:37:52,062 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 158 transitions, 460 flow
[2024-02-28 21:37:52,063 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 158 transitions, 450 flow, removed 0 selfloop flow, removed 5 redundant places.
[2024-02-28 21:37:52,064 INFO  L231             Difference]: Finished difference. Result has 147 places, 152 transitions, 410 flow
[2024-02-28 21:37:52,065 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=410, PETRI_PLACES=147, PETRI_TRANSITIONS=152}
[2024-02-28 21:37:52,065 INFO  L281   CegarLoopForPetriNet]: 139 programPoint places, 8 predicate places.
[2024-02-28 21:37:52,065 INFO  L495      AbstractCegarLoop]: Abstraction has has 147 places, 152 transitions, 410 flow
[2024-02-28 21:37:52,066 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 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)
[2024-02-28 21:37:52,066 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 21:37:52,066 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 21:37:52,066 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-02-28 21:37:52,066 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 9 more)] ===
[2024-02-28 21:37:52,066 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 21:37:52,067 INFO  L85        PathProgramCache]: Analyzing trace with hash -1144144204, now seen corresponding path program 1 times
[2024-02-28 21:37:52,067 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 21:37:52,067 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244534336]
[2024-02-28 21:37:52,067 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 21:37:52,067 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 21:37:52,079 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 21:37:52,100 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 21:37:52,100 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 21:37:52,101 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244534336]
[2024-02-28 21:37:52,101 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244534336] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 21:37:52,101 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 21:37:52,101 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-02-28 21:37:52,101 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436388602]
[2024-02-28 21:37:52,101 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 21:37:52,102 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-02-28 21:37:52,102 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 21:37:52,102 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-02-28 21:37:52,102 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-02-28 21:37:52,121 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 117 out of 140
[2024-02-28 21:37:52,121 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 152 transitions, 410 flow. Second operand  has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:37:52,121 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 21:37:52,121 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 140
[2024-02-28 21:37:52,121 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 21:37:52,215 INFO  L124   PetriNetUnfolderBase]: 160/835 cut-off events.
[2024-02-28 21:37:52,215 INFO  L125   PetriNetUnfolderBase]: For 175/179 co-relation queries the response was YES.
[2024-02-28 21:37:52,216 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1467 conditions, 835 events. 160/835 cut-off events. For 175/179 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 5206 event pairs, 74 based on Foata normal form. 1/784 useless extension candidates. Maximal degree in co-relation 1357. Up to 262 conditions per place. 
[2024-02-28 21:37:52,218 INFO  L140   encePairwiseOnDemand]: 133/140 looper letters, 30 selfloop transitions, 11 changer transitions 0/165 dead transitions.
[2024-02-28 21:37:52,218 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 165 transitions, 532 flow
[2024-02-28 21:37:52,219 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-02-28 21:37:52,219 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-02-28 21:37:52,219 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 383 transitions.
[2024-02-28 21:37:52,220 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9119047619047619
[2024-02-28 21:37:52,220 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 383 transitions.
[2024-02-28 21:37:52,220 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 383 transitions.
[2024-02-28 21:37:52,220 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 21:37:52,220 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 383 transitions.
[2024-02-28 21:37:52,221 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:37:52,222 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:37:52,222 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:37:52,222 INFO  L175             Difference]: Start difference. First operand has 147 places, 152 transitions, 410 flow. Second operand 3 states and 383 transitions.
[2024-02-28 21:37:52,222 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 165 transitions, 532 flow
[2024-02-28 21:37:52,224 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 165 transitions, 524 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-02-28 21:37:52,225 INFO  L231             Difference]: Finished difference. Result has 149 places, 159 transitions, 490 flow
[2024-02-28 21:37:52,226 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=402, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=490, PETRI_PLACES=149, PETRI_TRANSITIONS=159}
[2024-02-28 21:37:52,226 INFO  L281   CegarLoopForPetriNet]: 139 programPoint places, 10 predicate places.
[2024-02-28 21:37:52,226 INFO  L495      AbstractCegarLoop]: Abstraction has has 149 places, 159 transitions, 490 flow
[2024-02-28 21:37:52,227 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:37:52,227 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 21:37:52,227 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 21:37:52,227 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-02-28 21:37:52,227 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 9 more)] ===
[2024-02-28 21:37:52,227 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 21:37:52,227 INFO  L85        PathProgramCache]: Analyzing trace with hash 1862128787, now seen corresponding path program 1 times
[2024-02-28 21:37:52,227 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 21:37:52,228 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089369586]
[2024-02-28 21:37:52,228 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 21:37:52,228 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 21:37:52,241 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 21:37:52,262 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-02-28 21:37:52,262 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 21:37:52,262 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089369586]
[2024-02-28 21:37:52,262 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089369586] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 21:37:52,262 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 21:37:52,262 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-02-28 21:37:52,263 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972309173]
[2024-02-28 21:37:52,263 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 21:37:52,263 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-02-28 21:37:52,263 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 21:37:52,264 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-02-28 21:37:52,264 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-02-28 21:37:52,270 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 122 out of 140
[2024-02-28 21:37:52,270 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 159 transitions, 490 flow. Second operand  has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:37:52,270 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 21:37:52,271 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 140
[2024-02-28 21:37:52,271 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 21:37:52,356 INFO  L124   PetriNetUnfolderBase]: 112/788 cut-off events.
[2024-02-28 21:37:52,357 INFO  L125   PetriNetUnfolderBase]: For 272/279 co-relation queries the response was YES.
[2024-02-28 21:37:52,357 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1386 conditions, 788 events. 112/788 cut-off events. For 272/279 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 5034 event pairs, 47 based on Foata normal form. 0/744 useless extension candidates. Maximal degree in co-relation 1275. Up to 129 conditions per place. 
[2024-02-28 21:37:52,359 INFO  L140   encePairwiseOnDemand]: 136/140 looper letters, 15 selfloop transitions, 3 changer transitions 6/165 dead transitions.
[2024-02-28 21:37:52,359 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 165 transitions, 548 flow
[2024-02-28 21:37:52,359 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-02-28 21:37:52,359 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-02-28 21:37:52,360 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 388 transitions.
[2024-02-28 21:37:52,360 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9238095238095239
[2024-02-28 21:37:52,360 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 388 transitions.
[2024-02-28 21:37:52,360 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 388 transitions.
[2024-02-28 21:37:52,361 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 21:37:52,361 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 388 transitions.
[2024-02-28 21:37:52,361 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:37:52,362 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:37:52,362 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:37:52,362 INFO  L175             Difference]: Start difference. First operand has 149 places, 159 transitions, 490 flow. Second operand 3 states and 388 transitions.
[2024-02-28 21:37:52,363 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 165 transitions, 548 flow
[2024-02-28 21:37:52,364 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 165 transitions, 526 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-02-28 21:37:52,366 INFO  L231             Difference]: Finished difference. Result has 151 places, 158 transitions, 482 flow
[2024-02-28 21:37:52,366 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=468, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=482, PETRI_PLACES=151, PETRI_TRANSITIONS=158}
[2024-02-28 21:37:52,366 INFO  L281   CegarLoopForPetriNet]: 139 programPoint places, 12 predicate places.
[2024-02-28 21:37:52,366 INFO  L495      AbstractCegarLoop]: Abstraction has has 151 places, 158 transitions, 482 flow
[2024-02-28 21:37:52,367 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:37:52,367 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 21:37:52,367 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 21:37:52,367 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-02-28 21:37:52,367 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 9 more)] ===
[2024-02-28 21:37:52,368 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 21:37:52,368 INFO  L85        PathProgramCache]: Analyzing trace with hash 1925861791, now seen corresponding path program 1 times
[2024-02-28 21:37:52,368 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 21:37:52,368 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209954025]
[2024-02-28 21:37:52,368 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 21:37:52,368 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 21:37:52,388 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-28 21:37:52,388 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-02-28 21:37:52,398 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-28 21:37:52,420 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-02-28 21:37:52,420 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-02-28 21:37:52,421 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 12 remaining)
[2024-02-28 21:37:52,422 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (10 of 12 remaining)
[2024-02-28 21:37:52,422 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (9 of 12 remaining)
[2024-02-28 21:37:52,422 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (8 of 12 remaining)
[2024-02-28 21:37:52,423 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (7 of 12 remaining)
[2024-02-28 21:37:52,423 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 12 remaining)
[2024-02-28 21:37:52,423 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 12 remaining)
[2024-02-28 21:37:52,423 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 12 remaining)
[2024-02-28 21:37:52,423 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (3 of 12 remaining)
[2024-02-28 21:37:52,423 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 12 remaining)
[2024-02-28 21:37:52,423 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 12 remaining)
[2024-02-28 21:37:52,424 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (0 of 12 remaining)
[2024-02-28 21:37:52,424 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-02-28 21:37:52,424 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 21:37:52,426 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-02-28 21:37:52,426 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2024-02-28 21:37:52,444 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-02-28 21:37:52,446 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 173 places, 172 transitions, 354 flow
[2024-02-28 21:37:52,466 INFO  L124   PetriNetUnfolderBase]: 10/278 cut-off events.
[2024-02-28 21:37:52,467 INFO  L125   PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES.
[2024-02-28 21:37:52,467 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 286 conditions, 278 events. 10/278 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 434 event pairs, 0 based on Foata normal form. 0/245 useless extension candidates. Maximal degree in co-relation 185. Up to 6 conditions per place. 
[2024-02-28 21:37:52,467 INFO  L82        GeneralOperation]: Start removeDead. Operand has 173 places, 172 transitions, 354 flow
[2024-02-28 21:37:52,469 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 173 places, 172 transitions, 354 flow
[2024-02-28 21:37:52,469 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-02-28 21:37:52,470 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=LoopHeads, 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;@2d6a85da, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-02-28 21:37:52,470 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 15 error locations.
[2024-02-28 21:37:52,475 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-02-28 21:37:52,476 INFO  L124   PetriNetUnfolderBase]: 2/54 cut-off events.
[2024-02-28 21:37:52,476 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-02-28 21:37:52,476 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 21:37:52,476 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 21:37:52,476 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-02-28 21:37:52,476 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 21:37:52,476 INFO  L85        PathProgramCache]: Analyzing trace with hash 1310321919, now seen corresponding path program 1 times
[2024-02-28 21:37:52,476 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 21:37:52,477 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907630504]
[2024-02-28 21:37:52,477 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 21:37:52,477 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 21:37:52,483 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 21:37:52,496 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 21:37:52,496 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 21:37:52,496 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907630504]
[2024-02-28 21:37:52,497 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907630504] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 21:37:52,497 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 21:37:52,497 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-02-28 21:37:52,497 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739105502]
[2024-02-28 21:37:52,497 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 21:37:52,497 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-02-28 21:37:52,497 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 21:37:52,498 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-02-28 21:37:52,498 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-02-28 21:37:52,522 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 138 out of 172
[2024-02-28 21:37:52,522 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 172 transitions, 354 flow. Second operand  has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:37:52,522 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 21:37:52,522 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 172
[2024-02-28 21:37:52,522 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 21:37:53,283 INFO  L124   PetriNetUnfolderBase]: 2216/7143 cut-off events.
[2024-02-28 21:37:53,283 INFO  L125   PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES.
[2024-02-28 21:37:53,292 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10847 conditions, 7143 events. 2216/7143 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 312. Compared 71192 event pairs, 879 based on Foata normal form. 75/6412 useless extension candidates. Maximal degree in co-relation 9274. Up to 2089 conditions per place. 
[2024-02-28 21:37:53,312 INFO  L140   encePairwiseOnDemand]: 154/172 looper letters, 46 selfloop transitions, 11 changer transitions 1/195 dead transitions.
[2024-02-28 21:37:53,313 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 195 transitions, 519 flow
[2024-02-28 21:37:53,313 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-02-28 21:37:53,313 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-02-28 21:37:53,314 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 480 transitions.
[2024-02-28 21:37:53,314 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9302325581395349
[2024-02-28 21:37:53,314 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 480 transitions.
[2024-02-28 21:37:53,314 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 480 transitions.
[2024-02-28 21:37:53,315 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 21:37:53,315 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 480 transitions.
[2024-02-28 21:37:53,316 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 160.0) internal successors, (480), 3 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:37:53,317 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)
[2024-02-28 21:37:53,317 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)
[2024-02-28 21:37:53,317 INFO  L175             Difference]: Start difference. First operand has 173 places, 172 transitions, 354 flow. Second operand 3 states and 480 transitions.
[2024-02-28 21:37:53,317 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 195 transitions, 519 flow
[2024-02-28 21:37:53,318 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 195 transitions, 519 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-02-28 21:37:53,320 INFO  L231             Difference]: Finished difference. Result has 177 places, 179 transitions, 442 flow
[2024-02-28 21:37:53,320 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=442, PETRI_PLACES=177, PETRI_TRANSITIONS=179}
[2024-02-28 21:37:53,320 INFO  L281   CegarLoopForPetriNet]: 173 programPoint places, 4 predicate places.
[2024-02-28 21:37:53,320 INFO  L495      AbstractCegarLoop]: Abstraction has has 177 places, 179 transitions, 442 flow
[2024-02-28 21:37:53,321 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:37:53,321 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 21:37:53,321 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 21:37:53,321 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-02-28 21:37:53,321 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-02-28 21:37:53,321 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 21:37:53,321 INFO  L85        PathProgramCache]: Analyzing trace with hash 566883492, now seen corresponding path program 1 times
[2024-02-28 21:37:53,322 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 21:37:53,322 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893455674]
[2024-02-28 21:37:53,322 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 21:37:53,322 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 21:37:53,329 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 21:37:53,343 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 21:37:53,343 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 21:37:53,343 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893455674]
[2024-02-28 21:37:53,343 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893455674] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 21:37:53,343 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 21:37:53,343 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-02-28 21:37:53,343 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947071380]
[2024-02-28 21:37:53,343 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 21:37:53,344 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-02-28 21:37:53,344 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 21:37:53,344 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-02-28 21:37:53,344 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-02-28 21:37:53,376 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 140 out of 172
[2024-02-28 21:37:53,377 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 179 transitions, 442 flow. Second operand  has 3 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:37:53,377 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 21:37:53,377 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 172
[2024-02-28 21:37:53,377 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 21:37:54,297 INFO  L124   PetriNetUnfolderBase]: 2480/9000 cut-off events.
[2024-02-28 21:37:54,298 INFO  L125   PetriNetUnfolderBase]: For 2872/3042 co-relation queries the response was YES.
[2024-02-28 21:37:54,310 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15766 conditions, 9000 events. 2480/9000 cut-off events. For 2872/3042 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 96246 event pairs, 1597 based on Foata normal form. 62/8224 useless extension candidates. Maximal degree in co-relation 13630. Up to 3442 conditions per place. 
[2024-02-28 21:37:54,338 INFO  L140   encePairwiseOnDemand]: 164/172 looper letters, 42 selfloop transitions, 12 changer transitions 0/197 dead transitions.
[2024-02-28 21:37:54,339 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 197 transitions, 610 flow
[2024-02-28 21:37:54,340 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-02-28 21:37:54,340 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-02-28 21:37:54,340 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 464 transitions.
[2024-02-28 21:37:54,341 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8992248062015504
[2024-02-28 21:37:54,341 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 464 transitions.
[2024-02-28 21:37:54,341 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 464 transitions.
[2024-02-28 21:37:54,341 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 21:37:54,341 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 464 transitions.
[2024-02-28 21:37:54,342 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:37:54,343 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)
[2024-02-28 21:37:54,343 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)
[2024-02-28 21:37:54,343 INFO  L175             Difference]: Start difference. First operand has 177 places, 179 transitions, 442 flow. Second operand 3 states and 464 transitions.
[2024-02-28 21:37:54,343 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 197 transitions, 610 flow
[2024-02-28 21:37:54,349 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 197 transitions, 580 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-02-28 21:37:54,351 INFO  L231             Difference]: Finished difference. Result has 178 places, 189 transitions, 526 flow
[2024-02-28 21:37:54,351 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=526, PETRI_PLACES=178, PETRI_TRANSITIONS=189}
[2024-02-28 21:37:54,351 INFO  L281   CegarLoopForPetriNet]: 173 programPoint places, 5 predicate places.
[2024-02-28 21:37:54,351 INFO  L495      AbstractCegarLoop]: Abstraction has has 178 places, 189 transitions, 526 flow
[2024-02-28 21:37:54,352 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:37:54,352 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 21:37:54,352 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 21:37:54,352 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-02-28 21:37:54,352 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-02-28 21:37:54,352 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 21:37:54,352 INFO  L85        PathProgramCache]: Analyzing trace with hash 554229852, now seen corresponding path program 1 times
[2024-02-28 21:37:54,353 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 21:37:54,353 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064214505]
[2024-02-28 21:37:54,353 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 21:37:54,353 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 21:37:54,359 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 21:37:54,389 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 21:37:54,389 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 21:37:54,389 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064214505]
[2024-02-28 21:37:54,389 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064214505] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 21:37:54,389 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 21:37:54,389 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-02-28 21:37:54,389 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014843047]
[2024-02-28 21:37:54,389 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 21:37:54,390 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-02-28 21:37:54,390 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 21:37:54,390 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-02-28 21:37:54,390 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-02-28 21:37:54,400 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 148 out of 172
[2024-02-28 21:37:54,400 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 189 transitions, 526 flow. Second operand  has 3 states, 3 states have (on average 149.33333333333334) internal successors, (448), 3 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:37:54,400 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 21:37:54,400 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 172
[2024-02-28 21:37:54,401 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 21:37:55,163 INFO  L124   PetriNetUnfolderBase]: 1987/8137 cut-off events.
[2024-02-28 21:37:55,163 INFO  L125   PetriNetUnfolderBase]: For 1273/1724 co-relation queries the response was YES.
[2024-02-28 21:37:55,178 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13288 conditions, 8137 events. 1987/8137 cut-off events. For 1273/1724 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 88572 event pairs, 1348 based on Foata normal form. 34/7321 useless extension candidates. Maximal degree in co-relation 11492. Up to 2231 conditions per place. 
[2024-02-28 21:37:55,198 INFO  L140   encePairwiseOnDemand]: 169/172 looper letters, 21 selfloop transitions, 2 changer transitions 3/194 dead transitions.
[2024-02-28 21:37:55,198 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 194 transitions, 588 flow
[2024-02-28 21:37:55,199 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-02-28 21:37:55,199 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-02-28 21:37:55,200 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 471 transitions.
[2024-02-28 21:37:55,200 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9127906976744186
[2024-02-28 21:37:55,201 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 471 transitions.
[2024-02-28 21:37:55,201 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 471 transitions.
[2024-02-28 21:37:55,201 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 21:37:55,201 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 471 transitions.
[2024-02-28 21:37:55,202 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 157.0) internal successors, (471), 3 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:37:55,203 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)
[2024-02-28 21:37:55,203 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)
[2024-02-28 21:37:55,203 INFO  L175             Difference]: Start difference. First operand has 178 places, 189 transitions, 526 flow. Second operand 3 states and 471 transitions.
[2024-02-28 21:37:55,203 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 194 transitions, 588 flow
[2024-02-28 21:37:55,208 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 194 transitions, 564 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-02-28 21:37:55,210 INFO  L231             Difference]: Finished difference. Result has 179 places, 190 transitions, 514 flow
[2024-02-28 21:37:55,210 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=514, PETRI_PLACES=179, PETRI_TRANSITIONS=190}
[2024-02-28 21:37:55,210 INFO  L281   CegarLoopForPetriNet]: 173 programPoint places, 6 predicate places.
[2024-02-28 21:37:55,211 INFO  L495      AbstractCegarLoop]: Abstraction has has 179 places, 190 transitions, 514 flow
[2024-02-28 21:37:55,211 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 149.33333333333334) internal successors, (448), 3 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:37:55,211 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 21:37:55,211 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 21:37:55,211 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-02-28 21:37:55,211 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-02-28 21:37:55,211 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 21:37:55,212 INFO  L85        PathProgramCache]: Analyzing trace with hash -542315604, now seen corresponding path program 1 times
[2024-02-28 21:37:55,212 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 21:37:55,212 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323329331]
[2024-02-28 21:37:55,212 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 21:37:55,212 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 21:37:55,224 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 21:37:55,449 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 21:37:55,449 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 21:37:55,449 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323329331]
[2024-02-28 21:37:55,449 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323329331] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 21:37:55,449 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 21:37:55,449 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 21:37:55,449 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075563952]
[2024-02-28 21:37:55,449 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 21:37:55,450 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 21:37:55,450 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 21:37:55,450 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 21:37:55,450 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 21:37:55,491 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 142 out of 172
[2024-02-28 21:37:55,492 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 190 transitions, 514 flow. Second operand  has 6 states, 6 states have (on average 143.66666666666666) internal successors, (862), 6 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:37:55,492 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 21:37:55,492 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 172
[2024-02-28 21:37:55,492 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 21:37:56,399 INFO  L124   PetriNetUnfolderBase]: 1805/8276 cut-off events.
[2024-02-28 21:37:56,399 INFO  L125   PetriNetUnfolderBase]: For 774/1670 co-relation queries the response was YES.
[2024-02-28 21:37:56,412 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12914 conditions, 8276 events. 1805/8276 cut-off events. For 774/1670 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 90018 event pairs, 1003 based on Foata normal form. 6/7468 useless extension candidates. Maximal degree in co-relation 12830. Up to 1560 conditions per place. 
[2024-02-28 21:37:56,428 INFO  L140   encePairwiseOnDemand]: 166/172 looper letters, 53 selfloop transitions, 5 changer transitions 0/221 dead transitions.
[2024-02-28 21:37:56,428 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 221 transitions, 692 flow
[2024-02-28 21:37:56,429 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 21:37:56,429 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 21:37:56,431 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 911 transitions.
[2024-02-28 21:37:56,431 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8827519379844961
[2024-02-28 21:37:56,431 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 911 transitions.
[2024-02-28 21:37:56,431 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 911 transitions.
[2024-02-28 21:37:56,432 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 21:37:56,432 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 911 transitions.
[2024-02-28 21:37:56,434 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 151.83333333333334) internal successors, (911), 6 states have internal predecessors, (911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:37:56,435 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 172.0) internal successors, (1204), 7 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:37:56,435 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 172.0) internal successors, (1204), 7 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:37:56,436 INFO  L175             Difference]: Start difference. First operand has 179 places, 190 transitions, 514 flow. Second operand 6 states and 911 transitions.
[2024-02-28 21:37:56,436 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 221 transitions, 692 flow
[2024-02-28 21:37:56,437 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 221 transitions, 690 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-02-28 21:37:56,441 INFO  L231             Difference]: Finished difference. Result has 182 places, 189 transitions, 520 flow
[2024-02-28 21:37:56,442 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=520, PETRI_PLACES=182, PETRI_TRANSITIONS=189}
[2024-02-28 21:37:56,443 INFO  L281   CegarLoopForPetriNet]: 173 programPoint places, 9 predicate places.
[2024-02-28 21:37:56,443 INFO  L495      AbstractCegarLoop]: Abstraction has has 182 places, 189 transitions, 520 flow
[2024-02-28 21:37:56,443 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 143.66666666666666) internal successors, (862), 6 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:37:56,444 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 21:37:56,444 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 21:37:56,444 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-02-28 21:37:56,444 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-02-28 21:37:56,444 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 21:37:56,444 INFO  L85        PathProgramCache]: Analyzing trace with hash -1027856386, now seen corresponding path program 1 times
[2024-02-28 21:37:56,445 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 21:37:56,445 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364357757]
[2024-02-28 21:37:56,445 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 21:37:56,445 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 21:37:56,454 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 21:37:56,470 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 21:37:56,470 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 21:37:56,470 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364357757]
[2024-02-28 21:37:56,470 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364357757] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 21:37:56,470 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 21:37:56,471 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-02-28 21:37:56,471 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4506103]
[2024-02-28 21:37:56,471 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 21:37:56,472 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-02-28 21:37:56,473 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 21:37:56,474 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-02-28 21:37:56,475 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-02-28 21:37:56,490 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 146 out of 172
[2024-02-28 21:37:56,490 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 189 transitions, 520 flow. Second operand  has 3 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:37:56,490 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 21:37:56,490 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 172
[2024-02-28 21:37:56,490 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 21:37:57,305 INFO  L124   PetriNetUnfolderBase]: 2252/9161 cut-off events.
[2024-02-28 21:37:57,306 INFO  L125   PetriNetUnfolderBase]: For 871/1783 co-relation queries the response was YES.
[2024-02-28 21:37:57,323 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14700 conditions, 9161 events. 2252/9161 cut-off events. For 871/1783 co-relation queries the response was YES. Maximal size of possible extension queue 391. Compared 104569 event pairs, 1333 based on Foata normal form. 10/8116 useless extension candidates. Maximal degree in co-relation 13109. Up to 2161 conditions per place. 
[2024-02-28 21:37:57,343 INFO  L140   encePairwiseOnDemand]: 166/172 looper letters, 33 selfloop transitions, 5 changer transitions 0/204 dead transitions.
[2024-02-28 21:37:57,343 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 204 transitions, 631 flow
[2024-02-28 21:37:57,344 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-02-28 21:37:57,344 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-02-28 21:37:57,345 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 477 transitions.
[2024-02-28 21:37:57,345 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9244186046511628
[2024-02-28 21:37:57,345 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 477 transitions.
[2024-02-28 21:37:57,345 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 477 transitions.
[2024-02-28 21:37:57,346 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 21:37:57,346 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 477 transitions.
[2024-02-28 21:37:57,347 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:37:57,348 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)
[2024-02-28 21:37:57,348 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)
[2024-02-28 21:37:57,348 INFO  L175             Difference]: Start difference. First operand has 182 places, 189 transitions, 520 flow. Second operand 3 states and 477 transitions.
[2024-02-28 21:37:57,348 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 204 transitions, 631 flow
[2024-02-28 21:37:57,350 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 204 transitions, 621 flow, removed 0 selfloop flow, removed 5 redundant places.
[2024-02-28 21:37:57,352 INFO  L231             Difference]: Finished difference. Result has 181 places, 193 transitions, 548 flow
[2024-02-28 21:37:57,352 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=548, PETRI_PLACES=181, PETRI_TRANSITIONS=193}
[2024-02-28 21:37:57,353 INFO  L281   CegarLoopForPetriNet]: 173 programPoint places, 8 predicate places.
[2024-02-28 21:37:57,353 INFO  L495      AbstractCegarLoop]: Abstraction has has 181 places, 193 transitions, 548 flow
[2024-02-28 21:37:57,353 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:37:57,353 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 21:37:57,354 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 21:37:57,354 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-02-28 21:37:57,354 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-02-28 21:37:57,354 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 21:37:57,354 INFO  L85        PathProgramCache]: Analyzing trace with hash -985860973, now seen corresponding path program 1 times
[2024-02-28 21:37:57,354 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 21:37:57,355 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803125308]
[2024-02-28 21:37:57,355 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 21:37:57,355 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 21:37:57,365 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 21:37:57,380 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 21:37:57,380 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 21:37:57,380 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803125308]
[2024-02-28 21:37:57,381 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803125308] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 21:37:57,381 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 21:37:57,381 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-02-28 21:37:57,382 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665256870]
[2024-02-28 21:37:57,382 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 21:37:57,383 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-02-28 21:37:57,383 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 21:37:57,384 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-02-28 21:37:57,384 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-02-28 21:37:57,416 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 142 out of 172
[2024-02-28 21:37:57,417 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 193 transitions, 548 flow. Second operand  has 3 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:37:57,417 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 21:37:57,417 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 172
[2024-02-28 21:37:57,418 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 21:37:58,407 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([424] L705-4-->L705-1: Formula: (= 0 |v_#race~threads_alive~0_7|)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|}  AuxVars[]  AssignedVars[#race~threads_alive~0][179], [Black: 190#(<= (+ ~threads_alive~0 1) 0), 72#L705-1true, 17#L688-7true, 200#true, Black: 176#true, 141#L688-2true, 206#true, Black: 184#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet12#1|), threadThread1of2ForFork0InUse, Black: 202#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), threadThread2of2ForFork0InUse])
[2024-02-28 21:37:58,407 INFO  L294   olderBase$Statistics]: this new event has 166 ancestors and is cut-off event
[2024-02-28 21:37:58,407 INFO  L297   olderBase$Statistics]:   existing Event has 159 ancestors and is cut-off event
[2024-02-28 21:37:58,408 INFO  L297   olderBase$Statistics]:   existing Event has 159 ancestors and is cut-off event
[2024-02-28 21:37:58,408 INFO  L297   olderBase$Statistics]:   existing Event has 166 ancestors and is cut-off event
[2024-02-28 21:37:58,518 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([424] L705-4-->L705-1: Formula: (= 0 |v_#race~threads_alive~0_7|)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|}  AuxVars[]  AssignedVars[#race~threads_alive~0][66], [Black: 190#(<= (+ ~threads_alive~0 1) 0), 72#L705-1true, 200#true, Black: 176#true, 141#L688-2true, 206#true, Black: 184#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet12#1|), threadThread1of2ForFork0InUse, Black: 202#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), threadThread2of2ForFork0InUse, 94#L690true])
[2024-02-28 21:37:58,518 INFO  L294   olderBase$Statistics]: this new event has 168 ancestors and is cut-off event
[2024-02-28 21:37:58,518 INFO  L297   olderBase$Statistics]:   existing Event has 168 ancestors and is cut-off event
[2024-02-28 21:37:58,518 INFO  L297   olderBase$Statistics]:   existing Event has 161 ancestors and is cut-off event
[2024-02-28 21:37:58,518 INFO  L297   olderBase$Statistics]:   existing Event has 161 ancestors and is cut-off event
[2024-02-28 21:37:58,552 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([424] L705-4-->L705-1: Formula: (= 0 |v_#race~threads_alive~0_7|)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|}  AuxVars[]  AssignedVars[#race~threads_alive~0][66], [Black: 190#(<= (+ ~threads_alive~0 1) 0), 111#L690-3true, 72#L705-1true, Black: 176#true, 200#true, 141#L688-2true, 206#true, Black: 184#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet12#1|), threadThread1of2ForFork0InUse, Black: 202#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), threadThread2of2ForFork0InUse])
[2024-02-28 21:37:58,552 INFO  L294   olderBase$Statistics]: this new event has 169 ancestors and is cut-off event
[2024-02-28 21:37:58,552 INFO  L297   olderBase$Statistics]:   existing Event has 169 ancestors and is cut-off event
[2024-02-28 21:37:58,552 INFO  L297   olderBase$Statistics]:   existing Event has 162 ancestors and is cut-off event
[2024-02-28 21:37:58,552 INFO  L297   olderBase$Statistics]:   existing Event has 162 ancestors and is cut-off event
[2024-02-28 21:37:58,694 INFO  L124   PetriNetUnfolderBase]: 3855/12798 cut-off events.
[2024-02-28 21:37:58,694 INFO  L125   PetriNetUnfolderBase]: For 4811/5111 co-relation queries the response was YES.
[2024-02-28 21:37:58,724 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23902 conditions, 12798 events. 3855/12798 cut-off events. For 4811/5111 co-relation queries the response was YES. Maximal size of possible extension queue 451. Compared 143542 event pairs, 1990 based on Foata normal form. 65/11504 useless extension candidates. Maximal degree in co-relation 20126. Up to 4823 conditions per place. 
[2024-02-28 21:37:58,760 INFO  L140   encePairwiseOnDemand]: 163/172 looper letters, 49 selfloop transitions, 19 changer transitions 0/219 dead transitions.
[2024-02-28 21:37:58,760 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 219 transitions, 785 flow
[2024-02-28 21:37:58,761 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-02-28 21:37:58,761 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-02-28 21:37:58,762 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 472 transitions.
[2024-02-28 21:37:58,763 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9147286821705426
[2024-02-28 21:37:58,763 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 472 transitions.
[2024-02-28 21:37:58,763 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 472 transitions.
[2024-02-28 21:37:58,763 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 21:37:58,763 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 472 transitions.
[2024-02-28 21:37:58,764 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 157.33333333333334) internal successors, (472), 3 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:37:58,765 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)
[2024-02-28 21:37:58,766 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)
[2024-02-28 21:37:58,766 INFO  L175             Difference]: Start difference. First operand has 181 places, 193 transitions, 548 flow. Second operand 3 states and 472 transitions.
[2024-02-28 21:37:58,766 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 219 transitions, 785 flow
[2024-02-28 21:37:58,770 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 219 transitions, 775 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-02-28 21:37:58,772 INFO  L231             Difference]: Finished difference. Result has 183 places, 208 transitions, 720 flow
[2024-02-28 21:37:58,773 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=720, PETRI_PLACES=183, PETRI_TRANSITIONS=208}
[2024-02-28 21:37:58,773 INFO  L281   CegarLoopForPetriNet]: 173 programPoint places, 10 predicate places.
[2024-02-28 21:37:58,773 INFO  L495      AbstractCegarLoop]: Abstraction has has 183 places, 208 transitions, 720 flow
[2024-02-28 21:37:58,774 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:37:58,774 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 21:37:58,774 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 21:37:58,774 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-02-28 21:37:58,774 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-02-28 21:37:58,775 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 21:37:58,775 INFO  L85        PathProgramCache]: Analyzing trace with hash 1464403890, now seen corresponding path program 1 times
[2024-02-28 21:37:58,775 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 21:37:58,775 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924768212]
[2024-02-28 21:37:58,775 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 21:37:58,775 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 21:37:58,788 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 21:37:58,808 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-02-28 21:37:58,808 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 21:37:58,809 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924768212]
[2024-02-28 21:37:58,809 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924768212] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 21:37:58,809 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 21:37:58,809 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-02-28 21:37:58,809 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124966959]
[2024-02-28 21:37:58,809 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 21:37:58,810 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-02-28 21:37:58,810 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 21:37:58,810 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-02-28 21:37:58,810 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-02-28 21:37:58,822 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 148 out of 172
[2024-02-28 21:37:58,823 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 208 transitions, 720 flow. Second operand  has 3 states, 3 states have (on average 150.33333333333334) internal successors, (451), 3 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:37:58,823 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 21:37:58,823 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 172
[2024-02-28 21:37:58,823 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 21:37:59,634 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([424] L705-4-->L705-1: Formula: (= 0 |v_#race~threads_alive~0_7|)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|}  AuxVars[]  AssignedVars[#race~threads_alive~0][180], [Black: 190#(<= (+ ~threads_alive~0 1) 0), 72#L705-1true, 17#L688-7true, Black: 208#(= |threadThread1of2ForFork0_#t~nondet6| |#race~threads_alive~0|), Black: 176#true, 141#L688-2true, 206#true, Black: 184#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet12#1|), threadThread1of2ForFork0InUse, Black: 202#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), threadThread2of2ForFork0InUse, 212#true])
[2024-02-28 21:37:59,635 INFO  L294   olderBase$Statistics]: this new event has 166 ancestors and is cut-off event
[2024-02-28 21:37:59,635 INFO  L297   olderBase$Statistics]:   existing Event has 159 ancestors and is cut-off event
[2024-02-28 21:37:59,635 INFO  L297   olderBase$Statistics]:   existing Event has 166 ancestors and is cut-off event
[2024-02-28 21:37:59,635 INFO  L297   olderBase$Statistics]:   existing Event has 159 ancestors and is cut-off event
[2024-02-28 21:37:59,636 INFO  L292   olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([424] L705-4-->L705-1: Formula: (= 0 |v_#race~threads_alive~0_7|)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|}  AuxVars[]  AssignedVars[#race~threads_alive~0][180], [Black: 190#(<= (+ ~threads_alive~0 1) 0), 17#L688-7true, 72#L705-1true, Black: 208#(= |threadThread1of2ForFork0_#t~nondet6| |#race~threads_alive~0|), Black: 176#true, 141#L688-2true, 206#true, Black: 184#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet12#1|), threadThread1of2ForFork0InUse, Black: 202#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), threadThread2of2ForFork0InUse, 212#true])
[2024-02-28 21:37:59,636 INFO  L294   olderBase$Statistics]: this new event has 166 ancestors and is cut-off event
[2024-02-28 21:37:59,636 INFO  L297   olderBase$Statistics]:   existing Event has 159 ancestors and is cut-off event
[2024-02-28 21:37:59,636 INFO  L297   olderBase$Statistics]:   existing Event has 166 ancestors and is cut-off event
[2024-02-28 21:37:59,636 INFO  L297   olderBase$Statistics]:   existing Event has 166 ancestors and is cut-off event
[2024-02-28 21:37:59,636 INFO  L297   olderBase$Statistics]:   existing Event has 159 ancestors and is cut-off event
[2024-02-28 21:37:59,669 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([561] L688-->L688-1: Formula: (= |v_#race~threads_alive~0_10| 0)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_10|}  AuxVars[]  AssignedVars[#race~threads_alive~0][212], [Black: 190#(<= (+ ~threads_alive~0 1) 0), 17#L688-7true, Black: 208#(= |threadThread1of2ForFork0_#t~nondet6| |#race~threads_alive~0|), Black: 176#true, 67#L688-1true, 206#true, Black: 184#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet12#1|), threadThread1of2ForFork0InUse, 152#L705-2true, Black: 202#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), threadThread2of2ForFork0InUse, 212#true])
[2024-02-28 21:37:59,669 INFO  L294   olderBase$Statistics]: this new event has 166 ancestors and is cut-off event
[2024-02-28 21:37:59,670 INFO  L297   olderBase$Statistics]:   existing Event has 166 ancestors and is cut-off event
[2024-02-28 21:37:59,670 INFO  L297   olderBase$Statistics]:   existing Event has 159 ancestors and is cut-off event
[2024-02-28 21:37:59,670 INFO  L297   olderBase$Statistics]:   existing Event has 159 ancestors and is cut-off event
[2024-02-28 21:37:59,686 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([424] L705-4-->L705-1: Formula: (= 0 |v_#race~threads_alive~0_7|)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|}  AuxVars[]  AssignedVars[#race~threads_alive~0][180], [Black: 190#(<= (+ ~threads_alive~0 1) 0), 72#L705-1true, 17#L688-7true, Black: 208#(= |threadThread1of2ForFork0_#t~nondet6| |#race~threads_alive~0|), Black: 176#true, 67#L688-1true, 206#true, Black: 184#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet12#1|), threadThread1of2ForFork0InUse, Black: 202#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), threadThread2of2ForFork0InUse, 212#true])
[2024-02-28 21:37:59,686 INFO  L294   olderBase$Statistics]: this new event has 165 ancestors and is cut-off event
[2024-02-28 21:37:59,686 INFO  L297   olderBase$Statistics]:   existing Event has 165 ancestors and is cut-off event
[2024-02-28 21:37:59,686 INFO  L297   olderBase$Statistics]:   existing Event has 158 ancestors and is cut-off event
[2024-02-28 21:37:59,686 INFO  L297   olderBase$Statistics]:   existing Event has 165 ancestors and is cut-off event
[2024-02-28 21:37:59,734 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([424] L705-4-->L705-1: Formula: (= 0 |v_#race~threads_alive~0_7|)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|}  AuxVars[]  AssignedVars[#race~threads_alive~0][66], [Black: 190#(<= (+ ~threads_alive~0 1) 0), 72#L705-1true, Black: 208#(= |threadThread1of2ForFork0_#t~nondet6| |#race~threads_alive~0|), Black: 176#true, 141#L688-2true, 206#true, Black: 184#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet12#1|), threadThread1of2ForFork0InUse, Black: 202#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), threadThread2of2ForFork0InUse, 212#true, 94#L690true])
[2024-02-28 21:37:59,735 INFO  L294   olderBase$Statistics]: this new event has 168 ancestors and is cut-off event
[2024-02-28 21:37:59,735 INFO  L297   olderBase$Statistics]:   existing Event has 161 ancestors and is cut-off event
[2024-02-28 21:37:59,735 INFO  L297   olderBase$Statistics]:   existing Event has 161 ancestors and is cut-off event
[2024-02-28 21:37:59,735 INFO  L297   olderBase$Statistics]:   existing Event has 168 ancestors and is cut-off event
[2024-02-28 21:37:59,749 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([424] L705-4-->L705-1: Formula: (= 0 |v_#race~threads_alive~0_7|)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|}  AuxVars[]  AssignedVars[#race~threads_alive~0][66], [Black: 190#(<= (+ ~threads_alive~0 1) 0), 72#L705-1true, Black: 208#(= |threadThread1of2ForFork0_#t~nondet6| |#race~threads_alive~0|), Black: 176#true, 141#L688-2true, 35#threadErr2ASSERT_VIOLATIONDATA_RACEtrue, 206#true, Black: 184#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet12#1|), threadThread1of2ForFork0InUse, Black: 202#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), threadThread2of2ForFork0InUse, 212#true])
[2024-02-28 21:37:59,750 INFO  L294   olderBase$Statistics]: this new event has 166 ancestors and is cut-off event
[2024-02-28 21:37:59,750 INFO  L297   olderBase$Statistics]:   existing Event has 166 ancestors and is cut-off event
[2024-02-28 21:37:59,750 INFO  L297   olderBase$Statistics]:   existing Event has 166 ancestors and is cut-off event
[2024-02-28 21:37:59,750 INFO  L297   olderBase$Statistics]:   existing Event has 159 ancestors and is cut-off event
[2024-02-28 21:37:59,761 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([561] L688-->L688-1: Formula: (= |v_#race~threads_alive~0_10| 0)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_10|}  AuxVars[]  AssignedVars[#race~threads_alive~0][197], [Black: 190#(<= (+ ~threads_alive~0 1) 0), Black: 208#(= |threadThread1of2ForFork0_#t~nondet6| |#race~threads_alive~0|), Black: 176#true, 67#L688-1true, 206#true, Black: 184#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet12#1|), threadThread1of2ForFork0InUse, 152#L705-2true, Black: 202#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), threadThread2of2ForFork0InUse, 212#true, 94#L690true])
[2024-02-28 21:37:59,761 INFO  L294   olderBase$Statistics]: this new event has 168 ancestors and is cut-off event
[2024-02-28 21:37:59,761 INFO  L297   olderBase$Statistics]:   existing Event has 161 ancestors and is cut-off event
[2024-02-28 21:37:59,761 INFO  L297   olderBase$Statistics]:   existing Event has 168 ancestors and is cut-off event
[2024-02-28 21:37:59,761 INFO  L297   olderBase$Statistics]:   existing Event has 161 ancestors and is cut-off event
[2024-02-28 21:37:59,873 INFO  L124   PetriNetUnfolderBase]: 2978/12011 cut-off events.
[2024-02-28 21:37:59,873 INFO  L125   PetriNetUnfolderBase]: For 5543/8836 co-relation queries the response was YES.
[2024-02-28 21:37:59,906 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 22344 conditions, 12011 events. 2978/12011 cut-off events. For 5543/8836 co-relation queries the response was YES. Maximal size of possible extension queue 524. Compared 141985 event pairs, 1401 based on Foata normal form. 24/10683 useless extension candidates. Maximal degree in co-relation 19299. Up to 2356 conditions per place. 
[2024-02-28 21:37:59,940 INFO  L140   encePairwiseOnDemand]: 167/172 looper letters, 29 selfloop transitions, 6 changer transitions 0/220 dead transitions.
[2024-02-28 21:37:59,941 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 220 transitions, 820 flow
[2024-02-28 21:37:59,942 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-02-28 21:37:59,942 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-02-28 21:37:59,943 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 477 transitions.
[2024-02-28 21:37:59,943 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9244186046511628
[2024-02-28 21:37:59,943 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 477 transitions.
[2024-02-28 21:37:59,943 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 477 transitions.
[2024-02-28 21:37:59,944 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 21:37:59,944 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 477 transitions.
[2024-02-28 21:37:59,945 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:37:59,946 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)
[2024-02-28 21:37:59,946 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)
[2024-02-28 21:37:59,946 INFO  L175             Difference]: Start difference. First operand has 183 places, 208 transitions, 720 flow. Second operand 3 states and 477 transitions.
[2024-02-28 21:37:59,946 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 220 transitions, 820 flow
[2024-02-28 21:37:59,965 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 220 transitions, 782 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-02-28 21:37:59,967 INFO  L231             Difference]: Finished difference. Result has 185 places, 212 transitions, 730 flow
[2024-02-28 21:37:59,967 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=682, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=730, PETRI_PLACES=185, PETRI_TRANSITIONS=212}
[2024-02-28 21:37:59,968 INFO  L281   CegarLoopForPetriNet]: 173 programPoint places, 12 predicate places.
[2024-02-28 21:37:59,968 INFO  L495      AbstractCegarLoop]: Abstraction has has 185 places, 212 transitions, 730 flow
[2024-02-28 21:37:59,968 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 150.33333333333334) internal successors, (451), 3 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:37:59,968 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 21:37:59,968 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 21:37:59,969 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-02-28 21:37:59,969 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-02-28 21:37:59,969 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 21:37:59,969 INFO  L85        PathProgramCache]: Analyzing trace with hash -1501935448, now seen corresponding path program 1 times
[2024-02-28 21:37:59,969 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 21:37:59,970 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583154759]
[2024-02-28 21:37:59,970 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 21:37:59,970 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 21:37:59,986 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-28 21:37:59,987 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-02-28 21:37:59,994 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-28 21:38:00,003 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-02-28 21:38:00,003 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-02-28 21:38:00,004 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (14 of 15 remaining)
[2024-02-28 21:38:00,004 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining)
[2024-02-28 21:38:00,004 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining)
[2024-02-28 21:38:00,004 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining)
[2024-02-28 21:38:00,004 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining)
[2024-02-28 21:38:00,004 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining)
[2024-02-28 21:38:00,005 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 15 remaining)
[2024-02-28 21:38:00,005 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining)
[2024-02-28 21:38:00,005 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining)
[2024-02-28 21:38:00,005 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining)
[2024-02-28 21:38:00,005 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 15 remaining)
[2024-02-28 21:38:00,005 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (3 of 15 remaining)
[2024-02-28 21:38:00,006 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining)
[2024-02-28 21:38:00,006 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining)
[2024-02-28 21:38:00,006 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining)
[2024-02-28 21:38:00,006 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-02-28 21:38:00,006 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 21:38:00,010 INFO  L228   ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances
[2024-02-28 21:38:00,010 INFO  L178   ceAbstractionStarter]: Computing trace abstraction results
[2024-02-28 21:38:00,049 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet8 could not be translated
[2024-02-28 21:38:00,051 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre14 could not be translated
[2024-02-28 21:38:00,051 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem16 could not be translated
[2024-02-28 21:38:00,051 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem16 could not be translated
[2024-02-28 21:38:00,052 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not
[2024-02-28 21:38:00,052 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not
[2024-02-28 21:38:00,052 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not
[2024-02-28 21:38:00,053 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-02-28 21:38:00,053 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-02-28 21:38:00,053 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-02-28 21:38:00,053 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-02-28 21:38:00,054 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-02-28 21:38:00,054 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-02-28 21:38:00,061 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.02 09:38:00 BasicIcfg
[2024-02-28 21:38:00,061 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-02-28 21:38:00,061 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2024-02-28 21:38:00,061 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2024-02-28 21:38:00,062 INFO  L274        PluginConnector]: Witness Printer initialized
[2024-02-28 21:38:00,062 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 09:37:50" (3/4) ...
[2024-02-28 21:38:00,063 INFO  L140         WitnessPrinter]: No result that supports witness generation found
[2024-02-28 21:38:00,064 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-02-28 21:38:00,065 INFO  L158              Benchmark]: Toolchain (without parser) took 10489.27ms. Allocated memory was 134.2MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 93.2MB in the beginning and 1.1GB in the end (delta: -976.6MB). Peak memory consumption was 958.8MB. Max. memory is 16.1GB.
[2024-02-28 21:38:00,065 INFO  L158              Benchmark]: CDTParser took 0.20ms. Allocated memory is still 134.2MB. Free memory is still 105.2MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-02-28 21:38:00,065 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 305.88ms. Allocated memory is still 134.2MB. Free memory was 93.2MB in the beginning and 73.0MB in the end (delta: 20.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB.
[2024-02-28 21:38:00,065 INFO  L158              Benchmark]: Boogie Procedure Inliner took 31.48ms. Allocated memory is still 134.2MB. Free memory was 73.0MB in the beginning and 71.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-02-28 21:38:00,066 INFO  L158              Benchmark]: Boogie Preprocessor took 20.80ms. Allocated memory is still 134.2MB. Free memory was 71.0MB in the beginning and 69.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-02-28 21:38:00,066 INFO  L158              Benchmark]: RCFGBuilder took 430.49ms. Allocated memory was 134.2MB in the beginning and 161.5MB in the end (delta: 27.3MB). Free memory was 69.1MB in the beginning and 122.8MB in the end (delta: -53.7MB). Peak memory consumption was 22.8MB. Max. memory is 16.1GB.
[2024-02-28 21:38:00,066 INFO  L158              Benchmark]: TraceAbstraction took 9693.03ms. Allocated memory was 161.5MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 122.8MB in the beginning and 1.1GB in the end (delta: -947.0MB). Peak memory consumption was 957.0MB. Max. memory is 16.1GB.
[2024-02-28 21:38:00,066 INFO  L158              Benchmark]: Witness Printer took 2.82ms. Allocated memory is still 2.1GB. Free memory is still 1.1GB. There was no memory consumed. Max. memory is 16.1GB.
[2024-02-28 21:38:00,068 INFO  L338   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.20ms. Allocated memory is still 134.2MB. Free memory is still 105.2MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 305.88ms. Allocated memory is still 134.2MB. Free memory was 93.2MB in the beginning and 73.0MB in the end (delta: 20.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 31.48ms. Allocated memory is still 134.2MB. Free memory was 73.0MB in the beginning and 71.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 20.80ms. Allocated memory is still 134.2MB. Free memory was 71.0MB in the beginning and 69.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
 * RCFGBuilder took 430.49ms. Allocated memory was 134.2MB in the beginning and 161.5MB in the end (delta: 27.3MB). Free memory was 69.1MB in the beginning and 122.8MB in the end (delta: -53.7MB). Peak memory consumption was 22.8MB. Max. memory is 16.1GB.
 * TraceAbstraction took 9693.03ms. Allocated memory was 161.5MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 122.8MB in the beginning and 1.1GB in the end (delta: -947.0MB). Peak memory consumption was 957.0MB. Max. memory is 16.1GB.
 * Witness Printer took 2.82ms. Allocated memory is still 2.1GB. Free memory is still 1.1GB. There was no memory consumed. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator:
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet8 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~pre14 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~mem16 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~mem16 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
  - GenericResult: Unfinished Backtranslation
    The program execution was not completely translated back.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - DataRaceFoundResult [Line: 685]: Data race detected
[2024-02-28 21:38:00,089 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet8 could not be translated
[2024-02-28 21:38:00,090 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre14 could not be translated
[2024-02-28 21:38:00,091 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem16 could not be translated
[2024-02-28 21:38:00,091 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem16 could not be translated
[2024-02-28 21:38:00,091 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not
[2024-02-28 21:38:00,091 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not
[2024-02-28 21:38:00,092 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not
[2024-02-28 21:38:00,092 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-02-28 21:38:00,092 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-02-28 21:38:00,092 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-02-28 21:38:00,092 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-02-28 21:38:00,093 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-02-28 21:38:00,093 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-02-28 21:38:00,109 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet8 could not be translated
[2024-02-28 21:38:00,110 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre14 could not be translated
[2024-02-28 21:38:00,110 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem16 could not be translated
[2024-02-28 21:38:00,110 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem16 could not be translated
[2024-02-28 21:38:00,110 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not
[2024-02-28 21:38:00,111 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not
[2024-02-28 21:38:00,111 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not
[2024-02-28 21:38:00,111 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-02-28 21:38:00,111 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-02-28 21:38:00,112 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-02-28 21:38:00,112 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-02-28 21:38:00,112 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-02-28 21:38:00,112 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
    Data race detected
The following path leads to a data race: 
[L678]               0  int threads_alive = -1;
        VAL             [threads_alive=-1]
[L679]               0  pthread_mutex_t threads_alive_mutex = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } };
        VAL             [threads_alive=-1, threads_alive_mutex={1:0}]
[L680]               0  pthread_cond_t threads_alive_cond = { { {0}, {0}, {0, 0}, {0, 0}, 0, 0, {0, 0} } };
        VAL             [threads_alive=-1, threads_alive_cond={2:0}, threads_alive_mutex={1:0}]
[L681]               0  int data = 0;
        VAL             [data=0, threads_alive=-1, threads_alive_cond={2:0}, threads_alive_mutex={1:0}]
[L682]               0  pthread_mutex_t data_mutex = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } };
        VAL             [data=0, data_mutex={3:0}, threads_alive=-1, threads_alive_cond={2:0}, threads_alive_mutex={1:0}]
[L694]               0  int threads_total = __VERIFIER_nondet_int();
        VAL             [data=0, data_mutex={3:0}, threads_alive=-1, threads_alive_cond={2:0}, threads_alive_mutex={1:0}, threads_total=1]
[L695]  CALL         0  assume_abort_if_not(threads_total >= 0)
[L675]  COND FALSE   0  !(!cond)
        VAL             [\old(cond)=1, cond=1, data=0, data_mutex={3:0}, threads_alive=-1, threads_alive_cond={2:0}, threads_alive_mutex={1:0}]
[L695]  RET          0  assume_abort_if_not(threads_total >= 0)
[L696]               0  int i = 0;
        VAL             [data=0, data_mutex={3:0}, i=0, threads_alive=-1, threads_alive_cond={2:0}, threads_alive_mutex={1:0}, threads_total=1]
[L696]  COND TRUE    0  i < threads_total
        VAL             [data=0, data_mutex={3:0}, i=0, threads_alive=-1, threads_alive_cond={2:0}, threads_alive_mutex={1:0}, threads_total=1]
[L698]               0  threads_alive++
        VAL             [data=0, data_mutex={3:0}, i=0, threads_alive=0, threads_alive_cond={2:0}, threads_alive_mutex={1:0}, threads_total=1]
[L700]               0  pthread_t tid;
        VAL             [data=0, data_mutex={3:0}, i=0, threads_alive=0, threads_alive_cond={2:0}, threads_alive_mutex={1:0}, threads_total=1, tid={5:0}]
[L701]  FCALL, FORK  0  pthread_create(&tid, ((void *)0), &thread, ((void *)0))
        VAL             [arg={0:0}, data=0, data_mutex={3:0}, i=0, threads_alive=0, threads_alive_cond={2:0}, threads_alive_mutex={1:0}, threads_total=1, tid={5:0}]
[L702]  EXPR         0  \read(tid)
        VAL             [arg={0:0}, data=0, data_mutex={3:0}, i=0, threads_alive=0, threads_alive_cond={2:0}, threads_alive_mutex={1:0}, threads_total=1, tid={5:0}]
[L702]               0  pthread_detach(tid)
        VAL             [arg={0:0}, data=0, data_mutex={3:0}, i=0, threads_alive=0, threads_alive_cond={2:0}, threads_alive_mutex={1:0}, threads_total=1, tid={5:0}]
[L696]               0  i++
        VAL             [arg={0:0}, data=0, data_mutex={3:0}, i=1, threads_alive=0, threads_alive_cond={2:0}, threads_alive_mutex={1:0}, threads_total=1, tid={5:0}]
[L696]  COND FALSE   0  !(i < threads_total)
        VAL             [arg={0:0}, data=0, data_mutex={3:0}, i=1, threads_alive=0, threads_alive_cond={2:0}, threads_alive_mutex={1:0}, threads_total=1]
[L705]  COND FALSE   0  !(\read(threads_alive))
        VAL             [arg={0:0}, data=0, data_mutex={3:0}, threads_alive=0, threads_alive_cond={2:0}, threads_alive_mutex={1:0}, threads_total=1]
[L685]               1  data = __VERIFIER_nondet_int()
        VAL             [arg={0:0}, arg={0:0}, data=0, data_mutex={3:0}, threads_alive=0, threads_alive_cond={2:0}, threads_alive_mutex={1:0}]
[L708]               0  return data;
        VAL             [arg={0:0}, arg={0:0}, data=0, data_mutex={3:0}, threads_alive=0, threads_alive_cond={2:0}, threads_alive_mutex={1:0}, threads_total=1]
[L685]               1  data = __VERIFIER_nondet_int()
        VAL             [arg={0:0}, arg={0:0}, data=0, data_mutex={3:0}, threads_alive=0, threads_alive_cond={2:0}, threads_alive_mutex={1:0}]

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

  - UnprovableResult [Line: 698]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 705]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 708]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 698]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 702]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 701]: Unable to prove that petrification did provide enough thread instances (tool internal message)
    Unable to prove that petrification did provide enough thread instances (tool internal message)
 Reason: Not analyzed. 
  - UnprovableResult [Line: 688]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 688]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
    CFG has 3 procedures, 169 locations, 12 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.0s, OverallIterations: 8, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 206 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 98 mSDsluCounter, 47 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 362 IncrementalHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 47 mSDtfsCounter, 362 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=490occurred in iteration=6, InterpolantAutomatonStates: 24, 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.6s InterpolantComputationTime, 568 NumberOfCodeBlocks, 568 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 463 ConstructedInterpolants, 0 QuantifiedInterpolants, 742 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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 2 thread instances
    CFG has 4 procedures, 201 locations, 15 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 7.6s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 317 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 149 mSDsluCounter, 81 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 546 IncrementalHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 81 mSDtfsCounter, 546 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=730occurred in iteration=7, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 568 NumberOfCodeBlocks, 568 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 463 ConstructedInterpolants, 0 QuantifiedInterpolants, 742 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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
RESULT: Ultimate proved your program to be incorrect!
[2024-02-28 21:38:00,126 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
--- End real Ultimate output ---

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