./Ultimate.py --spec /mnt/goblint-svcomp/goblint-bench/bench/concrat/properties/no-data-race.prp --file /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/thread-join-array-dynamic.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-array-dynamic.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 969606139c1c2163106c8f66fddcc76915ad819af1c6c8745c4f4780b431a948
--- Real Ultimate output ---
This is Ultimate 0.2.4-dev-0e0057c
[2024-03-12 01:37:21,471 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-03-12 01:37:21,509 INFO  L114        SettingsManager]: Loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2024-03-12 01:37:21,512 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-03-12 01:37:21,513 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-03-12 01:37:21,527 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-03-12 01:37:21,527 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-03-12 01:37:21,527 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-03-12 01:37:21,528 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-03-12 01:37:21,528 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-03-12 01:37:21,529 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-03-12 01:37:21,529 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-03-12 01:37:21,529 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-03-12 01:37:21,529 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-03-12 01:37:21,530 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-03-12 01:37:21,530 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-03-12 01:37:21,530 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-03-12 01:37:21,531 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-03-12 01:37:21,531 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-03-12 01:37:21,531 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-03-12 01:37:21,531 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-03-12 01:37:21,532 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-03-12 01:37:21,532 INFO  L153        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2024-03-12 01:37:21,532 INFO  L153        SettingsManager]:  * Check unreachability of reach_error function=false
[2024-03-12 01:37:21,532 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-03-12 01:37:21,533 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-03-12 01:37:21,533 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-03-12 01:37:21,533 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-03-12 01:37:21,533 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-03-12 01:37:21,534 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-03-12 01:37:21,534 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-03-12 01:37:21,534 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-03-12 01:37:21,534 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-03-12 01:37:21,535 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-03-12 01:37:21,535 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-03-12 01:37:21,535 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-03-12 01:37:21,535 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-03-12 01:37:21,535 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-03-12 01:37:21,535 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-03-12 01:37:21,536 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-03-12 01:37:21,536 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-03-12 01:37:21,536 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 -> 969606139c1c2163106c8f66fddcc76915ad819af1c6c8745c4f4780b431a948
[2024-03-12 01:37:21,711 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-03-12 01:37:21,735 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-03-12 01:37:21,737 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-03-12 01:37:21,737 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-03-12 01:37:21,740 INFO  L274        PluginConnector]: CDTParser initialized
[2024-03-12 01:37:21,741 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/thread-join-array-dynamic.i
[2024-03-12 01:37:22,841 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-03-12 01:37:23,036 INFO  L384              CDTParser]: Found 1 translation units.
[2024-03-12 01:37:23,036 INFO  L180              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/thread-join-array-dynamic.i
[2024-03-12 01:37:23,048 INFO  L427              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data/142e136b1/4de77a59339e42258277da14c283795c/FLAGb7380c97d
[2024-03-12 01:37:23,059 INFO  L435              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data/142e136b1/4de77a59339e42258277da14c283795c
[2024-03-12 01:37:23,060 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-03-12 01:37:23,061 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-03-12 01:37:23,062 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-03-12 01:37:23,062 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-03-12 01:37:23,066 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-03-12 01:37:23,066 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.03 01:37:23" (1/1) ...
[2024-03-12 01:37:23,067 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d2ac001 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:37:23, skipping insertion in model container
[2024-03-12 01:37:23,067 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.03 01:37:23" (1/1) ...
[2024-03-12 01:37:23,106 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-03-12 01:37:23,350 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2024-03-12 01:37:23,359 INFO  L202         MainTranslator]: Completed pre-run
[2024-03-12 01:37:23,391 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2024-03-12 01:37:23,440 INFO  L206         MainTranslator]: Completed translation
[2024-03-12 01:37:23,441 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:37:23 WrapperNode
[2024-03-12 01:37:23,441 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-03-12 01:37:23,441 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-03-12 01:37:23,442 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-03-12 01:37:23,442 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-03-12 01:37:23,446 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:37:23" (1/1) ...
[2024-03-12 01:37:23,459 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:37:23" (1/1) ...
[2024-03-12 01:37:23,477 INFO  L138                Inliner]: procedures = 269, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 86
[2024-03-12 01:37:23,478 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-03-12 01:37:23,478 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-03-12 01:37:23,478 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-03-12 01:37:23,478 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-03-12 01:37:23,485 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:37:23" (1/1) ...
[2024-03-12 01:37:23,485 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:37:23" (1/1) ...
[2024-03-12 01:37:23,488 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:37:23" (1/1) ...
[2024-03-12 01:37:23,488 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:37:23" (1/1) ...
[2024-03-12 01:37:23,493 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:37:23" (1/1) ...
[2024-03-12 01:37:23,496 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:37:23" (1/1) ...
[2024-03-12 01:37:23,497 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:37:23" (1/1) ...
[2024-03-12 01:37:23,498 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:37:23" (1/1) ...
[2024-03-12 01:37:23,500 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-03-12 01:37:23,501 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-03-12 01:37:23,501 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-03-12 01:37:23,501 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-03-12 01:37:23,502 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:37:23" (1/1) ...
[2024-03-12 01:37:23,506 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-03-12 01:37:23,513 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 01:37:23,524 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-03-12 01:37:23,543 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-03-12 01:37:23,568 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2024-03-12 01:37:23,568 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2024-03-12 01:37:23,568 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-03-12 01:37:23,568 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2024-03-12 01:37:23,569 INFO  L130     BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock
[2024-03-12 01:37:23,569 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2024-03-12 01:37:23,569 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2024-03-12 01:37:23,569 INFO  L130     BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock
[2024-03-12 01:37:23,569 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2024-03-12 01:37:23,569 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-03-12 01:37:23,569 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2024-03-12 01:37:23,569 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2024-03-12 01:37:23,570 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2024-03-12 01:37:23,570 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-03-12 01:37:23,570 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-03-12 01:37:23,571 WARN  L213             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-03-12 01:37:23,712 INFO  L241             CfgBuilder]: Building ICFG
[2024-03-12 01:37:23,713 INFO  L267             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-03-12 01:37:23,881 INFO  L282             CfgBuilder]: Performing block encoding
[2024-03-12 01:37:23,894 INFO  L304             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-03-12 01:37:23,894 INFO  L309             CfgBuilder]: Removed 2 assume(true) statements.
[2024-03-12 01:37:23,895 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.03 01:37:23 BoogieIcfgContainer
[2024-03-12 01:37:23,895 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-03-12 01:37:23,897 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-03-12 01:37:23,897 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-03-12 01:37:23,899 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-03-12 01:37:23,900 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.03 01:37:23" (1/3) ...
[2024-03-12 01:37:23,900 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fa294d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.03 01:37:23, skipping insertion in model container
[2024-03-12 01:37:23,900 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:37:23" (2/3) ...
[2024-03-12 01:37:23,901 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fa294d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.03 01:37:23, skipping insertion in model container
[2024-03-12 01:37:23,901 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.03 01:37:23" (3/3) ...
[2024-03-12 01:37:23,902 INFO  L112   eAbstractionObserver]: Analyzing ICFG thread-join-array-dynamic.i
[2024-03-12 01:37:23,907 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2024-03-12 01:37:23,914 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-03-12 01:37:23,915 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations.
[2024-03-12 01:37:23,915 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-03-12 01:37:23,953 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2024-03-12 01:37:23,978 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 109 places, 110 transitions, 227 flow
[2024-03-12 01:37:24,041 INFO  L124   PetriNetUnfolderBase]: 6/161 cut-off events.
[2024-03-12 01:37:24,042 INFO  L125   PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES.
[2024-03-12 01:37:24,046 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 166 conditions, 161 events. 6/161 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 323 event pairs, 0 based on Foata normal form. 0/141 useless extension candidates. Maximal degree in co-relation 80. Up to 4 conditions per place. 
[2024-03-12 01:37:24,046 INFO  L82        GeneralOperation]: Start removeDead. Operand has 109 places, 110 transitions, 227 flow
[2024-03-12 01:37:24,049 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 109 places, 110 transitions, 227 flow
[2024-03-12 01:37:24,056 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-12 01:37:24,061 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;@104c922d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-03-12 01:37:24,061 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 8 error locations.
[2024-03-12 01:37:24,086 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-03-12 01:37:24,086 INFO  L124   PetriNetUnfolderBase]: 3/52 cut-off events.
[2024-03-12 01:37:24,086 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-03-12 01:37:24,086 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:37:24,087 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]
[2024-03-12 01:37:24,087 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-12 01:37:24,091 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:37:24,091 INFO  L85        PathProgramCache]: Analyzing trace with hash -517201455, now seen corresponding path program 1 times
[2024-03-12 01:37:24,099 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:37:24,099 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078622356]
[2024-03-12 01:37:24,099 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:37:24,101 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:37:24,197 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:37:24,561 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:37:24,562 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:37:24,562 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078622356]
[2024-03-12 01:37:24,563 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078622356] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:37:24,563 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:37:24,563 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 01:37:24,564 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341197480]
[2024-03-12 01:37:24,565 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:37:24,571 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-12 01:37:24,575 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:37:24,594 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-12 01:37:24,595 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-12 01:37:24,842 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 81 out of 110
[2024-03-12 01:37:24,845 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 110 transitions, 227 flow. Second operand  has 6 states, 6 states have (on average 82.16666666666667) internal successors, (493), 6 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:24,845 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:37:24,845 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 110
[2024-03-12 01:37:24,846 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:37:24,985 INFO  L124   PetriNetUnfolderBase]: 36/306 cut-off events.
[2024-03-12 01:37:24,985 INFO  L125   PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES.
[2024-03-12 01:37:24,985 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 428 conditions, 306 events. 36/306 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1222 event pairs, 30 based on Foata normal form. 8/281 useless extension candidates. Maximal degree in co-relation 296. Up to 93 conditions per place. 
[2024-03-12 01:37:24,987 INFO  L140   encePairwiseOnDemand]: 91/110 looper letters, 23 selfloop transitions, 13 changer transitions 2/118 dead transitions.
[2024-03-12 01:37:24,987 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 118 transitions, 317 flow
[2024-03-12 01:37:24,988 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 01:37:24,991 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 01:37:24,998 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 531 transitions.
[2024-03-12 01:37:25,000 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8045454545454546
[2024-03-12 01:37:25,001 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 531 transitions.
[2024-03-12 01:37:25,001 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 531 transitions.
[2024-03-12 01:37:25,003 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:37:25,004 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 531 transitions.
[2024-03-12 01:37:25,008 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 88.5) internal successors, (531), 6 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:25,013 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 110.0) internal successors, (770), 7 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:25,014 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 110.0) internal successors, (770), 7 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:25,015 INFO  L175             Difference]: Start difference. First operand has 109 places, 110 transitions, 227 flow. Second operand 6 states and 531 transitions.
[2024-03-12 01:37:25,016 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 118 transitions, 317 flow
[2024-03-12 01:37:25,018 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 118 transitions, 317 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-12 01:37:25,021 INFO  L231             Difference]: Finished difference. Result has 115 places, 115 transitions, 309 flow
[2024-03-12 01:37:25,023 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=309, PETRI_PLACES=115, PETRI_TRANSITIONS=115}
[2024-03-12 01:37:25,025 INFO  L281   CegarLoopForPetriNet]: 109 programPoint places, 6 predicate places.
[2024-03-12 01:37:25,026 INFO  L495      AbstractCegarLoop]: Abstraction has has 115 places, 115 transitions, 309 flow
[2024-03-12 01:37:25,026 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 82.16666666666667) internal successors, (493), 6 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:25,026 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:37:25,026 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]
[2024-03-12 01:37:25,026 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-03-12 01:37:25,027 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-12 01:37:25,027 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:37:25,027 INFO  L85        PathProgramCache]: Analyzing trace with hash 60060144, now seen corresponding path program 1 times
[2024-03-12 01:37:25,027 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:37:25,028 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153508189]
[2024-03-12 01:37:25,028 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:37:25,028 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:37:25,041 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:37:25,057 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:37:25,058 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:37:25,058 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153508189]
[2024-03-12 01:37:25,058 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153508189] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:37:25,058 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:37:25,058 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 01:37:25,059 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792892314]
[2024-03-12 01:37:25,059 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:37:25,060 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 01:37:25,060 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:37:25,060 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 01:37:25,060 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 01:37:25,067 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 99 out of 110
[2024-03-12 01:37:25,068 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 115 transitions, 309 flow. Second operand  has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:25,068 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:37:25,068 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 110
[2024-03-12 01:37:25,068 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:37:25,099 INFO  L124   PetriNetUnfolderBase]: 9/211 cut-off events.
[2024-03-12 01:37:25,099 INFO  L125   PetriNetUnfolderBase]: For 15/18 co-relation queries the response was YES.
[2024-03-12 01:37:25,099 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 298 conditions, 211 events. 9/211 cut-off events. For 15/18 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 529 event pairs, 1 based on Foata normal form. 0/195 useless extension candidates. Maximal degree in co-relation 174. Up to 16 conditions per place. 
[2024-03-12 01:37:25,100 INFO  L140   encePairwiseOnDemand]: 106/110 looper letters, 8 selfloop transitions, 3 changer transitions 5/119 dead transitions.
[2024-03-12 01:37:25,100 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 119 transitions, 341 flow
[2024-03-12 01:37:25,100 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 01:37:25,100 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 01:37:25,101 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 310 transitions.
[2024-03-12 01:37:25,101 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9393939393939394
[2024-03-12 01:37:25,102 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 310 transitions.
[2024-03-12 01:37:25,102 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 310 transitions.
[2024-03-12 01:37:25,102 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:37:25,102 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 310 transitions.
[2024-03-12 01:37:25,103 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:25,104 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:25,104 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:25,104 INFO  L175             Difference]: Start difference. First operand has 115 places, 115 transitions, 309 flow. Second operand 3 states and 310 transitions.
[2024-03-12 01:37:25,104 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 119 transitions, 341 flow
[2024-03-12 01:37:25,106 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 119 transitions, 337 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-12 01:37:25,108 INFO  L231             Difference]: Finished difference. Result has 117 places, 113 transitions, 305 flow
[2024-03-12 01:37:25,108 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=305, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=305, PETRI_PLACES=117, PETRI_TRANSITIONS=113}
[2024-03-12 01:37:25,108 INFO  L281   CegarLoopForPetriNet]: 109 programPoint places, 8 predicate places.
[2024-03-12 01:37:25,109 INFO  L495      AbstractCegarLoop]: Abstraction has has 117 places, 113 transitions, 305 flow
[2024-03-12 01:37:25,109 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:25,109 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:37:25,109 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]
[2024-03-12 01:37:25,109 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-03-12 01:37:25,110 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-12 01:37:25,110 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:37:25,110 INFO  L85        PathProgramCache]: Analyzing trace with hash 1036693827, now seen corresponding path program 1 times
[2024-03-12 01:37:25,110 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:37:25,111 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229193522]
[2024-03-12 01:37:25,111 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:37:25,111 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:37:25,125 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:37:25,179 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:37:25,179 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:37:25,179 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229193522]
[2024-03-12 01:37:25,179 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229193522] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:37:25,180 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:37:25,180 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 01:37:25,180 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194624567]
[2024-03-12 01:37:25,180 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:37:25,180 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-03-12 01:37:25,181 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:37:25,181 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-03-12 01:37:25,181 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-03-12 01:37:25,235 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 92 out of 110
[2024-03-12 01:37:25,236 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 113 transitions, 305 flow. Second operand  has 5 states, 5 states have (on average 93.4) internal successors, (467), 5 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:25,236 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:37:25,236 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 110
[2024-03-12 01:37:25,236 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:37:25,281 INFO  L124   PetriNetUnfolderBase]: 16/291 cut-off events.
[2024-03-12 01:37:25,281 INFO  L125   PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES.
[2024-03-12 01:37:25,282 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 437 conditions, 291 events. 16/291 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1027 event pairs, 1 based on Foata normal form. 1/279 useless extension candidates. Maximal degree in co-relation 325. Up to 48 conditions per place. 
[2024-03-12 01:37:25,283 INFO  L140   encePairwiseOnDemand]: 103/110 looper letters, 15 selfloop transitions, 2 changer transitions 4/115 dead transitions.
[2024-03-12 01:37:25,283 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 115 transitions, 337 flow
[2024-03-12 01:37:25,283 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 01:37:25,283 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 01:37:25,284 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 574 transitions.
[2024-03-12 01:37:25,285 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8696969696969697
[2024-03-12 01:37:25,285 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 574 transitions.
[2024-03-12 01:37:25,285 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 574 transitions.
[2024-03-12 01:37:25,285 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:37:25,285 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 574 transitions.
[2024-03-12 01:37:25,286 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 95.66666666666667) internal successors, (574), 6 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:25,288 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 110.0) internal successors, (770), 7 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:25,288 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 110.0) internal successors, (770), 7 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:25,288 INFO  L175             Difference]: Start difference. First operand has 117 places, 113 transitions, 305 flow. Second operand 6 states and 574 transitions.
[2024-03-12 01:37:25,288 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 115 transitions, 337 flow
[2024-03-12 01:37:25,290 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 115 transitions, 317 flow, removed 7 selfloop flow, removed 2 redundant places.
[2024-03-12 01:37:25,292 INFO  L231             Difference]: Finished difference. Result has 124 places, 109 transitions, 279 flow
[2024-03-12 01:37:25,292 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=279, PETRI_PLACES=124, PETRI_TRANSITIONS=109}
[2024-03-12 01:37:25,293 INFO  L281   CegarLoopForPetriNet]: 109 programPoint places, 15 predicate places.
[2024-03-12 01:37:25,293 INFO  L495      AbstractCegarLoop]: Abstraction has has 124 places, 109 transitions, 279 flow
[2024-03-12 01:37:25,293 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 93.4) internal successors, (467), 5 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:25,293 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:37:25,294 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]
[2024-03-12 01:37:25,294 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-03-12 01:37:25,294 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-12 01:37:25,294 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:37:25,294 INFO  L85        PathProgramCache]: Analyzing trace with hash -1484834911, now seen corresponding path program 1 times
[2024-03-12 01:37:25,295 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:37:25,295 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781456441]
[2024-03-12 01:37:25,295 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:37:25,295 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:37:25,307 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:37:25,323 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:37:25,323 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:37:25,324 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781456441]
[2024-03-12 01:37:25,324 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781456441] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:37:25,324 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:37:25,324 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 01:37:25,324 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042231317]
[2024-03-12 01:37:25,324 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:37:25,325 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 01:37:25,325 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:37:25,325 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 01:37:25,325 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 01:37:25,335 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 97 out of 110
[2024-03-12 01:37:25,335 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 109 transitions, 279 flow. Second operand  has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:25,335 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:37:25,336 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 110
[2024-03-12 01:37:25,336 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:37:25,361 INFO  L124   PetriNetUnfolderBase]: 5/209 cut-off events.
[2024-03-12 01:37:25,361 INFO  L125   PetriNetUnfolderBase]: For 20/33 co-relation queries the response was YES.
[2024-03-12 01:37:25,362 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 303 conditions, 209 events. 5/209 cut-off events. For 20/33 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 548 event pairs, 3 based on Foata normal form. 1/200 useless extension candidates. Maximal degree in co-relation 243. Up to 25 conditions per place. 
[2024-03-12 01:37:25,363 INFO  L140   encePairwiseOnDemand]: 105/110 looper letters, 8 selfloop transitions, 4 changer transitions 3/112 dead transitions.
[2024-03-12 01:37:25,363 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 112 transitions, 315 flow
[2024-03-12 01:37:25,363 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 01:37:25,363 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 01:37:25,364 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 305 transitions.
[2024-03-12 01:37:25,364 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9242424242424242
[2024-03-12 01:37:25,364 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 305 transitions.
[2024-03-12 01:37:25,364 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 305 transitions.
[2024-03-12 01:37:25,365 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:37:25,365 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 305 transitions.
[2024-03-12 01:37:25,365 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:25,366 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:25,366 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:25,366 INFO  L175             Difference]: Start difference. First operand has 124 places, 109 transitions, 279 flow. Second operand 3 states and 305 transitions.
[2024-03-12 01:37:25,366 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 112 transitions, 315 flow
[2024-03-12 01:37:25,368 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 112 transitions, 301 flow, removed 5 selfloop flow, removed 5 redundant places.
[2024-03-12 01:37:25,369 INFO  L231             Difference]: Finished difference. Result has 120 places, 109 transitions, 287 flow
[2024-03-12 01:37:25,369 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=287, PETRI_PLACES=120, PETRI_TRANSITIONS=109}
[2024-03-12 01:37:25,370 INFO  L281   CegarLoopForPetriNet]: 109 programPoint places, 11 predicate places.
[2024-03-12 01:37:25,370 INFO  L495      AbstractCegarLoop]: Abstraction has has 120 places, 109 transitions, 287 flow
[2024-03-12 01:37:25,370 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:25,370 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:37:25,371 INFO  L208   CegarLoopForPetriNet]: trace histogram [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]
[2024-03-12 01:37:25,371 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-03-12 01:37:25,371 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-12 01:37:25,371 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:37:25,371 INFO  L85        PathProgramCache]: Analyzing trace with hash 125150059, now seen corresponding path program 1 times
[2024-03-12 01:37:25,372 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:37:25,372 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893495273]
[2024-03-12 01:37:25,372 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:37:25,372 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:37:25,396 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-12 01:37:25,396 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-03-12 01:37:25,406 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-12 01:37:25,426 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-03-12 01:37:25,426 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-03-12 01:37:25,427 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining)
[2024-03-12 01:37:25,428 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 8 remaining)
[2024-03-12 01:37:25,428 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 8 remaining)
[2024-03-12 01:37:25,428 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (4 of 8 remaining)
[2024-03-12 01:37:25,429 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (3 of 8 remaining)
[2024-03-12 01:37:25,429 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (2 of 8 remaining)
[2024-03-12 01:37:25,429 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 8 remaining)
[2024-03-12 01:37:25,429 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 8 remaining)
[2024-03-12 01:37:25,429 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-03-12 01:37:25,430 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1]
[2024-03-12 01:37:25,431 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-03-12 01:37:25,431 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2024-03-12 01:37:25,446 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2024-03-12 01:37:25,448 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 128 places, 128 transitions, 272 flow
[2024-03-12 01:37:25,469 INFO  L124   PetriNetUnfolderBase]: 11/284 cut-off events.
[2024-03-12 01:37:25,470 INFO  L125   PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES.
[2024-03-12 01:37:25,470 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 296 conditions, 284 events. 11/284 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 687 event pairs, 0 based on Foata normal form. 0/248 useless extension candidates. Maximal degree in co-relation 163. Up to 8 conditions per place. 
[2024-03-12 01:37:25,470 INFO  L82        GeneralOperation]: Start removeDead. Operand has 128 places, 128 transitions, 272 flow
[2024-03-12 01:37:25,472 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 128 places, 128 transitions, 272 flow
[2024-03-12 01:37:25,473 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-12 01:37:25,474 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;@104c922d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-03-12 01:37:25,474 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 9 error locations.
[2024-03-12 01:37:25,477 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-03-12 01:37:25,477 INFO  L124   PetriNetUnfolderBase]: 3/52 cut-off events.
[2024-03-12 01:37:25,477 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-03-12 01:37:25,477 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:37:25,477 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]
[2024-03-12 01:37:25,477 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-12 01:37:25,477 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:37:25,477 INFO  L85        PathProgramCache]: Analyzing trace with hash 889799121, now seen corresponding path program 1 times
[2024-03-12 01:37:25,478 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:37:25,478 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410811114]
[2024-03-12 01:37:25,478 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:37:25,478 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:37:25,487 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:37:25,629 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:37:25,629 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:37:25,629 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410811114]
[2024-03-12 01:37:25,629 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410811114] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:37:25,630 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:37:25,630 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 01:37:25,630 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421901418]
[2024-03-12 01:37:25,630 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:37:25,630 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-12 01:37:25,630 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:37:25,631 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-12 01:37:25,631 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-12 01:37:25,799 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 95 out of 128
[2024-03-12 01:37:25,800 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 128 transitions, 272 flow. Second operand  has 6 states, 6 states have (on average 96.16666666666667) internal successors, (577), 6 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:25,800 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:37:25,800 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 128
[2024-03-12 01:37:25,800 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:37:25,985 INFO  L124   PetriNetUnfolderBase]: 280/1695 cut-off events.
[2024-03-12 01:37:25,985 INFO  L125   PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES.
[2024-03-12 01:37:25,988 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2281 conditions, 1695 events. 280/1695 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 13275 event pairs, 240 based on Foata normal form. 24/1588 useless extension candidates. Maximal degree in co-relation 731. Up to 488 conditions per place. 
[2024-03-12 01:37:25,992 INFO  L140   encePairwiseOnDemand]: 109/128 looper letters, 30 selfloop transitions, 13 changer transitions 1/138 dead transitions.
[2024-03-12 01:37:25,993 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 138 transitions, 378 flow
[2024-03-12 01:37:25,993 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 01:37:25,993 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 01:37:25,994 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 621 transitions.
[2024-03-12 01:37:25,995 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.80859375
[2024-03-12 01:37:25,995 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 621 transitions.
[2024-03-12 01:37:25,995 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 621 transitions.
[2024-03-12 01:37:25,995 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:37:25,995 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 621 transitions.
[2024-03-12 01:37:25,997 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 103.5) internal successors, (621), 6 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:25,998 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 128.0) internal successors, (896), 7 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:25,998 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 128.0) internal successors, (896), 7 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:25,998 INFO  L175             Difference]: Start difference. First operand has 128 places, 128 transitions, 272 flow. Second operand 6 states and 621 transitions.
[2024-03-12 01:37:25,998 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 138 transitions, 378 flow
[2024-03-12 01:37:25,999 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 138 transitions, 378 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-12 01:37:26,000 INFO  L231             Difference]: Finished difference. Result has 134 places, 133 transitions, 354 flow
[2024-03-12 01:37:26,001 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=354, PETRI_PLACES=134, PETRI_TRANSITIONS=133}
[2024-03-12 01:37:26,001 INFO  L281   CegarLoopForPetriNet]: 128 programPoint places, 6 predicate places.
[2024-03-12 01:37:26,001 INFO  L495      AbstractCegarLoop]: Abstraction has has 134 places, 133 transitions, 354 flow
[2024-03-12 01:37:26,002 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 96.16666666666667) internal successors, (577), 6 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:26,002 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:37:26,002 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]
[2024-03-12 01:37:26,002 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-03-12 01:37:26,002 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-12 01:37:26,002 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:37:26,002 INFO  L85        PathProgramCache]: Analyzing trace with hash -422723088, now seen corresponding path program 1 times
[2024-03-12 01:37:26,003 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:37:26,003 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930380461]
[2024-03-12 01:37:26,003 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:37:26,003 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:37:26,011 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:37:26,024 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:37:26,024 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:37:26,024 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930380461]
[2024-03-12 01:37:26,024 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930380461] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:37:26,024 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:37:26,024 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 01:37:26,025 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992561376]
[2024-03-12 01:37:26,025 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:37:26,025 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 01:37:26,025 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:37:26,026 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 01:37:26,026 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 01:37:26,035 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 112 out of 128
[2024-03-12 01:37:26,035 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 133 transitions, 354 flow. Second operand  has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:26,035 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:37:26,035 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 128
[2024-03-12 01:37:26,035 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:37:26,123 INFO  L124   PetriNetUnfolderBase]: 120/888 cut-off events.
[2024-03-12 01:37:26,123 INFO  L125   PetriNetUnfolderBase]: For 88/131 co-relation queries the response was YES.
[2024-03-12 01:37:26,124 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1277 conditions, 888 events. 120/888 cut-off events. For 88/131 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 5284 event pairs, 50 based on Foata normal form. 0/798 useless extension candidates. Maximal degree in co-relation 1052. Up to 139 conditions per place. 
[2024-03-12 01:37:26,127 INFO  L140   encePairwiseOnDemand]: 123/128 looper letters, 16 selfloop transitions, 4 changer transitions 4/140 dead transitions.
[2024-03-12 01:37:26,127 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 140 transitions, 408 flow
[2024-03-12 01:37:26,127 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 01:37:26,128 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 01:37:26,128 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 357 transitions.
[2024-03-12 01:37:26,129 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9296875
[2024-03-12 01:37:26,129 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 357 transitions.
[2024-03-12 01:37:26,129 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 357 transitions.
[2024-03-12 01:37:26,129 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:37:26,129 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 357 transitions.
[2024-03-12 01:37:26,130 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:26,131 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:26,131 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:26,131 INFO  L175             Difference]: Start difference. First operand has 134 places, 133 transitions, 354 flow. Second operand 3 states and 357 transitions.
[2024-03-12 01:37:26,131 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 140 transitions, 408 flow
[2024-03-12 01:37:26,133 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 140 transitions, 404 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-12 01:37:26,134 INFO  L231             Difference]: Finished difference. Result has 136 places, 132 transitions, 358 flow
[2024-03-12 01:37:26,135 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=358, PETRI_PLACES=136, PETRI_TRANSITIONS=132}
[2024-03-12 01:37:26,135 INFO  L281   CegarLoopForPetriNet]: 128 programPoint places, 8 predicate places.
[2024-03-12 01:37:26,135 INFO  L495      AbstractCegarLoop]: Abstraction has has 136 places, 132 transitions, 358 flow
[2024-03-12 01:37:26,135 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:26,136 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:37:26,136 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]
[2024-03-12 01:37:26,136 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-03-12 01:37:26,136 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-12 01:37:26,136 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:37:26,136 INFO  L85        PathProgramCache]: Analyzing trace with hash -1044684349, now seen corresponding path program 1 times
[2024-03-12 01:37:26,136 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:37:26,137 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15106467]
[2024-03-12 01:37:26,137 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:37:26,137 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:37:26,146 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:37:26,199 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:37:26,199 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:37:26,199 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15106467]
[2024-03-12 01:37:26,199 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15106467] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:37:26,199 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:37:26,199 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 01:37:26,200 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804548729]
[2024-03-12 01:37:26,200 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:37:26,200 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-03-12 01:37:26,200 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:37:26,201 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-03-12 01:37:26,201 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-03-12 01:37:26,261 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 106 out of 128
[2024-03-12 01:37:26,262 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 132 transitions, 358 flow. Second operand  has 5 states, 5 states have (on average 107.4) internal successors, (537), 5 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:26,262 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:37:26,262 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 128
[2024-03-12 01:37:26,262 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:37:26,396 INFO  L124   PetriNetUnfolderBase]: 187/1317 cut-off events.
[2024-03-12 01:37:26,396 INFO  L125   PetriNetUnfolderBase]: For 68/69 co-relation queries the response was YES.
[2024-03-12 01:37:26,399 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1916 conditions, 1317 events. 187/1317 cut-off events. For 68/69 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 9531 event pairs, 131 based on Foata normal form. 1/1224 useless extension candidates. Maximal degree in co-relation 1287. Up to 313 conditions per place. 
[2024-03-12 01:37:26,402 INFO  L140   encePairwiseOnDemand]: 121/128 looper letters, 20 selfloop transitions, 2 changer transitions 4/135 dead transitions.
[2024-03-12 01:37:26,403 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 135 transitions, 402 flow
[2024-03-12 01:37:26,403 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 01:37:26,403 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 01:37:26,404 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 663 transitions.
[2024-03-12 01:37:26,405 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.86328125
[2024-03-12 01:37:26,405 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 663 transitions.
[2024-03-12 01:37:26,405 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 663 transitions.
[2024-03-12 01:37:26,405 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:37:26,405 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 663 transitions.
[2024-03-12 01:37:26,406 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 110.5) internal successors, (663), 6 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:26,408 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 128.0) internal successors, (896), 7 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:26,408 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 128.0) internal successors, (896), 7 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:26,408 INFO  L175             Difference]: Start difference. First operand has 136 places, 132 transitions, 358 flow. Second operand 6 states and 663 transitions.
[2024-03-12 01:37:26,408 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 135 transitions, 402 flow
[2024-03-12 01:37:26,410 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 135 transitions, 380 flow, removed 7 selfloop flow, removed 2 redundant places.
[2024-03-12 01:37:26,411 INFO  L231             Difference]: Finished difference. Result has 143 places, 129 transitions, 334 flow
[2024-03-12 01:37:26,411 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=334, PETRI_PLACES=143, PETRI_TRANSITIONS=129}
[2024-03-12 01:37:26,412 INFO  L281   CegarLoopForPetriNet]: 128 programPoint places, 15 predicate places.
[2024-03-12 01:37:26,412 INFO  L495      AbstractCegarLoop]: Abstraction has has 143 places, 129 transitions, 334 flow
[2024-03-12 01:37:26,412 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 107.4) internal successors, (537), 5 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:26,412 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:37:26,412 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]
[2024-03-12 01:37:26,413 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-03-12 01:37:26,413 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-12 01:37:26,413 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:37:26,413 INFO  L85        PathProgramCache]: Analyzing trace with hash -1351165423, now seen corresponding path program 1 times
[2024-03-12 01:37:26,413 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:37:26,413 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096293930]
[2024-03-12 01:37:26,413 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:37:26,413 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:37:26,426 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:37:26,445 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:37:26,445 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:37:26,445 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096293930]
[2024-03-12 01:37:26,446 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096293930] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:37:26,446 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:37:26,446 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 01:37:26,446 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133037063]
[2024-03-12 01:37:26,446 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:37:26,446 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 01:37:26,447 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:37:26,447 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 01:37:26,447 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 01:37:26,460 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 110 out of 128
[2024-03-12 01:37:26,460 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 129 transitions, 334 flow. Second operand  has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:26,461 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:37:26,461 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 128
[2024-03-12 01:37:26,461 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:37:26,611 INFO  L124   PetriNetUnfolderBase]: 172/1228 cut-off events.
[2024-03-12 01:37:26,611 INFO  L125   PetriNetUnfolderBase]: For 203/446 co-relation queries the response was YES.
[2024-03-12 01:37:26,613 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1870 conditions, 1228 events. 172/1228 cut-off events. For 203/446 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 8860 event pairs, 77 based on Foata normal form. 3/1082 useless extension candidates. Maximal degree in co-relation 1800. Up to 270 conditions per place. 
[2024-03-12 01:37:26,617 INFO  L140   encePairwiseOnDemand]: 122/128 looper letters, 19 selfloop transitions, 7 changer transitions 0/138 dead transitions.
[2024-03-12 01:37:26,617 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 138 transitions, 418 flow
[2024-03-12 01:37:26,617 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 01:37:26,617 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 01:37:26,618 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 354 transitions.
[2024-03-12 01:37:26,618 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.921875
[2024-03-12 01:37:26,618 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 354 transitions.
[2024-03-12 01:37:26,619 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 354 transitions.
[2024-03-12 01:37:26,619 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:37:26,619 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 354 transitions.
[2024-03-12 01:37:26,620 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:26,620 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:26,621 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:26,621 INFO  L175             Difference]: Start difference. First operand has 143 places, 129 transitions, 334 flow. Second operand 3 states and 354 transitions.
[2024-03-12 01:37:26,621 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 138 transitions, 418 flow
[2024-03-12 01:37:26,622 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 138 transitions, 406 flow, removed 5 selfloop flow, removed 4 redundant places.
[2024-03-12 01:37:26,624 INFO  L231             Difference]: Finished difference. Result has 140 places, 134 transitions, 378 flow
[2024-03-12 01:37:26,624 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=378, PETRI_PLACES=140, PETRI_TRANSITIONS=134}
[2024-03-12 01:37:26,625 INFO  L281   CegarLoopForPetriNet]: 128 programPoint places, 12 predicate places.
[2024-03-12 01:37:26,625 INFO  L495      AbstractCegarLoop]: Abstraction has has 140 places, 134 transitions, 378 flow
[2024-03-12 01:37:26,625 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:26,625 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:37:26,625 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]
[2024-03-12 01:37:26,625 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-03-12 01:37:26,626 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-12 01:37:26,626 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:37:26,626 INFO  L85        PathProgramCache]: Analyzing trace with hash -1764200252, now seen corresponding path program 1 times
[2024-03-12 01:37:26,626 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:37:26,626 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586185326]
[2024-03-12 01:37:26,626 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:37:26,626 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:37:26,642 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:37:26,860 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-12 01:37:26,860 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:37:26,860 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586185326]
[2024-03-12 01:37:26,860 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586185326] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:37:26,860 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:37:26,861 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 01:37:26,861 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691839986]
[2024-03-12 01:37:26,861 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:37:26,861 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-12 01:37:26,861 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:37:26,862 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-12 01:37:26,862 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-12 01:37:27,011 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 104 out of 128
[2024-03-12 01:37:27,012 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 134 transitions, 378 flow. Second operand  has 6 states, 6 states have (on average 105.5) internal successors, (633), 6 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:27,013 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:37:27,013 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 128
[2024-03-12 01:37:27,013 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:37:27,217 INFO  L124   PetriNetUnfolderBase]: 305/1642 cut-off events.
[2024-03-12 01:37:27,218 INFO  L125   PetriNetUnfolderBase]: For 244/262 co-relation queries the response was YES.
[2024-03-12 01:37:27,221 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2680 conditions, 1642 events. 305/1642 cut-off events. For 244/262 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 12875 event pairs, 131 based on Foata normal form. 2/1516 useless extension candidates. Maximal degree in co-relation 2244. Up to 287 conditions per place. 
[2024-03-12 01:37:27,225 INFO  L140   encePairwiseOnDemand]: 122/128 looper letters, 31 selfloop transitions, 5 changer transitions 0/149 dead transitions.
[2024-03-12 01:37:27,225 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 149 transitions, 480 flow
[2024-03-12 01:37:27,226 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 01:37:27,226 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 01:37:27,227 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 661 transitions.
[2024-03-12 01:37:27,228 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8606770833333334
[2024-03-12 01:37:27,228 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 661 transitions.
[2024-03-12 01:37:27,228 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 661 transitions.
[2024-03-12 01:37:27,228 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:37:27,229 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 661 transitions.
[2024-03-12 01:37:27,230 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 110.16666666666667) internal successors, (661), 6 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:27,231 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 128.0) internal successors, (896), 7 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:27,231 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 128.0) internal successors, (896), 7 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:27,231 INFO  L175             Difference]: Start difference. First operand has 140 places, 134 transitions, 378 flow. Second operand 6 states and 661 transitions.
[2024-03-12 01:37:27,231 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 149 transitions, 480 flow
[2024-03-12 01:37:27,233 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 149 transitions, 466 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-12 01:37:27,235 INFO  L231             Difference]: Finished difference. Result has 142 places, 133 transitions, 372 flow
[2024-03-12 01:37:27,235 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=372, PETRI_PLACES=142, PETRI_TRANSITIONS=133}
[2024-03-12 01:37:27,235 INFO  L281   CegarLoopForPetriNet]: 128 programPoint places, 14 predicate places.
[2024-03-12 01:37:27,235 INFO  L495      AbstractCegarLoop]: Abstraction has has 142 places, 133 transitions, 372 flow
[2024-03-12 01:37:27,236 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 105.5) internal successors, (633), 6 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:27,236 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:37:27,236 INFO  L208   CegarLoopForPetriNet]: trace histogram [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]
[2024-03-12 01:37:27,236 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-03-12 01:37:27,236 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-12 01:37:27,237 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:37:27,237 INFO  L85        PathProgramCache]: Analyzing trace with hash -1564481087, now seen corresponding path program 1 times
[2024-03-12 01:37:27,237 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:37:27,237 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645741263]
[2024-03-12 01:37:27,237 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:37:27,237 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:37:27,249 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:37:27,272 INFO  L134       CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked.
[2024-03-12 01:37:27,272 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:37:27,272 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645741263]
[2024-03-12 01:37:27,272 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645741263] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:37:27,272 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:37:27,273 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 01:37:27,273 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205525153]
[2024-03-12 01:37:27,273 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:37:27,273 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 01:37:27,274 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:37:27,274 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 01:37:27,274 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 01:37:27,289 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 110 out of 128
[2024-03-12 01:37:27,289 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 133 transitions, 372 flow. Second operand  has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:27,289 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:37:27,289 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 128
[2024-03-12 01:37:27,290 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:37:27,457 INFO  L124   PetriNetUnfolderBase]: 236/1653 cut-off events.
[2024-03-12 01:37:27,457 INFO  L125   PetriNetUnfolderBase]: For 572/2029 co-relation queries the response was YES.
[2024-03-12 01:37:27,460 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2796 conditions, 1653 events. 236/1653 cut-off events. For 572/2029 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 13639 event pairs, 93 based on Foata normal form. 2/1501 useless extension candidates. Maximal degree in co-relation 2511. Up to 351 conditions per place. 
[2024-03-12 01:37:27,463 INFO  L140   encePairwiseOnDemand]: 122/128 looper letters, 19 selfloop transitions, 10 changer transitions 0/142 dead transitions.
[2024-03-12 01:37:27,463 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 142 transitions, 467 flow
[2024-03-12 01:37:27,464 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 01:37:27,464 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 01:37:27,465 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 353 transitions.
[2024-03-12 01:37:27,465 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9192708333333334
[2024-03-12 01:37:27,465 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 353 transitions.
[2024-03-12 01:37:27,465 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 353 transitions.
[2024-03-12 01:37:27,465 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:37:27,465 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 353 transitions.
[2024-03-12 01:37:27,466 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:27,467 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:27,467 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:27,467 INFO  L175             Difference]: Start difference. First operand has 142 places, 133 transitions, 372 flow. Second operand 3 states and 353 transitions.
[2024-03-12 01:37:27,467 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 142 transitions, 467 flow
[2024-03-12 01:37:27,469 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 142 transitions, 457 flow, removed 0 selfloop flow, removed 5 redundant places.
[2024-03-12 01:37:27,470 INFO  L231             Difference]: Finished difference. Result has 141 places, 139 transitions, 444 flow
[2024-03-12 01:37:27,470 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=444, PETRI_PLACES=141, PETRI_TRANSITIONS=139}
[2024-03-12 01:37:27,471 INFO  L281   CegarLoopForPetriNet]: 128 programPoint places, 13 predicate places.
[2024-03-12 01:37:27,471 INFO  L495      AbstractCegarLoop]: Abstraction has has 141 places, 139 transitions, 444 flow
[2024-03-12 01:37:27,471 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:27,471 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:37:27,471 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]
[2024-03-12 01:37:27,472 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-03-12 01:37:27,472 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-12 01:37:27,472 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:37:27,472 INFO  L85        PathProgramCache]: Analyzing trace with hash 1694769532, now seen corresponding path program 1 times
[2024-03-12 01:37:27,472 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:37:27,472 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797987581]
[2024-03-12 01:37:27,472 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:37:27,472 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:37:27,484 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:37:27,535 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:37:27,535 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:37:27,535 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797987581]
[2024-03-12 01:37:27,535 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797987581] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 01:37:27,536 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919023514]
[2024-03-12 01:37:27,536 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:37:27,536 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 01:37:27,536 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 01:37:27,538 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-12 01:37:27,555 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-03-12 01:37:27,635 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:37:27,637 INFO  L262         TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 4 conjunts are in the unsatisfiable core
[2024-03-12 01:37:27,639 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 01:37:27,728 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:37:27,728 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-12 01:37:27,774 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:37:27,774 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1919023514] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-12 01:37:27,774 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-12 01:37:27,774 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9
[2024-03-12 01:37:27,774 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130308531]
[2024-03-12 01:37:27,774 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-12 01:37:27,775 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-03-12 01:37:27,775 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:37:27,775 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-03-12 01:37:27,775 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2024-03-12 01:37:27,866 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 104 out of 128
[2024-03-12 01:37:27,867 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 139 transitions, 444 flow. Second operand  has 9 states, 9 states have (on average 106.33333333333333) internal successors, (957), 9 states have internal predecessors, (957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:27,867 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:37:27,867 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 128
[2024-03-12 01:37:27,867 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:37:28,098 INFO  L124   PetriNetUnfolderBase]: 189/1467 cut-off events.
[2024-03-12 01:37:28,098 INFO  L125   PetriNetUnfolderBase]: For 427/473 co-relation queries the response was YES.
[2024-03-12 01:37:28,101 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2350 conditions, 1467 events. 189/1467 cut-off events. For 427/473 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 10663 event pairs, 62 based on Foata normal form. 0/1411 useless extension candidates. Maximal degree in co-relation 1184. Up to 177 conditions per place. 
[2024-03-12 01:37:28,104 INFO  L140   encePairwiseOnDemand]: 118/128 looper letters, 25 selfloop transitions, 9 changer transitions 12/159 dead transitions.
[2024-03-12 01:37:28,104 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 159 transitions, 556 flow
[2024-03-12 01:37:28,105 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-03-12 01:37:28,105 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-03-12 01:37:28,106 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 878 transitions.
[2024-03-12 01:37:28,106 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.857421875
[2024-03-12 01:37:28,106 INFO  L72            ComplementDD]: Start complementDD. Operand 8 states and 878 transitions.
[2024-03-12 01:37:28,106 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 8 states and 878 transitions.
[2024-03-12 01:37:28,107 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:37:28,107 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 878 transitions.
[2024-03-12 01:37:28,109 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 9 states, 8 states have (on average 109.75) internal successors, (878), 8 states have internal predecessors, (878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:28,110 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 9 states, 9 states have (on average 128.0) internal successors, (1152), 9 states have internal predecessors, (1152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:28,110 INFO  L81            ComplementDD]: Finished complementDD. Result  has 9 states, 9 states have (on average 128.0) internal successors, (1152), 9 states have internal predecessors, (1152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:28,110 INFO  L175             Difference]: Start difference. First operand has 141 places, 139 transitions, 444 flow. Second operand 8 states and 878 transitions.
[2024-03-12 01:37:28,110 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 159 transitions, 556 flow
[2024-03-12 01:37:28,112 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 159 transitions, 542 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-12 01:37:28,114 INFO  L231             Difference]: Finished difference. Result has 149 places, 137 transitions, 435 flow
[2024-03-12 01:37:28,114 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=435, PETRI_PLACES=149, PETRI_TRANSITIONS=137}
[2024-03-12 01:37:28,114 INFO  L281   CegarLoopForPetriNet]: 128 programPoint places, 21 predicate places.
[2024-03-12 01:37:28,115 INFO  L495      AbstractCegarLoop]: Abstraction has has 149 places, 137 transitions, 435 flow
[2024-03-12 01:37:28,115 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 106.33333333333333) internal successors, (957), 9 states have internal predecessors, (957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:28,115 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:37:28,115 INFO  L208   CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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]
[2024-03-12 01:37:28,129 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2024-03-12 01:37:28,316 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,2 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 01:37:28,316 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-12 01:37:28,317 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:37:28,317 INFO  L85        PathProgramCache]: Analyzing trace with hash 202870155, now seen corresponding path program 1 times
[2024-03-12 01:37:28,317 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:37:28,317 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641113596]
[2024-03-12 01:37:28,318 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:37:28,318 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:37:28,343 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-12 01:37:28,343 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-03-12 01:37:28,352 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-12 01:37:28,359 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-03-12 01:37:28,359 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-03-12 01:37:28,360 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining)
[2024-03-12 01:37:28,360 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining)
[2024-03-12 01:37:28,360 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining)
[2024-03-12 01:37:28,360 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining)
[2024-03-12 01:37:28,360 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining)
[2024-03-12 01:37:28,360 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining)
[2024-03-12 01:37:28,360 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining)
[2024-03-12 01:37:28,360 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining)
[2024-03-12 01:37:28,360 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining)
[2024-03-12 01:37:28,361 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-03-12 01:37:28,361 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:37:28,361 WARN  L233   ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-03-12 01:37:28,361 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances.
[2024-03-12 01:37:28,374 INFO  L144    ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions.
[2024-03-12 01:37:28,376 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 147 places, 146 transitions, 319 flow
[2024-03-12 01:37:28,405 INFO  L124   PetriNetUnfolderBase]: 21/494 cut-off events.
[2024-03-12 01:37:28,405 INFO  L125   PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES.
[2024-03-12 01:37:28,406 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 519 conditions, 494 events. 21/494 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1475 event pairs, 1 based on Foata normal form. 0/430 useless extension candidates. Maximal degree in co-relation 292. Up to 16 conditions per place. 
[2024-03-12 01:37:28,406 INFO  L82        GeneralOperation]: Start removeDead. Operand has 147 places, 146 transitions, 319 flow
[2024-03-12 01:37:28,408 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 147 places, 146 transitions, 319 flow
[2024-03-12 01:37:28,409 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-12 01:37:28,410 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;@104c922d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-03-12 01:37:28,410 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 10 error locations.
[2024-03-12 01:37:28,412 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-03-12 01:37:28,412 INFO  L124   PetriNetUnfolderBase]: 3/52 cut-off events.
[2024-03-12 01:37:28,413 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-03-12 01:37:28,413 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:37:28,413 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]
[2024-03-12 01:37:28,413 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-12 01:37:28,413 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:37:28,413 INFO  L85        PathProgramCache]: Analyzing trace with hash -1800308143, now seen corresponding path program 1 times
[2024-03-12 01:37:28,413 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:37:28,413 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219130189]
[2024-03-12 01:37:28,413 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:37:28,414 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:37:28,422 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:37:28,572 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:37:28,573 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:37:28,573 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219130189]
[2024-03-12 01:37:28,573 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219130189] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:37:28,573 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:37:28,573 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 01:37:28,573 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697802207]
[2024-03-12 01:37:28,573 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:37:28,573 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-12 01:37:28,574 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:37:28,574 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-12 01:37:28,574 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-12 01:37:28,712 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 109 out of 146
[2024-03-12 01:37:28,713 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 146 transitions, 319 flow. Second operand  has 6 states, 6 states have (on average 110.16666666666667) internal successors, (661), 6 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:28,713 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:37:28,713 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 146
[2024-03-12 01:37:28,713 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:37:29,347 INFO  L124   PetriNetUnfolderBase]: 1609/7822 cut-off events.
[2024-03-12 01:37:29,347 INFO  L125   PetriNetUnfolderBase]: For 217/217 co-relation queries the response was YES.
[2024-03-12 01:37:29,361 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10579 conditions, 7822 events. 1609/7822 cut-off events. For 217/217 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 82499 event pairs, 1387 based on Foata normal form. 80/7310 useless extension candidates. Maximal degree in co-relation 3416. Up to 2326 conditions per place. 
[2024-03-12 01:37:29,384 INFO  L140   encePairwiseOnDemand]: 127/146 looper letters, 36 selfloop transitions, 13 changer transitions 1/158 dead transitions.
[2024-03-12 01:37:29,384 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 158 transitions, 441 flow
[2024-03-12 01:37:29,385 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 01:37:29,385 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 01:37:29,386 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 711 transitions.
[2024-03-12 01:37:29,386 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8116438356164384
[2024-03-12 01:37:29,386 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 711 transitions.
[2024-03-12 01:37:29,386 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 711 transitions.
[2024-03-12 01:37:29,387 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:37:29,387 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 711 transitions.
[2024-03-12 01:37:29,388 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 118.5) internal successors, (711), 6 states have internal predecessors, (711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:29,389 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 146.0) internal successors, (1022), 7 states have internal predecessors, (1022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:29,389 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 146.0) internal successors, (1022), 7 states have internal predecessors, (1022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:29,390 INFO  L175             Difference]: Start difference. First operand has 147 places, 146 transitions, 319 flow. Second operand 6 states and 711 transitions.
[2024-03-12 01:37:29,390 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 158 transitions, 441 flow
[2024-03-12 01:37:29,390 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 158 transitions, 441 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-12 01:37:29,392 INFO  L231             Difference]: Finished difference. Result has 153 places, 151 transitions, 401 flow
[2024-03-12 01:37:29,392 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=146, PETRI_DIFFERENCE_MINUEND_FLOW=307, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=401, PETRI_PLACES=153, PETRI_TRANSITIONS=151}
[2024-03-12 01:37:29,392 INFO  L281   CegarLoopForPetriNet]: 147 programPoint places, 6 predicate places.
[2024-03-12 01:37:29,393 INFO  L495      AbstractCegarLoop]: Abstraction has has 153 places, 151 transitions, 401 flow
[2024-03-12 01:37:29,393 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 110.16666666666667) internal successors, (661), 6 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:29,393 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:37:29,393 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]
[2024-03-12 01:37:29,393 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-03-12 01:37:29,393 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-12 01:37:29,393 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:37:29,393 INFO  L85        PathProgramCache]: Analyzing trace with hash -1174724304, now seen corresponding path program 1 times
[2024-03-12 01:37:29,394 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:37:29,394 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248906137]
[2024-03-12 01:37:29,394 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:37:29,394 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:37:29,401 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:37:29,412 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:37:29,413 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:37:29,413 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248906137]
[2024-03-12 01:37:29,413 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248906137] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:37:29,413 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:37:29,413 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 01:37:29,413 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743863382]
[2024-03-12 01:37:29,413 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:37:29,414 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 01:37:29,414 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:37:29,414 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 01:37:29,414 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 01:37:29,437 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 125 out of 146
[2024-03-12 01:37:29,437 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 151 transitions, 401 flow. Second operand  has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:29,438 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:37:29,438 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 146
[2024-03-12 01:37:29,438 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:37:29,942 INFO  L124   PetriNetUnfolderBase]: 1072/4728 cut-off events.
[2024-03-12 01:37:29,942 INFO  L125   PetriNetUnfolderBase]: For 465/813 co-relation queries the response was YES.
[2024-03-12 01:37:29,951 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7064 conditions, 4728 events. 1072/4728 cut-off events. For 465/813 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 43803 event pairs, 542 based on Foata normal form. 0/4245 useless extension candidates. Maximal degree in co-relation 6338. Up to 1110 conditions per place. 
[2024-03-12 01:37:29,962 INFO  L140   encePairwiseOnDemand]: 140/146 looper letters, 23 selfloop transitions, 5 changer transitions 4/161 dead transitions.
[2024-03-12 01:37:29,962 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 161 transitions, 477 flow
[2024-03-12 01:37:29,962 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 01:37:29,962 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 01:37:29,963 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 404 transitions.
[2024-03-12 01:37:29,963 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9223744292237442
[2024-03-12 01:37:29,963 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 404 transitions.
[2024-03-12 01:37:29,963 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 404 transitions.
[2024-03-12 01:37:29,964 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:37:29,964 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 404 transitions.
[2024-03-12 01:37:29,964 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:29,965 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 146.0) internal successors, (584), 4 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:29,965 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 146.0) internal successors, (584), 4 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:29,966 INFO  L175             Difference]: Start difference. First operand has 153 places, 151 transitions, 401 flow. Second operand 3 states and 404 transitions.
[2024-03-12 01:37:29,966 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 161 transitions, 477 flow
[2024-03-12 01:37:29,972 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 161 transitions, 473 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-12 01:37:29,974 INFO  L231             Difference]: Finished difference. Result has 155 places, 151 transitions, 413 flow
[2024-03-12 01:37:29,974 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=146, PETRI_DIFFERENCE_MINUEND_FLOW=397, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=413, PETRI_PLACES=155, PETRI_TRANSITIONS=151}
[2024-03-12 01:37:29,974 INFO  L281   CegarLoopForPetriNet]: 147 programPoint places, 8 predicate places.
[2024-03-12 01:37:29,975 INFO  L495      AbstractCegarLoop]: Abstraction has has 155 places, 151 transitions, 413 flow
[2024-03-12 01:37:29,975 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:29,975 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:37:29,975 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]
[2024-03-12 01:37:29,975 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-03-12 01:37:29,975 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-12 01:37:29,976 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:37:29,976 INFO  L85        PathProgramCache]: Analyzing trace with hash 1413081877, now seen corresponding path program 1 times
[2024-03-12 01:37:29,976 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:37:29,976 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509260394]
[2024-03-12 01:37:29,976 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:37:29,976 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:37:29,985 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:37:30,026 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:37:30,027 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:37:30,027 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509260394]
[2024-03-12 01:37:30,027 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509260394] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:37:30,027 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:37:30,027 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 01:37:30,027 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127111155]
[2024-03-12 01:37:30,027 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:37:30,027 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-03-12 01:37:30,028 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:37:30,028 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-03-12 01:37:30,028 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-03-12 01:37:30,066 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 120 out of 146
[2024-03-12 01:37:30,067 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 151 transitions, 413 flow. Second operand  has 5 states, 5 states have (on average 121.4) internal successors, (607), 5 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:30,067 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:37:30,067 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 146
[2024-03-12 01:37:30,067 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:37:30,713 INFO  L124   PetriNetUnfolderBase]: 1324/6579 cut-off events.
[2024-03-12 01:37:30,714 INFO  L125   PetriNetUnfolderBase]: For 394/394 co-relation queries the response was YES.
[2024-03-12 01:37:30,733 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9642 conditions, 6579 events. 1324/6579 cut-off events. For 394/394 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 66281 event pairs, 765 based on Foata normal form. 1/5859 useless extension candidates. Maximal degree in co-relation 5883. Up to 1710 conditions per place. 
[2024-03-12 01:37:30,751 INFO  L140   encePairwiseOnDemand]: 139/146 looper letters, 24 selfloop transitions, 2 changer transitions 4/154 dead transitions.
[2024-03-12 01:37:30,751 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 154 transitions, 465 flow
[2024-03-12 01:37:30,751 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 01:37:30,752 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 01:37:30,753 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 751 transitions.
[2024-03-12 01:37:30,753 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8573059360730594
[2024-03-12 01:37:30,753 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 751 transitions.
[2024-03-12 01:37:30,753 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 751 transitions.
[2024-03-12 01:37:30,754 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:37:30,754 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 751 transitions.
[2024-03-12 01:37:30,755 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 125.16666666666667) internal successors, (751), 6 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:30,756 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 146.0) internal successors, (1022), 7 states have internal predecessors, (1022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:30,757 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 146.0) internal successors, (1022), 7 states have internal predecessors, (1022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:30,757 INFO  L175             Difference]: Start difference. First operand has 155 places, 151 transitions, 413 flow. Second operand 6 states and 751 transitions.
[2024-03-12 01:37:30,757 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 154 transitions, 465 flow
[2024-03-12 01:37:30,763 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 154 transitions, 441 flow, removed 7 selfloop flow, removed 2 redundant places.
[2024-03-12 01:37:30,764 INFO  L231             Difference]: Finished difference. Result has 162 places, 148 transitions, 387 flow
[2024-03-12 01:37:30,765 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=146, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=387, PETRI_PLACES=162, PETRI_TRANSITIONS=148}
[2024-03-12 01:37:30,765 INFO  L281   CegarLoopForPetriNet]: 147 programPoint places, 15 predicate places.
[2024-03-12 01:37:30,765 INFO  L495      AbstractCegarLoop]: Abstraction has has 162 places, 148 transitions, 387 flow
[2024-03-12 01:37:30,765 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 121.4) internal successors, (607), 5 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:30,766 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:37:30,766 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]
[2024-03-12 01:37:30,766 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-03-12 01:37:30,766 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-12 01:37:30,766 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:37:30,766 INFO  L85        PathProgramCache]: Analyzing trace with hash 13631731, now seen corresponding path program 1 times
[2024-03-12 01:37:30,766 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:37:30,766 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45924184]
[2024-03-12 01:37:30,766 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:37:30,767 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:37:30,778 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:37:30,802 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:37:30,802 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:37:30,802 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45924184]
[2024-03-12 01:37:30,802 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45924184] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:37:30,802 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:37:30,803 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 01:37:30,803 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88020314]
[2024-03-12 01:37:30,803 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:37:30,803 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 01:37:30,804 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:37:30,804 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 01:37:30,804 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 01:37:30,819 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 123 out of 146
[2024-03-12 01:37:30,819 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 148 transitions, 387 flow. Second operand  has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:30,819 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:37:30,819 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 146
[2024-03-12 01:37:30,820 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:37:31,488 INFO  L124   PetriNetUnfolderBase]: 1718/7521 cut-off events.
[2024-03-12 01:37:31,488 INFO  L125   PetriNetUnfolderBase]: For 1480/4560 co-relation queries the response was YES.
[2024-03-12 01:37:31,516 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12122 conditions, 7521 events. 1718/7521 cut-off events. For 1480/4560 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 80237 event pairs, 957 based on Foata normal form. 7/6675 useless extension candidates. Maximal degree in co-relation 12051. Up to 2225 conditions per place. 
[2024-03-12 01:37:31,538 INFO  L140   encePairwiseOnDemand]: 139/146 looper letters, 29 selfloop transitions, 9 changer transitions 0/163 dead transitions.
[2024-03-12 01:37:31,538 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 163 transitions, 521 flow
[2024-03-12 01:37:31,539 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 01:37:31,539 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 01:37:31,540 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 403 transitions.
[2024-03-12 01:37:31,540 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9200913242009132
[2024-03-12 01:37:31,540 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 403 transitions.
[2024-03-12 01:37:31,540 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 403 transitions.
[2024-03-12 01:37:31,540 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:37:31,540 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 403 transitions.
[2024-03-12 01:37:31,541 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:31,542 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 146.0) internal successors, (584), 4 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:31,542 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 146.0) internal successors, (584), 4 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:31,542 INFO  L175             Difference]: Start difference. First operand has 162 places, 148 transitions, 387 flow. Second operand 3 states and 403 transitions.
[2024-03-12 01:37:31,542 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 163 transitions, 521 flow
[2024-03-12 01:37:31,546 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 163 transitions, 509 flow, removed 5 selfloop flow, removed 4 redundant places.
[2024-03-12 01:37:31,548 INFO  L231             Difference]: Finished difference. Result has 159 places, 155 transitions, 451 flow
[2024-03-12 01:37:31,548 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=146, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=451, PETRI_PLACES=159, PETRI_TRANSITIONS=155}
[2024-03-12 01:37:31,548 INFO  L281   CegarLoopForPetriNet]: 147 programPoint places, 12 predicate places.
[2024-03-12 01:37:31,549 INFO  L495      AbstractCegarLoop]: Abstraction has has 159 places, 155 transitions, 451 flow
[2024-03-12 01:37:31,549 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:31,549 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:37:31,549 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]
[2024-03-12 01:37:31,549 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-03-12 01:37:31,549 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-12 01:37:31,549 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:37:31,549 INFO  L85        PathProgramCache]: Analyzing trace with hash -1842448300, now seen corresponding path program 1 times
[2024-03-12 01:37:31,549 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:37:31,550 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920501740]
[2024-03-12 01:37:31,550 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:37:31,550 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:37:31,561 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:37:31,746 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-12 01:37:31,746 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:37:31,746 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920501740]
[2024-03-12 01:37:31,746 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920501740] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:37:31,746 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:37:31,747 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 01:37:31,747 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870571135]
[2024-03-12 01:37:31,747 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:37:31,747 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-12 01:37:31,747 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:37:31,747 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-12 01:37:31,748 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-12 01:37:31,900 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 118 out of 146
[2024-03-12 01:37:31,901 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 155 transitions, 451 flow. Second operand  has 6 states, 6 states have (on average 119.5) internal successors, (717), 6 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:31,901 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:37:31,902 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 146
[2024-03-12 01:37:31,902 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:37:32,750 INFO  L124   PetriNetUnfolderBase]: 2597/9499 cut-off events.
[2024-03-12 01:37:32,750 INFO  L125   PetriNetUnfolderBase]: For 1430/1682 co-relation queries the response was YES.
[2024-03-12 01:37:32,776 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16000 conditions, 9499 events. 2597/9499 cut-off events. For 1430/1682 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 101276 event pairs, 1164 based on Foata normal form. 17/8528 useless extension candidates. Maximal degree in co-relation 13467. Up to 1870 conditions per place. 
[2024-03-12 01:37:32,798 INFO  L140   encePairwiseOnDemand]: 140/146 looper letters, 43 selfloop transitions, 5 changer transitions 0/178 dead transitions.
[2024-03-12 01:37:32,798 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 178 transitions, 593 flow
[2024-03-12 01:37:32,799 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 01:37:32,799 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 01:37:32,800 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 757 transitions.
[2024-03-12 01:37:32,800 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8641552511415526
[2024-03-12 01:37:32,801 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 757 transitions.
[2024-03-12 01:37:32,801 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 757 transitions.
[2024-03-12 01:37:32,801 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:37:32,801 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 757 transitions.
[2024-03-12 01:37:32,802 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 126.16666666666667) internal successors, (757), 6 states have internal predecessors, (757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:32,803 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 146.0) internal successors, (1022), 7 states have internal predecessors, (1022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:32,804 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 146.0) internal successors, (1022), 7 states have internal predecessors, (1022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:32,804 INFO  L175             Difference]: Start difference. First operand has 159 places, 155 transitions, 451 flow. Second operand 6 states and 757 transitions.
[2024-03-12 01:37:32,804 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 178 transitions, 593 flow
[2024-03-12 01:37:32,810 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 178 transitions, 575 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-12 01:37:32,812 INFO  L231             Difference]: Finished difference. Result has 161 places, 154 transitions, 441 flow
[2024-03-12 01:37:32,812 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=146, PETRI_DIFFERENCE_MINUEND_FLOW=431, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=441, PETRI_PLACES=161, PETRI_TRANSITIONS=154}
[2024-03-12 01:37:32,813 INFO  L281   CegarLoopForPetriNet]: 147 programPoint places, 14 predicate places.
[2024-03-12 01:37:32,813 INFO  L495      AbstractCegarLoop]: Abstraction has has 161 places, 154 transitions, 441 flow
[2024-03-12 01:37:32,813 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 119.5) internal successors, (717), 6 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:32,813 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:37:32,813 INFO  L208   CegarLoopForPetriNet]: trace histogram [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]
[2024-03-12 01:37:32,813 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-03-12 01:37:32,813 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-12 01:37:32,814 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:37:32,814 INFO  L85        PathProgramCache]: Analyzing trace with hash -1300017215, now seen corresponding path program 1 times
[2024-03-12 01:37:32,814 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:37:32,814 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201383293]
[2024-03-12 01:37:32,814 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:37:32,814 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:37:32,826 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:37:32,842 INFO  L134       CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked.
[2024-03-12 01:37:32,843 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:37:32,843 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201383293]
[2024-03-12 01:37:32,843 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201383293] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:37:32,843 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:37:32,843 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 01:37:32,843 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273456683]
[2024-03-12 01:37:32,843 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:37:32,843 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 01:37:32,843 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:37:32,844 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 01:37:32,844 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 01:37:32,864 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 123 out of 146
[2024-03-12 01:37:32,864 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 154 transitions, 441 flow. Second operand  has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:32,864 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:37:32,864 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 146
[2024-03-12 01:37:32,864 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:37:33,865 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([482] L1031-->L1031-1: Formula: (= |v_#race~data~0_6| 0)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_6|}  AuxVars[]  AssignedVars[#race~data~0][134], [60#L1016-6true, Black: 150#true, Black: 161#true, 192#true, 84#L1016-6true, threadThread1of3ForFork0InUse, Black: 169#(= |ULTIMATE.start_main_~i~0#1| 0), threadThread2of3ForFork0InUse, threadThread3of3ForFork0NotInUse, 185#true, Black: 181#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), Black: 154#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 152#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 92#L1031-1true, Black: 153#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0))])
[2024-03-12 01:37:33,866 INFO  L294   olderBase$Statistics]: this new event has 144 ancestors and is cut-off event
[2024-03-12 01:37:33,866 INFO  L297   olderBase$Statistics]:   existing Event has 93 ancestors and is cut-off event
[2024-03-12 01:37:33,866 INFO  L297   olderBase$Statistics]:   existing Event has 93 ancestors and is cut-off event
[2024-03-12 01:37:33,866 INFO  L297   olderBase$Statistics]:   existing Event has 144 ancestors and is cut-off event
[2024-03-12 01:37:34,009 INFO  L124   PetriNetUnfolderBase]: 2782/11571 cut-off events.
[2024-03-12 01:37:34,009 INFO  L125   PetriNetUnfolderBase]: For 5294/11867 co-relation queries the response was YES.
[2024-03-12 01:37:34,036 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21016 conditions, 11571 events. 2782/11571 cut-off events. For 5294/11867 co-relation queries the response was YES. Maximal size of possible extension queue 522. Compared 133613 event pairs, 1146 based on Foata normal form. 21/10079 useless extension candidates. Maximal degree in co-relation 18431. Up to 3318 conditions per place. 
[2024-03-12 01:37:34,060 INFO  L140   encePairwiseOnDemand]: 139/146 looper letters, 31 selfloop transitions, 14 changer transitions 0/171 dead transitions.
[2024-03-12 01:37:34,060 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 171 transitions, 610 flow
[2024-03-12 01:37:34,061 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 01:37:34,061 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 01:37:34,061 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 402 transitions.
[2024-03-12 01:37:34,062 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9178082191780822
[2024-03-12 01:37:34,062 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 402 transitions.
[2024-03-12 01:37:34,062 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 402 transitions.
[2024-03-12 01:37:34,062 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:37:34,062 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 402 transitions.
[2024-03-12 01:37:34,063 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:34,063 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 146.0) internal successors, (584), 4 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:34,064 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 146.0) internal successors, (584), 4 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:34,064 INFO  L175             Difference]: Start difference. First operand has 161 places, 154 transitions, 441 flow. Second operand 3 states and 402 transitions.
[2024-03-12 01:37:34,064 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 171 transitions, 610 flow
[2024-03-12 01:37:34,072 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 171 transitions, 600 flow, removed 0 selfloop flow, removed 5 redundant places.
[2024-03-12 01:37:34,073 INFO  L231             Difference]: Finished difference. Result has 160 places, 164 transitions, 561 flow
[2024-03-12 01:37:34,073 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=146, PETRI_DIFFERENCE_MINUEND_FLOW=431, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=561, PETRI_PLACES=160, PETRI_TRANSITIONS=164}
[2024-03-12 01:37:34,074 INFO  L281   CegarLoopForPetriNet]: 147 programPoint places, 13 predicate places.
[2024-03-12 01:37:34,074 INFO  L495      AbstractCegarLoop]: Abstraction has has 160 places, 164 transitions, 561 flow
[2024-03-12 01:37:34,074 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:34,074 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:37:34,074 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]
[2024-03-12 01:37:34,074 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-03-12 01:37:34,074 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-12 01:37:34,075 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:37:34,075 INFO  L85        PathProgramCache]: Analyzing trace with hash -1491027490, now seen corresponding path program 1 times
[2024-03-12 01:37:34,075 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:37:34,075 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498456428]
[2024-03-12 01:37:34,075 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:37:34,075 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:37:34,087 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:37:34,141 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:37:34,141 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:37:34,141 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498456428]
[2024-03-12 01:37:34,141 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498456428] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 01:37:34,141 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [127795244]
[2024-03-12 01:37:34,142 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:37:34,142 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 01:37:34,142 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 01:37:34,143 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-12 01:37:34,145 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2024-03-12 01:37:34,255 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:37:34,256 INFO  L262         TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 4 conjunts are in the unsatisfiable core
[2024-03-12 01:37:34,258 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 01:37:34,332 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:37:34,332 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-12 01:37:34,380 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:37:34,380 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [127795244] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-12 01:37:34,380 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-12 01:37:34,380 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9
[2024-03-12 01:37:34,381 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750266272]
[2024-03-12 01:37:34,381 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-12 01:37:34,381 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-03-12 01:37:34,381 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:37:34,381 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-03-12 01:37:34,381 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2024-03-12 01:37:34,469 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 118 out of 146
[2024-03-12 01:37:34,470 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 164 transitions, 561 flow. Second operand  has 9 states, 9 states have (on average 120.33333333333333) internal successors, (1083), 9 states have internal predecessors, (1083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:34,470 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:37:34,470 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 146
[2024-03-12 01:37:34,471 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:37:35,651 INFO  L124   PetriNetUnfolderBase]: 2062/10483 cut-off events.
[2024-03-12 01:37:35,652 INFO  L125   PetriNetUnfolderBase]: For 3523/4166 co-relation queries the response was YES.
[2024-03-12 01:37:35,679 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17464 conditions, 10483 events. 2062/10483 cut-off events. For 3523/4166 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 118176 event pairs, 547 based on Foata normal form. 5/9696 useless extension candidates. Maximal degree in co-relation 9561. Up to 1321 conditions per place. 
[2024-03-12 01:37:35,700 INFO  L140   encePairwiseOnDemand]: 136/146 looper letters, 48 selfloop transitions, 10 changer transitions 0/195 dead transitions.
[2024-03-12 01:37:35,700 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 195 transitions, 740 flow
[2024-03-12 01:37:35,701 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-03-12 01:37:35,701 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-03-12 01:37:35,702 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1003 transitions.
[2024-03-12 01:37:35,702 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8587328767123288
[2024-03-12 01:37:35,702 INFO  L72            ComplementDD]: Start complementDD. Operand 8 states and 1003 transitions.
[2024-03-12 01:37:35,702 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 8 states and 1003 transitions.
[2024-03-12 01:37:35,703 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:37:35,703 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1003 transitions.
[2024-03-12 01:37:35,704 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 9 states, 8 states have (on average 125.375) internal successors, (1003), 8 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:35,706 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 9 states, 9 states have (on average 146.0) internal successors, (1314), 9 states have internal predecessors, (1314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:35,706 INFO  L81            ComplementDD]: Finished complementDD. Result  has 9 states, 9 states have (on average 146.0) internal successors, (1314), 9 states have internal predecessors, (1314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:35,706 INFO  L175             Difference]: Start difference. First operand has 160 places, 164 transitions, 561 flow. Second operand 8 states and 1003 transitions.
[2024-03-12 01:37:35,706 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 195 transitions, 740 flow
[2024-03-12 01:37:35,713 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 195 transitions, 714 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-12 01:37:35,714 INFO  L231             Difference]: Finished difference. Result has 168 places, 166 transitions, 569 flow
[2024-03-12 01:37:35,715 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=146, PETRI_DIFFERENCE_MINUEND_FLOW=525, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=569, PETRI_PLACES=168, PETRI_TRANSITIONS=166}
[2024-03-12 01:37:35,715 INFO  L281   CegarLoopForPetriNet]: 147 programPoint places, 21 predicate places.
[2024-03-12 01:37:35,715 INFO  L495      AbstractCegarLoop]: Abstraction has has 168 places, 166 transitions, 569 flow
[2024-03-12 01:37:35,715 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 120.33333333333333) internal successors, (1083), 9 states have internal predecessors, (1083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:35,716 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:37:35,716 INFO  L208   CegarLoopForPetriNet]: trace histogram [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]
[2024-03-12 01:37:35,724 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2024-03-12 01:37:35,917 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19
[2024-03-12 01:37:35,917 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-12 01:37:35,918 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:37:35,918 INFO  L85        PathProgramCache]: Analyzing trace with hash 1232180181, now seen corresponding path program 1 times
[2024-03-12 01:37:35,918 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:37:35,918 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372729775]
[2024-03-12 01:37:35,918 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:37:35,919 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:37:35,936 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:37:35,977 INFO  L134       CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:37:35,977 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:37:35,977 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372729775]
[2024-03-12 01:37:35,978 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372729775] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:37:35,978 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:37:35,978 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-03-12 01:37:35,978 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528640488]
[2024-03-12 01:37:35,978 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:37:35,978 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 01:37:35,978 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:37:35,979 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 01:37:35,979 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 01:37:35,987 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 130 out of 146
[2024-03-12 01:37:35,987 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 166 transitions, 569 flow. Second operand  has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:35,987 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:37:35,987 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 146
[2024-03-12 01:37:35,988 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:37:36,209 INFO  L124   PetriNetUnfolderBase]: 117/1901 cut-off events.
[2024-03-12 01:37:36,209 INFO  L125   PetriNetUnfolderBase]: For 602/781 co-relation queries the response was YES.
[2024-03-12 01:37:36,213 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3102 conditions, 1901 events. 117/1901 cut-off events. For 602/781 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 15706 event pairs, 43 based on Foata normal form. 24/1845 useless extension candidates. Maximal degree in co-relation 2449. Up to 144 conditions per place. 
[2024-03-12 01:37:36,215 INFO  L140   encePairwiseOnDemand]: 140/146 looper letters, 12 selfloop transitions, 6 changer transitions 0/161 dead transitions.
[2024-03-12 01:37:36,215 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 161 transitions, 556 flow
[2024-03-12 01:37:36,216 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 01:37:36,216 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 01:37:36,217 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 411 transitions.
[2024-03-12 01:37:36,217 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9383561643835616
[2024-03-12 01:37:36,217 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 411 transitions.
[2024-03-12 01:37:36,217 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 411 transitions.
[2024-03-12 01:37:36,217 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:37:36,217 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 411 transitions.
[2024-03-12 01:37:36,218 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:36,219 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 146.0) internal successors, (584), 4 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:36,219 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 146.0) internal successors, (584), 4 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:36,219 INFO  L175             Difference]: Start difference. First operand has 168 places, 166 transitions, 569 flow. Second operand 3 states and 411 transitions.
[2024-03-12 01:37:36,219 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 161 transitions, 556 flow
[2024-03-12 01:37:36,222 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 161 transitions, 546 flow, removed 2 selfloop flow, removed 3 redundant places.
[2024-03-12 01:37:36,223 INFO  L231             Difference]: Finished difference. Result has 167 places, 156 transitions, 491 flow
[2024-03-12 01:37:36,223 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=146, PETRI_DIFFERENCE_MINUEND_FLOW=479, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=491, PETRI_PLACES=167, PETRI_TRANSITIONS=156}
[2024-03-12 01:37:36,224 INFO  L281   CegarLoopForPetriNet]: 147 programPoint places, 20 predicate places.
[2024-03-12 01:37:36,224 INFO  L495      AbstractCegarLoop]: Abstraction has has 167 places, 156 transitions, 491 flow
[2024-03-12 01:37:36,224 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:36,224 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:37:36,224 INFO  L208   CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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]
[2024-03-12 01:37:36,224 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2024-03-12 01:37:36,224 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-12 01:37:36,225 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:37:36,225 INFO  L85        PathProgramCache]: Analyzing trace with hash 946362802, now seen corresponding path program 1 times
[2024-03-12 01:37:36,225 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:37:36,225 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763997784]
[2024-03-12 01:37:36,225 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:37:36,225 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:37:36,238 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:37:36,253 INFO  L134       CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked.
[2024-03-12 01:37:36,253 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:37:36,253 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763997784]
[2024-03-12 01:37:36,253 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763997784] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:37:36,254 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:37:36,254 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 01:37:36,254 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557475160]
[2024-03-12 01:37:36,254 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:37:36,254 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 01:37:36,254 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:37:36,254 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 01:37:36,254 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 01:37:36,267 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 123 out of 146
[2024-03-12 01:37:36,268 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 156 transitions, 491 flow. Second operand  has 3 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-03-12 01:37:36,268 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:37:36,268 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 146
[2024-03-12 01:37:36,268 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:37:36,491 INFO  L124   PetriNetUnfolderBase]: 203/2208 cut-off events.
[2024-03-12 01:37:36,491 INFO  L125   PetriNetUnfolderBase]: For 1365/1861 co-relation queries the response was YES.
[2024-03-12 01:37:36,497 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3998 conditions, 2208 events. 203/2208 cut-off events. For 1365/1861 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 19491 event pairs, 134 based on Foata normal form. 4/2069 useless extension candidates. Maximal degree in co-relation 3287. Up to 435 conditions per place. 
[2024-03-12 01:37:36,499 INFO  L140   encePairwiseOnDemand]: 141/146 looper letters, 25 selfloop transitions, 5 changer transitions 0/161 dead transitions.
[2024-03-12 01:37:36,499 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 161 transitions, 573 flow
[2024-03-12 01:37:36,500 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 01:37:36,500 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 01:37:36,501 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 395 transitions.
[2024-03-12 01:37:36,501 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9018264840182648
[2024-03-12 01:37:36,501 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 395 transitions.
[2024-03-12 01:37:36,501 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 395 transitions.
[2024-03-12 01:37:36,501 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:37:36,501 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 395 transitions.
[2024-03-12 01:37:36,502 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:36,502 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 146.0) internal successors, (584), 4 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:36,503 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 146.0) internal successors, (584), 4 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:36,503 INFO  L175             Difference]: Start difference. First operand has 167 places, 156 transitions, 491 flow. Second operand 3 states and 395 transitions.
[2024-03-12 01:37:36,503 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 161 transitions, 573 flow
[2024-03-12 01:37:36,506 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 161 transitions, 567 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-12 01:37:36,507 INFO  L231             Difference]: Finished difference. Result has 170 places, 159 transitions, 525 flow
[2024-03-12 01:37:36,507 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=146, PETRI_DIFFERENCE_MINUEND_FLOW=485, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=525, PETRI_PLACES=170, PETRI_TRANSITIONS=159}
[2024-03-12 01:37:36,508 INFO  L281   CegarLoopForPetriNet]: 147 programPoint places, 23 predicate places.
[2024-03-12 01:37:36,508 INFO  L495      AbstractCegarLoop]: Abstraction has has 170 places, 159 transitions, 525 flow
[2024-03-12 01:37:36,508 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 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-03-12 01:37:36,508 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:37:36,508 INFO  L208   CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 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-03-12 01:37:36,509 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2024-03-12 01:37:36,509 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-12 01:37:36,509 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:37:36,509 INFO  L85        PathProgramCache]: Analyzing trace with hash 1060851100, now seen corresponding path program 1 times
[2024-03-12 01:37:36,509 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:37:36,509 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803749134]
[2024-03-12 01:37:36,509 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:37:36,509 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:37:36,540 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-12 01:37:36,540 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-03-12 01:37:36,552 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-12 01:37:36,560 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-03-12 01:37:36,561 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-03-12 01:37:36,561 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining)
[2024-03-12 01:37:36,561 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining)
[2024-03-12 01:37:36,561 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining)
[2024-03-12 01:37:36,561 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining)
[2024-03-12 01:37:36,561 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining)
[2024-03-12 01:37:36,561 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining)
[2024-03-12 01:37:36,561 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining)
[2024-03-12 01:37:36,561 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining)
[2024-03-12 01:37:36,561 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining)
[2024-03-12 01:37:36,562 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining)
[2024-03-12 01:37:36,562 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2024-03-12 01:37:36,562 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:37:36,562 WARN  L233   ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-03-12 01:37:36,562 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances.
[2024-03-12 01:37:36,577 INFO  L144    ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions.
[2024-03-12 01:37:36,579 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 166 places, 164 transitions, 368 flow
[2024-03-12 01:37:36,654 INFO  L124   PetriNetUnfolderBase]: 43/880 cut-off events.
[2024-03-12 01:37:36,654 INFO  L125   PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES.
[2024-03-12 01:37:36,656 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 931 conditions, 880 events. 43/880 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 3514 event pairs, 6 based on Foata normal form. 0/764 useless extension candidates. Maximal degree in co-relation 514. Up to 32 conditions per place. 
[2024-03-12 01:37:36,656 INFO  L82        GeneralOperation]: Start removeDead. Operand has 166 places, 164 transitions, 368 flow
[2024-03-12 01:37:36,658 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 166 places, 164 transitions, 368 flow
[2024-03-12 01:37:36,659 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-12 01:37:36,659 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;@104c922d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-03-12 01:37:36,659 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 11 error locations.
[2024-03-12 01:37:36,661 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-03-12 01:37:36,661 INFO  L124   PetriNetUnfolderBase]: 3/52 cut-off events.
[2024-03-12 01:37:36,661 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-03-12 01:37:36,661 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:37:36,661 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]
[2024-03-12 01:37:36,661 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-12 01:37:36,662 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:37:36,662 INFO  L85        PathProgramCache]: Analyzing trace with hash 2411345, now seen corresponding path program 1 times
[2024-03-12 01:37:36,662 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:37:36,662 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358386198]
[2024-03-12 01:37:36,662 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:37:36,662 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:37:36,669 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:37:36,775 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:37:36,776 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:37:36,776 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358386198]
[2024-03-12 01:37:36,776 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358386198] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:37:36,776 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:37:36,776 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 01:37:36,776 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796713022]
[2024-03-12 01:37:36,776 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:37:36,776 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-12 01:37:36,776 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:37:36,777 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-12 01:37:36,777 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-12 01:37:36,886 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 123 out of 164
[2024-03-12 01:37:36,888 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 164 transitions, 368 flow. Second operand  has 6 states, 6 states have (on average 124.16666666666667) internal successors, (745), 6 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:36,888 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:37:36,888 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 164
[2024-03-12 01:37:36,888 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:37:40,532 INFO  L124   PetriNetUnfolderBase]: 8218/33148 cut-off events.
[2024-03-12 01:37:40,533 INFO  L125   PetriNetUnfolderBase]: For 1120/1120 co-relation queries the response was YES.
[2024-03-12 01:37:40,595 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 45783 conditions, 33148 events. 8218/33148 cut-off events. For 1120/1120 co-relation queries the response was YES. Maximal size of possible extension queue 877. Compared 424964 event pairs, 7076 based on Foata normal form. 304/30910 useless extension candidates. Maximal degree in co-relation 14908. Up to 10644 conditions per place. 
[2024-03-12 01:37:40,716 INFO  L140   encePairwiseOnDemand]: 145/164 looper letters, 42 selfloop transitions, 13 changer transitions 1/178 dead transitions.
[2024-03-12 01:37:40,716 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 178 transitions, 506 flow
[2024-03-12 01:37:40,729 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 01:37:40,730 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 01:37:40,732 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 801 transitions.
[2024-03-12 01:37:40,733 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8140243902439024
[2024-03-12 01:37:40,733 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 801 transitions.
[2024-03-12 01:37:40,733 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 801 transitions.
[2024-03-12 01:37:40,734 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:37:40,734 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 801 transitions.
[2024-03-12 01:37:40,736 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 133.5) internal successors, (801), 6 states have internal predecessors, (801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:40,738 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 164.0) internal successors, (1148), 7 states have internal predecessors, (1148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:40,739 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 164.0) internal successors, (1148), 7 states have internal predecessors, (1148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:40,739 INFO  L175             Difference]: Start difference. First operand has 166 places, 164 transitions, 368 flow. Second operand 6 states and 801 transitions.
[2024-03-12 01:37:40,739 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 178 transitions, 506 flow
[2024-03-12 01:37:40,741 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 178 transitions, 506 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-12 01:37:40,744 INFO  L231             Difference]: Finished difference. Result has 172 places, 169 transitions, 450 flow
[2024-03-12 01:37:40,744 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=450, PETRI_PLACES=172, PETRI_TRANSITIONS=169}
[2024-03-12 01:37:40,744 INFO  L281   CegarLoopForPetriNet]: 166 programPoint places, 6 predicate places.
[2024-03-12 01:37:40,745 INFO  L495      AbstractCegarLoop]: Abstraction has has 172 places, 169 transitions, 450 flow
[2024-03-12 01:37:40,745 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 124.16666666666667) internal successors, (745), 6 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:40,745 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:37:40,745 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]
[2024-03-12 01:37:40,745 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2024-03-12 01:37:40,745 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-12 01:37:40,746 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:37:40,746 INFO  L85        PathProgramCache]: Analyzing trace with hash 2099023792, now seen corresponding path program 1 times
[2024-03-12 01:37:40,746 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:37:40,746 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452096543]
[2024-03-12 01:37:40,746 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:37:40,746 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:37:40,753 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:37:40,762 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:37:40,762 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:37:40,762 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452096543]
[2024-03-12 01:37:40,763 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452096543] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:37:40,763 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:37:40,763 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 01:37:40,763 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68317551]
[2024-03-12 01:37:40,763 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:37:40,763 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 01:37:40,763 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:37:40,764 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 01:37:40,764 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 01:37:40,777 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 138 out of 164
[2024-03-12 01:37:40,777 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 169 transitions, 450 flow. Second operand  has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:40,777 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:37:40,777 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 164
[2024-03-12 01:37:40,778 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:37:43,671 INFO  L124   PetriNetUnfolderBase]: 7860/26990 cut-off events.
[2024-03-12 01:37:43,671 INFO  L125   PetriNetUnfolderBase]: For 2883/5133 co-relation queries the response was YES.
[2024-03-12 01:37:43,823 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 41265 conditions, 26990 events. 7860/26990 cut-off events. For 2883/5133 co-relation queries the response was YES. Maximal size of possible extension queue 823. Compared 324736 event pairs, 4292 based on Foata normal form. 0/24570 useless extension candidates. Maximal degree in co-relation 38038. Up to 7653 conditions per place. 
[2024-03-12 01:37:43,891 INFO  L140   encePairwiseOnDemand]: 157/164 looper letters, 30 selfloop transitions, 6 changer transitions 4/182 dead transitions.
[2024-03-12 01:37:43,891 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 182 transitions, 548 flow
[2024-03-12 01:37:43,894 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 01:37:43,895 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 01:37:43,895 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 451 transitions.
[2024-03-12 01:37:43,895 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9166666666666666
[2024-03-12 01:37:43,895 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 451 transitions.
[2024-03-12 01:37:43,895 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 451 transitions.
[2024-03-12 01:37:43,896 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:37:43,896 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 451 transitions.
[2024-03-12 01:37:43,896 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 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-03-12 01:37:43,897 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:43,897 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:43,897 INFO  L175             Difference]: Start difference. First operand has 172 places, 169 transitions, 450 flow. Second operand 3 states and 451 transitions.
[2024-03-12 01:37:43,897 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 182 transitions, 548 flow
[2024-03-12 01:37:43,987 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 182 transitions, 544 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-12 01:37:43,989 INFO  L231             Difference]: Finished difference. Result has 174 places, 170 transitions, 470 flow
[2024-03-12 01:37:43,989 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=470, PETRI_PLACES=174, PETRI_TRANSITIONS=170}
[2024-03-12 01:37:43,989 INFO  L281   CegarLoopForPetriNet]: 166 programPoint places, 8 predicate places.
[2024-03-12 01:37:43,989 INFO  L495      AbstractCegarLoop]: Abstraction has has 174 places, 170 transitions, 470 flow
[2024-03-12 01:37:43,990 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:43,990 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:37:43,990 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]
[2024-03-12 01:37:43,990 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2024-03-12 01:37:43,990 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-12 01:37:43,990 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:37:43,990 INFO  L85        PathProgramCache]: Analyzing trace with hash -179942087, now seen corresponding path program 1 times
[2024-03-12 01:37:43,990 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:37:43,990 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701792140]
[2024-03-12 01:37:43,991 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:37:43,991 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:37:43,999 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:37:44,029 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:37:44,029 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:37:44,029 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701792140]
[2024-03-12 01:37:44,029 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701792140] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:37:44,029 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:37:44,029 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 01:37:44,029 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500054240]
[2024-03-12 01:37:44,029 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:37:44,030 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-03-12 01:37:44,030 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:37:44,030 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-03-12 01:37:44,030 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-03-12 01:37:44,075 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 134 out of 164
[2024-03-12 01:37:44,076 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 170 transitions, 470 flow. Second operand  has 5 states, 5 states have (on average 135.4) internal successors, (677), 5 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:44,076 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:37:44,076 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 164
[2024-03-12 01:37:44,077 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:37:47,904 INFO  L124   PetriNetUnfolderBase]: 9364/35483 cut-off events.
[2024-03-12 01:37:47,905 INFO  L125   PetriNetUnfolderBase]: For 2533/2572 co-relation queries the response was YES.
[2024-03-12 01:37:48,009 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 53431 conditions, 35483 events. 9364/35483 cut-off events. For 2533/2572 co-relation queries the response was YES. Maximal size of possible extension queue 844. Compared 453537 event pairs, 7546 based on Foata normal form. 1/31439 useless extension candidates. Maximal degree in co-relation 33246. Up to 10765 conditions per place. 
[2024-03-12 01:37:48,104 INFO  L140   encePairwiseOnDemand]: 157/164 looper letters, 28 selfloop transitions, 2 changer transitions 4/173 dead transitions.
[2024-03-12 01:37:48,104 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 173 transitions, 530 flow
[2024-03-12 01:37:48,105 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 01:37:48,105 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 01:37:48,106 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 839 transitions.
[2024-03-12 01:37:48,106 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8526422764227642
[2024-03-12 01:37:48,106 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 839 transitions.
[2024-03-12 01:37:48,106 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 839 transitions.
[2024-03-12 01:37:48,107 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:37:48,107 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 839 transitions.
[2024-03-12 01:37:48,108 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 139.83333333333334) internal successors, (839), 6 states have internal predecessors, (839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:48,109 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 164.0) internal successors, (1148), 7 states have internal predecessors, (1148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:48,109 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 164.0) internal successors, (1148), 7 states have internal predecessors, (1148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:48,109 INFO  L175             Difference]: Start difference. First operand has 174 places, 170 transitions, 470 flow. Second operand 6 states and 839 transitions.
[2024-03-12 01:37:48,109 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 173 transitions, 530 flow
[2024-03-12 01:37:48,149 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 173 transitions, 504 flow, removed 7 selfloop flow, removed 2 redundant places.
[2024-03-12 01:37:48,151 INFO  L231             Difference]: Finished difference. Result has 181 places, 167 transitions, 442 flow
[2024-03-12 01:37:48,151 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=422, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=442, PETRI_PLACES=181, PETRI_TRANSITIONS=167}
[2024-03-12 01:37:48,151 INFO  L281   CegarLoopForPetriNet]: 166 programPoint places, 15 predicate places.
[2024-03-12 01:37:48,151 INFO  L495      AbstractCegarLoop]: Abstraction has has 181 places, 167 transitions, 442 flow
[2024-03-12 01:37:48,151 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 135.4) internal successors, (677), 5 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:48,152 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:37:48,152 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]
[2024-03-12 01:37:48,152 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2024-03-12 01:37:48,152 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-12 01:37:48,152 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:37:48,152 INFO  L85        PathProgramCache]: Analyzing trace with hash -1161374729, now seen corresponding path program 1 times
[2024-03-12 01:37:48,152 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:37:48,152 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413709568]
[2024-03-12 01:37:48,152 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:37:48,153 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:37:48,161 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:37:48,171 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:37:48,171 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:37:48,171 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413709568]
[2024-03-12 01:37:48,171 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413709568] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:37:48,172 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:37:48,172 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 01:37:48,172 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314498825]
[2024-03-12 01:37:48,172 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:37:48,172 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 01:37:48,172 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:37:48,172 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 01:37:48,172 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 01:37:48,187 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 136 out of 164
[2024-03-12 01:37:48,187 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 167 transitions, 442 flow. Second operand  has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:48,187 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:37:48,187 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 164
[2024-03-12 01:37:48,187 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:37:53,825 INFO  L124   PetriNetUnfolderBase]: 13502/50092 cut-off events.
[2024-03-12 01:37:53,825 INFO  L125   PetriNetUnfolderBase]: For 10598/24770 co-relation queries the response was YES.
[2024-03-12 01:37:53,992 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 81237 conditions, 50092 events. 13502/50092 cut-off events. For 10598/24770 co-relation queries the response was YES. Maximal size of possible extension queue 1582. Compared 686860 event pairs, 7306 based on Foata normal form. 31/44662 useless extension candidates. Maximal degree in co-relation 81165. Up to 15734 conditions per place. 
[2024-03-12 01:37:54,145 INFO  L140   encePairwiseOnDemand]: 156/164 looper letters, 39 selfloop transitions, 11 changer transitions 0/188 dead transitions.
[2024-03-12 01:37:54,145 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 188 transitions, 628 flow
[2024-03-12 01:37:54,146 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 01:37:54,146 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 01:37:54,147 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 452 transitions.
[2024-03-12 01:37:54,147 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9186991869918699
[2024-03-12 01:37:54,147 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 452 transitions.
[2024-03-12 01:37:54,147 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 452 transitions.
[2024-03-12 01:37:54,147 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:37:54,147 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 452 transitions.
[2024-03-12 01:37:54,148 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:54,148 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:54,149 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:54,149 INFO  L175             Difference]: Start difference. First operand has 181 places, 167 transitions, 442 flow. Second operand 3 states and 452 transitions.
[2024-03-12 01:37:54,149 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 188 transitions, 628 flow
[2024-03-12 01:37:54,181 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 188 transitions, 616 flow, removed 5 selfloop flow, removed 4 redundant places.
[2024-03-12 01:37:54,182 INFO  L231             Difference]: Finished difference. Result has 178 places, 176 transitions, 526 flow
[2024-03-12 01:37:54,183 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=430, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=526, PETRI_PLACES=178, PETRI_TRANSITIONS=176}
[2024-03-12 01:37:54,183 INFO  L281   CegarLoopForPetriNet]: 166 programPoint places, 12 predicate places.
[2024-03-12 01:37:54,183 INFO  L495      AbstractCegarLoop]: Abstraction has has 178 places, 176 transitions, 526 flow
[2024-03-12 01:37:54,184 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:54,184 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:37:54,184 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]
[2024-03-12 01:37:54,184 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2024-03-12 01:37:54,184 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-12 01:37:54,184 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:37:54,184 INFO  L85        PathProgramCache]: Analyzing trace with hash 1674253156, now seen corresponding path program 1 times
[2024-03-12 01:37:54,184 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:37:54,185 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95404020]
[2024-03-12 01:37:54,185 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:37:54,185 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:37:54,198 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:37:54,372 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-12 01:37:54,372 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:37:54,372 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95404020]
[2024-03-12 01:37:54,372 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95404020] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:37:54,372 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:37:54,372 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 01:37:54,373 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76537817]
[2024-03-12 01:37:54,373 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:37:54,373 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-12 01:37:54,373 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:37:54,374 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-12 01:37:54,374 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-12 01:37:54,584 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 132 out of 164
[2024-03-12 01:37:54,585 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 176 transitions, 526 flow. Second operand  has 6 states, 6 states have (on average 133.5) internal successors, (801), 6 states have internal predecessors, (801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:37:54,585 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:37:54,585 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 164
[2024-03-12 01:37:54,585 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:37:59,426 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([695] L1016-4-->L1016-5: Formula: (= |v_#race~data~0_1| |v_threadThread3of4ForFork0_#t~nondet5_3|)  InVars {threadThread3of4ForFork0_#t~nondet5=|v_threadThread3of4ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_1|, threadThread3of4ForFork0_#t~nondet5=|v_threadThread3of4ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][174], [threadThread1of4ForFork0InUse, threadThread2of4ForFork0InUse, threadThread3of4ForFork0InUse, Black: 188#(= |ULTIMATE.start_main_~i~0#1| 0), threadThread4of4ForFork0NotInUse, 104#L1031-2true, Black: 200#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 105#L1017true, 87#L1016-5true, Black: 171#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 172#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#true, Black: 173#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 182#(= |#race~data~0| 0), 198#true, 82#L1015-3true, 204#true])
[2024-03-12 01:37:59,427 INFO  L294   olderBase$Statistics]: this new event has 165 ancestors and is cut-off event
[2024-03-12 01:37:59,427 INFO  L297   olderBase$Statistics]:   existing Event has 114 ancestors and is cut-off event
[2024-03-12 01:37:59,427 INFO  L297   olderBase$Statistics]:   existing Event has 114 ancestors and is cut-off event
[2024-03-12 01:37:59,427 INFO  L297   olderBase$Statistics]:   existing Event has 165 ancestors and is cut-off event
[2024-03-12 01:37:59,719 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([743] L1016-4-->L1016-5: Formula: (= |v_threadThread4of4ForFork0_#t~nondet5_3| |v_#race~data~0_1|)  InVars {threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|}  OutVars{threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_1|}  AuxVars[]  AssignedVars[#race~data~0][205], [threadThread1of4ForFork0InUse, threadThread2of4ForFork0NotInUse, threadThread3of4ForFork0InUse, Black: 188#(= |ULTIMATE.start_main_~i~0#1| 0), threadThread4of4ForFork0InUse, 104#L1031-2true, Black: 200#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 87#L1016-5true, Black: 171#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 172#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#true, Black: 173#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 182#(= |#race~data~0| 0), 198#true, 204#true, 92#L1016-6true, 55#L1016-5true])
[2024-03-12 01:37:59,720 INFO  L294   olderBase$Statistics]: this new event has 169 ancestors and is cut-off event
[2024-03-12 01:37:59,720 INFO  L297   olderBase$Statistics]:   existing Event has 169 ancestors and is cut-off event
[2024-03-12 01:37:59,720 INFO  L297   olderBase$Statistics]:   existing Event has 169 ancestors and is cut-off event
[2024-03-12 01:37:59,720 INFO  L297   olderBase$Statistics]:   existing Event has 169 ancestors and is cut-off event
[2024-03-12 01:37:59,781 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([695] L1016-4-->L1016-5: Formula: (= |v_#race~data~0_1| |v_threadThread3of4ForFork0_#t~nondet5_3|)  InVars {threadThread3of4ForFork0_#t~nondet5=|v_threadThread3of4ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_1|, threadThread3of4ForFork0_#t~nondet5=|v_threadThread3of4ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][174], [threadThread1of4ForFork0InUse, threadThread2of4ForFork0InUse, 18#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread3of4ForFork0InUse, Black: 188#(= |ULTIMATE.start_main_~i~0#1| 0), threadThread4of4ForFork0NotInUse, 104#L1031-2true, Black: 200#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 87#L1016-5true, Black: 171#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 51#L1016-5true, Black: 172#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#true, Black: 173#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 182#(= |#race~data~0| 0), 198#true, 204#true])
[2024-03-12 01:37:59,781 INFO  L294   olderBase$Statistics]: this new event has 169 ancestors and is cut-off event
[2024-03-12 01:37:59,781 INFO  L297   olderBase$Statistics]:   existing Event has 169 ancestors and is cut-off event
[2024-03-12 01:37:59,781 INFO  L297   olderBase$Statistics]:   existing Event has 118 ancestors and is cut-off event
[2024-03-12 01:37:59,781 INFO  L297   olderBase$Statistics]:   existing Event has 118 ancestors and is cut-off event
[2024-03-12 01:37:59,893 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([743] L1016-4-->L1016-5: Formula: (= |v_threadThread4of4ForFork0_#t~nondet5_3| |v_#race~data~0_1|)  InVars {threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|}  OutVars{threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_1|}  AuxVars[]  AssignedVars[#race~data~0][199], [threadThread1of4ForFork0InUse, threadThread2of4ForFork0NotInUse, threadThread3of4ForFork0InUse, Black: 188#(= |ULTIMATE.start_main_~i~0#1| 0), 104#L1031-2true, threadThread4of4ForFork0InUse, Black: 200#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 105#L1017true, 87#L1016-5true, Black: 171#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 172#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#true, Black: 173#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 182#(= |#race~data~0| 0), 198#true, 204#true, 55#L1016-5true])
[2024-03-12 01:37:59,894 INFO  L294   olderBase$Statistics]: this new event has 171 ancestors and is cut-off event
[2024-03-12 01:37:59,894 INFO  L297   olderBase$Statistics]:   existing Event has 171 ancestors and is cut-off event
[2024-03-12 01:37:59,894 INFO  L297   olderBase$Statistics]:   existing Event has 171 ancestors and is cut-off event
[2024-03-12 01:37:59,894 INFO  L297   olderBase$Statistics]:   existing Event has 171 ancestors and is cut-off event
[2024-03-12 01:38:00,859 INFO  L124   PetriNetUnfolderBase]: 18821/55621 cut-off events.
[2024-03-12 01:38:00,859 INFO  L125   PetriNetUnfolderBase]: For 8352/10369 co-relation queries the response was YES.
[2024-03-12 01:38:01,095 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 96190 conditions, 55621 events. 18821/55621 cut-off events. For 8352/10369 co-relation queries the response was YES. Maximal size of possible extension queue 1668. Compared 720244 event pairs, 8703 based on Foata normal form. 104/49314 useless extension candidates. Maximal degree in co-relation 80776. Up to 11866 conditions per place. 
[2024-03-12 01:38:01,285 INFO  L140   encePairwiseOnDemand]: 158/164 looper letters, 55 selfloop transitions, 5 changer transitions 0/207 dead transitions.
[2024-03-12 01:38:01,285 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 207 transitions, 708 flow
[2024-03-12 01:38:01,286 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 01:38:01,286 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 01:38:01,287 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 853 transitions.
[2024-03-12 01:38:01,287 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.866869918699187
[2024-03-12 01:38:01,287 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 853 transitions.
[2024-03-12 01:38:01,287 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 853 transitions.
[2024-03-12 01:38:01,287 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:38:01,287 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 853 transitions.
[2024-03-12 01:38:01,288 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 142.16666666666666) internal successors, (853), 6 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:38:01,289 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 164.0) internal successors, (1148), 7 states have internal predecessors, (1148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:38:01,289 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 164.0) internal successors, (1148), 7 states have internal predecessors, (1148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:38:01,289 INFO  L175             Difference]: Start difference. First operand has 178 places, 176 transitions, 526 flow. Second operand 6 states and 853 transitions.
[2024-03-12 01:38:01,290 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 207 transitions, 708 flow
[2024-03-12 01:38:01,371 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 207 transitions, 686 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-12 01:38:01,373 INFO  L231             Difference]: Finished difference. Result has 180 places, 175 transitions, 512 flow
[2024-03-12 01:38:01,373 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=512, PETRI_PLACES=180, PETRI_TRANSITIONS=175}
[2024-03-12 01:38:01,373 INFO  L281   CegarLoopForPetriNet]: 166 programPoint places, 14 predicate places.
[2024-03-12 01:38:01,374 INFO  L495      AbstractCegarLoop]: Abstraction has has 180 places, 175 transitions, 512 flow
[2024-03-12 01:38:01,374 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 133.5) internal successors, (801), 6 states have internal predecessors, (801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:38:01,374 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:38:01,374 INFO  L208   CegarLoopForPetriNet]: trace histogram [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]
[2024-03-12 01:38:01,374 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2024-03-12 01:38:01,374 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-12 01:38:01,374 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:38:01,374 INFO  L85        PathProgramCache]: Analyzing trace with hash 1360262609, now seen corresponding path program 1 times
[2024-03-12 01:38:01,374 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:38:01,375 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966484691]
[2024-03-12 01:38:01,375 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:38:01,375 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:38:01,387 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:38:01,402 INFO  L134       CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked.
[2024-03-12 01:38:01,402 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:38:01,402 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966484691]
[2024-03-12 01:38:01,402 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966484691] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:38:01,402 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:38:01,402 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 01:38:01,402 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098073531]
[2024-03-12 01:38:01,402 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:38:01,402 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 01:38:01,403 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:38:01,403 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 01:38:01,403 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 01:38:01,424 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 136 out of 164
[2024-03-12 01:38:01,424 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 175 transitions, 512 flow. Second operand  has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:38:01,424 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:38:01,424 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 164
[2024-03-12 01:38:01,424 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:38:05,428 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([646] L1031-->L1031-1: Formula: (= |v_#race~data~0_6| 0)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_6|}  AuxVars[]  AssignedVars[#race~data~0][135], [threadThread1of4ForFork0InUse, 42#L1016-6true, threadThread2of4ForFork0InUse, threadThread3of4ForFork0NotInUse, Black: 188#(= |ULTIMATE.start_main_~i~0#1| 0), threadThread4of4ForFork0NotInUse, Black: 200#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 211#true, Black: 171#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 172#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#true, Black: 173#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 101#L1031-1true, Black: 180#true, 204#true, 92#L1016-6true])
[2024-03-12 01:38:05,428 INFO  L294   olderBase$Statistics]: this new event has 144 ancestors and is cut-off event
[2024-03-12 01:38:05,428 INFO  L297   olderBase$Statistics]:   existing Event has 93 ancestors and is cut-off event
[2024-03-12 01:38:05,428 INFO  L297   olderBase$Statistics]:   existing Event has 93 ancestors and is cut-off event
[2024-03-12 01:38:05,429 INFO  L297   olderBase$Statistics]:   existing Event has 144 ancestors and is cut-off event
[2024-03-12 01:38:05,658 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([743] L1016-4-->L1016-5: Formula: (= |v_threadThread4of4ForFork0_#t~nondet5_3| |v_#race~data~0_1|)  InVars {threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|}  OutVars{threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_1|}  AuxVars[]  AssignedVars[#race~data~0][192], [threadThread1of4ForFork0InUse, 42#L1016-6true, threadThread2of4ForFork0InUse, threadThread3of4ForFork0InUse, Black: 188#(= |ULTIMATE.start_main_~i~0#1| 0), threadThread4of4ForFork0InUse, Black: 200#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 87#L1016-5true, Black: 171#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 211#true, Black: 172#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#true, Black: 173#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 35#ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACEtrue, Black: 182#(= |#race~data~0| 0), 204#true, 92#L1016-6true, 55#L1016-5true])
[2024-03-12 01:38:05,658 INFO  L294   olderBase$Statistics]: this new event has 144 ancestors and is cut-off event
[2024-03-12 01:38:05,658 INFO  L297   olderBase$Statistics]:   existing Event has 144 ancestors and is cut-off event
[2024-03-12 01:38:05,658 INFO  L297   olderBase$Statistics]:   existing Event has 144 ancestors and is cut-off event
[2024-03-12 01:38:05,658 INFO  L297   olderBase$Statistics]:   existing Event has 144 ancestors and is cut-off event
[2024-03-12 01:38:06,009 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([743] L1016-4-->L1016-5: Formula: (= |v_threadThread4of4ForFork0_#t~nondet5_3| |v_#race~data~0_1|)  InVars {threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|}  OutVars{threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_1|}  AuxVars[]  AssignedVars[#race~data~0][181], [threadThread1of4ForFork0InUse, 42#L1016-6true, threadThread2of4ForFork0InUse, threadThread3of4ForFork0InUse, Black: 188#(= |ULTIMATE.start_main_~i~0#1| 0), threadThread4of4ForFork0InUse, Black: 200#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 105#L1017true, 87#L1016-5true, 211#true, Black: 171#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 172#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#true, Black: 173#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 182#(= |#race~data~0| 0), 35#ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACEtrue, 204#true, 55#L1016-5true])
[2024-03-12 01:38:06,009 INFO  L294   olderBase$Statistics]: this new event has 146 ancestors and is cut-off event
[2024-03-12 01:38:06,009 INFO  L297   olderBase$Statistics]:   existing Event has 146 ancestors and is cut-off event
[2024-03-12 01:38:06,009 INFO  L297   olderBase$Statistics]:   existing Event has 146 ancestors and is cut-off event
[2024-03-12 01:38:06,009 INFO  L297   olderBase$Statistics]:   existing Event has 146 ancestors and is cut-off event
[2024-03-12 01:38:06,055 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([695] L1016-4-->L1016-5: Formula: (= |v_#race~data~0_1| |v_threadThread3of4ForFork0_#t~nondet5_3|)  InVars {threadThread3of4ForFork0_#t~nondet5=|v_threadThread3of4ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_1|, threadThread3of4ForFork0_#t~nondet5=|v_threadThread3of4ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][183], [threadThread1of4ForFork0InUse, threadThread2of4ForFork0InUse, 18#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread3of4ForFork0InUse, Black: 188#(= |ULTIMATE.start_main_~i~0#1| 0), 29#L1017-3true, threadThread4of4ForFork0InUse, 104#L1031-2true, Black: 200#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 87#L1016-5true, 211#true, Black: 171#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 172#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#true, Black: 173#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 182#(= |#race~data~0| 0), 204#true, 55#L1016-5true])
[2024-03-12 01:38:06,055 INFO  L294   olderBase$Statistics]: this new event has 147 ancestors and is cut-off event
[2024-03-12 01:38:06,055 INFO  L297   olderBase$Statistics]:   existing Event has 147 ancestors and is cut-off event
[2024-03-12 01:38:06,055 INFO  L297   olderBase$Statistics]:   existing Event has 147 ancestors and is cut-off event
[2024-03-12 01:38:06,055 INFO  L297   olderBase$Statistics]:   existing Event has 147 ancestors and is cut-off event
[2024-03-12 01:38:06,184 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([743] L1016-4-->L1016-5: Formula: (= |v_threadThread4of4ForFork0_#t~nondet5_3| |v_#race~data~0_1|)  InVars {threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|}  OutVars{threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_1|}  AuxVars[]  AssignedVars[#race~data~0][192], [threadThread1of4ForFork0InUse, 42#L1016-6true, threadThread2of4ForFork0InUse, threadThread3of4ForFork0InUse, Black: 188#(= |ULTIMATE.start_main_~i~0#1| 0), threadThread4of4ForFork0InUse, Black: 200#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 211#true, Black: 171#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 172#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#true, Black: 173#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 49#L1017-3true, Black: 182#(= |#race~data~0| 0), 35#ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACEtrue, 204#true, 92#L1016-6true, 55#L1016-5true])
[2024-03-12 01:38:06,184 INFO  L294   olderBase$Statistics]: this new event has 148 ancestors and is cut-off event
[2024-03-12 01:38:06,184 INFO  L297   olderBase$Statistics]:   existing Event has 148 ancestors and is cut-off event
[2024-03-12 01:38:06,184 INFO  L297   olderBase$Statistics]:   existing Event has 148 ancestors and is cut-off event
[2024-03-12 01:38:06,184 INFO  L297   olderBase$Statistics]:   existing Event has 148 ancestors and is cut-off event
[2024-03-12 01:38:06,623 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([695] L1016-4-->L1016-5: Formula: (= |v_#race~data~0_1| |v_threadThread3of4ForFork0_#t~nondet5_3|)  InVars {threadThread3of4ForFork0_#t~nondet5=|v_threadThread3of4ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_1|, threadThread3of4ForFork0_#t~nondet5=|v_threadThread3of4ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][183], [threadThread1of4ForFork0InUse, threadThread2of4ForFork0InUse, 18#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread3of4ForFork0InUse, Black: 188#(= |ULTIMATE.start_main_~i~0#1| 0), 29#L1017-3true, threadThread4of4ForFork0InUse, 104#L1031-2true, Black: 200#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 53#L1017-3true, 87#L1016-5true, 211#true, Black: 171#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 172#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#true, Black: 173#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 182#(= |#race~data~0| 0), 204#true])
[2024-03-12 01:38:06,623 INFO  L294   olderBase$Statistics]: this new event has 151 ancestors and is cut-off event
[2024-03-12 01:38:06,623 INFO  L297   olderBase$Statistics]:   existing Event has 151 ancestors and is cut-off event
[2024-03-12 01:38:06,623 INFO  L297   olderBase$Statistics]:   existing Event has 151 ancestors and is cut-off event
[2024-03-12 01:38:06,623 INFO  L297   olderBase$Statistics]:   existing Event has 151 ancestors and is cut-off event
[2024-03-12 01:38:06,690 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([743] L1016-4-->L1016-5: Formula: (= |v_threadThread4of4ForFork0_#t~nondet5_3| |v_#race~data~0_1|)  InVars {threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|}  OutVars{threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_1|}  AuxVars[]  AssignedVars[#race~data~0][181], [threadThread1of4ForFork0InUse, 42#L1016-6true, threadThread2of4ForFork0InUse, threadThread3of4ForFork0InUse, Black: 188#(= |ULTIMATE.start_main_~i~0#1| 0), threadThread4of4ForFork0InUse, Black: 200#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 105#L1017true, Black: 171#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 211#true, Black: 172#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#true, Black: 173#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 49#L1017-3true, 35#ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACEtrue, Black: 182#(= |#race~data~0| 0), 204#true, 55#L1016-5true])
[2024-03-12 01:38:06,690 INFO  L294   olderBase$Statistics]: this new event has 150 ancestors and is not cut-off event
[2024-03-12 01:38:06,690 INFO  L297   olderBase$Statistics]:   existing Event has 150 ancestors and is not cut-off event
[2024-03-12 01:38:06,690 INFO  L297   olderBase$Statistics]:   existing Event has 150 ancestors and is not cut-off event
[2024-03-12 01:38:06,690 INFO  L297   olderBase$Statistics]:   existing Event has 150 ancestors and is not cut-off event
[2024-03-12 01:38:06,725 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([727] L1016-4-->L1016-5: Formula: (= |v_threadThread2of4ForFork0_#t~nondet5_3| |v_#race~data~0_1|)  InVars {threadThread2of4ForFork0_#t~nondet5=|v_threadThread2of4ForFork0_#t~nondet5_3|}  OutVars{threadThread2of4ForFork0_#t~nondet5=|v_threadThread2of4ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_1|}  AuxVars[]  AssignedVars[#race~data~0][155], [threadThread1of4ForFork0InUse, threadThread2of4ForFork0InUse, 18#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread3of4ForFork0InUse, Black: 188#(= |ULTIMATE.start_main_~i~0#1| 0), threadThread4of4ForFork0InUse, 104#L1031-2true, 213#(= |threadThread2of4ForFork0_#t~nondet5| |#race~data~0|), Black: 200#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 53#L1017-3true, Black: 171#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 51#L1016-5true, Black: 172#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#true, Black: 173#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 49#L1017-3true, Black: 182#(= |#race~data~0| 0), 204#true])
[2024-03-12 01:38:06,725 INFO  L294   olderBase$Statistics]: this new event has 151 ancestors and is cut-off event
[2024-03-12 01:38:06,725 INFO  L297   olderBase$Statistics]:   existing Event has 151 ancestors and is cut-off event
[2024-03-12 01:38:06,725 INFO  L297   olderBase$Statistics]:   existing Event has 151 ancestors and is cut-off event
[2024-03-12 01:38:06,725 INFO  L297   olderBase$Statistics]:   existing Event has 151 ancestors and is cut-off event
[2024-03-12 01:38:07,364 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([646] L1031-->L1031-1: Formula: (= |v_#race~data~0_6| 0)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_6|}  AuxVars[]  AssignedVars[#race~data~0][135], [threadThread1of4ForFork0InUse, 42#L1016-6true, threadThread2of4ForFork0InUse, threadThread3of4ForFork0InUse, Black: 188#(= |ULTIMATE.start_main_~i~0#1| 0), threadThread4of4ForFork0NotInUse, Black: 200#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 211#true, Black: 171#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 172#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#true, 101#L1031-1true, Black: 173#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 180#true, 11#$Ultimate##0true, 204#true, 92#L1016-6true])
[2024-03-12 01:38:07,365 INFO  L294   olderBase$Statistics]: this new event has 161 ancestors and is cut-off event
[2024-03-12 01:38:07,365 INFO  L297   olderBase$Statistics]:   existing Event has 110 ancestors and is cut-off event
[2024-03-12 01:38:07,365 INFO  L297   olderBase$Statistics]:   existing Event has 110 ancestors and is cut-off event
[2024-03-12 01:38:07,365 INFO  L297   olderBase$Statistics]:   existing Event has 161 ancestors and is cut-off event
[2024-03-12 01:38:07,532 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([646] L1031-->L1031-1: Formula: (= |v_#race~data~0_6| 0)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_6|}  AuxVars[]  AssignedVars[#race~data~0][135], [threadThread1of4ForFork0InUse, 42#L1016-6true, threadThread2of4ForFork0InUse, threadThread3of4ForFork0InUse, Black: 188#(= |ULTIMATE.start_main_~i~0#1| 0), threadThread4of4ForFork0NotInUse, 16#L1015-3true, Black: 200#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 211#true, Black: 171#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 172#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#true, 101#L1031-1true, Black: 173#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 180#true, 204#true, 92#L1016-6true])
[2024-03-12 01:38:07,533 INFO  L294   olderBase$Statistics]: this new event has 163 ancestors and is cut-off event
[2024-03-12 01:38:07,533 INFO  L297   olderBase$Statistics]:   existing Event has 112 ancestors and is cut-off event
[2024-03-12 01:38:07,533 INFO  L297   olderBase$Statistics]:   existing Event has 163 ancestors and is cut-off event
[2024-03-12 01:38:07,533 INFO  L297   olderBase$Statistics]:   existing Event has 112 ancestors and is cut-off event
[2024-03-12 01:38:08,243 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([646] L1031-->L1031-1: Formula: (= |v_#race~data~0_6| 0)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_6|}  AuxVars[]  AssignedVars[#race~data~0][135], [threadThread1of4ForFork0InUse, 42#L1016-6true, threadThread2of4ForFork0InUse, threadThread3of4ForFork0InUse, Black: 188#(= |ULTIMATE.start_main_~i~0#1| 0), threadThread4of4ForFork0NotInUse, Black: 200#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 87#L1016-5true, 211#true, Black: 171#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 172#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#true, 101#L1031-1true, Black: 173#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 180#true, 92#L1016-6true, 204#true])
[2024-03-12 01:38:08,243 INFO  L294   olderBase$Statistics]: this new event has 169 ancestors and is cut-off event
[2024-03-12 01:38:08,244 INFO  L297   olderBase$Statistics]:   existing Event has 169 ancestors and is cut-off event
[2024-03-12 01:38:08,244 INFO  L297   olderBase$Statistics]:   existing Event has 118 ancestors and is cut-off event
[2024-03-12 01:38:08,244 INFO  L297   olderBase$Statistics]:   existing Event has 118 ancestors and is cut-off event
[2024-03-12 01:38:08,440 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([646] L1031-->L1031-1: Formula: (= |v_#race~data~0_6| 0)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_6|}  AuxVars[]  AssignedVars[#race~data~0][134], [threadThread1of4ForFork0InUse, 42#L1016-6true, threadThread2of4ForFork0InUse, 18#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread3of4ForFork0InUse, Black: 188#(= |ULTIMATE.start_main_~i~0#1| 0), threadThread4of4ForFork0NotInUse, Black: 200#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 87#L1016-5true, 211#true, Black: 171#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 172#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#true, 101#L1031-1true, Black: 173#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 180#true, 204#true])
[2024-03-12 01:38:08,441 INFO  L294   olderBase$Statistics]: this new event has 169 ancestors and is cut-off event
[2024-03-12 01:38:08,441 INFO  L297   olderBase$Statistics]:   existing Event has 118 ancestors and is cut-off event
[2024-03-12 01:38:08,441 INFO  L297   olderBase$Statistics]:   existing Event has 169 ancestors and is cut-off event
[2024-03-12 01:38:08,441 INFO  L297   olderBase$Statistics]:   existing Event has 118 ancestors and is cut-off event
[2024-03-12 01:38:08,581 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([646] L1031-->L1031-1: Formula: (= |v_#race~data~0_6| 0)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_6|}  AuxVars[]  AssignedVars[#race~data~0][91], [threadThread1of4ForFork0InUse, threadThread2of4ForFork0InUse, 18#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread3of4ForFork0InUse, Black: 188#(= |ULTIMATE.start_main_~i~0#1| 0), threadThread4of4ForFork0NotInUse, Black: 200#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 159#L1017true, 87#L1016-5true, 211#true, Black: 171#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 172#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#true, 101#L1031-1true, Black: 173#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 180#true, 204#true])
[2024-03-12 01:38:08,581 INFO  L294   olderBase$Statistics]: this new event has 171 ancestors and is cut-off event
[2024-03-12 01:38:08,582 INFO  L297   olderBase$Statistics]:   existing Event has 120 ancestors and is cut-off event
[2024-03-12 01:38:08,582 INFO  L297   olderBase$Statistics]:   existing Event has 120 ancestors and is cut-off event
[2024-03-12 01:38:08,582 INFO  L297   olderBase$Statistics]:   existing Event has 171 ancestors and is cut-off event
[2024-03-12 01:38:08,582 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([646] L1031-->L1031-1: Formula: (= |v_#race~data~0_6| 0)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_6|}  AuxVars[]  AssignedVars[#race~data~0][135], [threadThread1of4ForFork0InUse, 42#L1016-6true, threadThread2of4ForFork0InUse, threadThread3of4ForFork0InUse, Black: 188#(= |ULTIMATE.start_main_~i~0#1| 0), threadThread4of4ForFork0NotInUse, Black: 200#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), Black: 171#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 211#true, Black: 172#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#true, 101#L1031-1true, Black: 173#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 49#L1017-3true, Black: 180#true, 92#L1016-6true, 204#true])
[2024-03-12 01:38:08,582 INFO  L294   olderBase$Statistics]: this new event has 173 ancestors and is cut-off event
[2024-03-12 01:38:08,582 INFO  L297   olderBase$Statistics]:   existing Event has 122 ancestors and is cut-off event
[2024-03-12 01:38:08,582 INFO  L297   olderBase$Statistics]:   existing Event has 173 ancestors and is cut-off event
[2024-03-12 01:38:08,582 INFO  L297   olderBase$Statistics]:   existing Event has 122 ancestors and is cut-off event
[2024-03-12 01:38:08,638 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([646] L1031-->L1031-1: Formula: (= |v_#race~data~0_6| 0)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_6|}  AuxVars[]  AssignedVars[#race~data~0][91], [threadThread1of4ForFork0InUse, threadThread2of4ForFork0InUse, 18#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread3of4ForFork0InUse, Black: 188#(= |ULTIMATE.start_main_~i~0#1| 0), 29#L1017-3true, threadThread4of4ForFork0NotInUse, Black: 200#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 87#L1016-5true, 211#true, Black: 171#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 172#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#true, 101#L1031-1true, Black: 173#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 180#true, 204#true])
[2024-03-12 01:38:08,638 INFO  L294   olderBase$Statistics]: this new event has 172 ancestors and is cut-off event
[2024-03-12 01:38:08,638 INFO  L297   olderBase$Statistics]:   existing Event has 121 ancestors and is cut-off event
[2024-03-12 01:38:08,638 INFO  L297   olderBase$Statistics]:   existing Event has 172 ancestors and is cut-off event
[2024-03-12 01:38:08,638 INFO  L297   olderBase$Statistics]:   existing Event has 121 ancestors and is cut-off event
[2024-03-12 01:38:08,698 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([646] L1031-->L1031-1: Formula: (= |v_#race~data~0_6| 0)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_6|}  AuxVars[]  AssignedVars[#race~data~0][134], [threadThread1of4ForFork0InUse, 42#L1016-6true, threadThread2of4ForFork0InUse, 18#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread3of4ForFork0InUse, Black: 188#(= |ULTIMATE.start_main_~i~0#1| 0), threadThread4of4ForFork0NotInUse, Black: 200#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 211#true, Black: 171#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 172#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#true, 101#L1031-1true, Black: 173#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 49#L1017-3true, Black: 180#true, 204#true])
[2024-03-12 01:38:08,699 INFO  L294   olderBase$Statistics]: this new event has 173 ancestors and is cut-off event
[2024-03-12 01:38:08,699 INFO  L297   olderBase$Statistics]:   existing Event has 122 ancestors and is cut-off event
[2024-03-12 01:38:08,699 INFO  L297   olderBase$Statistics]:   existing Event has 173 ancestors and is cut-off event
[2024-03-12 01:38:08,699 INFO  L297   olderBase$Statistics]:   existing Event has 122 ancestors and is cut-off event
[2024-03-12 01:38:08,799 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([646] L1031-->L1031-1: Formula: (= |v_#race~data~0_6| 0)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_6|}  AuxVars[]  AssignedVars[#race~data~0][91], [threadThread1of4ForFork0InUse, threadThread2of4ForFork0InUse, 18#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread3of4ForFork0InUse, Black: 188#(= |ULTIMATE.start_main_~i~0#1| 0), threadThread4of4ForFork0NotInUse, Black: 200#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 159#L1017true, 211#true, Black: 171#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 172#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#true, 101#L1031-1true, Black: 173#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 49#L1017-3true, Black: 180#true, 204#true])
[2024-03-12 01:38:08,799 INFO  L294   olderBase$Statistics]: this new event has 175 ancestors and is cut-off event
[2024-03-12 01:38:08,799 INFO  L297   olderBase$Statistics]:   existing Event has 124 ancestors and is cut-off event
[2024-03-12 01:38:08,799 INFO  L297   olderBase$Statistics]:   existing Event has 124 ancestors and is cut-off event
[2024-03-12 01:38:08,799 INFO  L297   olderBase$Statistics]:   existing Event has 175 ancestors and is cut-off event
[2024-03-12 01:38:08,841 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([646] L1031-->L1031-1: Formula: (= |v_#race~data~0_6| 0)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_6|}  AuxVars[]  AssignedVars[#race~data~0][91], [threadThread1of4ForFork0InUse, threadThread2of4ForFork0InUse, 18#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread3of4ForFork0InUse, Black: 188#(= |ULTIMATE.start_main_~i~0#1| 0), 29#L1017-3true, threadThread4of4ForFork0NotInUse, Black: 200#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 211#true, Black: 171#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 172#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#true, 101#L1031-1true, Black: 173#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 49#L1017-3true, Black: 180#true, 204#true])
[2024-03-12 01:38:08,841 INFO  L294   olderBase$Statistics]: this new event has 176 ancestors and is cut-off event
[2024-03-12 01:38:08,842 INFO  L297   olderBase$Statistics]:   existing Event has 176 ancestors and is cut-off event
[2024-03-12 01:38:08,842 INFO  L297   olderBase$Statistics]:   existing Event has 125 ancestors and is cut-off event
[2024-03-12 01:38:08,842 INFO  L297   olderBase$Statistics]:   existing Event has 125 ancestors and is cut-off event
[2024-03-12 01:38:09,428 INFO  L124   PetriNetUnfolderBase]: 23229/73281 cut-off events.
[2024-03-12 01:38:09,428 INFO  L125   PetriNetUnfolderBase]: For 40020/95473 co-relation queries the response was YES.
[2024-03-12 01:38:09,727 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 141213 conditions, 73281 events. 23229/73281 cut-off events. For 40020/95473 co-relation queries the response was YES. Maximal size of possible extension queue 2748. Compared 1022782 event pairs, 11276 based on Foata normal form. 57/64642 useless extension candidates. Maximal degree in co-relation 122571. Up to 25820 conditions per place. 
[2024-03-12 01:38:09,992 INFO  L140   encePairwiseOnDemand]: 156/164 looper letters, 43 selfloop transitions, 18 changer transitions 0/200 dead transitions.
[2024-03-12 01:38:09,992 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 200 transitions, 757 flow
[2024-03-12 01:38:09,993 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 01:38:09,993 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 01:38:09,993 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 451 transitions.
[2024-03-12 01:38:09,994 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9166666666666666
[2024-03-12 01:38:09,994 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 451 transitions.
[2024-03-12 01:38:09,994 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 451 transitions.
[2024-03-12 01:38:09,994 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:38:09,994 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 451 transitions.
[2024-03-12 01:38:09,994 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 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-03-12 01:38:09,995 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:38:09,995 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:38:09,995 INFO  L175             Difference]: Start difference. First operand has 180 places, 175 transitions, 512 flow. Second operand 3 states and 451 transitions.
[2024-03-12 01:38:09,995 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 200 transitions, 757 flow
[2024-03-12 01:38:10,278 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 200 transitions, 747 flow, removed 0 selfloop flow, removed 5 redundant places.
[2024-03-12 01:38:10,280 INFO  L231             Difference]: Finished difference. Result has 179 places, 189 transitions, 680 flow
[2024-03-12 01:38:10,280 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=680, PETRI_PLACES=179, PETRI_TRANSITIONS=189}
[2024-03-12 01:38:10,281 INFO  L281   CegarLoopForPetriNet]: 166 programPoint places, 13 predicate places.
[2024-03-12 01:38:10,281 INFO  L495      AbstractCegarLoop]: Abstraction has has 179 places, 189 transitions, 680 flow
[2024-03-12 01:38:10,281 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:38:10,281 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:38:10,281 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]
[2024-03-12 01:38:10,281 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2024-03-12 01:38:10,281 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-12 01:38:10,281 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:38:10,281 INFO  L85        PathProgramCache]: Analyzing trace with hash -2086180894, now seen corresponding path program 1 times
[2024-03-12 01:38:10,281 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:38:10,282 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909355013]
[2024-03-12 01:38:10,282 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:38:10,282 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:38:10,294 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:38:10,349 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:38:10,349 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:38:10,349 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909355013]
[2024-03-12 01:38:10,349 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909355013] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 01:38:10,349 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546436166]
[2024-03-12 01:38:10,349 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:38:10,349 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 01:38:10,349 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 01:38:10,350 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-12 01:38:10,353 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2024-03-12 01:38:10,493 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:38:10,494 INFO  L262         TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 4 conjunts are in the unsatisfiable core
[2024-03-12 01:38:10,496 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 01:38:10,547 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:38:10,547 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-12 01:38:10,598 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:38:10,599 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [546436166] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-12 01:38:10,599 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-12 01:38:10,599 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9
[2024-03-12 01:38:10,599 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272487966]
[2024-03-12 01:38:10,599 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-12 01:38:10,600 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-03-12 01:38:10,600 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:38:10,600 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-03-12 01:38:10,600 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2024-03-12 01:38:10,686 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 132 out of 164
[2024-03-12 01:38:10,687 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 189 transitions, 680 flow. Second operand  has 9 states, 9 states have (on average 134.33333333333334) internal successors, (1209), 9 states have internal predecessors, (1209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:38:10,687 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:38:10,687 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 164
[2024-03-12 01:38:10,687 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:38:16,070 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([743] L1016-4-->L1016-5: Formula: (= |v_threadThread4of4ForFork0_#t~nondet5_3| |v_#race~data~0_1|)  InVars {threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|}  OutVars{threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_1|}  AuxVars[]  AssignedVars[#race~data~0][224], [threadThread1of4ForFork0NotInUse, 42#L1016-6true, threadThread2of4ForFork0InUse, Black: 188#(= |ULTIMATE.start_main_~i~0#1| 0), threadThread3of4ForFork0InUse, 104#L1031-2true, threadThread4of4ForFork0InUse, Black: 200#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 87#L1016-5true, 211#true, Black: 171#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 172#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#true, Black: 173#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 221#(<= 1 |ULTIMATE.start_main_~breads_total~0#1|), Black: 182#(= |#race~data~0| 0), Black: 213#(= |threadThread2of4ForFork0_#t~nondet5| |#race~data~0|), 55#L1016-5true])
[2024-03-12 01:38:16,071 INFO  L294   olderBase$Statistics]: this new event has 169 ancestors and is cut-off event
[2024-03-12 01:38:16,071 INFO  L297   olderBase$Statistics]:   existing Event has 169 ancestors and is cut-off event
[2024-03-12 01:38:16,071 INFO  L297   olderBase$Statistics]:   existing Event has 169 ancestors and is cut-off event
[2024-03-12 01:38:16,071 INFO  L297   olderBase$Statistics]:   existing Event has 169 ancestors and is cut-off event
[2024-03-12 01:38:16,136 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([743] L1016-4-->L1016-5: Formula: (= |v_threadThread4of4ForFork0_#t~nondet5_3| |v_#race~data~0_1|)  InVars {threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|}  OutVars{threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_1|}  AuxVars[]  AssignedVars[#race~data~0][225], [threadThread1of4ForFork0InUse, threadThread2of4ForFork0NotInUse, Black: 188#(= |ULTIMATE.start_main_~i~0#1| 0), threadThread3of4ForFork0InUse, 104#L1031-2true, threadThread4of4ForFork0InUse, Black: 200#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 87#L1016-5true, 211#true, Black: 171#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 172#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#true, Black: 173#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 213#(= |threadThread2of4ForFork0_#t~nondet5| |#race~data~0|), Black: 182#(= |#race~data~0| 0), 221#(<= 1 |ULTIMATE.start_main_~breads_total~0#1|), 92#L1016-6true, 55#L1016-5true])
[2024-03-12 01:38:16,136 INFO  L294   olderBase$Statistics]: this new event has 169 ancestors and is cut-off event
[2024-03-12 01:38:16,136 INFO  L297   olderBase$Statistics]:   existing Event has 169 ancestors and is cut-off event
[2024-03-12 01:38:16,136 INFO  L297   olderBase$Statistics]:   existing Event has 169 ancestors and is cut-off event
[2024-03-12 01:38:16,137 INFO  L297   olderBase$Statistics]:   existing Event has 169 ancestors and is cut-off event
[2024-03-12 01:38:16,420 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([743] L1016-4-->L1016-5: Formula: (= |v_threadThread4of4ForFork0_#t~nondet5_3| |v_#race~data~0_1|)  InVars {threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|}  OutVars{threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_1|}  AuxVars[]  AssignedVars[#race~data~0][222], [threadThread1of4ForFork0NotInUse, threadThread2of4ForFork0InUse, Black: 188#(= |ULTIMATE.start_main_~i~0#1| 0), threadThread3of4ForFork0InUse, 104#L1031-2true, threadThread4of4ForFork0InUse, Black: 200#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 159#L1017true, 87#L1016-5true, 211#true, Black: 171#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 172#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#true, Black: 173#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 221#(<= 1 |ULTIMATE.start_main_~breads_total~0#1|), Black: 182#(= |#race~data~0| 0), Black: 213#(= |threadThread2of4ForFork0_#t~nondet5| |#race~data~0|), 55#L1016-5true])
[2024-03-12 01:38:16,420 INFO  L294   olderBase$Statistics]: this new event has 171 ancestors and is cut-off event
[2024-03-12 01:38:16,421 INFO  L297   olderBase$Statistics]:   existing Event has 171 ancestors and is cut-off event
[2024-03-12 01:38:16,421 INFO  L297   olderBase$Statistics]:   existing Event has 171 ancestors and is cut-off event
[2024-03-12 01:38:16,421 INFO  L297   olderBase$Statistics]:   existing Event has 171 ancestors and is cut-off event
[2024-03-12 01:38:16,424 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([743] L1016-4-->L1016-5: Formula: (= |v_threadThread4of4ForFork0_#t~nondet5_3| |v_#race~data~0_1|)  InVars {threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|}  OutVars{threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_1|}  AuxVars[]  AssignedVars[#race~data~0][222], [threadThread1of4ForFork0InUse, threadThread2of4ForFork0NotInUse, Black: 188#(= |ULTIMATE.start_main_~i~0#1| 0), threadThread3of4ForFork0InUse, 104#L1031-2true, threadThread4of4ForFork0InUse, Black: 200#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 105#L1017true, 87#L1016-5true, Black: 171#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 211#true, Black: 172#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#true, Black: 173#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 213#(= |threadThread2of4ForFork0_#t~nondet5| |#race~data~0|), Black: 182#(= |#race~data~0| 0), 221#(<= 1 |ULTIMATE.start_main_~breads_total~0#1|), 55#L1016-5true])
[2024-03-12 01:38:16,424 INFO  L294   olderBase$Statistics]: this new event has 171 ancestors and is cut-off event
[2024-03-12 01:38:16,424 INFO  L297   olderBase$Statistics]:   existing Event has 171 ancestors and is cut-off event
[2024-03-12 01:38:16,424 INFO  L297   olderBase$Statistics]:   existing Event has 171 ancestors and is cut-off event
[2024-03-12 01:38:16,424 INFO  L297   olderBase$Statistics]:   existing Event has 171 ancestors and is cut-off event
[2024-03-12 01:38:16,947 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([743] L1016-4-->L1016-5: Formula: (= |v_threadThread4of4ForFork0_#t~nondet5_3| |v_#race~data~0_1|)  InVars {threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|}  OutVars{threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_1|}  AuxVars[]  AssignedVars[#race~data~0][225], [threadThread1of4ForFork0InUse, threadThread2of4ForFork0InUse, threadThread3of4ForFork0NotInUse, Black: 188#(= |ULTIMATE.start_main_~i~0#1| 0), 29#L1017-3true, threadThread4of4ForFork0InUse, 104#L1031-2true, Black: 200#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 211#true, Black: 171#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 172#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#true, Black: 173#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 182#(= |#race~data~0| 0), Black: 213#(= |threadThread2of4ForFork0_#t~nondet5| |#race~data~0|), 221#(<= 1 |ULTIMATE.start_main_~breads_total~0#1|), 92#L1016-6true, 55#L1016-5true])
[2024-03-12 01:38:16,947 INFO  L294   olderBase$Statistics]: this new event has 173 ancestors and is cut-off event
[2024-03-12 01:38:16,947 INFO  L297   olderBase$Statistics]:   existing Event has 173 ancestors and is cut-off event
[2024-03-12 01:38:16,948 INFO  L297   olderBase$Statistics]:   existing Event has 173 ancestors and is cut-off event
[2024-03-12 01:38:16,948 INFO  L297   olderBase$Statistics]:   existing Event has 173 ancestors and is cut-off event
[2024-03-12 01:38:17,950 INFO  L124   PetriNetUnfolderBase]: 16918/65322 cut-off events.
[2024-03-12 01:38:17,951 INFO  L125   PetriNetUnfolderBase]: For 22979/27352 co-relation queries the response was YES.
[2024-03-12 01:38:18,202 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 113383 conditions, 65322 events. 16918/65322 cut-off events. For 22979/27352 co-relation queries the response was YES. Maximal size of possible extension queue 1558. Compared 931878 event pairs, 5122 based on Foata normal form. 39/58859 useless extension candidates. Maximal degree in co-relation 63510. Up to 8876 conditions per place. 
[2024-03-12 01:38:18,407 INFO  L140   encePairwiseOnDemand]: 154/164 looper letters, 61 selfloop transitions, 10 changer transitions 0/230 dead transitions.
[2024-03-12 01:38:18,407 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 230 transitions, 916 flow
[2024-03-12 01:38:18,408 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-03-12 01:38:18,408 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-03-12 01:38:18,409 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1128 transitions.
[2024-03-12 01:38:18,409 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8597560975609756
[2024-03-12 01:38:18,409 INFO  L72            ComplementDD]: Start complementDD. Operand 8 states and 1128 transitions.
[2024-03-12 01:38:18,409 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 8 states and 1128 transitions.
[2024-03-12 01:38:18,410 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:38:18,410 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1128 transitions.
[2024-03-12 01:38:18,411 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 9 states, 8 states have (on average 141.0) internal successors, (1128), 8 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:38:18,412 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 9 states, 9 states have (on average 164.0) internal successors, (1476), 9 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:38:18,413 INFO  L81            ComplementDD]: Finished complementDD. Result  has 9 states, 9 states have (on average 164.0) internal successors, (1476), 9 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:38:18,413 INFO  L175             Difference]: Start difference. First operand has 179 places, 189 transitions, 680 flow. Second operand 8 states and 1128 transitions.
[2024-03-12 01:38:18,413 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 230 transitions, 916 flow
[2024-03-12 01:38:18,524 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 230 transitions, 880 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-12 01:38:18,526 INFO  L231             Difference]: Finished difference. Result has 187 places, 192 transitions, 688 flow
[2024-03-12 01:38:18,526 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=644, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=688, PETRI_PLACES=187, PETRI_TRANSITIONS=192}
[2024-03-12 01:38:18,527 INFO  L281   CegarLoopForPetriNet]: 166 programPoint places, 21 predicate places.
[2024-03-12 01:38:18,527 INFO  L495      AbstractCegarLoop]: Abstraction has has 187 places, 192 transitions, 688 flow
[2024-03-12 01:38:18,527 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 134.33333333333334) internal successors, (1209), 9 states have internal predecessors, (1209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:38:18,527 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:38:18,528 INFO  L208   CegarLoopForPetriNet]: trace histogram [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]
[2024-03-12 01:38:18,536 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2024-03-12 01:38:18,728 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,4 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 01:38:18,729 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-12 01:38:18,730 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:38:18,730 INFO  L85        PathProgramCache]: Analyzing trace with hash -655903803, now seen corresponding path program 1 times
[2024-03-12 01:38:18,730 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:38:18,731 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166999618]
[2024-03-12 01:38:18,731 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:38:18,731 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:38:18,747 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:38:18,784 INFO  L134       CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:38:18,784 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:38:18,784 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166999618]
[2024-03-12 01:38:18,785 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166999618] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:38:18,785 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:38:18,785 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-03-12 01:38:18,785 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179096169]
[2024-03-12 01:38:18,785 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:38:18,785 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 01:38:18,786 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:38:18,786 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 01:38:18,786 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 01:38:18,794 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 144 out of 164
[2024-03-12 01:38:18,795 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 192 transitions, 688 flow. Second operand  has 3 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:38:18,795 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:38:18,795 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 164
[2024-03-12 01:38:18,795 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:38:19,737 INFO  L124   PetriNetUnfolderBase]: 688/8410 cut-off events.
[2024-03-12 01:38:19,737 INFO  L125   PetriNetUnfolderBase]: For 2744/3214 co-relation queries the response was YES.
[2024-03-12 01:38:19,761 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13670 conditions, 8410 events. 688/8410 cut-off events. For 2744/3214 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 99781 event pairs, 149 based on Foata normal form. 199/8213 useless extension candidates. Maximal degree in co-relation 5330. Up to 662 conditions per place. 
[2024-03-12 01:38:19,775 INFO  L140   encePairwiseOnDemand]: 156/164 looper letters, 16 selfloop transitions, 8 changer transitions 0/182 dead transitions.
[2024-03-12 01:38:19,775 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 182 transitions, 647 flow
[2024-03-12 01:38:19,776 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 01:38:19,776 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 01:38:19,777 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 460 transitions.
[2024-03-12 01:38:19,777 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9349593495934959
[2024-03-12 01:38:19,777 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 460 transitions.
[2024-03-12 01:38:19,778 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 460 transitions.
[2024-03-12 01:38:19,778 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:38:19,778 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 460 transitions.
[2024-03-12 01:38:19,779 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:38:19,779 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:38:19,780 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:38:19,780 INFO  L175             Difference]: Start difference. First operand has 187 places, 192 transitions, 688 flow. Second operand 3 states and 460 transitions.
[2024-03-12 01:38:19,780 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 182 transitions, 647 flow
[2024-03-12 01:38:19,788 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 182 transitions, 637 flow, removed 2 selfloop flow, removed 3 redundant places.
[2024-03-12 01:38:19,790 INFO  L231             Difference]: Finished difference. Result has 186 places, 175 transitions, 558 flow
[2024-03-12 01:38:19,790 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=542, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=558, PETRI_PLACES=186, PETRI_TRANSITIONS=175}
[2024-03-12 01:38:19,790 INFO  L281   CegarLoopForPetriNet]: 166 programPoint places, 20 predicate places.
[2024-03-12 01:38:19,791 INFO  L495      AbstractCegarLoop]: Abstraction has has 186 places, 175 transitions, 558 flow
[2024-03-12 01:38:19,791 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:38:19,791 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:38:19,791 INFO  L208   CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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]
[2024-03-12 01:38:19,791 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2024-03-12 01:38:19,791 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-12 01:38:19,792 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:38:19,792 INFO  L85        PathProgramCache]: Analyzing trace with hash -1215309242, now seen corresponding path program 1 times
[2024-03-12 01:38:19,792 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:38:19,792 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008495789]
[2024-03-12 01:38:19,792 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:38:19,792 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:38:19,808 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:38:19,825 INFO  L134       CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked.
[2024-03-12 01:38:19,825 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:38:19,826 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008495789]
[2024-03-12 01:38:19,826 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008495789] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:38:19,826 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:38:19,826 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 01:38:19,826 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222724320]
[2024-03-12 01:38:19,826 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:38:19,827 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 01:38:19,827 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:38:19,827 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 01:38:19,827 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 01:38:19,852 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 136 out of 164
[2024-03-12 01:38:19,852 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 175 transitions, 558 flow. Second operand  has 3 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:38:19,853 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:38:19,853 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 164
[2024-03-12 01:38:19,853 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:38:20,908 INFO  L124   PetriNetUnfolderBase]: 1114/8945 cut-off events.
[2024-03-12 01:38:20,909 INFO  L125   PetriNetUnfolderBase]: For 6632/8938 co-relation queries the response was YES.
[2024-03-12 01:38:20,926 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16874 conditions, 8945 events. 1114/8945 cut-off events. For 6632/8938 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 109169 event pairs, 714 based on Foata normal form. 24/8249 useless extension candidates. Maximal degree in co-relation 13153. Up to 2065 conditions per place. 
[2024-03-12 01:38:20,938 INFO  L140   encePairwiseOnDemand]: 159/164 looper letters, 33 selfloop transitions, 5 changer transitions 0/182 dead transitions.
[2024-03-12 01:38:20,939 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 182 transitions, 672 flow
[2024-03-12 01:38:20,940 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 01:38:20,940 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 01:38:20,940 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 441 transitions.
[2024-03-12 01:38:20,940 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8963414634146342
[2024-03-12 01:38:20,940 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 441 transitions.
[2024-03-12 01:38:20,940 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 441 transitions.
[2024-03-12 01:38:20,941 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:38:20,941 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 441 transitions.
[2024-03-12 01:38:20,941 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:38:20,942 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:38:20,943 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:38:20,943 INFO  L175             Difference]: Start difference. First operand has 186 places, 175 transitions, 558 flow. Second operand 3 states and 441 transitions.
[2024-03-12 01:38:20,943 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 182 transitions, 672 flow
[2024-03-12 01:38:20,959 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 182 transitions, 664 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-12 01:38:20,961 INFO  L231             Difference]: Finished difference. Result has 189 places, 178 transitions, 590 flow
[2024-03-12 01:38:20,961 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=550, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=590, PETRI_PLACES=189, PETRI_TRANSITIONS=178}
[2024-03-12 01:38:20,961 INFO  L281   CegarLoopForPetriNet]: 166 programPoint places, 23 predicate places.
[2024-03-12 01:38:20,962 INFO  L495      AbstractCegarLoop]: Abstraction has has 189 places, 178 transitions, 590 flow
[2024-03-12 01:38:20,962 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:38:20,962 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:38:20,962 INFO  L208   CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-12 01:38:20,962 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2024-03-12 01:38:20,962 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-12 01:38:20,963 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:38:20,963 INFO  L85        PathProgramCache]: Analyzing trace with hash 484211616, now seen corresponding path program 1 times
[2024-03-12 01:38:20,963 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:38:20,963 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551821534]
[2024-03-12 01:38:20,963 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:38:20,963 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:38:20,989 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:38:21,006 INFO  L134       CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked.
[2024-03-12 01:38:21,006 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:38:21,006 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551821534]
[2024-03-12 01:38:21,007 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551821534] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:38:21,007 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:38:21,007 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 01:38:21,007 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331334613]
[2024-03-12 01:38:21,007 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:38:21,007 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 01:38:21,008 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:38:21,008 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 01:38:21,008 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 01:38:21,029 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 136 out of 164
[2024-03-12 01:38:21,029 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 178 transitions, 590 flow. Second operand  has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:38:21,030 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:38:21,030 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 164
[2024-03-12 01:38:21,030 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:38:22,057 INFO  L124   PetriNetUnfolderBase]: 1121/9381 cut-off events.
[2024-03-12 01:38:22,057 INFO  L125   PetriNetUnfolderBase]: For 8993/11700 co-relation queries the response was YES.
[2024-03-12 01:38:22,091 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18166 conditions, 9381 events. 1121/9381 cut-off events. For 8993/11700 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 115729 event pairs, 707 based on Foata normal form. 18/8735 useless extension candidates. Maximal degree in co-relation 14444. Up to 2095 conditions per place. 
[2024-03-12 01:38:22,106 INFO  L140   encePairwiseOnDemand]: 159/164 looper letters, 33 selfloop transitions, 5 changer transitions 0/184 dead transitions.
[2024-03-12 01:38:22,106 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 184 transitions, 695 flow
[2024-03-12 01:38:22,107 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 01:38:22,107 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 01:38:22,107 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 440 transitions.
[2024-03-12 01:38:22,108 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8943089430894309
[2024-03-12 01:38:22,108 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 440 transitions.
[2024-03-12 01:38:22,108 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 440 transitions.
[2024-03-12 01:38:22,108 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:38:22,108 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 440 transitions.
[2024-03-12 01:38:22,109 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 146.66666666666666) internal successors, (440), 3 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:38:22,109 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:38:22,109 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:38:22,110 INFO  L175             Difference]: Start difference. First operand has 189 places, 178 transitions, 590 flow. Second operand 3 states and 440 transitions.
[2024-03-12 01:38:22,110 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 184 transitions, 695 flow
[2024-03-12 01:38:22,137 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 184 transitions, 681 flow, removed 2 selfloop flow, removed 2 redundant places.
[2024-03-12 01:38:22,138 INFO  L231             Difference]: Finished difference. Result has 191 places, 181 transitions, 618 flow
[2024-03-12 01:38:22,139 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=576, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=618, PETRI_PLACES=191, PETRI_TRANSITIONS=181}
[2024-03-12 01:38:22,139 INFO  L281   CegarLoopForPetriNet]: 166 programPoint places, 25 predicate places.
[2024-03-12 01:38:22,139 INFO  L495      AbstractCegarLoop]: Abstraction has has 191 places, 181 transitions, 618 flow
[2024-03-12 01:38:22,139 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:38:22,140 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:38:22,140 INFO  L208   CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-12 01:38:22,140 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2024-03-12 01:38:22,140 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-12 01:38:22,140 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:38:22,140 INFO  L85        PathProgramCache]: Analyzing trace with hash 1564638058, now seen corresponding path program 1 times
[2024-03-12 01:38:22,141 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:38:22,141 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003300396]
[2024-03-12 01:38:22,141 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:38:22,141 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:38:22,175 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-12 01:38:22,175 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-03-12 01:38:22,188 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-12 01:38:22,197 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-03-12 01:38:22,197 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-03-12 01:38:22,198 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining)
[2024-03-12 01:38:22,198 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining)
[2024-03-12 01:38:22,198 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining)
[2024-03-12 01:38:22,198 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining)
[2024-03-12 01:38:22,198 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining)
[2024-03-12 01:38:22,198 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining)
[2024-03-12 01:38:22,199 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining)
[2024-03-12 01:38:22,199 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining)
[2024-03-12 01:38:22,199 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining)
[2024-03-12 01:38:22,199 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining)
[2024-03-12 01:38:22,199 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining)
[2024-03-12 01:38:22,199 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2024-03-12 01:38:22,199 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:38:22,200 WARN  L233   ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-03-12 01:38:22,200 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances.
[2024-03-12 01:38:22,218 INFO  L144    ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions.
[2024-03-12 01:38:22,219 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 185 places, 182 transitions, 419 flow
[2024-03-12 01:38:22,369 INFO  L124   PetriNetUnfolderBase]: 93/1622 cut-off events.
[2024-03-12 01:38:22,369 INFO  L125   PetriNetUnfolderBase]: For 110/110 co-relation queries the response was YES.
[2024-03-12 01:38:22,375 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1728 conditions, 1622 events. 93/1622 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 8277 event pairs, 23 based on Foata normal form. 0/1406 useless extension candidates. Maximal degree in co-relation 925. Up to 80 conditions per place. 
[2024-03-12 01:38:22,375 INFO  L82        GeneralOperation]: Start removeDead. Operand has 185 places, 182 transitions, 419 flow
[2024-03-12 01:38:22,380 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 185 places, 182 transitions, 419 flow
[2024-03-12 01:38:22,380 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-12 01:38:22,381 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;@104c922d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-03-12 01:38:22,381 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 12 error locations.
[2024-03-12 01:38:22,383 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-03-12 01:38:22,383 INFO  L124   PetriNetUnfolderBase]: 3/52 cut-off events.
[2024-03-12 01:38:22,383 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-03-12 01:38:22,383 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:38:22,383 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]
[2024-03-12 01:38:22,383 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 9 more)] ===
[2024-03-12 01:38:22,384 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:38:22,384 INFO  L85        PathProgramCache]: Analyzing trace with hash 2002990289, now seen corresponding path program 1 times
[2024-03-12 01:38:22,384 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:38:22,384 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52549225]
[2024-03-12 01:38:22,384 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:38:22,384 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:38:22,392 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:38:22,493 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:38:22,493 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:38:22,493 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52549225]
[2024-03-12 01:38:22,493 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52549225] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:38:22,493 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:38:22,493 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 01:38:22,494 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342567226]
[2024-03-12 01:38:22,494 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:38:22,494 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-12 01:38:22,494 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:38:22,494 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-12 01:38:22,495 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-12 01:38:22,646 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 137 out of 182
[2024-03-12 01:38:22,647 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 182 transitions, 419 flow. Second operand  has 6 states, 6 states have (on average 138.16666666666666) internal successors, (829), 6 states have internal predecessors, (829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:38:22,647 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:38:22,647 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 182
[2024-03-12 01:38:22,647 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:38:38,242 INFO  L124   PetriNetUnfolderBase]: 39523/136623 cut-off events.
[2024-03-12 01:38:38,242 INFO  L125   PetriNetUnfolderBase]: For 5419/5419 co-relation queries the response was YES.
[2024-03-12 01:38:38,721 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 193351 conditions, 136623 events. 39523/136623 cut-off events. For 5419/5419 co-relation queries the response was YES. Maximal size of possible extension queue 2868. Compared 2027077 event pairs, 33951 based on Foata normal form. 1172/127390 useless extension candidates. Maximal degree in co-relation 64008. Up to 47594 conditions per place. 
[2024-03-12 01:38:39,199 INFO  L140   encePairwiseOnDemand]: 163/182 looper letters, 48 selfloop transitions, 13 changer transitions 1/198 dead transitions.
[2024-03-12 01:38:39,200 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 198 transitions, 573 flow
[2024-03-12 01:38:39,200 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 01:38:39,201 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 01:38:39,201 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 891 transitions.
[2024-03-12 01:38:39,202 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8159340659340659
[2024-03-12 01:38:39,202 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 891 transitions.
[2024-03-12 01:38:39,202 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 891 transitions.
[2024-03-12 01:38:39,202 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:38:39,202 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 891 transitions.
[2024-03-12 01:38:39,203 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 148.5) internal successors, (891), 6 states have internal predecessors, (891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:38:39,205 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 182.0) internal successors, (1274), 7 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:38:39,205 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 182.0) internal successors, (1274), 7 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:38:39,205 INFO  L175             Difference]: Start difference. First operand has 185 places, 182 transitions, 419 flow. Second operand 6 states and 891 transitions.
[2024-03-12 01:38:39,205 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 198 transitions, 573 flow
[2024-03-12 01:38:39,214 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 198 transitions, 573 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-12 01:38:39,215 INFO  L231             Difference]: Finished difference. Result has 191 places, 187 transitions, 501 flow
[2024-03-12 01:38:39,216 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=407, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=501, PETRI_PLACES=191, PETRI_TRANSITIONS=187}
[2024-03-12 01:38:39,216 INFO  L281   CegarLoopForPetriNet]: 185 programPoint places, 6 predicate places.
[2024-03-12 01:38:39,216 INFO  L495      AbstractCegarLoop]: Abstraction has has 191 places, 187 transitions, 501 flow
[2024-03-12 01:38:39,216 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 138.16666666666666) internal successors, (829), 6 states have internal predecessors, (829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:38:39,217 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:38:39,217 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]
[2024-03-12 01:38:39,217 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2024-03-12 01:38:39,217 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 9 more)] ===
[2024-03-12 01:38:39,217 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:38:39,217 INFO  L85        PathProgramCache]: Analyzing trace with hash 808586608, now seen corresponding path program 1 times
[2024-03-12 01:38:39,218 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:38:39,218 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746180512]
[2024-03-12 01:38:39,218 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:38:39,218 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:38:39,226 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:38:39,237 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:38:39,237 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:38:39,237 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746180512]
[2024-03-12 01:38:39,237 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746180512] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:38:39,237 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:38:39,238 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 01:38:39,238 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317443651]
[2024-03-12 01:38:39,238 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:38:39,238 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 01:38:39,238 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:38:39,239 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 01:38:39,239 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 01:38:39,261 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 151 out of 182
[2024-03-12 01:38:39,261 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 187 transitions, 501 flow. Second operand  has 3 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:38:39,261 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:38:39,261 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 182
[2024-03-12 01:38:39,262 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:38:57,408 INFO  L124   PetriNetUnfolderBase]: 51884/150186 cut-off events.
[2024-03-12 01:38:57,408 INFO  L125   PetriNetUnfolderBase]: For 18384/30801 co-relation queries the response was YES.
[2024-03-12 01:38:58,100 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 234920 conditions, 150186 events. 51884/150186 cut-off events. For 18384/30801 co-relation queries the response was YES. Maximal size of possible extension queue 3549. Compared 2139322 event pairs, 29580 based on Foata normal form. 0/137883 useless extension candidates. Maximal degree in co-relation 219192. Up to 48608 conditions per place. 
[2024-03-12 01:38:58,778 INFO  L140   encePairwiseOnDemand]: 174/182 looper letters, 37 selfloop transitions, 7 changer transitions 4/203 dead transitions.
[2024-03-12 01:38:58,778 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 203 transitions, 621 flow
[2024-03-12 01:38:58,780 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 01:38:58,780 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 01:38:58,780 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 498 transitions.
[2024-03-12 01:38:58,780 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9120879120879121
[2024-03-12 01:38:58,780 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 498 transitions.
[2024-03-12 01:38:58,781 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 498 transitions.
[2024-03-12 01:38:58,781 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:38:58,781 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 498 transitions.
[2024-03-12 01:38:58,781 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 166.0) internal successors, (498), 3 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:38:58,782 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 182.0) internal successors, (728), 4 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-03-12 01:38:58,782 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 182.0) internal successors, (728), 4 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-03-12 01:38:58,782 INFO  L175             Difference]: Start difference. First operand has 191 places, 187 transitions, 501 flow. Second operand 3 states and 498 transitions.
[2024-03-12 01:38:58,782 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 203 transitions, 621 flow
[2024-03-12 01:39:01,201 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 203 transitions, 617 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-12 01:39:01,203 INFO  L231             Difference]: Finished difference. Result has 193 places, 189 transitions, 529 flow
[2024-03-12 01:39:01,204 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=497, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=529, PETRI_PLACES=193, PETRI_TRANSITIONS=189}
[2024-03-12 01:39:01,204 INFO  L281   CegarLoopForPetriNet]: 185 programPoint places, 8 predicate places.
[2024-03-12 01:39:01,204 INFO  L495      AbstractCegarLoop]: Abstraction has has 193 places, 189 transitions, 529 flow
[2024-03-12 01:39:01,204 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:39:01,204 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:39:01,205 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]
[2024-03-12 01:39:01,205 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35
[2024-03-12 01:39:01,205 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 9 more)] ===
[2024-03-12 01:39:01,205 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:39:01,205 INFO  L85        PathProgramCache]: Analyzing trace with hash -1528788945, now seen corresponding path program 1 times
[2024-03-12 01:39:01,206 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:39:01,206 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834313314]
[2024-03-12 01:39:01,206 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:39:01,206 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:39:01,220 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:39:01,258 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:39:01,258 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:39:01,258 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834313314]
[2024-03-12 01:39:01,258 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834313314] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:39:01,258 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:39:01,259 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 01:39:01,259 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138177675]
[2024-03-12 01:39:01,259 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:39:01,259 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-03-12 01:39:01,259 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:39:01,259 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-03-12 01:39:01,259 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-03-12 01:39:01,306 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 148 out of 182
[2024-03-12 01:39:01,306 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 189 transitions, 529 flow. Second operand  has 5 states, 5 states have (on average 149.4) internal successors, (747), 5 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:39:01,306 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:39:01,307 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 182
[2024-03-12 01:39:01,307 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:39:24,524 INFO  L124   PetriNetUnfolderBase]: 59384/190886 cut-off events.
[2024-03-12 01:39:24,524 INFO  L125   PetriNetUnfolderBase]: For 15002/15221 co-relation queries the response was YES.
[2024-03-12 01:39:25,709 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 294795 conditions, 190886 events. 59384/190886 cut-off events. For 15002/15221 co-relation queries the response was YES. Maximal size of possible extension queue 3829. Compared 2903559 event pairs, 48714 based on Foata normal form. 1/166930 useless extension candidates. Maximal degree in co-relation 184183. Up to 62672 conditions per place. 
[2024-03-12 01:39:26,713 INFO  L140   encePairwiseOnDemand]: 175/182 looper letters, 32 selfloop transitions, 2 changer transitions 4/192 dead transitions.
[2024-03-12 01:39:26,713 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 192 transitions, 597 flow
[2024-03-12 01:39:26,714 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 01:39:26,714 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 01:39:26,715 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 927 transitions.
[2024-03-12 01:39:26,715 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8489010989010989
[2024-03-12 01:39:26,716 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 927 transitions.
[2024-03-12 01:39:26,716 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 927 transitions.
[2024-03-12 01:39:26,716 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:39:26,716 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 927 transitions.
[2024-03-12 01:39:26,717 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 154.5) internal successors, (927), 6 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:39:26,718 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 182.0) internal successors, (1274), 7 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:39:26,719 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 182.0) internal successors, (1274), 7 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:39:26,719 INFO  L175             Difference]: Start difference. First operand has 193 places, 189 transitions, 529 flow. Second operand 6 states and 927 transitions.
[2024-03-12 01:39:26,719 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 192 transitions, 597 flow
[2024-03-12 01:39:28,189 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 192 transitions, 569 flow, removed 7 selfloop flow, removed 2 redundant places.
[2024-03-12 01:39:28,191 INFO  L231             Difference]: Finished difference. Result has 200 places, 186 transitions, 499 flow
[2024-03-12 01:39:28,191 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=479, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=499, PETRI_PLACES=200, PETRI_TRANSITIONS=186}
[2024-03-12 01:39:28,192 INFO  L281   CegarLoopForPetriNet]: 185 programPoint places, 15 predicate places.
[2024-03-12 01:39:28,192 INFO  L495      AbstractCegarLoop]: Abstraction has has 200 places, 186 transitions, 499 flow
[2024-03-12 01:39:28,192 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 149.4) internal successors, (747), 5 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:39:28,192 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:39:28,192 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]
[2024-03-12 01:39:28,192 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36
[2024-03-12 01:39:28,192 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 9 more)] ===
[2024-03-12 01:39:28,193 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:39:28,193 INFO  L85        PathProgramCache]: Analyzing trace with hash 1681341261, now seen corresponding path program 1 times
[2024-03-12 01:39:28,193 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:39:28,193 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085831890]
[2024-03-12 01:39:28,193 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:39:28,193 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:39:28,200 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:39:28,209 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:39:28,209 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:39:28,209 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085831890]
[2024-03-12 01:39:28,209 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085831890] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:39:28,210 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:39:28,210 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 01:39:28,210 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362447880]
[2024-03-12 01:39:28,210 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:39:28,210 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 01:39:28,210 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:39:28,210 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 01:39:28,210 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 01:39:28,231 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 149 out of 182
[2024-03-12 01:39:28,231 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 186 transitions, 499 flow. Second operand  has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:39:28,231 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:39:28,231 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 182
[2024-03-12 01:39:28,231 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:40:05,169 INFO  L124   PetriNetUnfolderBase]: 92612/289541 cut-off events.
[2024-03-12 01:40:05,169 INFO  L125   PetriNetUnfolderBase]: For 69598/153629 co-relation queries the response was YES.
[2024-03-12 01:40:06,984 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 484079 conditions, 289541 events. 92612/289541 cut-off events. For 69598/153629 co-relation queries the response was YES. Maximal size of possible extension queue 7268. Compared 4639368 event pairs, 52694 based on Foata normal form. 136/260396 useless extension candidates. Maximal degree in co-relation 484006. Up to 102181 conditions per place. 
[2024-03-12 01:40:08,398 INFO  L140   encePairwiseOnDemand]: 173/182 looper letters, 49 selfloop transitions, 13 changer transitions 0/213 dead transitions.
[2024-03-12 01:40:08,399 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 213 transitions, 739 flow
[2024-03-12 01:40:08,399 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 01:40:08,399 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 01:40:08,400 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 501 transitions.
[2024-03-12 01:40:08,400 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9175824175824175
[2024-03-12 01:40:08,400 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 501 transitions.
[2024-03-12 01:40:08,400 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 501 transitions.
[2024-03-12 01:40:08,400 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:40:08,400 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 501 transitions.
[2024-03-12 01:40:08,401 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 167.0) internal successors, (501), 3 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:40:08,401 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 182.0) internal successors, (728), 4 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-03-12 01:40:08,401 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 182.0) internal successors, (728), 4 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-03-12 01:40:08,401 INFO  L175             Difference]: Start difference. First operand has 200 places, 186 transitions, 499 flow. Second operand 3 states and 501 transitions.
[2024-03-12 01:40:08,401 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 213 transitions, 739 flow
[2024-03-12 01:40:09,238 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 213 transitions, 727 flow, removed 5 selfloop flow, removed 4 redundant places.
[2024-03-12 01:40:09,240 INFO  L231             Difference]: Finished difference. Result has 197 places, 197 transitions, 603 flow
[2024-03-12 01:40:09,240 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=487, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=603, PETRI_PLACES=197, PETRI_TRANSITIONS=197}
[2024-03-12 01:40:09,241 INFO  L281   CegarLoopForPetriNet]: 185 programPoint places, 12 predicate places.
[2024-03-12 01:40:09,241 INFO  L495      AbstractCegarLoop]: Abstraction has has 197 places, 197 transitions, 603 flow
[2024-03-12 01:40:09,241 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:40:09,241 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:40:09,241 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]
[2024-03-12 01:40:09,241 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37
[2024-03-12 01:40:09,241 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 9 more)] ===
[2024-03-12 01:40:09,242 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:40:09,242 INFO  L85        PathProgramCache]: Analyzing trace with hash 195969524, now seen corresponding path program 1 times
[2024-03-12 01:40:09,242 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:40:09,242 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181877689]
[2024-03-12 01:40:09,242 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:40:09,242 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:40:09,268 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:40:09,414 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-12 01:40:09,415 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:40:09,415 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181877689]
[2024-03-12 01:40:09,415 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181877689] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:40:09,415 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:40:09,415 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 01:40:09,415 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671140448]
[2024-03-12 01:40:09,415 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:40:09,415 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-12 01:40:09,416 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:40:09,416 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-12 01:40:09,416 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-12 01:40:09,650 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 146 out of 182
[2024-03-12 01:40:09,650 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 197 transitions, 603 flow. Second operand  has 6 states, 6 states have (on average 147.5) internal successors, (885), 6 states have internal predecessors, (885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:40:09,650 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:40:09,650 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 182
[2024-03-12 01:40:09,651 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:40:22,303 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([925] L1016-4-->L1016-5: Formula: (= |v_#race~data~0_1| |v_threadThread5of5ForFork0_#t~nondet5_3|)  InVars {threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_1|, threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][234], [Black: 190#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 83#L1016-5true, Black: 192#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 191#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 188#true, 110#L1031-2true, 6#L1016-6true, Black: 201#(= |#race~data~0| 0), 36#L1015-3true, 174#L1017-3true, 217#true, 51#L1016-5true, threadThread1of5ForFork0InUse, threadThread2of5ForFork0InUse, threadThread3of5ForFork0InUse, Black: 207#(= |ULTIMATE.start_main_~i~0#1| 0), threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, Black: 219#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|), 223#true])
[2024-03-12 01:40:22,303 INFO  L294   olderBase$Statistics]: this new event has 166 ancestors and is cut-off event
[2024-03-12 01:40:22,303 INFO  L297   olderBase$Statistics]:   existing Event has 166 ancestors and is cut-off event
[2024-03-12 01:40:22,303 INFO  L297   olderBase$Statistics]:   existing Event has 166 ancestors and is cut-off event
[2024-03-12 01:40:22,303 INFO  L297   olderBase$Statistics]:   existing Event has 166 ancestors and is cut-off event
[2024-03-12 01:40:22,512 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([925] L1016-4-->L1016-5: Formula: (= |v_#race~data~0_1| |v_threadThread5of5ForFork0_#t~nondet5_3|)  InVars {threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_1|, threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][234], [Black: 190#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 192#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 83#L1016-5true, Black: 191#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 110#L1031-2true, Black: 188#true, 145#L1016-5true, 6#L1016-6true, Black: 201#(= |#race~data~0| 0), 217#true, 57#L1015-3true, threadThread1of5ForFork0InUse, threadThread2of5ForFork0InUse, threadThread3of5ForFork0InUse, Black: 207#(= |ULTIMATE.start_main_~i~0#1| 0), threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 176#L1017-3true, 223#true, Black: 219#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|)])
[2024-03-12 01:40:22,512 INFO  L294   olderBase$Statistics]: this new event has 166 ancestors and is cut-off event
[2024-03-12 01:40:22,512 INFO  L297   olderBase$Statistics]:   existing Event has 166 ancestors and is cut-off event
[2024-03-12 01:40:22,512 INFO  L297   olderBase$Statistics]:   existing Event has 166 ancestors and is cut-off event
[2024-03-12 01:40:22,512 INFO  L297   olderBase$Statistics]:   existing Event has 166 ancestors and is cut-off event
[2024-03-12 01:40:23,209 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([909] L1016-4-->L1016-5: Formula: (= |v_threadThread3of5ForFork0_#t~nondet5_3| |v_#race~data~0_1|)  InVars {threadThread3of5ForFork0_#t~nondet5=|v_threadThread3of5ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_1|, threadThread3of5ForFork0_#t~nondet5=|v_threadThread3of5ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][174], [Black: 190#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 192#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 191#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 110#L1031-2true, Black: 188#true, 145#L1016-5true, Black: 201#(= |#race~data~0| 0), 217#true, 158#L1017true, threadThread1of5ForFork0InUse, threadThread2of5ForFork0InUse, threadThread3of5ForFork0InUse, threadThread4of5ForFork0NotInUse, Black: 207#(= |ULTIMATE.start_main_~i~0#1| 0), threadThread5of5ForFork0NotInUse, 45#L1015-3true, 223#true, Black: 219#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|)])
[2024-03-12 01:40:23,210 INFO  L294   olderBase$Statistics]: this new event has 165 ancestors and is cut-off event
[2024-03-12 01:40:23,210 INFO  L297   olderBase$Statistics]:   existing Event has 165 ancestors and is cut-off event
[2024-03-12 01:40:23,210 INFO  L297   olderBase$Statistics]:   existing Event has 114 ancestors and is cut-off event
[2024-03-12 01:40:23,210 INFO  L297   olderBase$Statistics]:   existing Event has 114 ancestors and is cut-off event
[2024-03-12 01:40:25,884 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([941] L1016-4-->L1016-5: Formula: (= |v_#race~data~0_1| |v_threadThread4of5ForFork0_#t~nondet5_3|)  InVars {threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_3|}  OutVars{threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_1|}  AuxVars[]  AssignedVars[#race~data~0][220], [Black: 190#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 192#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 191#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 110#L1031-2true, Black: 188#true, 145#L1016-5true, 6#L1016-6true, Black: 201#(= |#race~data~0| 0), 217#true, threadThread1of5ForFork0InUse, threadThread2of5ForFork0NotInUse, threadThread3of5ForFork0InUse, Black: 207#(= |ULTIMATE.start_main_~i~0#1| 0), threadThread4of5ForFork0InUse, threadThread5of5ForFork0NotInUse, 58#L1016-5true, Black: 219#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|), 223#true])
[2024-03-12 01:40:25,884 INFO  L294   olderBase$Statistics]: this new event has 169 ancestors and is cut-off event
[2024-03-12 01:40:25,884 INFO  L297   olderBase$Statistics]:   existing Event has 169 ancestors and is cut-off event
[2024-03-12 01:40:25,884 INFO  L297   olderBase$Statistics]:   existing Event has 169 ancestors and is cut-off event
[2024-03-12 01:40:25,884 INFO  L297   olderBase$Statistics]:   existing Event has 169 ancestors and is cut-off event
[2024-03-12 01:40:26,443 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([909] L1016-4-->L1016-5: Formula: (= |v_threadThread3of5ForFork0_#t~nondet5_3| |v_#race~data~0_1|)  InVars {threadThread3of5ForFork0_#t~nondet5=|v_threadThread3of5ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_1|, threadThread3of5ForFork0_#t~nondet5=|v_threadThread3of5ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][174], [Black: 190#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 192#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 191#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 110#L1031-2true, Black: 188#true, 145#L1016-5true, 79#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 201#(= |#race~data~0| 0), 217#true, 51#L1016-5true, threadThread1of5ForFork0InUse, threadThread2of5ForFork0InUse, threadThread3of5ForFork0InUse, Black: 207#(= |ULTIMATE.start_main_~i~0#1| 0), threadThread4of5ForFork0NotInUse, threadThread5of5ForFork0NotInUse, 223#true, Black: 219#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|)])
[2024-03-12 01:40:26,444 INFO  L294   olderBase$Statistics]: this new event has 169 ancestors and is cut-off event
[2024-03-12 01:40:26,444 INFO  L297   olderBase$Statistics]:   existing Event has 118 ancestors and is cut-off event
[2024-03-12 01:40:26,444 INFO  L297   olderBase$Statistics]:   existing Event has 118 ancestors and is cut-off event
[2024-03-12 01:40:26,444 INFO  L297   olderBase$Statistics]:   existing Event has 169 ancestors and is cut-off event
[2024-03-12 01:40:27,692 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([941] L1016-4-->L1016-5: Formula: (= |v_#race~data~0_1| |v_threadThread4of5ForFork0_#t~nondet5_3|)  InVars {threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_3|}  OutVars{threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_1|}  AuxVars[]  AssignedVars[#race~data~0][203], [Black: 190#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 192#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 191#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 110#L1031-2true, Black: 188#true, 145#L1016-5true, Black: 201#(= |#race~data~0| 0), 217#true, 158#L1017true, threadThread1of5ForFork0InUse, threadThread2of5ForFork0NotInUse, threadThread3of5ForFork0InUse, Black: 207#(= |ULTIMATE.start_main_~i~0#1| 0), threadThread4of5ForFork0InUse, threadThread5of5ForFork0NotInUse, 58#L1016-5true, Black: 219#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|), 223#true])
[2024-03-12 01:40:27,692 INFO  L294   olderBase$Statistics]: this new event has 171 ancestors and is cut-off event
[2024-03-12 01:40:27,693 INFO  L297   olderBase$Statistics]:   existing Event has 171 ancestors and is cut-off event
[2024-03-12 01:40:27,693 INFO  L297   olderBase$Statistics]:   existing Event has 171 ancestors and is cut-off event
[2024-03-12 01:40:27,693 INFO  L297   olderBase$Statistics]:   existing Event has 171 ancestors and is cut-off event
[2024-03-12 01:40:28,956 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([925] L1016-4-->L1016-5: Formula: (= |v_#race~data~0_1| |v_threadThread5of5ForFork0_#t~nondet5_3|)  InVars {threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_1|, threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][234], [Black: 190#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 83#L1016-5true, Black: 192#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 191#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 188#true, 110#L1031-2true, 6#L1016-6true, Black: 201#(= |#race~data~0| 0), 174#L1017-3true, 217#true, 51#L1016-5true, threadThread1of5ForFork0InUse, 140#L1017-3true, threadThread2of5ForFork0InUse, threadThread3of5ForFork0InUse, Black: 207#(= |ULTIMATE.start_main_~i~0#1| 0), threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, Black: 219#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|), 223#true])
[2024-03-12 01:40:28,957 INFO  L294   olderBase$Statistics]: this new event has 176 ancestors and is cut-off event
[2024-03-12 01:40:28,957 INFO  L297   olderBase$Statistics]:   existing Event has 176 ancestors and is cut-off event
[2024-03-12 01:40:28,957 INFO  L297   olderBase$Statistics]:   existing Event has 176 ancestors and is cut-off event
[2024-03-12 01:40:28,957 INFO  L297   olderBase$Statistics]:   existing Event has 176 ancestors and is cut-off event
[2024-03-12 01:40:32,976 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([925] L1016-4-->L1016-5: Formula: (= |v_#race~data~0_1| |v_threadThread5of5ForFork0_#t~nondet5_3|)  InVars {threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_1|, threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][228], [Black: 190#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 83#L1016-5true, Black: 192#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 191#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 110#L1031-2true, Black: 188#true, 79#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 201#(= |#race~data~0| 0), 174#L1017-3true, 217#true, 51#L1016-5true, threadThread1of5ForFork0InUse, 140#L1017-3true, threadThread2of5ForFork0InUse, threadThread3of5ForFork0InUse, Black: 207#(= |ULTIMATE.start_main_~i~0#1| 0), threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, Black: 219#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|), 223#true])
[2024-03-12 01:40:32,976 INFO  L294   olderBase$Statistics]: this new event has 176 ancestors and is cut-off event
[2024-03-12 01:40:32,976 INFO  L297   olderBase$Statistics]:   existing Event has 176 ancestors and is cut-off event
[2024-03-12 01:40:32,977 INFO  L297   olderBase$Statistics]:   existing Event has 176 ancestors and is cut-off event
[2024-03-12 01:40:32,977 INFO  L297   olderBase$Statistics]:   existing Event has 176 ancestors and is cut-off event
[2024-03-12 01:40:32,977 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([925] L1016-4-->L1016-5: Formula: (= |v_#race~data~0_1| |v_threadThread5of5ForFork0_#t~nondet5_3|)  InVars {threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_1|, threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][212], [Black: 190#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 83#L1016-5true, Black: 192#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 191#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 188#true, 79#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 201#(= |#race~data~0| 0), 174#L1017-3true, 217#true, 51#L1016-5true, threadThread1of5ForFork0InUse, 140#L1017-3true, threadThread2of5ForFork0InUse, threadThread3of5ForFork0InUse, 39#ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACEtrue, Black: 207#(= |ULTIMATE.start_main_~i~0#1| 0), threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 223#true, Black: 219#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|)])
[2024-03-12 01:40:32,977 INFO  L294   olderBase$Statistics]: this new event has 176 ancestors and is cut-off event
[2024-03-12 01:40:32,977 INFO  L297   olderBase$Statistics]:   existing Event has 176 ancestors and is cut-off event
[2024-03-12 01:40:32,977 INFO  L297   olderBase$Statistics]:   existing Event has 176 ancestors and is cut-off event
[2024-03-12 01:40:32,977 INFO  L297   olderBase$Statistics]:   existing Event has 176 ancestors and is cut-off event
[2024-03-12 01:40:33,441 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([909] L1016-4-->L1016-5: Formula: (= |v_threadThread3of5ForFork0_#t~nondet5_3| |v_#race~data~0_1|)  InVars {threadThread3of5ForFork0_#t~nondet5=|v_threadThread3of5ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_1|, threadThread3of5ForFork0_#t~nondet5=|v_threadThread3of5ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][174], [Black: 190#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 192#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 191#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 188#true, 110#L1031-2true, 145#L1016-5true, Black: 201#(= |#race~data~0| 0), 217#true, 158#L1017true, threadThread1of5ForFork0InUse, threadThread2of5ForFork0InUse, threadThread3of5ForFork0InUse, Black: 207#(= |ULTIMATE.start_main_~i~0#1| 0), 12#$Ultimate##0true, threadThread4of5ForFork0InUse, threadThread5of5ForFork0NotInUse, 45#L1015-3true, Black: 219#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|), 223#true])
[2024-03-12 01:40:33,442 INFO  L294   olderBase$Statistics]: this new event has 182 ancestors and is cut-off event
[2024-03-12 01:40:33,442 INFO  L297   olderBase$Statistics]:   existing Event has 131 ancestors and is cut-off event
[2024-03-12 01:40:33,442 INFO  L297   olderBase$Statistics]:   existing Event has 131 ancestors and is cut-off event
[2024-03-12 01:40:33,442 INFO  L297   olderBase$Statistics]:   existing Event has 182 ancestors and is cut-off event
[2024-03-12 01:40:33,442 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([941] L1016-4-->L1016-5: Formula: (= |v_#race~data~0_1| |v_threadThread4of5ForFork0_#t~nondet5_3|)  InVars {threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_3|}  OutVars{threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_1|}  AuxVars[]  AssignedVars[#race~data~0][203], [Black: 190#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 192#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 191#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 110#L1031-2true, Black: 188#true, Black: 201#(= |#race~data~0| 0), 217#true, 158#L1017true, threadThread1of5ForFork0InUse, 101#$Ultimate##0true, threadThread2of5ForFork0InUse, threadThread3of5ForFork0InUse, Black: 207#(= |ULTIMATE.start_main_~i~0#1| 0), threadThread4of5ForFork0InUse, threadThread5of5ForFork0NotInUse, 58#L1016-5true, 45#L1015-3true, Black: 219#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|), 223#true])
[2024-03-12 01:40:33,442 INFO  L294   olderBase$Statistics]: this new event has 182 ancestors and is cut-off event
[2024-03-12 01:40:33,443 INFO  L297   olderBase$Statistics]:   existing Event has 182 ancestors and is cut-off event
[2024-03-12 01:40:33,443 INFO  L297   olderBase$Statistics]:   existing Event has 131 ancestors and is cut-off event
[2024-03-12 01:40:33,443 INFO  L297   olderBase$Statistics]:   existing Event has 131 ancestors and is cut-off event
[2024-03-12 01:40:33,443 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([941] L1016-4-->L1016-5: Formula: (= |v_#race~data~0_1| |v_threadThread4of5ForFork0_#t~nondet5_3|)  InVars {threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_3|}  OutVars{threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_1|}  AuxVars[]  AssignedVars[#race~data~0][203], [Black: 190#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 172#$Ultimate##0true, Black: 192#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 191#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 110#L1031-2true, Black: 188#true, Black: 201#(= |#race~data~0| 0), 36#L1015-3true, 217#true, 158#L1017true, threadThread1of5ForFork0InUse, threadThread2of5ForFork0InUse, threadThread3of5ForFork0InUse, Black: 207#(= |ULTIMATE.start_main_~i~0#1| 0), threadThread4of5ForFork0InUse, threadThread5of5ForFork0NotInUse, 58#L1016-5true, Black: 219#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|), 223#true])
[2024-03-12 01:40:33,443 INFO  L294   olderBase$Statistics]: this new event has 182 ancestors and is cut-off event
[2024-03-12 01:40:33,444 INFO  L297   olderBase$Statistics]:   existing Event has 182 ancestors and is cut-off event
[2024-03-12 01:40:33,444 INFO  L297   olderBase$Statistics]:   existing Event has 131 ancestors and is cut-off event
[2024-03-12 01:40:33,444 INFO  L297   olderBase$Statistics]:   existing Event has 131 ancestors and is cut-off event
[2024-03-12 01:40:34,427 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([941] L1016-4-->L1016-5: Formula: (= |v_#race~data~0_1| |v_threadThread4of5ForFork0_#t~nondet5_3|)  InVars {threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_3|}  OutVars{threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_1|}  AuxVars[]  AssignedVars[#race~data~0][203], [Black: 190#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 192#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 191#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 110#L1031-2true, Black: 188#true, Black: 201#(= |#race~data~0| 0), 36#L1015-3true, 217#true, 158#L1017true, threadThread1of5ForFork0InUse, threadThread2of5ForFork0InUse, threadThread3of5ForFork0InUse, Black: 207#(= |ULTIMATE.start_main_~i~0#1| 0), threadThread4of5ForFork0InUse, threadThread5of5ForFork0NotInUse, 45#L1015-3true, 58#L1016-5true, Black: 219#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|), 223#true])
[2024-03-12 01:40:34,427 INFO  L294   olderBase$Statistics]: this new event has 184 ancestors and is cut-off event
[2024-03-12 01:40:34,427 INFO  L297   olderBase$Statistics]:   existing Event has 133 ancestors and is cut-off event
[2024-03-12 01:40:34,428 INFO  L297   olderBase$Statistics]:   existing Event has 184 ancestors and is cut-off event
[2024-03-12 01:40:34,428 INFO  L297   olderBase$Statistics]:   existing Event has 133 ancestors and is cut-off event
