./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/per-thread-index-inc-race.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/per-thread-index-inc-race.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 c2477e080b433404a699ec58c97164bf32e77252c3111797e1b8766fb1eccb6a
--- Real Ultimate output ---
This is Ultimate 0.2.4-dev-0e0057c
[2024-03-09 05:56:44,992 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-03-09 05:56:45,030 INFO  L114        SettingsManager]: Loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2024-03-09 05:56:45,033 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-03-09 05:56:45,033 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-03-09 05:56:45,051 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-03-09 05:56:45,051 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-03-09 05:56:45,051 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-03-09 05:56:45,052 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-03-09 05:56:45,052 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-03-09 05:56:45,053 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-03-09 05:56:45,053 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-03-09 05:56:45,053 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-03-09 05:56:45,054 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-03-09 05:56:45,054 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-03-09 05:56:45,054 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-03-09 05:56:45,054 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-03-09 05:56:45,054 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-03-09 05:56:45,055 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-03-09 05:56:45,055 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-03-09 05:56:45,055 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-03-09 05:56:45,056 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-03-09 05:56:45,056 INFO  L153        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2024-03-09 05:56:45,056 INFO  L153        SettingsManager]:  * Check unreachability of reach_error function=false
[2024-03-09 05:56:45,056 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-03-09 05:56:45,057 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-03-09 05:56:45,057 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-03-09 05:56:45,057 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-03-09 05:56:45,057 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-03-09 05:56:45,057 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-03-09 05:56:45,058 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-03-09 05:56:45,058 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-03-09 05:56:45,058 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-03-09 05:56:45,058 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-03-09 05:56:45,062 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-03-09 05:56:45,062 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-03-09 05:56:45,062 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-03-09 05:56:45,062 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-03-09 05:56:45,062 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-03-09 05:56:45,062 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-03-09 05:56:45,063 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-03-09 05:56:45,063 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 -> c2477e080b433404a699ec58c97164bf32e77252c3111797e1b8766fb1eccb6a
[2024-03-09 05:56:45,228 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-03-09 05:56:45,243 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-03-09 05:56:45,245 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-03-09 05:56:45,246 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-03-09 05:56:45,246 INFO  L274        PluginConnector]: CDTParser initialized
[2024-03-09 05:56:45,247 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-index-inc-race.i
[2024-03-09 05:56:46,338 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-03-09 05:56:46,516 INFO  L384              CDTParser]: Found 1 translation units.
[2024-03-09 05:56:46,517 INFO  L180              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-index-inc-race.i
[2024-03-09 05:56:46,529 INFO  L427              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data/074e329e5/e5e0ed2adecd4d71af02bbcc786ac04b/FLAGa7877997a
[2024-03-09 05:56:46,887 INFO  L435              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data/074e329e5/e5e0ed2adecd4d71af02bbcc786ac04b
[2024-03-09 05:56:46,889 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-03-09 05:56:46,890 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-03-09 05:56:46,892 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-03-09 05:56:46,892 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-03-09 05:56:46,896 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-03-09 05:56:46,896 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 05:56:46" (1/1) ...
[2024-03-09 05:56:46,897 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cdb2423 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:56:46, skipping insertion in model container
[2024-03-09 05:56:46,897 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 05:56:46" (1/1) ...
[2024-03-09 05:56:46,934 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-03-09 05:56:47,224 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2024-03-09 05:56:47,230 INFO  L202         MainTranslator]: Completed pre-run
[2024-03-09 05:56:47,265 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2024-03-09 05:56:47,300 INFO  L206         MainTranslator]: Completed translation
[2024-03-09 05:56:47,300 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:56:47 WrapperNode
[2024-03-09 05:56:47,301 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-03-09 05:56:47,301 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-03-09 05:56:47,301 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-03-09 05:56:47,301 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-03-09 05:56:47,306 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:56:47" (1/1) ...
[2024-03-09 05:56:47,321 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:56:47" (1/1) ...
[2024-03-09 05:56:47,339 INFO  L138                Inliner]: procedures = 277, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 88
[2024-03-09 05:56:47,339 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-03-09 05:56:47,340 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-03-09 05:56:47,340 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-03-09 05:56:47,340 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-03-09 05:56:47,347 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:56:47" (1/1) ...
[2024-03-09 05:56:47,347 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:56:47" (1/1) ...
[2024-03-09 05:56:47,351 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:56:47" (1/1) ...
[2024-03-09 05:56:47,351 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:56:47" (1/1) ...
[2024-03-09 05:56:47,358 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:56:47" (1/1) ...
[2024-03-09 05:56:47,360 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:56:47" (1/1) ...
[2024-03-09 05:56:47,362 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:56:47" (1/1) ...
[2024-03-09 05:56:47,363 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:56:47" (1/1) ...
[2024-03-09 05:56:47,365 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-03-09 05:56:47,365 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-03-09 05:56:47,366 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-03-09 05:56:47,366 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-03-09 05:56:47,366 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:56:47" (1/1) ...
[2024-03-09 05:56:47,371 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-03-09 05:56:47,379 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 05:56:47,404 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-09 05:56:47,407 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-09 05:56:47,428 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2024-03-09 05:56:47,428 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2024-03-09 05:56:47,428 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-03-09 05:56:47,428 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2024-03-09 05:56:47,428 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2024-03-09 05:56:47,428 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2024-03-09 05:56:47,428 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2024-03-09 05:56:47,428 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2024-03-09 05:56:47,428 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2024-03-09 05:56:47,428 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-03-09 05:56:47,429 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-03-09 05:56:47,430 WARN  L213             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-03-09 05:56:47,572 INFO  L241             CfgBuilder]: Building ICFG
[2024-03-09 05:56:47,574 INFO  L267             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-03-09 05:56:47,741 INFO  L282             CfgBuilder]: Performing block encoding
[2024-03-09 05:56:47,755 INFO  L304             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-03-09 05:56:47,756 INFO  L309             CfgBuilder]: Removed 2 assume(true) statements.
[2024-03-09 05:56:47,757 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.03 05:56:47 BoogieIcfgContainer
[2024-03-09 05:56:47,757 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-03-09 05:56:47,758 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-03-09 05:56:47,758 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-03-09 05:56:47,760 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-03-09 05:56:47,760 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 05:56:46" (1/3) ...
[2024-03-09 05:56:47,761 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@711fa550 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 05:56:47, skipping insertion in model container
[2024-03-09 05:56:47,761 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:56:47" (2/3) ...
[2024-03-09 05:56:47,761 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@711fa550 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 05:56:47, skipping insertion in model container
[2024-03-09 05:56:47,761 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.03 05:56:47" (3/3) ...
[2024-03-09 05:56:47,762 INFO  L112   eAbstractionObserver]: Analyzing ICFG per-thread-index-inc-race.i
[2024-03-09 05:56:47,768 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2024-03-09 05:56:47,775 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-03-09 05:56:47,775 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations.
[2024-03-09 05:56:47,775 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-03-09 05:56:47,822 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2024-03-09 05:56:47,847 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 130 places, 131 transitions, 269 flow
[2024-03-09 05:56:47,907 INFO  L124   PetriNetUnfolderBase]: 6/183 cut-off events.
[2024-03-09 05:56:47,908 INFO  L125   PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES.
[2024-03-09 05:56:47,912 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 188 conditions, 183 events. 6/183 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 399 event pairs, 0 based on Foata normal form. 0/158 useless extension candidates. Maximal degree in co-relation 92. Up to 4 conditions per place. 
[2024-03-09 05:56:47,912 INFO  L82        GeneralOperation]: Start removeDead. Operand has 130 places, 131 transitions, 269 flow
[2024-03-09 05:56:47,915 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 130 places, 131 transitions, 269 flow
[2024-03-09 05:56:47,923 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-09 05:56:47,929 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;@38e4f4e6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-03-09 05:56:47,929 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 17 error locations.
[2024-03-09 05:56:47,934 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-03-09 05:56:47,934 INFO  L124   PetriNetUnfolderBase]: 1/26 cut-off events.
[2024-03-09 05:56:47,934 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-03-09 05:56:47,934 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:56:47,934 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]
[2024-03-09 05:56:47,935 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] ===
[2024-03-09 05:56:47,939 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:56:47,939 INFO  L85        PathProgramCache]: Analyzing trace with hash 145902881, now seen corresponding path program 1 times
[2024-03-09 05:56:47,945 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:56:47,946 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390289696]
[2024-03-09 05:56:47,946 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:56:47,946 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:56:48,026 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:56:48,100 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:56:48,101 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:56:48,101 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390289696]
[2024-03-09 05:56:48,101 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390289696] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:56:48,101 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:56:48,102 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-09 05:56:48,103 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193869935]
[2024-03-09 05:56:48,103 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:56:48,110 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 05:56:48,114 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:56:48,132 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 05:56:48,133 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 05:56:48,157 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 117 out of 131
[2024-03-09 05:56:48,160 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 131 transitions, 269 flow. Second operand  has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 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-09 05:56:48,160 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:56:48,160 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 131
[2024-03-09 05:56:48,161 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:56:48,216 INFO  L124   PetriNetUnfolderBase]: 3/213 cut-off events.
[2024-03-09 05:56:48,216 INFO  L125   PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES.
[2024-03-09 05:56:48,217 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 235 conditions, 213 events. 3/213 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 503 event pairs, 2 based on Foata normal form. 7/195 useless extension candidates. Maximal degree in co-relation 133. Up to 15 conditions per place. 
[2024-03-09 05:56:48,218 INFO  L140   encePairwiseOnDemand]: 125/131 looper letters, 8 selfloop transitions, 2 changer transitions 1/127 dead transitions.
[2024-03-09 05:56:48,218 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 127 transitions, 281 flow
[2024-03-09 05:56:48,219 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 05:56:48,221 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 05:56:48,227 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 365 transitions.
[2024-03-09 05:56:48,229 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9287531806615776
[2024-03-09 05:56:48,229 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 365 transitions.
[2024-03-09 05:56:48,230 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 365 transitions.
[2024-03-09 05:56:48,231 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:56:48,233 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 365 transitions.
[2024-03-09 05:56:48,237 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 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-09 05:56:48,241 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 131.0) internal successors, (524), 4 states have internal predecessors, (524), 0 states have call successors, (0), 0 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-09 05:56:48,241 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 131.0) internal successors, (524), 4 states have internal predecessors, (524), 0 states have call successors, (0), 0 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-09 05:56:48,242 INFO  L175             Difference]: Start difference. First operand has 130 places, 131 transitions, 269 flow. Second operand 3 states and 365 transitions.
[2024-03-09 05:56:48,243 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 127 transitions, 281 flow
[2024-03-09 05:56:48,245 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 127 transitions, 281 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-09 05:56:48,248 INFO  L231             Difference]: Finished difference. Result has 131 places, 126 transitions, 263 flow
[2024-03-09 05:56:48,249 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=263, PETRI_PLACES=131, PETRI_TRANSITIONS=126}
[2024-03-09 05:56:48,252 INFO  L281   CegarLoopForPetriNet]: 130 programPoint places, 1 predicate places.
[2024-03-09 05:56:48,252 INFO  L495      AbstractCegarLoop]: Abstraction has has 131 places, 126 transitions, 263 flow
[2024-03-09 05:56:48,252 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 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-09 05:56:48,252 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:56:48,252 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]
[2024-03-09 05:56:48,253 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-03-09 05:56:48,253 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] ===
[2024-03-09 05:56:48,253 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:56:48,253 INFO  L85        PathProgramCache]: Analyzing trace with hash 660401546, now seen corresponding path program 1 times
[2024-03-09 05:56:48,254 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:56:48,254 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229886053]
[2024-03-09 05:56:48,254 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:56:48,254 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:56:48,284 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:56:48,619 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-09 05:56:48,619 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:56:48,619 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229886053]
[2024-03-09 05:56:48,620 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229886053] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:56:48,620 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:56:48,620 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 05:56:48,620 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085489006]
[2024-03-09 05:56:48,620 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:56:48,621 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 05:56:48,621 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:56:48,622 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 05:56:48,622 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 05:56:48,845 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 100 out of 131
[2024-03-09 05:56:48,847 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 126 transitions, 263 flow. Second operand  has 6 states, 6 states have (on average 101.16666666666667) internal successors, (607), 6 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-09 05:56:48,847 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:56:48,847 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 131
[2024-03-09 05:56:48,847 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:56:49,083 INFO  L124   PetriNetUnfolderBase]: 117/615 cut-off events.
[2024-03-09 05:56:49,083 INFO  L125   PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES.
[2024-03-09 05:56:49,085 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 930 conditions, 615 events. 117/615 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 3269 event pairs, 6 based on Foata normal form. 0/549 useless extension candidates. Maximal degree in co-relation 895. Up to 194 conditions per place. 
[2024-03-09 05:56:49,087 INFO  L140   encePairwiseOnDemand]: 108/131 looper letters, 38 selfloop transitions, 29 changer transitions 0/165 dead transitions.
[2024-03-09 05:56:49,087 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 165 transitions, 478 flow
[2024-03-09 05:56:49,088 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 05:56:49,088 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 05:56:49,090 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 670 transitions.
[2024-03-09 05:56:49,091 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8524173027989822
[2024-03-09 05:56:49,091 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 670 transitions.
[2024-03-09 05:56:49,091 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 670 transitions.
[2024-03-09 05:56:49,092 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:56:49,092 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 670 transitions.
[2024-03-09 05:56:49,094 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 111.66666666666667) internal successors, (670), 6 states have internal predecessors, (670), 0 states have call successors, (0), 0 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-09 05:56:49,096 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 131.0) internal successors, (917), 7 states have internal predecessors, (917), 0 states have call successors, (0), 0 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-09 05:56:49,097 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 131.0) internal successors, (917), 7 states have internal predecessors, (917), 0 states have call successors, (0), 0 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-09 05:56:49,097 INFO  L175             Difference]: Start difference. First operand has 131 places, 126 transitions, 263 flow. Second operand 6 states and 670 transitions.
[2024-03-09 05:56:49,097 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 165 transitions, 478 flow
[2024-03-09 05:56:49,098 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 165 transitions, 474 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-09 05:56:49,101 INFO  L231             Difference]: Finished difference. Result has 138 places, 155 transitions, 479 flow
[2024-03-09 05:56:49,101 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=479, PETRI_PLACES=138, PETRI_TRANSITIONS=155}
[2024-03-09 05:56:49,102 INFO  L281   CegarLoopForPetriNet]: 130 programPoint places, 8 predicate places.
[2024-03-09 05:56:49,102 INFO  L495      AbstractCegarLoop]: Abstraction has has 138 places, 155 transitions, 479 flow
[2024-03-09 05:56:49,102 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 101.16666666666667) internal successors, (607), 6 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-09 05:56:49,102 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:56:49,102 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-09 05:56:49,103 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-03-09 05:56:49,103 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] ===
[2024-03-09 05:56:49,103 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:56:49,103 INFO  L85        PathProgramCache]: Analyzing trace with hash -112748168, now seen corresponding path program 1 times
[2024-03-09 05:56:49,103 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:56:49,104 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92390055]
[2024-03-09 05:56:49,104 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:56:49,104 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:56:49,120 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:56:49,141 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-09 05:56:49,142 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:56:49,142 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92390055]
[2024-03-09 05:56:49,142 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92390055] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:56:49,142 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:56:49,142 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-09 05:56:49,142 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774464340]
[2024-03-09 05:56:49,142 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:56:49,143 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 05:56:49,143 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:56:49,143 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 05:56:49,144 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 05:56:49,154 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 119 out of 131
[2024-03-09 05:56:49,155 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 155 transitions, 479 flow. Second operand  has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:56:49,155 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:56:49,155 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 131
[2024-03-09 05:56:49,155 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:56:49,216 INFO  L124   PetriNetUnfolderBase]: 86/564 cut-off events.
[2024-03-09 05:56:49,216 INFO  L125   PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES.
[2024-03-09 05:56:49,217 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 968 conditions, 564 events. 86/564 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3047 event pairs, 3 based on Foata normal form. 0/522 useless extension candidates. Maximal degree in co-relation 810. Up to 101 conditions per place. 
[2024-03-09 05:56:49,219 INFO  L140   encePairwiseOnDemand]: 127/131 looper letters, 5 selfloop transitions, 2 changer transitions 0/153 dead transitions.
[2024-03-09 05:56:49,219 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 153 transitions, 489 flow
[2024-03-09 05:56:49,219 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 05:56:49,220 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 05:56:49,220 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 366 transitions.
[2024-03-09 05:56:49,220 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9312977099236641
[2024-03-09 05:56:49,220 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 366 transitions.
[2024-03-09 05:56:49,221 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 366 transitions.
[2024-03-09 05:56:49,221 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:56:49,221 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 366 transitions.
[2024-03-09 05:56:49,222 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:56:49,223 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 131.0) internal successors, (524), 4 states have internal predecessors, (524), 0 states have call successors, (0), 0 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-09 05:56:49,223 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 131.0) internal successors, (524), 4 states have internal predecessors, (524), 0 states have call successors, (0), 0 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-09 05:56:49,223 INFO  L175             Difference]: Start difference. First operand has 138 places, 155 transitions, 479 flow. Second operand 3 states and 366 transitions.
[2024-03-09 05:56:49,223 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 153 transitions, 489 flow
[2024-03-09 05:56:49,226 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 153 transitions, 489 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-09 05:56:49,228 INFO  L231             Difference]: Finished difference. Result has 138 places, 153 transitions, 479 flow
[2024-03-09 05:56:49,228 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=475, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=479, PETRI_PLACES=138, PETRI_TRANSITIONS=153}
[2024-03-09 05:56:49,229 INFO  L281   CegarLoopForPetriNet]: 130 programPoint places, 8 predicate places.
[2024-03-09 05:56:49,229 INFO  L495      AbstractCegarLoop]: Abstraction has has 138 places, 153 transitions, 479 flow
[2024-03-09 05:56:49,229 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:56:49,229 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:56:49,230 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-09 05:56:49,230 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-03-09 05:56:49,230 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] ===
[2024-03-09 05:56:49,230 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:56:49,230 INFO  L85        PathProgramCache]: Analyzing trace with hash -1466984703, now seen corresponding path program 1 times
[2024-03-09 05:56:49,230 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:56:49,231 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768871102]
[2024-03-09 05:56:49,231 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:56:49,231 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:56:49,241 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:56:49,260 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-09 05:56:49,260 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:56:49,260 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768871102]
[2024-03-09 05:56:49,260 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768871102] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:56:49,260 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:56:49,261 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-09 05:56:49,261 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912381531]
[2024-03-09 05:56:49,261 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:56:49,261 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 05:56:49,261 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:56:49,262 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 05:56:49,262 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 05:56:49,273 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 119 out of 131
[2024-03-09 05:56:49,274 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 153 transitions, 479 flow. Second operand  has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:56:49,274 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:56:49,274 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 131
[2024-03-09 05:56:49,274 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:56:49,328 INFO  L124   PetriNetUnfolderBase]: 90/618 cut-off events.
[2024-03-09 05:56:49,328 INFO  L125   PetriNetUnfolderBase]: For 75/75 co-relation queries the response was YES.
[2024-03-09 05:56:49,329 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1072 conditions, 618 events. 90/618 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 3371 event pairs, 5 based on Foata normal form. 0/578 useless extension candidates. Maximal degree in co-relation 940. Up to 109 conditions per place. 
[2024-03-09 05:56:49,330 INFO  L140   encePairwiseOnDemand]: 127/131 looper letters, 7 selfloop transitions, 2 changer transitions 0/153 dead transitions.
[2024-03-09 05:56:49,330 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 153 transitions, 497 flow
[2024-03-09 05:56:49,331 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 05:56:49,331 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 05:56:49,332 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 368 transitions.
[2024-03-09 05:56:49,332 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9363867684478372
[2024-03-09 05:56:49,332 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 368 transitions.
[2024-03-09 05:56:49,332 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 368 transitions.
[2024-03-09 05:56:49,332 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:56:49,332 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 368 transitions.
[2024-03-09 05:56:49,333 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 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-09 05:56:49,334 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 131.0) internal successors, (524), 4 states have internal predecessors, (524), 0 states have call successors, (0), 0 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-09 05:56:49,334 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 131.0) internal successors, (524), 4 states have internal predecessors, (524), 0 states have call successors, (0), 0 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-09 05:56:49,334 INFO  L175             Difference]: Start difference. First operand has 138 places, 153 transitions, 479 flow. Second operand 3 states and 368 transitions.
[2024-03-09 05:56:49,334 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 153 transitions, 497 flow
[2024-03-09 05:56:49,337 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 153 transitions, 493 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-09 05:56:49,338 INFO  L231             Difference]: Finished difference. Result has 137 places, 153 transitions, 485 flow
[2024-03-09 05:56:49,339 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=471, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=485, PETRI_PLACES=137, PETRI_TRANSITIONS=153}
[2024-03-09 05:56:49,339 INFO  L281   CegarLoopForPetriNet]: 130 programPoint places, 7 predicate places.
[2024-03-09 05:56:49,339 INFO  L495      AbstractCegarLoop]: Abstraction has has 137 places, 153 transitions, 485 flow
[2024-03-09 05:56:49,340 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:56:49,340 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:56:49,340 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]
[2024-03-09 05:56:49,340 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-03-09 05:56:49,340 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] ===
[2024-03-09 05:56:49,341 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:56:49,341 INFO  L85        PathProgramCache]: Analyzing trace with hash 665548585, now seen corresponding path program 1 times
[2024-03-09 05:56:49,341 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:56:49,341 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910746825]
[2024-03-09 05:56:49,341 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:56:49,341 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:56:49,356 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:56:49,422 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-09 05:56:49,422 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:56:49,422 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910746825]
[2024-03-09 05:56:49,422 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910746825] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:56:49,422 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:56:49,422 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 05:56:49,423 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841421045]
[2024-03-09 05:56:49,423 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:56:49,423 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-03-09 05:56:49,423 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:56:49,423 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-03-09 05:56:49,424 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-03-09 05:56:49,493 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 115 out of 131
[2024-03-09 05:56:49,494 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 153 transitions, 485 flow. Second operand  has 5 states, 5 states have (on average 116.4) internal successors, (582), 5 states have internal predecessors, (582), 0 states have call successors, (0), 0 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-09 05:56:49,494 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:56:49,494 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 131
[2024-03-09 05:56:49,495 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:56:49,583 INFO  L124   PetriNetUnfolderBase]: 83/576 cut-off events.
[2024-03-09 05:56:49,583 INFO  L125   PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES.
[2024-03-09 05:56:49,584 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1027 conditions, 576 events. 83/576 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3034 event pairs, 3 based on Foata normal form. 1/548 useless extension candidates. Maximal degree in co-relation 866. Up to 102 conditions per place. 
[2024-03-09 05:56:49,586 INFO  L140   encePairwiseOnDemand]: 123/131 looper letters, 11 selfloop transitions, 2 changer transitions 5/158 dead transitions.
[2024-03-09 05:56:49,586 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 158 transitions, 531 flow
[2024-03-09 05:56:49,588 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 05:56:49,588 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 05:56:49,589 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 709 transitions.
[2024-03-09 05:56:49,590 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9020356234096693
[2024-03-09 05:56:49,590 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 709 transitions.
[2024-03-09 05:56:49,590 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 709 transitions.
[2024-03-09 05:56:49,591 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:56:49,591 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 709 transitions.
[2024-03-09 05:56:49,592 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 118.16666666666667) internal successors, (709), 6 states have internal predecessors, (709), 0 states have call successors, (0), 0 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-09 05:56:49,593 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 131.0) internal successors, (917), 7 states have internal predecessors, (917), 0 states have call successors, (0), 0 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-09 05:56:49,594 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 131.0) internal successors, (917), 7 states have internal predecessors, (917), 0 states have call successors, (0), 0 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-09 05:56:49,594 INFO  L175             Difference]: Start difference. First operand has 137 places, 153 transitions, 485 flow. Second operand 6 states and 709 transitions.
[2024-03-09 05:56:49,594 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 158 transitions, 531 flow
[2024-03-09 05:56:49,597 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 158 transitions, 531 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-09 05:56:49,599 INFO  L231             Difference]: Finished difference. Result has 146 places, 153 transitions, 503 flow
[2024-03-09 05:56:49,600 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=485, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=503, PETRI_PLACES=146, PETRI_TRANSITIONS=153}
[2024-03-09 05:56:49,601 INFO  L281   CegarLoopForPetriNet]: 130 programPoint places, 16 predicate places.
[2024-03-09 05:56:49,601 INFO  L495      AbstractCegarLoop]: Abstraction has has 146 places, 153 transitions, 503 flow
[2024-03-09 05:56:49,602 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 116.4) internal successors, (582), 5 states have internal predecessors, (582), 0 states have call successors, (0), 0 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-09 05:56:49,602 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:56:49,602 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]
[2024-03-09 05:56:49,602 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-03-09 05:56:49,602 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] ===
[2024-03-09 05:56:49,603 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:56:49,603 INFO  L85        PathProgramCache]: Analyzing trace with hash -236195491, now seen corresponding path program 1 times
[2024-03-09 05:56:49,603 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:56:49,603 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990446076]
[2024-03-09 05:56:49,603 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:56:49,603 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:56:49,616 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:56:49,638 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-09 05:56:49,638 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:56:49,638 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990446076]
[2024-03-09 05:56:49,639 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990446076] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:56:49,639 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:56:49,639 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-09 05:56:49,639 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472558857]
[2024-03-09 05:56:49,639 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:56:49,640 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 05:56:49,640 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:56:49,641 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 05:56:49,641 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 05:56:49,661 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 119 out of 131
[2024-03-09 05:56:49,662 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 153 transitions, 503 flow. Second operand  has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:56:49,662 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:56:49,663 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 131
[2024-03-09 05:56:49,663 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:56:49,719 INFO  L124   PetriNetUnfolderBase]: 74/530 cut-off events.
[2024-03-09 05:56:49,719 INFO  L125   PetriNetUnfolderBase]: For 79/79 co-relation queries the response was YES.
[2024-03-09 05:56:49,720 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 967 conditions, 530 events. 74/530 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2796 event pairs, 2 based on Foata normal form. 0/506 useless extension candidates. Maximal degree in co-relation 894. Up to 93 conditions per place. 
[2024-03-09 05:56:49,721 INFO  L140   encePairwiseOnDemand]: 128/131 looper letters, 6 selfloop transitions, 2 changer transitions 0/152 dead transitions.
[2024-03-09 05:56:49,721 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 152 transitions, 517 flow
[2024-03-09 05:56:49,722 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 05:56:49,722 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 05:56:49,723 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 366 transitions.
[2024-03-09 05:56:49,723 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9312977099236641
[2024-03-09 05:56:49,723 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 366 transitions.
[2024-03-09 05:56:49,723 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 366 transitions.
[2024-03-09 05:56:49,723 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:56:49,723 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 366 transitions.
[2024-03-09 05:56:49,724 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:56:49,725 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 131.0) internal successors, (524), 4 states have internal predecessors, (524), 0 states have call successors, (0), 0 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-09 05:56:49,725 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 131.0) internal successors, (524), 4 states have internal predecessors, (524), 0 states have call successors, (0), 0 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-09 05:56:49,725 INFO  L175             Difference]: Start difference. First operand has 146 places, 153 transitions, 503 flow. Second operand 3 states and 366 transitions.
[2024-03-09 05:56:49,725 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 152 transitions, 517 flow
[2024-03-09 05:56:49,728 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 152 transitions, 503 flow, removed 5 selfloop flow, removed 5 redundant places.
[2024-03-09 05:56:49,730 INFO  L231             Difference]: Finished difference. Result has 139 places, 152 transitions, 491 flow
[2024-03-09 05:56:49,730 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=487, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=491, PETRI_PLACES=139, PETRI_TRANSITIONS=152}
[2024-03-09 05:56:49,731 INFO  L281   CegarLoopForPetriNet]: 130 programPoint places, 9 predicate places.
[2024-03-09 05:56:49,731 INFO  L495      AbstractCegarLoop]: Abstraction has has 139 places, 152 transitions, 491 flow
[2024-03-09 05:56:49,731 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:56:49,732 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:56:49,732 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]
[2024-03-09 05:56:49,732 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-03-09 05:56:49,732 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] ===
[2024-03-09 05:56:49,732 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:56:49,732 INFO  L85        PathProgramCache]: Analyzing trace with hash -8045228, now seen corresponding path program 1 times
[2024-03-09 05:56:49,733 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:56:49,733 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249857810]
[2024-03-09 05:56:49,733 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:56:49,733 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:56:49,762 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-09 05:56:49,762 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-03-09 05:56:49,774 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-09 05:56:49,793 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-03-09 05:56:49,793 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-03-09 05:56:49,794 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 17 remaining)
[2024-03-09 05:56:49,795 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (15 of 17 remaining)
[2024-03-09 05:56:49,795 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (14 of 17 remaining)
[2024-03-09 05:56:49,795 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (13 of 17 remaining)
[2024-03-09 05:56:49,796 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (12 of 17 remaining)
[2024-03-09 05:56:49,796 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (11 of 17 remaining)
[2024-03-09 05:56:49,796 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (10 of 17 remaining)
[2024-03-09 05:56:49,796 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (9 of 17 remaining)
[2024-03-09 05:56:49,796 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (8 of 17 remaining)
[2024-03-09 05:56:49,796 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (7 of 17 remaining)
[2024-03-09 05:56:49,796 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (6 of 17 remaining)
[2024-03-09 05:56:49,797 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (5 of 17 remaining)
[2024-03-09 05:56:49,797 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 17 remaining)
[2024-03-09 05:56:49,797 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (3 of 17 remaining)
[2024-03-09 05:56:49,797 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (2 of 17 remaining)
[2024-03-09 05:56:49,797 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (1 of 17 remaining)
[2024-03-09 05:56:49,797 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (0 of 17 remaining)
[2024-03-09 05:56:49,797 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-03-09 05:56:49,798 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1]
[2024-03-09 05:56:49,799 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-03-09 05:56:49,799 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2024-03-09 05:56:49,820 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2024-03-09 05:56:49,823 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 167 places, 167 transitions, 350 flow
[2024-03-09 05:56:49,854 INFO  L124   PetriNetUnfolderBase]: 11/326 cut-off events.
[2024-03-09 05:56:49,854 INFO  L125   PetriNetUnfolderBase]: For 6/7 co-relation queries the response was YES.
[2024-03-09 05:56:49,855 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 338 conditions, 326 events. 11/326 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 897 event pairs, 0 based on Foata normal form. 0/281 useless extension candidates. Maximal degree in co-relation 185. Up to 8 conditions per place. 
[2024-03-09 05:56:49,855 INFO  L82        GeneralOperation]: Start removeDead. Operand has 167 places, 167 transitions, 350 flow
[2024-03-09 05:56:49,856 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 167 places, 167 transitions, 350 flow
[2024-03-09 05:56:49,857 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-09 05:56:49,858 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;@38e4f4e6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-03-09 05:56:49,858 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 22 error locations.
[2024-03-09 05:56:49,860 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-03-09 05:56:49,860 INFO  L124   PetriNetUnfolderBase]: 1/26 cut-off events.
[2024-03-09 05:56:49,860 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-03-09 05:56:49,860 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:56:49,860 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]
[2024-03-09 05:56:49,860 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-09 05:56:49,860 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:56:49,861 INFO  L85        PathProgramCache]: Analyzing trace with hash -2115235000, now seen corresponding path program 1 times
[2024-03-09 05:56:49,861 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:56:49,861 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053441917]
[2024-03-09 05:56:49,861 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:56:49,861 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:56:49,867 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:56:49,878 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-09 05:56:49,879 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:56:49,879 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053441917]
[2024-03-09 05:56:49,879 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053441917] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:56:49,879 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:56:49,879 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-09 05:56:49,879 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595139313]
[2024-03-09 05:56:49,879 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:56:49,880 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 05:56:49,880 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:56:49,880 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 05:56:49,880 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 05:56:49,907 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 150 out of 167
[2024-03-09 05:56:49,907 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 167 transitions, 350 flow. Second operand  has 3 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 0 states have call successors, (0), 0 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-09 05:56:49,907 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:56:49,907 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 167
[2024-03-09 05:56:49,907 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:56:49,977 INFO  L124   PetriNetUnfolderBase]: 19/562 cut-off events.
[2024-03-09 05:56:49,977 INFO  L125   PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES.
[2024-03-09 05:56:49,978 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 631 conditions, 562 events. 19/562 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2455 event pairs, 16 based on Foata normal form. 17/511 useless extension candidates. Maximal degree in co-relation 370. Up to 50 conditions per place. 
[2024-03-09 05:56:49,980 INFO  L140   encePairwiseOnDemand]: 161/167 looper letters, 11 selfloop transitions, 2 changer transitions 1/163 dead transitions.
[2024-03-09 05:56:49,980 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 163 transitions, 368 flow
[2024-03-09 05:56:49,980 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 05:56:49,980 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 05:56:49,981 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 467 transitions.
[2024-03-09 05:56:49,981 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9321357285429142
[2024-03-09 05:56:49,981 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 467 transitions.
[2024-03-09 05:56:49,981 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 467 transitions.
[2024-03-09 05:56:49,982 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:56:49,982 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 467 transitions.
[2024-03-09 05:56:49,983 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 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-09 05:56:49,983 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 0 states have call successors, (0), 0 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-09 05:56:49,984 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 0 states have call successors, (0), 0 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-09 05:56:49,984 INFO  L175             Difference]: Start difference. First operand has 167 places, 167 transitions, 350 flow. Second operand 3 states and 467 transitions.
[2024-03-09 05:56:49,984 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 163 transitions, 368 flow
[2024-03-09 05:56:49,984 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 163 transitions, 368 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-09 05:56:49,986 INFO  L231             Difference]: Finished difference. Result has 168 places, 162 transitions, 344 flow
[2024-03-09 05:56:49,986 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=167, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=344, PETRI_PLACES=168, PETRI_TRANSITIONS=162}
[2024-03-09 05:56:49,987 INFO  L281   CegarLoopForPetriNet]: 167 programPoint places, 1 predicate places.
[2024-03-09 05:56:49,987 INFO  L495      AbstractCegarLoop]: Abstraction has has 168 places, 162 transitions, 344 flow
[2024-03-09 05:56:49,987 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 0 states have call successors, (0), 0 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-09 05:56:49,987 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:56:49,987 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]
[2024-03-09 05:56:49,987 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-03-09 05:56:49,987 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-09 05:56:49,988 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:56:49,988 INFO  L85        PathProgramCache]: Analyzing trace with hash -415078799, now seen corresponding path program 1 times
[2024-03-09 05:56:49,988 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:56:49,988 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564679461]
[2024-03-09 05:56:49,988 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:56:49,988 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:56:49,998 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:56:50,158 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-09 05:56:50,159 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:56:50,159 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564679461]
[2024-03-09 05:56:50,159 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564679461] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:56:50,159 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:56:50,159 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 05:56:50,159 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161582340]
[2024-03-09 05:56:50,159 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:56:50,160 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 05:56:50,160 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:56:50,160 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 05:56:50,160 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 05:56:50,358 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 130 out of 167
[2024-03-09 05:56:50,358 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 162 transitions, 344 flow. Second operand  has 6 states, 6 states have (on average 131.16666666666666) internal successors, (787), 6 states have internal predecessors, (787), 0 states have call successors, (0), 0 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-09 05:56:50,359 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:56:50,359 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 167
[2024-03-09 05:56:50,359 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:56:50,971 INFO  L124   PetriNetUnfolderBase]: 1710/5135 cut-off events.
[2024-03-09 05:56:50,971 INFO  L125   PetriNetUnfolderBase]: For 125/125 co-relation queries the response was YES.
[2024-03-09 05:56:50,978 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8202 conditions, 5135 events. 1710/5135 cut-off events. For 125/125 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 43336 event pairs, 258 based on Foata normal form. 0/4579 useless extension candidates. Maximal degree in co-relation 8166. Up to 2239 conditions per place. 
[2024-03-09 05:56:50,994 INFO  L140   encePairwiseOnDemand]: 140/167 looper letters, 46 selfloop transitions, 48 changer transitions 0/222 dead transitions.
[2024-03-09 05:56:50,994 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 222 transitions, 663 flow
[2024-03-09 05:56:50,995 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 05:56:50,995 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 05:56:50,996 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 877 transitions.
[2024-03-09 05:56:50,997 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.875249500998004
[2024-03-09 05:56:50,997 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 877 transitions.
[2024-03-09 05:56:50,997 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 877 transitions.
[2024-03-09 05:56:50,997 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:56:50,998 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 877 transitions.
[2024-03-09 05:56:50,999 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 146.16666666666666) internal successors, (877), 6 states have internal predecessors, (877), 0 states have call successors, (0), 0 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-09 05:56:51,000 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 167.0) internal successors, (1169), 7 states have internal predecessors, (1169), 0 states have call successors, (0), 0 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-09 05:56:51,001 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 167.0) internal successors, (1169), 7 states have internal predecessors, (1169), 0 states have call successors, (0), 0 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-09 05:56:51,001 INFO  L175             Difference]: Start difference. First operand has 168 places, 162 transitions, 344 flow. Second operand 6 states and 877 transitions.
[2024-03-09 05:56:51,001 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 222 transitions, 663 flow
[2024-03-09 05:56:51,002 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 222 transitions, 659 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-09 05:56:51,005 INFO  L231             Difference]: Finished difference. Result has 175 places, 210 transitions, 682 flow
[2024-03-09 05:56:51,005 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=167, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=682, PETRI_PLACES=175, PETRI_TRANSITIONS=210}
[2024-03-09 05:56:51,005 INFO  L281   CegarLoopForPetriNet]: 167 programPoint places, 8 predicate places.
[2024-03-09 05:56:51,005 INFO  L495      AbstractCegarLoop]: Abstraction has has 175 places, 210 transitions, 682 flow
[2024-03-09 05:56:51,006 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 131.16666666666666) internal successors, (787), 6 states have internal predecessors, (787), 0 states have call successors, (0), 0 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-09 05:56:51,006 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:56:51,006 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-09 05:56:51,006 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-03-09 05:56:51,006 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-09 05:56:51,006 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:56:51,007 INFO  L85        PathProgramCache]: Analyzing trace with hash 1229635297, now seen corresponding path program 1 times
[2024-03-09 05:56:51,007 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:56:51,007 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217723310]
[2024-03-09 05:56:51,007 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:56:51,007 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:56:51,018 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:56:51,063 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-09 05:56:51,063 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:56:51,064 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217723310]
[2024-03-09 05:56:51,064 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217723310] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:56:51,064 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:56:51,064 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-09 05:56:51,064 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037916150]
[2024-03-09 05:56:51,064 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:56:51,065 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 05:56:51,065 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:56:51,066 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 05:56:51,066 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 05:56:51,089 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 146 out of 167
[2024-03-09 05:56:51,090 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 210 transitions, 682 flow. Second operand  has 3 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-09 05:56:51,090 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:56:51,090 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 167
[2024-03-09 05:56:51,090 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:56:51,931 INFO  L124   PetriNetUnfolderBase]: 2283/9045 cut-off events.
[2024-03-09 05:56:51,931 INFO  L125   PetriNetUnfolderBase]: For 1657/2048 co-relation queries the response was YES.
[2024-03-09 05:56:51,952 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16526 conditions, 9045 events. 2283/9045 cut-off events. For 1657/2048 co-relation queries the response was YES. Maximal size of possible extension queue 433. Compared 98123 event pairs, 254 based on Foata normal form. 0/8266 useless extension candidates. Maximal degree in co-relation 8948. Up to 2439 conditions per place. 
[2024-03-09 05:56:51,980 INFO  L140   encePairwiseOnDemand]: 153/167 looper letters, 21 selfloop transitions, 10 changer transitions 0/223 dead transitions.
[2024-03-09 05:56:51,980 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 223 transitions, 781 flow
[2024-03-09 05:56:51,981 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 05:56:51,981 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 05:56:51,981 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 473 transitions.
[2024-03-09 05:56:51,982 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9441117764471058
[2024-03-09 05:56:51,982 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 473 transitions.
[2024-03-09 05:56:51,982 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 473 transitions.
[2024-03-09 05:56:51,982 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:56:51,982 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 473 transitions.
[2024-03-09 05:56:51,983 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 157.66666666666666) internal successors, (473), 3 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:56:51,984 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 0 states have call successors, (0), 0 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-09 05:56:51,984 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 0 states have call successors, (0), 0 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-09 05:56:51,984 INFO  L175             Difference]: Start difference. First operand has 175 places, 210 transitions, 682 flow. Second operand 3 states and 473 transitions.
[2024-03-09 05:56:51,984 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 223 transitions, 781 flow
[2024-03-09 05:56:51,997 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 223 transitions, 781 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-09 05:56:51,999 INFO  L231             Difference]: Finished difference. Result has 179 places, 220 transitions, 770 flow
[2024-03-09 05:56:52,000 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=167, PETRI_DIFFERENCE_MINUEND_FLOW=682, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=770, PETRI_PLACES=179, PETRI_TRANSITIONS=220}
[2024-03-09 05:56:52,000 INFO  L281   CegarLoopForPetriNet]: 167 programPoint places, 12 predicate places.
[2024-03-09 05:56:52,000 INFO  L495      AbstractCegarLoop]: Abstraction has has 179 places, 220 transitions, 770 flow
[2024-03-09 05:56:52,001 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 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-09 05:56:52,001 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:56:52,001 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-09 05:56:52,001 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-03-09 05:56:52,001 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-09 05:56:52,001 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:56:52,001 INFO  L85        PathProgramCache]: Analyzing trace with hash -156000952, now seen corresponding path program 1 times
[2024-03-09 05:56:52,001 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:56:52,002 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796936850]
[2024-03-09 05:56:52,002 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:56:52,002 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:56:52,011 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:56:52,027 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-09 05:56:52,028 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:56:52,028 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796936850]
[2024-03-09 05:56:52,028 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796936850] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:56:52,028 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:56:52,028 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-09 05:56:52,028 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405649270]
[2024-03-09 05:56:52,028 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:56:52,029 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 05:56:52,029 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:56:52,029 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 05:56:52,029 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 05:56:52,043 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 150 out of 167
[2024-03-09 05:56:52,043 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 220 transitions, 770 flow. Second operand  has 3 states, 3 states have (on average 151.0) internal successors, (453), 3 states have internal predecessors, (453), 0 states have call successors, (0), 0 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-09 05:56:52,043 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:56:52,044 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 167
[2024-03-09 05:56:52,044 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:56:53,113 INFO  L124   PetriNetUnfolderBase]: 2678/11005 cut-off events.
[2024-03-09 05:56:53,113 INFO  L125   PetriNetUnfolderBase]: For 1861/2260 co-relation queries the response was YES.
[2024-03-09 05:56:53,139 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20212 conditions, 11005 events. 2678/11005 cut-off events. For 1861/2260 co-relation queries the response was YES. Maximal size of possible extension queue 461. Compared 123798 event pairs, 321 based on Foata normal form. 0/10185 useless extension candidates. Maximal degree in co-relation 8912. Up to 2929 conditions per place. 
[2024-03-09 05:56:53,168 INFO  L140   encePairwiseOnDemand]: 161/167 looper letters, 12 selfloop transitions, 3 changer transitions 0/221 dead transitions.
[2024-03-09 05:56:53,168 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 221 transitions, 807 flow
[2024-03-09 05:56:53,169 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 05:56:53,169 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 05:56:53,170 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 468 transitions.
[2024-03-09 05:56:53,170 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9341317365269461
[2024-03-09 05:56:53,170 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 468 transitions.
[2024-03-09 05:56:53,170 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 468 transitions.
[2024-03-09 05:56:53,170 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:56:53,170 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 468 transitions.
[2024-03-09 05:56:53,171 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 0 states have call successors, (0), 0 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-09 05:56:53,172 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 0 states have call successors, (0), 0 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-09 05:56:53,172 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 0 states have call successors, (0), 0 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-09 05:56:53,172 INFO  L175             Difference]: Start difference. First operand has 179 places, 220 transitions, 770 flow. Second operand 3 states and 468 transitions.
[2024-03-09 05:56:53,172 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 221 transitions, 807 flow
[2024-03-09 05:56:53,190 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 221 transitions, 787 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-09 05:56:53,192 INFO  L231             Difference]: Finished difference. Result has 177 places, 220 transitions, 765 flow
[2024-03-09 05:56:53,193 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=167, PETRI_DIFFERENCE_MINUEND_FLOW=744, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=765, PETRI_PLACES=177, PETRI_TRANSITIONS=220}
[2024-03-09 05:56:53,193 INFO  L281   CegarLoopForPetriNet]: 167 programPoint places, 10 predicate places.
[2024-03-09 05:56:53,193 INFO  L495      AbstractCegarLoop]: Abstraction has has 177 places, 220 transitions, 765 flow
[2024-03-09 05:56:53,193 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 151.0) internal successors, (453), 3 states have internal predecessors, (453), 0 states have call successors, (0), 0 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-09 05:56:53,194 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:56:53,194 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]
[2024-03-09 05:56:53,194 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-03-09 05:56:53,194 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-09 05:56:53,194 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:56:53,194 INFO  L85        PathProgramCache]: Analyzing trace with hash -1643627927, now seen corresponding path program 1 times
[2024-03-09 05:56:53,194 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:56:53,195 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221594431]
[2024-03-09 05:56:53,195 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:56:53,195 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:56:53,206 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:56:53,257 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-09 05:56:53,257 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:56:53,258 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221594431]
[2024-03-09 05:56:53,258 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221594431] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:56:53,258 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:56:53,258 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 05:56:53,258 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100484229]
[2024-03-09 05:56:53,258 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:56:53,258 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-03-09 05:56:53,259 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:56:53,259 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-03-09 05:56:53,259 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-03-09 05:56:53,308 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 149 out of 167
[2024-03-09 05:56:53,309 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 220 transitions, 765 flow. Second operand  has 5 states, 5 states have (on average 150.4) internal successors, (752), 5 states have internal predecessors, (752), 0 states have call successors, (0), 0 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-09 05:56:53,309 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:56:53,309 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 167
[2024-03-09 05:56:53,309 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:56:54,047 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([431] L1054-5-->L1054-6: Formula: (let ((.cse0 (select |v_#race_20| |v_ULTIMATE.start_main_~#tids~0#1.base_17|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 1)) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_17|) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 3)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 2)) 0)))  InVars {#race=|v_#race_20|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  OutVars{#race=|v_#race_20|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  AuxVars[]  AssignedVars[][162], [Black: 192#true, threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, 107#L1054-6true, 197#true, 4#L1042-8true, 106#L1042-10true, 179#(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| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 194#(= |#race~datas~0| 0), Black: 177#(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: 176#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 174#true, Black: 178#(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: 188#(= |#race~next_j~0| 0)])
[2024-03-09 05:56:54,048 INFO  L294   olderBase$Statistics]: this new event has 118 ancestors and is not cut-off event
[2024-03-09 05:56:54,048 INFO  L297   olderBase$Statistics]:   existing Event has 118 ancestors and is not cut-off event
[2024-03-09 05:56:54,048 INFO  L297   olderBase$Statistics]:   existing Event has 118 ancestors and is not cut-off event
[2024-03-09 05:56:54,048 INFO  L297   olderBase$Statistics]:   existing Event has 118 ancestors and is not cut-off event
[2024-03-09 05:56:54,216 INFO  L124   PetriNetUnfolderBase]: 2270/9302 cut-off events.
[2024-03-09 05:56:54,217 INFO  L125   PetriNetUnfolderBase]: For 1684/2022 co-relation queries the response was YES.
[2024-03-09 05:56:54,241 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17491 conditions, 9302 events. 2270/9302 cut-off events. For 1684/2022 co-relation queries the response was YES. Maximal size of possible extension queue 408. Compared 101782 event pairs, 238 based on Foata normal form. 1/8697 useless extension candidates. Maximal degree in co-relation 9902. Up to 2513 conditions per place. 
[2024-03-09 05:56:54,265 INFO  L140   encePairwiseOnDemand]: 159/167 looper letters, 14 selfloop transitions, 2 changer transitions 5/226 dead transitions.
[2024-03-09 05:56:54,266 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 226 transitions, 819 flow
[2024-03-09 05:56:54,267 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 05:56:54,267 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 05:56:54,268 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 916 transitions.
[2024-03-09 05:56:54,269 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9141716566866267
[2024-03-09 05:56:54,269 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 916 transitions.
[2024-03-09 05:56:54,269 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 916 transitions.
[2024-03-09 05:56:54,269 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:56:54,269 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 916 transitions.
[2024-03-09 05:56:54,271 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 152.66666666666666) internal successors, (916), 6 states have internal predecessors, (916), 0 states have call successors, (0), 0 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-09 05:56:54,272 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 167.0) internal successors, (1169), 7 states have internal predecessors, (1169), 0 states have call successors, (0), 0 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-09 05:56:54,273 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 167.0) internal successors, (1169), 7 states have internal predecessors, (1169), 0 states have call successors, (0), 0 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-09 05:56:54,273 INFO  L175             Difference]: Start difference. First operand has 177 places, 220 transitions, 765 flow. Second operand 6 states and 916 transitions.
[2024-03-09 05:56:54,273 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 226 transitions, 819 flow
[2024-03-09 05:56:54,294 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 226 transitions, 819 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-09 05:56:54,296 INFO  L231             Difference]: Finished difference. Result has 186 places, 221 transitions, 787 flow
[2024-03-09 05:56:54,296 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=167, PETRI_DIFFERENCE_MINUEND_FLOW=765, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=787, PETRI_PLACES=186, PETRI_TRANSITIONS=221}
[2024-03-09 05:56:54,296 INFO  L281   CegarLoopForPetriNet]: 167 programPoint places, 19 predicate places.
[2024-03-09 05:56:54,297 INFO  L495      AbstractCegarLoop]: Abstraction has has 186 places, 221 transitions, 787 flow
[2024-03-09 05:56:54,297 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 150.4) internal successors, (752), 5 states have internal predecessors, (752), 0 states have call successors, (0), 0 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-09 05:56:54,297 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:56:54,297 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]
[2024-03-09 05:56:54,297 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-03-09 05:56:54,297 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-09 05:56:54,298 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:56:54,298 INFO  L85        PathProgramCache]: Analyzing trace with hash -1348886202, now seen corresponding path program 1 times
[2024-03-09 05:56:54,298 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:56:54,298 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23043196]
[2024-03-09 05:56:54,298 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:56:54,298 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:56:54,309 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:56:54,328 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-09 05:56:54,328 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:56:54,329 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23043196]
[2024-03-09 05:56:54,329 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23043196] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:56:54,329 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:56:54,329 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-09 05:56:54,329 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190118595]
[2024-03-09 05:56:54,329 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:56:54,329 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 05:56:54,330 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:56:54,330 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 05:56:54,330 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 05:56:54,355 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 150 out of 167
[2024-03-09 05:56:54,355 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 221 transitions, 787 flow. Second operand  has 3 states, 3 states have (on average 152.0) internal successors, (456), 3 states have internal predecessors, (456), 0 states have call successors, (0), 0 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-09 05:56:54,355 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:56:54,355 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 167
[2024-03-09 05:56:54,355 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:56:55,300 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([357] L1056-5-->L1056-6: Formula: (let ((.cse0 (select |v_#race_40| |v_ULTIMATE.start_main_~#tids~0#1.base_24|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 2)) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_24|) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 3)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 1)) 0)))  InVars {#race=|v_#race_40|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  OutVars{#race=|v_#race_40|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  AuxVars[]  AssignedVars[][170], [Black: 192#true, threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, Black: 201#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 54#L1056-6true, 209#true, 197#true, Black: 200#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), Black: 199#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 203#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 4#L1042-8true, 179#(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| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 194#(= |#race~datas~0| 0), 74#L1042-9true, Black: 177#(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: 176#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 174#true, Black: 178#(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: 188#(= |#race~next_j~0| 0)])
[2024-03-09 05:56:55,300 INFO  L294   olderBase$Statistics]: this new event has 118 ancestors and is not cut-off event
[2024-03-09 05:56:55,300 INFO  L297   olderBase$Statistics]:   existing Event has 118 ancestors and is not cut-off event
[2024-03-09 05:56:55,300 INFO  L297   olderBase$Statistics]:   existing Event has 118 ancestors and is not cut-off event
[2024-03-09 05:56:55,300 INFO  L297   olderBase$Statistics]:   existing Event has 118 ancestors and is not cut-off event
[2024-03-09 05:56:55,306 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([431] L1054-5-->L1054-6: Formula: (let ((.cse0 (select |v_#race_20| |v_ULTIMATE.start_main_~#tids~0#1.base_17|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 1)) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_17|) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 3)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 2)) 0)))  InVars {#race=|v_#race_20|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  OutVars{#race=|v_#race_20|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  AuxVars[]  AssignedVars[][159], [Black: 192#true, threadThread1of2ForFork0InUse, 107#L1054-6true, threadThread2of2ForFork0InUse, Black: 201#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 209#true, 197#true, Black: 200#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), Black: 199#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 203#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 4#L1042-8true, 106#L1042-10true, 194#(= |#race~datas~0| 0), 179#(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| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 177#(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: 176#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 174#true, Black: 178#(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: 188#(= |#race~next_j~0| 0)])
[2024-03-09 05:56:55,306 INFO  L294   olderBase$Statistics]: this new event has 118 ancestors and is not cut-off event
[2024-03-09 05:56:55,307 INFO  L297   olderBase$Statistics]:   existing Event has 118 ancestors and is not cut-off event
[2024-03-09 05:56:55,307 INFO  L297   olderBase$Statistics]:   existing Event has 118 ancestors and is not cut-off event
[2024-03-09 05:56:55,307 INFO  L297   olderBase$Statistics]:   existing Event has 118 ancestors and is not cut-off event
[2024-03-09 05:56:55,318 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([357] L1056-5-->L1056-6: Formula: (let ((.cse0 (select |v_#race_40| |v_ULTIMATE.start_main_~#tids~0#1.base_24|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 2)) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_24|) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 3)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 1)) 0)))  InVars {#race=|v_#race_40|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  OutVars{#race=|v_#race_40|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  AuxVars[]  AssignedVars[][170], [Black: 192#true, threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, Black: 201#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 54#L1056-6true, 209#true, 197#true, Black: 200#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), Black: 199#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 203#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 4#L1042-8true, 106#L1042-10true, 179#(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| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 194#(= |#race~datas~0| 0), Black: 177#(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: 176#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 174#true, Black: 178#(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: 188#(= |#race~next_j~0| 0)])
[2024-03-09 05:56:55,318 INFO  L294   olderBase$Statistics]: this new event has 119 ancestors and is not cut-off event
[2024-03-09 05:56:55,318 INFO  L297   olderBase$Statistics]:   existing Event has 119 ancestors and is not cut-off event
[2024-03-09 05:56:55,318 INFO  L297   olderBase$Statistics]:   existing Event has 119 ancestors and is not cut-off event
[2024-03-09 05:56:55,318 INFO  L297   olderBase$Statistics]:   existing Event has 119 ancestors and is not cut-off event
[2024-03-09 05:56:55,460 INFO  L124   PetriNetUnfolderBase]: 2296/10318 cut-off events.
[2024-03-09 05:56:55,460 INFO  L125   PetriNetUnfolderBase]: For 2090/2489 co-relation queries the response was YES.
[2024-03-09 05:56:55,487 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19651 conditions, 10318 events. 2296/10318 cut-off events. For 2090/2489 co-relation queries the response was YES. Maximal size of possible extension queue 474. Compared 119096 event pairs, 222 based on Foata normal form. 7/9657 useless extension candidates. Maximal degree in co-relation 19576. Up to 2570 conditions per place. 
[2024-03-09 05:56:55,509 INFO  L140   encePairwiseOnDemand]: 160/167 looper letters, 20 selfloop transitions, 9 changer transitions 0/230 dead transitions.
[2024-03-09 05:56:55,509 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 230 transitions, 881 flow
[2024-03-09 05:56:55,509 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 05:56:55,510 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 05:56:55,510 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 472 transitions.
[2024-03-09 05:56:55,510 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9421157684630739
[2024-03-09 05:56:55,511 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 472 transitions.
[2024-03-09 05:56:55,511 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 472 transitions.
[2024-03-09 05:56:55,511 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:56:55,511 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 472 transitions.
[2024-03-09 05:56:55,512 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 157.33333333333334) internal successors, (472), 3 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:56:55,512 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 0 states have call successors, (0), 0 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-09 05:56:55,513 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 0 states have call successors, (0), 0 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-09 05:56:55,513 INFO  L175             Difference]: Start difference. First operand has 186 places, 221 transitions, 787 flow. Second operand 3 states and 472 transitions.
[2024-03-09 05:56:55,513 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 230 transitions, 881 flow
[2024-03-09 05:56:55,539 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 230 transitions, 869 flow, removed 5 selfloop flow, removed 4 redundant places.
[2024-03-09 05:56:55,541 INFO  L231             Difference]: Finished difference. Result has 183 places, 228 transitions, 851 flow
[2024-03-09 05:56:55,542 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=167, PETRI_DIFFERENCE_MINUEND_FLOW=775, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=851, PETRI_PLACES=183, PETRI_TRANSITIONS=228}
[2024-03-09 05:56:55,542 INFO  L281   CegarLoopForPetriNet]: 167 programPoint places, 16 predicate places.
[2024-03-09 05:56:55,542 INFO  L495      AbstractCegarLoop]: Abstraction has has 183 places, 228 transitions, 851 flow
[2024-03-09 05:56:55,543 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 152.0) internal successors, (456), 3 states have internal predecessors, (456), 0 states have call successors, (0), 0 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-09 05:56:55,543 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:56:55,543 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]
[2024-03-09 05:56:55,543 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-03-09 05:56:55,543 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-09 05:56:55,543 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:56:55,543 INFO  L85        PathProgramCache]: Analyzing trace with hash 1095598003, now seen corresponding path program 1 times
[2024-03-09 05:56:55,543 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:56:55,544 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607160246]
[2024-03-09 05:56:55,544 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:56:55,544 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:56:55,558 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:56:55,759 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-09 05:56:55,759 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:56:55,759 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607160246]
[2024-03-09 05:56:55,759 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607160246] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:56:55,760 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:56:55,760 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 05:56:55,760 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043141188]
[2024-03-09 05:56:55,760 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:56:55,760 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 05:56:55,760 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:56:55,761 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 05:56:55,761 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 05:56:56,018 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 139 out of 167
[2024-03-09 05:56:56,019 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 228 transitions, 851 flow. Second operand  has 6 states, 6 states have (on average 140.5) internal successors, (843), 6 states have internal predecessors, (843), 0 states have call successors, (0), 0 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-09 05:56:56,019 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:56:56,019 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 167
[2024-03-09 05:56:56,019 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:56:57,675 INFO  L124   PetriNetUnfolderBase]: 4143/13883 cut-off events.
[2024-03-09 05:56:57,675 INFO  L125   PetriNetUnfolderBase]: For 6999/11203 co-relation queries the response was YES.
[2024-03-09 05:56:57,713 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 31442 conditions, 13883 events. 4143/13883 cut-off events. For 6999/11203 co-relation queries the response was YES. Maximal size of possible extension queue 571. Compared 153545 event pairs, 653 based on Foata normal form. 35/12969 useless extension candidates. Maximal degree in co-relation 18662. Up to 5291 conditions per place. 
[2024-03-09 05:56:57,749 INFO  L140   encePairwiseOnDemand]: 152/167 looper letters, 58 selfloop transitions, 70 changer transitions 0/299 dead transitions.
[2024-03-09 05:56:57,750 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 299 transitions, 1447 flow
[2024-03-09 05:56:57,750 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 05:56:57,751 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 05:56:57,752 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 899 transitions.
[2024-03-09 05:56:57,752 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8972055888223552
[2024-03-09 05:56:57,752 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 899 transitions.
[2024-03-09 05:56:57,752 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 899 transitions.
[2024-03-09 05:56:57,753 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:56:57,753 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 899 transitions.
[2024-03-09 05:56:57,754 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 149.83333333333334) internal successors, (899), 6 states have internal predecessors, (899), 0 states have call successors, (0), 0 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-09 05:56:57,756 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 167.0) internal successors, (1169), 7 states have internal predecessors, (1169), 0 states have call successors, (0), 0 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-09 05:56:57,756 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 167.0) internal successors, (1169), 7 states have internal predecessors, (1169), 0 states have call successors, (0), 0 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-09 05:56:57,756 INFO  L175             Difference]: Start difference. First operand has 183 places, 228 transitions, 851 flow. Second operand 6 states and 899 transitions.
[2024-03-09 05:56:57,756 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 299 transitions, 1447 flow
[2024-03-09 05:56:57,784 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 299 transitions, 1429 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-09 05:56:57,788 INFO  L231             Difference]: Finished difference. Result has 191 places, 297 transitions, 1487 flow
[2024-03-09 05:56:57,788 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=167, PETRI_DIFFERENCE_MINUEND_FLOW=833, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1487, PETRI_PLACES=191, PETRI_TRANSITIONS=297}
[2024-03-09 05:56:57,788 INFO  L281   CegarLoopForPetriNet]: 167 programPoint places, 24 predicate places.
[2024-03-09 05:56:57,789 INFO  L495      AbstractCegarLoop]: Abstraction has has 191 places, 297 transitions, 1487 flow
[2024-03-09 05:56:57,789 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 140.5) internal successors, (843), 6 states have internal predecessors, (843), 0 states have call successors, (0), 0 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-09 05:56:57,789 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:56:57,789 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]
[2024-03-09 05:56:57,789 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-03-09 05:56:57,789 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting threadErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-09 05:56:57,790 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:56:57,790 INFO  L85        PathProgramCache]: Analyzing trace with hash -2010471471, now seen corresponding path program 1 times
[2024-03-09 05:56:57,790 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:56:57,790 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098187553]
[2024-03-09 05:56:57,790 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:56:57,790 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:56:57,805 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:56:58,051 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-09 05:56:58,052 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:56:58,052 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098187553]
[2024-03-09 05:56:58,052 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098187553] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:56:58,052 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:56:58,052 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 05:56:58,052 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269593590]
[2024-03-09 05:56:58,052 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:56:58,053 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 05:56:58,053 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:56:58,053 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 05:56:58,053 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 05:56:58,258 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 128 out of 167
[2024-03-09 05:56:58,259 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 297 transitions, 1487 flow. Second operand  has 6 states, 6 states have (on average 130.5) internal successors, (783), 6 states have internal predecessors, (783), 0 states have call successors, (0), 0 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-09 05:56:58,259 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:56:58,259 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 167
[2024-03-09 05:56:58,259 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:57:01,625 INFO  L124   PetriNetUnfolderBase]: 10287/29072 cut-off events.
[2024-03-09 05:57:01,625 INFO  L125   PetriNetUnfolderBase]: For 24533/97395 co-relation queries the response was YES.
[2024-03-09 05:57:01,724 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 79022 conditions, 29072 events. 10287/29072 cut-off events. For 24533/97395 co-relation queries the response was YES. Maximal size of possible extension queue 973. Compared 332763 event pairs, 2275 based on Foata normal form. 84/26798 useless extension candidates. Maximal degree in co-relation 66055. Up to 14172 conditions per place. 
[2024-03-09 05:57:01,816 INFO  L140   encePairwiseOnDemand]: 140/167 looper letters, 172 selfloop transitions, 188 changer transitions 0/510 dead transitions.
[2024-03-09 05:57:01,816 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 510 transitions, 3497 flow
[2024-03-09 05:57:01,817 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 05:57:01,817 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 05:57:01,819 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 910 transitions.
[2024-03-09 05:57:01,819 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.908183632734531
[2024-03-09 05:57:01,819 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 910 transitions.
[2024-03-09 05:57:01,819 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 910 transitions.
[2024-03-09 05:57:01,820 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:57:01,820 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 910 transitions.
[2024-03-09 05:57:01,821 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 151.66666666666666) internal successors, (910), 6 states have internal predecessors, (910), 0 states have call successors, (0), 0 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-09 05:57:01,822 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 167.0) internal successors, (1169), 7 states have internal predecessors, (1169), 0 states have call successors, (0), 0 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-09 05:57:01,823 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 167.0) internal successors, (1169), 7 states have internal predecessors, (1169), 0 states have call successors, (0), 0 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-09 05:57:01,823 INFO  L175             Difference]: Start difference. First operand has 191 places, 297 transitions, 1487 flow. Second operand 6 states and 910 transitions.
[2024-03-09 05:57:01,823 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 510 transitions, 3497 flow
[2024-03-09 05:57:01,932 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 510 transitions, 3497 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-09 05:57:01,938 INFO  L231             Difference]: Finished difference. Result has 200 places, 475 transitions, 3373 flow
[2024-03-09 05:57:01,939 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=167, PETRI_DIFFERENCE_MINUEND_FLOW=1487, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3373, PETRI_PLACES=200, PETRI_TRANSITIONS=475}
[2024-03-09 05:57:01,939 INFO  L281   CegarLoopForPetriNet]: 167 programPoint places, 33 predicate places.
[2024-03-09 05:57:01,939 INFO  L495      AbstractCegarLoop]: Abstraction has has 200 places, 475 transitions, 3373 flow
[2024-03-09 05:57:01,940 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 130.5) internal successors, (783), 6 states have internal predecessors, (783), 0 states have call successors, (0), 0 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-09 05:57:01,940 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:57:01,940 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]
[2024-03-09 05:57:01,940 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-03-09 05:57:01,940 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-09 05:57:01,940 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:57:01,940 INFO  L85        PathProgramCache]: Analyzing trace with hash 1755702461, now seen corresponding path program 1 times
[2024-03-09 05:57:01,940 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:57:01,941 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30748286]
[2024-03-09 05:57:01,941 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:57:01,941 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:57:01,960 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:57:01,981 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-09 05:57:01,981 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:57:01,981 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30748286]
[2024-03-09 05:57:01,981 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30748286] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:57:01,981 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:57:01,981 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-09 05:57:01,982 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561582644]
[2024-03-09 05:57:01,982 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:57:01,982 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 05:57:01,982 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:57:01,982 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 05:57:01,983 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 05:57:02,009 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 150 out of 167
[2024-03-09 05:57:02,010 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 475 transitions, 3373 flow. Second operand  has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 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-09 05:57:02,010 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:57:02,010 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 167
[2024-03-09 05:57:02,010 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:57:04,505 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([510] L1042-7-->L1042-8: Formula: (= (store |v_#race_44| v_~datas~0.base_6 (store (select |v_#race_44| v_~datas~0.base_6) (+ v_~datas~0.offset_6 (* v_threadThread2of2ForFork0_~j~0_9 4) 1) |v_threadThread2of2ForFork0_#t~nondet6_5|)) |v_#race_43|)  InVars {#race=|v_#race_44|, ~datas~0.base=v_~datas~0.base_6, threadThread2of2ForFork0_#t~nondet6=|v_threadThread2of2ForFork0_#t~nondet6_5|, threadThread2of2ForFork0_~j~0=v_threadThread2of2ForFork0_~j~0_9, ~datas~0.offset=v_~datas~0.offset_6}  OutVars{#race=|v_#race_43|, ~datas~0.base=v_~datas~0.base_6, threadThread2of2ForFork0_#t~nondet6=|v_threadThread2of2ForFork0_#t~nondet6_5|, threadThread2of2ForFork0_~j~0=v_threadThread2of2ForFork0_~j~0_9, ~datas~0.offset=v_~datas~0.offset_6}  AuxVars[]  AssignedVars[#race][260], [Black: 192#true, 174#true, Black: 199#(= |ULTIMATE.start_main_~i~0#1| 0), 106#L1042-10true, 194#(= |#race~datas~0| 0), Black: 211#(= |threadThread1of2ForFork0_#t~nondet4| |#race~next_j~0|), Black: 220#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem16#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem16#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem16#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem16#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem16#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem16#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem16#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem16#1.offset| 1)) 0)), Black: 218#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem16#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem16#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem16#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem16#1.offset| 1)) 0)), Black: 219#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem16#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem16#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem16#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem16#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem16#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem16#1.offset| 1)) 0)), Black: 217#(= (select (select |#race| |ULTIMATE.start_main_#t~mem16#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem16#1.offset|)) 0), threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, Black: 231#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 229#(= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))), 151#L1054-5true, 215#true, Black: 230#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 232#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), 4#L1042-8true, 227#true, Black: 177#(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: 179#(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| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 176#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 178#(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)), 238#true, Black: 188#(= |#race~next_j~0| 0)])
[2024-03-09 05:57:04,506 INFO  L294   olderBase$Statistics]: this new event has 117 ancestors and is cut-off event
[2024-03-09 05:57:04,506 INFO  L297   olderBase$Statistics]:   existing Event has 117 ancestors and is cut-off event
[2024-03-09 05:57:04,506 INFO  L297   olderBase$Statistics]:   existing Event has 117 ancestors and is cut-off event
[2024-03-09 05:57:04,506 INFO  L297   olderBase$Statistics]:   existing Event has 117 ancestors and is cut-off event
[2024-03-09 05:57:04,608 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([510] L1042-7-->L1042-8: Formula: (= (store |v_#race_44| v_~datas~0.base_6 (store (select |v_#race_44| v_~datas~0.base_6) (+ v_~datas~0.offset_6 (* v_threadThread2of2ForFork0_~j~0_9 4) 1) |v_threadThread2of2ForFork0_#t~nondet6_5|)) |v_#race_43|)  InVars {#race=|v_#race_44|, ~datas~0.base=v_~datas~0.base_6, threadThread2of2ForFork0_#t~nondet6=|v_threadThread2of2ForFork0_#t~nondet6_5|, threadThread2of2ForFork0_~j~0=v_threadThread2of2ForFork0_~j~0_9, ~datas~0.offset=v_~datas~0.offset_6}  OutVars{#race=|v_#race_43|, ~datas~0.base=v_~datas~0.base_6, threadThread2of2ForFork0_#t~nondet6=|v_threadThread2of2ForFork0_#t~nondet6_5|, threadThread2of2ForFork0_~j~0=v_threadThread2of2ForFork0_~j~0_9, ~datas~0.offset=v_~datas~0.offset_6}  AuxVars[]  AssignedVars[#race][260], [Black: 192#true, 174#true, Black: 199#(= |ULTIMATE.start_main_~i~0#1| 0), 51#L1056-5true, 106#L1042-10true, 194#(= |#race~datas~0| 0), Black: 211#(= |threadThread1of2ForFork0_#t~nondet4| |#race~next_j~0|), Black: 220#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem16#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem16#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem16#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem16#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem16#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem16#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem16#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem16#1.offset| 1)) 0)), Black: 218#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem16#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem16#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem16#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem16#1.offset| 1)) 0)), Black: 219#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem16#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem16#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem16#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem16#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem16#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem16#1.offset| 1)) 0)), Black: 217#(= (select (select |#race| |ULTIMATE.start_main_#t~mem16#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem16#1.offset|)) 0), threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, Black: 231#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 229#(= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))), 215#true, Black: 230#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 232#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), 4#L1042-8true, 227#true, Black: 177#(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: 179#(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| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 176#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 178#(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)), 238#true, Black: 188#(= |#race~next_j~0| 0)])
[2024-03-09 05:57:04,608 INFO  L294   olderBase$Statistics]: this new event has 118 ancestors and is cut-off event
[2024-03-09 05:57:04,608 INFO  L297   olderBase$Statistics]:   existing Event has 118 ancestors and is cut-off event
[2024-03-09 05:57:04,608 INFO  L297   olderBase$Statistics]:   existing Event has 118 ancestors and is cut-off event
[2024-03-09 05:57:04,608 INFO  L297   olderBase$Statistics]:   existing Event has 118 ancestors and is cut-off event
[2024-03-09 05:57:04,629 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([480] L1042-10-->L1042-11: Formula: (let ((.cse0 (select |v_#race_50| v_~datas~0.base_10)) (.cse1 (* v_threadThread1of2ForFork0_~j~0_17 4))) (and (= |v_threadThread1of2ForFork0_#t~nondet6_13| (select .cse0 (+ .cse1 2 v_~datas~0.offset_10))) (= (select .cse0 (+ .cse1 3 v_~datas~0.offset_10)) |v_threadThread1of2ForFork0_#t~nondet6_13|) (= |v_threadThread1of2ForFork0_#t~nondet6_13| (select .cse0 (+ .cse1 v_~datas~0.offset_10))) (= (select .cse0 (+ .cse1 v_~datas~0.offset_10 1)) |v_threadThread1of2ForFork0_#t~nondet6_13|)))  InVars {#race=|v_#race_50|, threadThread1of2ForFork0_~j~0=v_threadThread1of2ForFork0_~j~0_17, threadThread1of2ForFork0_#t~nondet6=|v_threadThread1of2ForFork0_#t~nondet6_13|, ~datas~0.base=v_~datas~0.base_10, ~datas~0.offset=v_~datas~0.offset_10}  OutVars{#race=|v_#race_50|, threadThread1of2ForFork0_~j~0=v_threadThread1of2ForFork0_~j~0_17, threadThread1of2ForFork0_#t~nondet6=|v_threadThread1of2ForFork0_#t~nondet6_13|, ~datas~0.base=v_~datas~0.base_10, ~datas~0.offset=v_~datas~0.offset_10}  AuxVars[]  AssignedVars[][210], [Black: 192#true, 134#L1042-7true, 174#true, Black: 199#(= |ULTIMATE.start_main_~i~0#1| 0), 194#(= |#race~datas~0| 0), Black: 211#(= |threadThread1of2ForFork0_#t~nondet4| |#race~next_j~0|), 58#L1042-11true, Black: 220#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem16#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem16#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem16#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem16#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem16#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem16#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem16#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem16#1.offset| 1)) 0)), 232#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 218#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem16#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem16#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem16#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem16#1.offset| 1)) 0)), Black: 219#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem16#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem16#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem16#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem16#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem16#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem16#1.offset| 1)) 0)), Black: 217#(= (select (select |#race| |ULTIMATE.start_main_#t~mem16#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem16#1.offset|)) 0), threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, Black: 231#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 229#(= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))), 151#L1054-5true, 215#true, Black: 230#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 177#(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: 179#(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| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 176#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 178#(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)), 238#true, Black: 188#(= |#race~next_j~0| 0)])
[2024-03-09 05:57:04,629 INFO  L294   olderBase$Statistics]: this new event has 117 ancestors and is not cut-off event
[2024-03-09 05:57:04,629 INFO  L297   olderBase$Statistics]:   existing Event has 117 ancestors and is not cut-off event
[2024-03-09 05:57:04,629 INFO  L297   olderBase$Statistics]:   existing Event has 117 ancestors and is not cut-off event
[2024-03-09 05:57:04,629 INFO  L297   olderBase$Statistics]:   existing Event has 117 ancestors and is not cut-off event
[2024-03-09 05:57:04,630 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([431] L1054-5-->L1054-6: Formula: (let ((.cse0 (select |v_#race_20| |v_ULTIMATE.start_main_~#tids~0#1.base_17|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 1)) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_17|) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 3)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 2)) 0)))  InVars {#race=|v_#race_20|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  OutVars{#race=|v_#race_20|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  AuxVars[]  AssignedVars[][231], [Black: 192#true, 107#L1054-6true, 134#L1042-7true, Black: 199#(= |ULTIMATE.start_main_~i~0#1| 0), 106#L1042-10true, 194#(= |#race~datas~0| 0), Black: 211#(= |threadThread1of2ForFork0_#t~nondet4| |#race~next_j~0|), Black: 220#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem16#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem16#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem16#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem16#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem16#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem16#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem16#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem16#1.offset| 1)) 0)), Black: 218#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem16#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem16#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem16#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem16#1.offset| 1)) 0)), Black: 219#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem16#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem16#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem16#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem16#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem16#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem16#1.offset| 1)) 0)), Black: 217#(= (select (select |#race| |ULTIMATE.start_main_#t~mem16#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem16#1.offset|)) 0), threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, Black: 231#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 229#(= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))), Black: 230#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), 215#true, Black: 232#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), 227#true, 179#(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| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 177#(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: 176#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 174#true, Black: 178#(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)), 238#true, Black: 188#(= |#race~next_j~0| 0)])
[2024-03-09 05:57:04,630 INFO  L294   olderBase$Statistics]: this new event has 117 ancestors and is not cut-off event
[2024-03-09 05:57:04,630 INFO  L297   olderBase$Statistics]:   existing Event has 117 ancestors and is not cut-off event
[2024-03-09 05:57:04,630 INFO  L297   olderBase$Statistics]:   existing Event has 117 ancestors and is not cut-off event
[2024-03-09 05:57:04,630 INFO  L297   olderBase$Statistics]:   existing Event has 117 ancestors and is not cut-off event
[2024-03-09 05:57:04,721 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([480] L1042-10-->L1042-11: Formula: (let ((.cse0 (select |v_#race_50| v_~datas~0.base_10)) (.cse1 (* v_threadThread1of2ForFork0_~j~0_17 4))) (and (= |v_threadThread1of2ForFork0_#t~nondet6_13| (select .cse0 (+ .cse1 2 v_~datas~0.offset_10))) (= (select .cse0 (+ .cse1 3 v_~datas~0.offset_10)) |v_threadThread1of2ForFork0_#t~nondet6_13|) (= |v_threadThread1of2ForFork0_#t~nondet6_13| (select .cse0 (+ .cse1 v_~datas~0.offset_10))) (= (select .cse0 (+ .cse1 v_~datas~0.offset_10 1)) |v_threadThread1of2ForFork0_#t~nondet6_13|)))  InVars {#race=|v_#race_50|, threadThread1of2ForFork0_~j~0=v_threadThread1of2ForFork0_~j~0_17, threadThread1of2ForFork0_#t~nondet6=|v_threadThread1of2ForFork0_#t~nondet6_13|, ~datas~0.base=v_~datas~0.base_10, ~datas~0.offset=v_~datas~0.offset_10}  OutVars{#race=|v_#race_50|, threadThread1of2ForFork0_~j~0=v_threadThread1of2ForFork0_~j~0_17, threadThread1of2ForFork0_#t~nondet6=|v_threadThread1of2ForFork0_#t~nondet6_13|, ~datas~0.base=v_~datas~0.base_10, ~datas~0.offset=v_~datas~0.offset_10}  AuxVars[]  AssignedVars[][210], [Black: 192#true, 134#L1042-7true, 174#true, Black: 199#(= |ULTIMATE.start_main_~i~0#1| 0), 51#L1056-5true, 194#(= |#race~datas~0| 0), Black: 211#(= |threadThread1of2ForFork0_#t~nondet4| |#race~next_j~0|), 58#L1042-11true, Black: 220#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem16#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem16#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem16#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem16#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem16#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem16#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem16#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem16#1.offset| 1)) 0)), Black: 218#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem16#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem16#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem16#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem16#1.offset| 1)) 0)), 232#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 219#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem16#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem16#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem16#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem16#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem16#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem16#1.offset| 1)) 0)), Black: 217#(= (select (select |#race| |ULTIMATE.start_main_#t~mem16#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem16#1.offset|)) 0), threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, Black: 231#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 229#(= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))), Black: 230#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), 215#true, Black: 177#(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: 179#(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| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 176#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 178#(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)), 238#true, Black: 188#(= |#race~next_j~0| 0)])
[2024-03-09 05:57:04,721 INFO  L294   olderBase$Statistics]: this new event has 118 ancestors and is not cut-off event
[2024-03-09 05:57:04,721 INFO  L297   olderBase$Statistics]:   existing Event has 118 ancestors and is not cut-off event
[2024-03-09 05:57:04,721 INFO  L297   olderBase$Statistics]:   existing Event has 118 ancestors and is not cut-off event
[2024-03-09 05:57:04,721 INFO  L297   olderBase$Statistics]:   existing Event has 118 ancestors and is not cut-off event
[2024-03-09 05:57:04,721 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([357] L1056-5-->L1056-6: Formula: (let ((.cse0 (select |v_#race_40| |v_ULTIMATE.start_main_~#tids~0#1.base_24|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 2)) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_24|) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 3)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 1)) 0)))  InVars {#race=|v_#race_40|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  OutVars{#race=|v_#race_40|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  AuxVars[]  AssignedVars[][245], [Black: 192#true, 134#L1042-7true, 54#L1056-6true, Black: 199#(= |ULTIMATE.start_main_~i~0#1| 0), 106#L1042-10true, 194#(= |#race~datas~0| 0), Black: 211#(= |threadThread1of2ForFork0_#t~nondet4| |#race~next_j~0|), Black: 220#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem16#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem16#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem16#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem16#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem16#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem16#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem16#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem16#1.offset| 1)) 0)), Black: 218#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem16#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem16#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem16#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem16#1.offset| 1)) 0)), Black: 219#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem16#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem16#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem16#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem16#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem16#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem16#1.offset| 1)) 0)), Black: 217#(= (select (select |#race| |ULTIMATE.start_main_#t~mem16#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem16#1.offset|)) 0), threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, Black: 231#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 229#(= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))), Black: 230#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), 215#true, Black: 232#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), 227#true, 179#(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| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 177#(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: 176#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 174#true, Black: 178#(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)), 238#true, Black: 188#(= |#race~next_j~0| 0)])
[2024-03-09 05:57:04,722 INFO  L294   olderBase$Statistics]: this new event has 118 ancestors and is not cut-off event
[2024-03-09 05:57:04,722 INFO  L297   olderBase$Statistics]:   existing Event has 118 ancestors and is not cut-off event
[2024-03-09 05:57:04,722 INFO  L297   olderBase$Statistics]:   existing Event has 118 ancestors and is not cut-off event
[2024-03-09 05:57:04,722 INFO  L297   olderBase$Statistics]:   existing Event has 118 ancestors and is not cut-off event
[2024-03-09 05:57:05,568 INFO  L124   PetriNetUnfolderBase]: 8793/27831 cut-off events.
[2024-03-09 05:57:05,568 INFO  L125   PetriNetUnfolderBase]: For 33592/60035 co-relation queries the response was YES.
[2024-03-09 05:57:05,673 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 80839 conditions, 27831 events. 8793/27831 cut-off events. For 33592/60035 co-relation queries the response was YES. Maximal size of possible extension queue 929. Compared 337058 event pairs, 1035 based on Foata normal form. 74/26387 useless extension candidates. Maximal degree in co-relation 67682. Up to 8068 conditions per place. 
[2024-03-09 05:57:05,834 INFO  L140   encePairwiseOnDemand]: 160/167 looper letters, 22 selfloop transitions, 11 changer transitions 0/483 dead transitions.
[2024-03-09 05:57:05,834 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 483 transitions, 3472 flow
[2024-03-09 05:57:05,835 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 05:57:05,835 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 05:57:05,835 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 471 transitions.
[2024-03-09 05:57:05,836 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9401197604790419
[2024-03-09 05:57:05,836 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 471 transitions.
[2024-03-09 05:57:05,836 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 471 transitions.
[2024-03-09 05:57:05,836 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:57:05,836 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 471 transitions.
[2024-03-09 05:57:05,837 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 157.0) internal successors, (471), 3 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:57:05,838 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 0 states have call successors, (0), 0 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-09 05:57:05,838 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 0 states have call successors, (0), 0 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-09 05:57:05,838 INFO  L175             Difference]: Start difference. First operand has 200 places, 475 transitions, 3373 flow. Second operand 3 states and 471 transitions.
[2024-03-09 05:57:05,838 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 483 transitions, 3472 flow
[2024-03-09 05:57:06,450 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 483 transitions, 3400 flow, removed 36 selfloop flow, removed 0 redundant places.
[2024-03-09 05:57:06,455 INFO  L231             Difference]: Finished difference. Result has 204 places, 482 transitions, 3389 flow
[2024-03-09 05:57:06,455 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=167, PETRI_DIFFERENCE_MINUEND_FLOW=3301, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=475, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=464, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3389, PETRI_PLACES=204, PETRI_TRANSITIONS=482}
[2024-03-09 05:57:06,456 INFO  L281   CegarLoopForPetriNet]: 167 programPoint places, 37 predicate places.
[2024-03-09 05:57:06,456 INFO  L495      AbstractCegarLoop]: Abstraction has has 204 places, 482 transitions, 3389 flow
[2024-03-09 05:57:06,456 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 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-09 05:57:06,456 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:57:06,456 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]
[2024-03-09 05:57:06,456 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-03-09 05:57:06,456 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-09 05:57:06,457 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:57:06,457 INFO  L85        PathProgramCache]: Analyzing trace with hash -1466040979, now seen corresponding path program 1 times
[2024-03-09 05:57:06,457 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:57:06,457 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450469657]
[2024-03-09 05:57:06,457 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:57:06,457 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:57:06,477 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-09 05:57:06,477 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-03-09 05:57:06,485 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-09 05:57:06,492 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-03-09 05:57:06,492 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-03-09 05:57:06,492 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (21 of 22 remaining)
[2024-03-09 05:57:06,492 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (20 of 22 remaining)
[2024-03-09 05:57:06,493 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (19 of 22 remaining)
[2024-03-09 05:57:06,493 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (18 of 22 remaining)
[2024-03-09 05:57:06,493 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (17 of 22 remaining)
[2024-03-09 05:57:06,493 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (16 of 22 remaining)
[2024-03-09 05:57:06,493 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (15 of 22 remaining)
[2024-03-09 05:57:06,493 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 22 remaining)
[2024-03-09 05:57:06,493 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (13 of 22 remaining)
[2024-03-09 05:57:06,493 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (12 of 22 remaining)
[2024-03-09 05:57:06,493 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (11 of 22 remaining)
[2024-03-09 05:57:06,493 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (10 of 22 remaining)
[2024-03-09 05:57:06,494 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (9 of 22 remaining)
[2024-03-09 05:57:06,494 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (8 of 22 remaining)
[2024-03-09 05:57:06,494 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (7 of 22 remaining)
[2024-03-09 05:57:06,494 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (6 of 22 remaining)
[2024-03-09 05:57:06,494 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (5 of 22 remaining)
[2024-03-09 05:57:06,494 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (4 of 22 remaining)
[2024-03-09 05:57:06,494 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (3 of 22 remaining)
[2024-03-09 05:57:06,494 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (2 of 22 remaining)
[2024-03-09 05:57:06,494 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (1 of 22 remaining)
[2024-03-09 05:57:06,494 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (0 of 22 remaining)
[2024-03-09 05:57:06,495 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-03-09 05:57:06,495 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 05:57:06,499 INFO  L228   ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances
[2024-03-09 05:57:06,499 INFO  L178   ceAbstractionStarter]: Computing trace abstraction results
[2024-03-09 05:57:06,526 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet7 could not be translated
[2024-03-09 05:57:06,527 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~malloc8
[2024-03-09 05:57:06,528 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet10 could not be translated
[2024-03-09 05:57:06,528 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~malloc9
[2024-03-09 05:57:06,528 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre12 could not be translated
[2024-03-09 05:57:06,528 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem13
[2024-03-09 05:57:06,529 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre12 could not be translated
[2024-03-09 05:57:06,529 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem13
[2024-03-09 05:57:06,529 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem13
[2024-03-09 05:57:06,529 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre12 could not be translated
[2024-03-09 05:57:06,529 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem13
[2024-03-09 05:57:06,530 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre12 could not be translated
[2024-03-09 05:57:06,530 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre12 could not be translated
[2024-03-09 05:57:06,530 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem13
[2024-03-09 05:57:06,530 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre12 could not be translated
[2024-03-09 05:57:06,530 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem13
[2024-03-09 05:57:06,531 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated
[2024-03-09 05:57:06,531 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post3 could not be translated
[2024-03-09 05:57:06,531 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated
[2024-03-09 05:57:06,531 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post3 could not be translated
[2024-03-09 05:57:06,538 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 05:57:06 BasicIcfg
[2024-03-09 05:57:06,538 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-03-09 05:57:06,539 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2024-03-09 05:57:06,539 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2024-03-09 05:57:06,539 INFO  L274        PluginConnector]: Witness Printer initialized
[2024-03-09 05:57:06,539 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.03 05:56:47" (3/4) ...
[2024-03-09 05:57:06,540 INFO  L140         WitnessPrinter]: No result that supports witness generation found
[2024-03-09 05:57:06,541 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-03-09 05:57:06,542 INFO  L158              Benchmark]: Toolchain (without parser) took 19651.36ms. Allocated memory was 104.9MB in the beginning and 5.5GB in the end (delta: 5.4GB). Free memory was 51.8MB in the beginning and 4.4GB in the end (delta: -4.4GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB.
[2024-03-09 05:57:06,542 INFO  L158              Benchmark]: CDTParser took 0.10ms. Allocated memory is still 86.0MB. Free memory was 59.0MB in the beginning and 58.9MB in the end (delta: 92.3kB). There was no memory consumed. Max. memory is 16.1GB.
[2024-03-09 05:57:06,542 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 409.25ms. Allocated memory is still 104.9MB. Free memory was 51.5MB in the beginning and 59.7MB in the end (delta: -8.2MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB.
[2024-03-09 05:57:06,542 INFO  L158              Benchmark]: Boogie Procedure Inliner took 38.16ms. Allocated memory is still 104.9MB. Free memory was 59.7MB in the beginning and 57.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-03-09 05:57:06,543 INFO  L158              Benchmark]: Boogie Preprocessor took 25.08ms. Allocated memory is still 104.9MB. Free memory was 57.2MB in the beginning and 55.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-03-09 05:57:06,543 INFO  L158              Benchmark]: RCFGBuilder took 391.28ms. Allocated memory is still 104.9MB. Free memory was 55.1MB in the beginning and 76.4MB in the end (delta: -21.4MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB.
[2024-03-09 05:57:06,543 INFO  L158              Benchmark]: TraceAbstraction took 18780.43ms. Allocated memory was 104.9MB in the beginning and 5.5GB in the end (delta: 5.4GB). Free memory was 75.3MB in the beginning and 4.4GB in the end (delta: -4.4GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB.
[2024-03-09 05:57:06,543 INFO  L158              Benchmark]: Witness Printer took 2.46ms. Allocated memory is still 5.5GB. Free memory is still 4.4GB. There was no memory consumed. Max. memory is 16.1GB.
[2024-03-09 05:57:06,545 INFO  L338   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.10ms. Allocated memory is still 86.0MB. Free memory was 59.0MB in the beginning and 58.9MB in the end (delta: 92.3kB). There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 409.25ms. Allocated memory is still 104.9MB. Free memory was 51.5MB in the beginning and 59.7MB in the end (delta: -8.2MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 38.16ms. Allocated memory is still 104.9MB. Free memory was 59.7MB in the beginning and 57.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 25.08ms. Allocated memory is still 104.9MB. Free memory was 57.2MB in the beginning and 55.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
 * RCFGBuilder took 391.28ms. Allocated memory is still 104.9MB. Free memory was 55.1MB in the beginning and 76.4MB in the end (delta: -21.4MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB.
 * TraceAbstraction took 18780.43ms. Allocated memory was 104.9MB in the beginning and 5.5GB in the end (delta: 5.4GB). Free memory was 75.3MB in the beginning and 4.4GB in the end (delta: -4.4GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB.
 * Witness Printer took 2.46ms. Allocated memory is still 5.5GB. Free memory is still 4.4GB. There was no memory consumed. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator:
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet7 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: unknown boogie variable #t~malloc8
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet10 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: unknown boogie variable #t~malloc9
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~pre12 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: unknown boogie variable #t~mem13
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~pre12 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: unknown boogie variable #t~mem13
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: unknown boogie variable #t~mem13
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~pre12 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: unknown boogie variable #t~mem13
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~pre12 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~pre12 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: unknown boogie variable #t~mem13
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~pre12 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: unknown boogie variable #t~mem13
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~post3 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~post3 could not be translated
  - GenericResult: Unfinished Backtranslation
    The program execution was not completely translated back.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - DataRaceFoundResult [Line: 1040]: Data race detected
[2024-03-09 05:57:06,558 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet7 could not be translated
[2024-03-09 05:57:06,558 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~malloc8
[2024-03-09 05:57:06,559 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~malloc9
[2024-03-09 05:57:06,559 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet10 could not be translated
[2024-03-09 05:57:06,559 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem13
[2024-03-09 05:57:06,559 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre12 could not be translated
[2024-03-09 05:57:06,559 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem13
[2024-03-09 05:57:06,559 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre12 could not be translated
[2024-03-09 05:57:06,559 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre12 could not be translated
[2024-03-09 05:57:06,560 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem13
[2024-03-09 05:57:06,560 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem13
[2024-03-09 05:57:06,560 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre12 could not be translated
[2024-03-09 05:57:06,560 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem13
[2024-03-09 05:57:06,560 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre12 could not be translated
[2024-03-09 05:57:06,561 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem13
[2024-03-09 05:57:06,561 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre12 could not be translated
[2024-03-09 05:57:06,561 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated
[2024-03-09 05:57:06,561 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post3 could not be translated
[2024-03-09 05:57:06,561 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated
[2024-03-09 05:57:06,561 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post3 could not be translated
[2024-03-09 05:57:06,570 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet7 could not be translated
[2024-03-09 05:57:06,570 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~malloc8
[2024-03-09 05:57:06,571 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet10 could not be translated
[2024-03-09 05:57:06,571 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~malloc9
[2024-03-09 05:57:06,571 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem13
[2024-03-09 05:57:06,571 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre12 could not be translated
[2024-03-09 05:57:06,571 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre12 could not be translated
[2024-03-09 05:57:06,571 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem13
[2024-03-09 05:57:06,571 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem13
[2024-03-09 05:57:06,571 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre12 could not be translated
[2024-03-09 05:57:06,572 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem13
[2024-03-09 05:57:06,572 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre12 could not be translated
[2024-03-09 05:57:06,572 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre12 could not be translated
[2024-03-09 05:57:06,572 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem13
[2024-03-09 05:57:06,572 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem13
[2024-03-09 05:57:06,572 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre12 could not be translated
[2024-03-09 05:57:06,573 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated
[2024-03-09 05:57:06,573 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post3 could not be translated
[2024-03-09 05:57:06,573 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated
[2024-03-09 05:57:06,573 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post3 could not be translated
    Data race detected
The following path leads to a data race: 
[L1036]               0  int *datas;
         VAL             [datas={0:0}]
[L1037]               0  int next_j = 0;
         VAL             [datas={0:0}, next_j=0]
[L1046]               0  int threads_total = __VERIFIER_nondet_int();
         VAL             [datas={0:0}, next_j=0, threads_total=2]
[L1047]  CALL         0  assume_abort_if_not(threads_total >= 0)
[L1033]  COND FALSE   0  !(!cond)
         VAL             [\old(cond)=1, cond=1, datas={0:0}, next_j=0]
[L1047]  RET          0  assume_abort_if_not(threads_total >= 0)
[L1048]               0  pthread_t *tids = malloc(threads_total * sizeof(pthread_t));
         VAL             [datas={0:0}, next_j=0, threads_total=2, tids={5:0}]
[L1048]               0  pthread_t *tids = malloc(threads_total * sizeof(pthread_t));
         VAL             [datas={0:0}, next_j=0, threads_total=2, tids={5:0}]
[L1049]               0  datas = malloc(threads_total * sizeof(int))
         VAL             [datas={-3:0}, next_j=0, threads_total=2, tids={5:0}]
[L1050]               0  int i = 0;
         VAL             [datas={-3:0}, i=0, next_j=0, threads_total=2, tids={5:0}]
[L1050]  COND TRUE    0  i < threads_total
         VAL             [datas={-3:0}, i=0, next_j=0, threads_total=2, tids={5:0}]
[L1051]  EXPR         0  \read(*tids)
         VAL             [datas={-3:0}, i=0, next_j=0, threads_total=2, tids={5:0}]
[L1051]  EXPR         0  tids[i]
         VAL             [datas={-3:0}, i=0, next_j=0, threads_total=2, tids={5:0}]
[L1051]  FCALL, FORK  0  pthread_create(&tids[i], ((void *)0), &thread, ((void *)0))
         VAL             [arg={0:0}, datas={-3:0}, i=0, next_j=0, threads_total=2, tids={5:0}]
[L1039]               1  int j;
         VAL             [arg={0:0}, arg={0:0}, datas={-3:0}, next_j=0]
[L1050]               0  i++
         VAL             [arg={0:0}, arg={0:0}, datas={-3:0}, i=1, next_j=0, threads_total=2, tids={5:0}]
[L1050]  COND TRUE    0  i < threads_total
         VAL             [arg={0:0}, arg={0:0}, datas={-3:0}, i=1, next_j=0, threads_total=2, tids={5:0}]
[L1051]  EXPR         0  \read(*tids)
         VAL             [arg={0:0}, arg={0:0}, datas={-3:0}, i=1, next_j=0, threads_total=2, tids={5:0}]
[L1051]  EXPR         0  tids[i]
         VAL             [arg={0:0}, arg={0:0}, datas={-3:0}, i=1, next_j=0, threads_total=2, tids={5:0}]
[L1051]  FCALL, FORK  0  pthread_create(&tids[i], ((void *)0), &thread, ((void *)0))
         VAL             [arg={0:0}, arg={0:0}, datas={-3:0}, i=1, next_j=0, threads_total=2, tids={5:0}]
[L1040]               1  j = next_j
         VAL             [arg={0:0}, arg={0:0}, datas={-3:0}, next_j=0]
[L1039]               2  int j;
         VAL             [arg={0:0}, arg={0:0}, datas={-3:0}, next_j=0]
[L1040]               2  j = next_j
         VAL             [arg={0:0}, arg={0:0}, datas={-3:0}, j=0, next_j=0]
[L1041]               1  next_j++
         VAL             [arg={0:0}, arg={0:0}, datas={-3:0}, j=0, next_j=1]
[L1040]               2  j = next_j
         VAL             [arg={0:0}, arg={0:0}, datas={-3:0}, j=0, next_j=1]

Now there is a data race on ~next_j~0 between 
	C: next_j++ [1041]
and
	C: j = next_j [1040]

  - UnprovableResult [Line: 1049]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1051]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1054]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1056]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1057]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1054]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1051]: Unable to prove that petrification did provide enough thread instances (tool internal message)
    Unable to prove that petrification did provide enough thread instances (tool internal message)
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1041]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1041]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1042]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1042]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
    CFG has 3 procedures, 163 locations, 17 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.0s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 236 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 136 mSDsluCounter, 60 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 33 mSDsCounter, 86 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 327 IncrementalHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 86 mSolverCounterUnsat, 27 mSDtfsCounter, 327 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=503occurred in iteration=5, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 299 NumberOfCodeBlocks, 299 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 237 ConstructedInterpolants, 0 QuantifiedInterpolants, 338 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
  - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances
    CFG has 4 procedures, 198 locations, 22 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 16.7s, OverallIterations: 10, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 15.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 551 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 288 mSDsluCounter, 75 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26 mSDsCounter, 153 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1196 IncrementalHoareTripleChecker+Invalid, 1349 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 153 mSolverCounterUnsat, 49 mSDtfsCounter, 1196 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3389occurred in iteration=9, InterpolantAutomatonStates: 39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 507 NumberOfCodeBlocks, 507 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 427 ConstructedInterpolants, 0 QuantifiedInterpolants, 760 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 12/12 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
[2024-03-09 05:57:06,590 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
--- End real Ultimate output ---

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