./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-bitmask-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-bitmask-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 f4ebc1fb9eba41c231393a5884ecb89fb8b7e4768600ef8a85dd877844861ace
--- Real Ultimate output ---
This is Ultimate 0.2.4-dev-0e0057c
[2024-03-09 05:43:10,235 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-03-09 05:43:10,280 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:43:10,284 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-03-09 05:43:10,284 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-03-09 05:43:10,299 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-03-09 05:43:10,299 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-03-09 05:43:10,300 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-03-09 05:43:10,300 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-03-09 05:43:10,300 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-03-09 05:43:10,301 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-03-09 05:43:10,301 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-03-09 05:43:10,302 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-03-09 05:43:10,302 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-03-09 05:43:10,302 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-03-09 05:43:10,303 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-03-09 05:43:10,303 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-03-09 05:43:10,303 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-03-09 05:43:10,304 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-03-09 05:43:10,304 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-03-09 05:43:10,304 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-03-09 05:43:10,305 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-03-09 05:43:10,305 INFO  L153        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2024-03-09 05:43:10,305 INFO  L153        SettingsManager]:  * Check unreachability of reach_error function=false
[2024-03-09 05:43:10,306 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-03-09 05:43:10,306 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-03-09 05:43:10,306 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-03-09 05:43:10,307 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-03-09 05:43:10,307 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-03-09 05:43:10,307 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-03-09 05:43:10,307 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-03-09 05:43:10,308 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-03-09 05:43:10,308 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-03-09 05:43:10,308 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-03-09 05:43:10,308 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-03-09 05:43:10,309 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-03-09 05:43:10,309 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-03-09 05:43:10,309 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-03-09 05:43:10,309 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-03-09 05:43:10,309 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-03-09 05:43:10,310 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-03-09 05:43:10,310 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 -> f4ebc1fb9eba41c231393a5884ecb89fb8b7e4768600ef8a85dd877844861ace
[2024-03-09 05:43:10,499 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-03-09 05:43:10,520 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-03-09 05:43:10,523 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-03-09 05:43:10,524 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-03-09 05:43:10,524 INFO  L274        PluginConnector]: CDTParser initialized
[2024-03-09 05:43:10,525 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-index-bitmask-race.i
[2024-03-09 05:43:11,665 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-03-09 05:43:11,942 INFO  L384              CDTParser]: Found 1 translation units.
[2024-03-09 05:43:11,943 INFO  L180              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-index-bitmask-race.i
[2024-03-09 05:43:11,956 INFO  L427              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data/3eb8594b3/21b47b33e5564115bb9f8c794e2218c7/FLAG0120c7b16
[2024-03-09 05:43:12,279 INFO  L435              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data/3eb8594b3/21b47b33e5564115bb9f8c794e2218c7
[2024-03-09 05:43:12,282 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-03-09 05:43:12,283 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-03-09 05:43:12,284 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-03-09 05:43:12,285 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-03-09 05:43:12,288 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-03-09 05:43:12,289 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 05:43:12" (1/1) ...
[2024-03-09 05:43:12,289 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6547c687 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:43:12, skipping insertion in model container
[2024-03-09 05:43:12,290 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 05:43:12" (1/1) ...
[2024-03-09 05:43:12,332 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-03-09 05:43:12,645 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2024-03-09 05:43:12,652 INFO  L202         MainTranslator]: Completed pre-run
[2024-03-09 05:43:12,681 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2024-03-09 05:43:12,709 WARN  L675               CHandler]: The function ffs is called, but not defined or handled by StandardFunctionHandler.
[2024-03-09 05:43:12,715 INFO  L206         MainTranslator]: Completed translation
[2024-03-09 05:43:12,715 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:43:12 WrapperNode
[2024-03-09 05:43:12,715 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-03-09 05:43:12,716 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-03-09 05:43:12,716 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-03-09 05:43:12,717 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-03-09 05:43:12,724 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:43:12" (1/1) ...
[2024-03-09 05:43:12,737 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:43:12" (1/1) ...
[2024-03-09 05:43:12,765 INFO  L138                Inliner]: procedures = 277, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 119
[2024-03-09 05:43:12,765 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-03-09 05:43:12,766 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-03-09 05:43:12,766 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-03-09 05:43:12,766 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-03-09 05:43:12,773 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:43:12" (1/1) ...
[2024-03-09 05:43:12,774 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:43:12" (1/1) ...
[2024-03-09 05:43:12,777 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:43:12" (1/1) ...
[2024-03-09 05:43:12,777 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:43:12" (1/1) ...
[2024-03-09 05:43:12,790 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:43:12" (1/1) ...
[2024-03-09 05:43:12,794 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:43:12" (1/1) ...
[2024-03-09 05:43:12,795 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:43:12" (1/1) ...
[2024-03-09 05:43:12,796 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:43:12" (1/1) ...
[2024-03-09 05:43:12,799 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-03-09 05:43:12,800 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-03-09 05:43:12,800 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-03-09 05:43:12,800 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-03-09 05:43:12,801 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:43:12" (1/1) ...
[2024-03-09 05:43:12,806 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-03-09 05:43:12,817 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 05:43:12,831 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:43:12,853 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:43:12,876 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2024-03-09 05:43:12,876 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2024-03-09 05:43:12,876 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-03-09 05:43:12,876 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2024-03-09 05:43:12,877 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2024-03-09 05:43:12,877 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2024-03-09 05:43:12,877 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2024-03-09 05:43:12,877 INFO  L130     BoogieDeclarations]: Found specification of procedure ffs
[2024-03-09 05:43:12,877 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2024-03-09 05:43:12,878 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2024-03-09 05:43:12,878 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-03-09 05:43:12,878 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-03-09 05:43:12,879 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:43:12,997 INFO  L241             CfgBuilder]: Building ICFG
[2024-03-09 05:43:12,999 INFO  L267             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-03-09 05:43:13,327 INFO  L282             CfgBuilder]: Performing block encoding
[2024-03-09 05:43:13,338 INFO  L304             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-03-09 05:43:13,339 INFO  L309             CfgBuilder]: Removed 2 assume(true) statements.
[2024-03-09 05:43:13,340 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.03 05:43:13 BoogieIcfgContainer
[2024-03-09 05:43:13,340 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-03-09 05:43:13,342 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-03-09 05:43:13,342 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-03-09 05:43:13,345 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-03-09 05:43:13,345 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 05:43:12" (1/3) ...
[2024-03-09 05:43:13,346 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bb7200e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 05:43:13, skipping insertion in model container
[2024-03-09 05:43:13,346 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:43:12" (2/3) ...
[2024-03-09 05:43:13,346 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bb7200e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 05:43:13, skipping insertion in model container
[2024-03-09 05:43:13,346 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.03 05:43:13" (3/3) ...
[2024-03-09 05:43:13,347 INFO  L112   eAbstractionObserver]: Analyzing ICFG per-thread-index-bitmask-race.i
[2024-03-09 05:43:13,353 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2024-03-09 05:43:13,361 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-03-09 05:43:13,362 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations.
[2024-03-09 05:43:13,362 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-03-09 05:43:13,426 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2024-03-09 05:43:13,456 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 175 places, 183 transitions, 373 flow
[2024-03-09 05:43:13,524 INFO  L124   PetriNetUnfolderBase]: 16/268 cut-off events.
[2024-03-09 05:43:13,525 INFO  L125   PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES.
[2024-03-09 05:43:13,531 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 273 conditions, 268 events. 16/268 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 603 event pairs, 0 based on Foata normal form. 0/228 useless extension candidates. Maximal degree in co-relation 136. Up to 6 conditions per place. 
[2024-03-09 05:43:13,531 INFO  L82        GeneralOperation]: Start removeDead. Operand has 175 places, 183 transitions, 373 flow
[2024-03-09 05:43:13,536 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 175 places, 183 transitions, 373 flow
[2024-03-09 05:43:13,543 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-09 05:43:13,549 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;@4e978215, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-03-09 05:43:13,550 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 18 error locations.
[2024-03-09 05:43:13,556 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-03-09 05:43:13,556 INFO  L124   PetriNetUnfolderBase]: 2/34 cut-off events.
[2024-03-09 05:43:13,556 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-03-09 05:43:13,556 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:43:13,557 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]
[2024-03-09 05:43:13,557 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-09 05:43:13,561 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:43:13,562 INFO  L85        PathProgramCache]: Analyzing trace with hash 492644561, now seen corresponding path program 1 times
[2024-03-09 05:43:13,568 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:43:13,569 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128883661]
[2024-03-09 05:43:13,569 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:43:13,569 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:43:13,665 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:43:13,758 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:43:13,758 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:43:13,759 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128883661]
[2024-03-09 05:43:13,759 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128883661] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:43:13,759 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:43:13,760 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-09 05:43:13,761 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204590508]
[2024-03-09 05:43:13,762 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:43:13,768 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 05:43:13,772 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:43:13,791 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 05:43:13,792 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 05:43:13,812 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 168 out of 183
[2024-03-09 05:43:13,815 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 183 transitions, 373 flow. Second operand  has 3 states, 3 states have (on average 169.33333333333334) internal successors, (508), 3 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:43:13,815 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:43:13,816 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 183
[2024-03-09 05:43:13,816 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:43:13,904 INFO  L124   PetriNetUnfolderBase]: 18/349 cut-off events.
[2024-03-09 05:43:13,904 INFO  L125   PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES.
[2024-03-09 05:43:13,906 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 371 conditions, 349 events. 18/349 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 929 event pairs, 2 based on Foata normal form. 6/304 useless extension candidates. Maximal degree in co-relation 229. Up to 15 conditions per place. 
[2024-03-09 05:43:13,908 INFO  L140   encePairwiseOnDemand]: 176/183 looper letters, 8 selfloop transitions, 2 changer transitions 2/178 dead transitions.
[2024-03-09 05:43:13,908 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 178 transitions, 383 flow
[2024-03-09 05:43:13,910 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 05:43:13,911 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 05:43:13,918 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 519 transitions.
[2024-03-09 05:43:13,920 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9453551912568307
[2024-03-09 05:43:13,920 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 519 transitions.
[2024-03-09 05:43:13,921 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 519 transitions.
[2024-03-09 05:43:13,923 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:43:13,925 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 519 transitions.
[2024-03-09 05:43:13,928 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 173.0) internal successors, (519), 3 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:43:13,932 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states 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:43:13,933 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states 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:43:13,934 INFO  L175             Difference]: Start difference. First operand has 175 places, 183 transitions, 373 flow. Second operand 3 states and 519 transitions.
[2024-03-09 05:43:13,935 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 178 transitions, 383 flow
[2024-03-09 05:43:13,938 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 178 transitions, 383 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-09 05:43:13,941 INFO  L231             Difference]: Finished difference. Result has 176 places, 176 transitions, 363 flow
[2024-03-09 05:43:13,942 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=363, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=363, PETRI_PLACES=176, PETRI_TRANSITIONS=176}
[2024-03-09 05:43:13,945 INFO  L281   CegarLoopForPetriNet]: 175 programPoint places, 1 predicate places.
[2024-03-09 05:43:13,945 INFO  L495      AbstractCegarLoop]: Abstraction has has 176 places, 176 transitions, 363 flow
[2024-03-09 05:43:13,946 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 169.33333333333334) internal successors, (508), 3 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:43:13,946 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:43:13,946 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:43:13,946 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-03-09 05:43:13,947 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-09 05:43:13,947 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:43:13,947 INFO  L85        PathProgramCache]: Analyzing trace with hash 887687438, now seen corresponding path program 1 times
[2024-03-09 05:43:13,948 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:43:13,948 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652766657]
[2024-03-09 05:43:13,948 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:43:13,948 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:43:13,967 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:43:14,010 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:43:14,011 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:43:14,011 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652766657]
[2024-03-09 05:43:14,011 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652766657] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:43:14,011 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:43:14,012 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-09 05:43:14,012 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409903263]
[2024-03-09 05:43:14,012 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:43:14,013 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 05:43:14,013 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:43:14,014 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 05:43:14,014 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 05:43:14,035 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 166 out of 183
[2024-03-09 05:43:14,036 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 176 transitions, 363 flow. Second operand  has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 0 states 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:43:14,036 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:43:14,036 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 183
[2024-03-09 05:43:14,036 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:43:14,107 INFO  L124   PetriNetUnfolderBase]: 46/496 cut-off events.
[2024-03-09 05:43:14,107 INFO  L125   PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES.
[2024-03-09 05:43:14,109 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 559 conditions, 496 events. 46/496 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2032 event pairs, 7 based on Foata normal form. 0/429 useless extension candidates. Maximal degree in co-relation 520. Up to 36 conditions per place. 
[2024-03-09 05:43:14,110 INFO  L140   encePairwiseOnDemand]: 172/183 looper letters, 13 selfloop transitions, 8 changer transitions 0/184 dead transitions.
[2024-03-09 05:43:14,111 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 184 transitions, 421 flow
[2024-03-09 05:43:14,111 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 05:43:14,111 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 05:43:14,112 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 522 transitions.
[2024-03-09 05:43:14,113 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9508196721311475
[2024-03-09 05:43:14,113 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 522 transitions.
[2024-03-09 05:43:14,113 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 522 transitions.
[2024-03-09 05:43:14,114 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:43:14,114 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 522 transitions.
[2024-03-09 05:43:14,115 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 174.0) internal successors, (522), 3 states have internal predecessors, (522), 0 states have call successors, (0), 0 states 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:43:14,117 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states 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:43:14,117 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states 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:43:14,117 INFO  L175             Difference]: Start difference. First operand has 176 places, 176 transitions, 363 flow. Second operand 3 states and 522 transitions.
[2024-03-09 05:43:14,117 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 184 transitions, 421 flow
[2024-03-09 05:43:14,119 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 184 transitions, 417 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-09 05:43:14,121 INFO  L231             Difference]: Finished difference. Result has 176 places, 184 transitions, 429 flow
[2024-03-09 05:43:14,121 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=359, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=429, PETRI_PLACES=176, PETRI_TRANSITIONS=184}
[2024-03-09 05:43:14,122 INFO  L281   CegarLoopForPetriNet]: 175 programPoint places, 1 predicate places.
[2024-03-09 05:43:14,122 INFO  L495      AbstractCegarLoop]: Abstraction has has 176 places, 184 transitions, 429 flow
[2024-03-09 05:43:14,123 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 0 states 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:43:14,123 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:43:14,123 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:43:14,123 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-03-09 05:43:14,124 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-09 05:43:14,124 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:43:14,124 INFO  L85        PathProgramCache]: Analyzing trace with hash -1589763451, now seen corresponding path program 1 times
[2024-03-09 05:43:14,124 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:43:14,125 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437274525]
[2024-03-09 05:43:14,125 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:43:14,125 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:43:14,148 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:43:14,246 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:43:14,246 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:43:14,246 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437274525]
[2024-03-09 05:43:14,247 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437274525] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:43:14,247 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:43:14,247 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 05:43:14,248 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490494252]
[2024-03-09 05:43:14,248 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:43:14,248 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-03-09 05:43:14,249 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:43:14,249 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-03-09 05:43:14,249 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-03-09 05:43:14,327 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 166 out of 183
[2024-03-09 05:43:14,328 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 184 transitions, 429 flow. Second operand  has 5 states, 5 states have (on average 167.4) internal successors, (837), 5 states have internal predecessors, (837), 0 states have call successors, (0), 0 states 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:43:14,328 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:43:14,328 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 183
[2024-03-09 05:43:14,329 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:43:14,392 INFO  L124   PetriNetUnfolderBase]: 46/507 cut-off events.
[2024-03-09 05:43:14,392 INFO  L125   PetriNetUnfolderBase]: For 18/25 co-relation queries the response was YES.
[2024-03-09 05:43:14,393 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 608 conditions, 507 events. 46/507 cut-off events. For 18/25 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1984 event pairs, 6 based on Foata normal form. 2/448 useless extension candidates. Maximal degree in co-relation 434. Up to 36 conditions per place. 
[2024-03-09 05:43:14,395 INFO  L140   encePairwiseOnDemand]: 175/183 looper letters, 11 selfloop transitions, 6 changer transitions 1/189 dead transitions.
[2024-03-09 05:43:14,395 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 189 transitions, 475 flow
[2024-03-09 05:43:14,396 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 05:43:14,396 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 05:43:14,397 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1015 transitions.
[2024-03-09 05:43:14,406 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.924408014571949
[2024-03-09 05:43:14,406 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 1015 transitions.
[2024-03-09 05:43:14,406 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 1015 transitions.
[2024-03-09 05:43:14,407 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:43:14,407 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1015 transitions.
[2024-03-09 05:43:14,409 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 169.16666666666666) internal successors, (1015), 6 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states 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:43:14,411 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 183.0) internal successors, (1281), 7 states have internal predecessors, (1281), 0 states have call successors, (0), 0 states 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:43:14,412 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 183.0) internal successors, (1281), 7 states have internal predecessors, (1281), 0 states have call successors, (0), 0 states 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:43:14,412 INFO  L175             Difference]: Start difference. First operand has 176 places, 184 transitions, 429 flow. Second operand 6 states and 1015 transitions.
[2024-03-09 05:43:14,412 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 189 transitions, 475 flow
[2024-03-09 05:43:14,414 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 189 transitions, 459 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-09 05:43:14,416 INFO  L231             Difference]: Finished difference. Result has 183 places, 188 transitions, 455 flow
[2024-03-09 05:43:14,416 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=413, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=455, PETRI_PLACES=183, PETRI_TRANSITIONS=188}
[2024-03-09 05:43:14,417 INFO  L281   CegarLoopForPetriNet]: 175 programPoint places, 8 predicate places.
[2024-03-09 05:43:14,417 INFO  L495      AbstractCegarLoop]: Abstraction has has 183 places, 188 transitions, 455 flow
[2024-03-09 05:43:14,417 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 167.4) internal successors, (837), 5 states have internal predecessors, (837), 0 states have call successors, (0), 0 states 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:43:14,417 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:43:14,418 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]
[2024-03-09 05:43:14,418 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-03-09 05:43:14,418 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-09 05:43:14,419 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:43:14,419 INFO  L85        PathProgramCache]: Analyzing trace with hash 2010357965, now seen corresponding path program 1 times
[2024-03-09 05:43:14,419 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:43:14,419 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469338452]
[2024-03-09 05:43:14,419 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:43:14,419 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:43:14,438 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:43:14,754 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:43:14,754 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:43:14,754 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469338452]
[2024-03-09 05:43:14,754 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469338452] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:43:14,755 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:43:14,755 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 05:43:14,755 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68076498]
[2024-03-09 05:43:14,755 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:43:14,756 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 05:43:14,756 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:43:14,756 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 05:43:14,757 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 05:43:14,967 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 151 out of 183
[2024-03-09 05:43:14,968 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 188 transitions, 455 flow. Second operand  has 6 states, 6 states have (on average 152.16666666666666) internal successors, (913), 6 states have internal predecessors, (913), 0 states have call successors, (0), 0 states 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:43:14,968 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:43:14,968 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 183
[2024-03-09 05:43:14,968 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:43:15,126 INFO  L124   PetriNetUnfolderBase]: 212/1375 cut-off events.
[2024-03-09 05:43:15,127 INFO  L125   PetriNetUnfolderBase]: For 15/17 co-relation queries the response was YES.
[2024-03-09 05:43:15,129 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1843 conditions, 1375 events. 212/1375 cut-off events. For 15/17 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 9427 event pairs, 16 based on Foata normal form. 1/1210 useless extension candidates. Maximal degree in co-relation 1700. Up to 195 conditions per place. 
[2024-03-09 05:43:15,132 INFO  L140   encePairwiseOnDemand]: 160/183 looper letters, 38 selfloop transitions, 29 changer transitions 0/227 dead transitions.
[2024-03-09 05:43:15,133 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 227 transitions, 670 flow
[2024-03-09 05:43:15,133 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 05:43:15,133 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 05:43:15,135 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 976 transitions.
[2024-03-09 05:43:15,135 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8888888888888888
[2024-03-09 05:43:15,135 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 976 transitions.
[2024-03-09 05:43:15,136 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 976 transitions.
[2024-03-09 05:43:15,136 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:43:15,136 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 976 transitions.
[2024-03-09 05:43:15,138 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 162.66666666666666) internal successors, (976), 6 states have internal predecessors, (976), 0 states have call successors, (0), 0 states 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:43:15,140 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 183.0) internal successors, (1281), 7 states have internal predecessors, (1281), 0 states have call successors, (0), 0 states 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:43:15,141 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 183.0) internal successors, (1281), 7 states have internal predecessors, (1281), 0 states have call successors, (0), 0 states 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:43:15,141 INFO  L175             Difference]: Start difference. First operand has 183 places, 188 transitions, 455 flow. Second operand 6 states and 976 transitions.
[2024-03-09 05:43:15,141 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 227 transitions, 670 flow
[2024-03-09 05:43:15,143 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 227 transitions, 668 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-09 05:43:15,145 INFO  L231             Difference]: Finished difference. Result has 192 places, 217 transitions, 673 flow
[2024-03-09 05:43:15,146 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=453, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=673, PETRI_PLACES=192, PETRI_TRANSITIONS=217}
[2024-03-09 05:43:15,146 INFO  L281   CegarLoopForPetriNet]: 175 programPoint places, 17 predicate places.
[2024-03-09 05:43:15,147 INFO  L495      AbstractCegarLoop]: Abstraction has has 192 places, 217 transitions, 673 flow
[2024-03-09 05:43:15,147 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 152.16666666666666) internal successors, (913), 6 states have internal predecessors, (913), 0 states have call successors, (0), 0 states 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:43:15,148 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:43:15,148 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]
[2024-03-09 05:43:15,148 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-03-09 05:43:15,148 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-09 05:43:15,149 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:43:15,149 INFO  L85        PathProgramCache]: Analyzing trace with hash 818998992, now seen corresponding path program 1 times
[2024-03-09 05:43:15,149 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:43:15,149 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559823379]
[2024-03-09 05:43:15,150 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:43:15,150 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:43:15,162 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:43:15,178 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:43:15,178 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:43:15,179 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559823379]
[2024-03-09 05:43:15,179 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559823379] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:43:15,179 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:43:15,179 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-09 05:43:15,179 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616739592]
[2024-03-09 05:43:15,180 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:43:15,180 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 05:43:15,180 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:43:15,181 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 05:43:15,181 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 05:43:15,190 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 170 out of 183
[2024-03-09 05:43:15,191 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 217 transitions, 673 flow. Second operand  has 3 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 0 states have call successors, (0), 0 states 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:43:15,191 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:43:15,191 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 183
[2024-03-09 05:43:15,191 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:43:15,295 INFO  L124   PetriNetUnfolderBase]: 178/1313 cut-off events.
[2024-03-09 05:43:15,296 INFO  L125   PetriNetUnfolderBase]: For 82/82 co-relation queries the response was YES.
[2024-03-09 05:43:15,299 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1911 conditions, 1313 events. 178/1313 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 9089 event pairs, 12 based on Foata normal form. 0/1171 useless extension candidates. Maximal degree in co-relation 1657. Up to 106 conditions per place. 
[2024-03-09 05:43:15,302 INFO  L140   encePairwiseOnDemand]: 179/183 looper letters, 7 selfloop transitions, 2 changer transitions 4/217 dead transitions.
[2024-03-09 05:43:15,302 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 217 transitions, 691 flow
[2024-03-09 05:43:15,302 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 05:43:15,302 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 05:43:15,303 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 521 transitions.
[2024-03-09 05:43:15,303 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9489981785063752
[2024-03-09 05:43:15,304 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 521 transitions.
[2024-03-09 05:43:15,304 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 521 transitions.
[2024-03-09 05:43:15,304 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:43:15,304 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 521 transitions.
[2024-03-09 05:43:15,305 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 0 states have call successors, (0), 0 states 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:43:15,307 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states 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:43:15,307 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states 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:43:15,307 INFO  L175             Difference]: Start difference. First operand has 192 places, 217 transitions, 673 flow. Second operand 3 states and 521 transitions.
[2024-03-09 05:43:15,307 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 217 transitions, 691 flow
[2024-03-09 05:43:15,310 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 217 transitions, 691 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-09 05:43:15,312 INFO  L231             Difference]: Finished difference. Result has 193 places, 213 transitions, 659 flow
[2024-03-09 05:43:15,312 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=669, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=659, PETRI_PLACES=193, PETRI_TRANSITIONS=213}
[2024-03-09 05:43:15,313 INFO  L281   CegarLoopForPetriNet]: 175 programPoint places, 18 predicate places.
[2024-03-09 05:43:15,313 INFO  L495      AbstractCegarLoop]: Abstraction has has 193 places, 213 transitions, 659 flow
[2024-03-09 05:43:15,314 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 0 states have call successors, (0), 0 states 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:43:15,314 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:43:15,314 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:43:15,314 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-03-09 05:43:15,314 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-09 05:43:15,315 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:43:15,315 INFO  L85        PathProgramCache]: Analyzing trace with hash -1087706299, now seen corresponding path program 1 times
[2024-03-09 05:43:15,315 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:43:15,315 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723269946]
[2024-03-09 05:43:15,315 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:43:15,316 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:43:15,325 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:43:15,371 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:43:15,371 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:43:15,371 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723269946]
[2024-03-09 05:43:15,371 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723269946] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:43:15,372 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:43:15,372 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-03-09 05:43:15,372 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020577947]
[2024-03-09 05:43:15,372 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:43:15,372 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-03-09 05:43:15,373 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:43:15,373 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-03-09 05:43:15,373 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-03-09 05:43:15,414 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 168 out of 183
[2024-03-09 05:43:15,415 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 213 transitions, 659 flow. Second operand  has 4 states, 4 states have (on average 169.25) internal successors, (677), 4 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:43:15,415 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:43:15,415 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 183
[2024-03-09 05:43:15,415 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:43:15,526 INFO  L124   PetriNetUnfolderBase]: 166/1210 cut-off events.
[2024-03-09 05:43:15,527 INFO  L125   PetriNetUnfolderBase]: For 91/91 co-relation queries the response was YES.
[2024-03-09 05:43:15,529 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1832 conditions, 1210 events. 166/1210 cut-off events. For 91/91 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 8101 event pairs, 16 based on Foata normal form. 1/1086 useless extension candidates. Maximal degree in co-relation 1684. Up to 94 conditions per place. 
[2024-03-09 05:43:15,532 INFO  L140   encePairwiseOnDemand]: 179/183 looper letters, 12 selfloop transitions, 4 changer transitions 0/218 dead transitions.
[2024-03-09 05:43:15,532 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 218 transitions, 701 flow
[2024-03-09 05:43:15,533 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-03-09 05:43:15,533 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-03-09 05:43:15,534 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 689 transitions.
[2024-03-09 05:43:15,534 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9412568306010929
[2024-03-09 05:43:15,534 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 689 transitions.
[2024-03-09 05:43:15,534 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 689 transitions.
[2024-03-09 05:43:15,535 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:43:15,535 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 689 transitions.
[2024-03-09 05:43:15,536 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 172.25) internal successors, (689), 4 states have internal predecessors, (689), 0 states have call successors, (0), 0 states 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:43:15,538 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 183.0) internal successors, (915), 5 states have internal predecessors, (915), 0 states have call successors, (0), 0 states 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:43:15,538 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 183.0) internal successors, (915), 5 states have internal predecessors, (915), 0 states have call successors, (0), 0 states 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:43:15,538 INFO  L175             Difference]: Start difference. First operand has 193 places, 213 transitions, 659 flow. Second operand 4 states and 689 transitions.
[2024-03-09 05:43:15,538 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 218 transitions, 701 flow
[2024-03-09 05:43:15,541 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 218 transitions, 689 flow, removed 5 selfloop flow, removed 4 redundant places.
[2024-03-09 05:43:15,543 INFO  L231             Difference]: Finished difference. Result has 191 places, 216 transitions, 672 flow
[2024-03-09 05:43:15,543 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=647, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=672, PETRI_PLACES=191, PETRI_TRANSITIONS=216}
[2024-03-09 05:43:15,544 INFO  L281   CegarLoopForPetriNet]: 175 programPoint places, 16 predicate places.
[2024-03-09 05:43:15,544 INFO  L495      AbstractCegarLoop]: Abstraction has has 191 places, 216 transitions, 672 flow
[2024-03-09 05:43:15,544 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 169.25) internal successors, (677), 4 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:43:15,545 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:43:15,545 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:43:15,545 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-03-09 05:43:15,545 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-09 05:43:15,545 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:43:15,546 INFO  L85        PathProgramCache]: Analyzing trace with hash -213965619, now seen corresponding path program 1 times
[2024-03-09 05:43:15,546 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:43:15,546 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006233891]
[2024-03-09 05:43:15,546 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:43:15,546 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:43:15,554 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:43:15,597 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:43:15,597 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:43:15,597 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006233891]
[2024-03-09 05:43:15,598 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006233891] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:43:15,598 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:43:15,598 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-03-09 05:43:15,598 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118225421]
[2024-03-09 05:43:15,598 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:43:15,599 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-03-09 05:43:15,599 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:43:15,600 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-03-09 05:43:15,600 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-03-09 05:43:15,651 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 168 out of 183
[2024-03-09 05:43:15,652 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 216 transitions, 672 flow. Second operand  has 4 states, 4 states have (on average 169.25) internal successors, (677), 4 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:43:15,652 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:43:15,652 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 183
[2024-03-09 05:43:15,653 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:43:15,763 INFO  L124   PetriNetUnfolderBase]: 165/1208 cut-off events.
[2024-03-09 05:43:15,763 INFO  L125   PetriNetUnfolderBase]: For 102/102 co-relation queries the response was YES.
[2024-03-09 05:43:15,765 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1834 conditions, 1208 events. 165/1208 cut-off events. For 102/102 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 8116 event pairs, 16 based on Foata normal form. 1/1081 useless extension candidates. Maximal degree in co-relation 1684. Up to 94 conditions per place. 
[2024-03-09 05:43:15,767 INFO  L140   encePairwiseOnDemand]: 179/183 looper letters, 11 selfloop transitions, 4 changer transitions 0/217 dead transitions.
[2024-03-09 05:43:15,767 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 217 transitions, 704 flow
[2024-03-09 05:43:15,768 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-03-09 05:43:15,768 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-03-09 05:43:15,769 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 688 transitions.
[2024-03-09 05:43:15,770 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9398907103825137
[2024-03-09 05:43:15,770 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 688 transitions.
[2024-03-09 05:43:15,770 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 688 transitions.
[2024-03-09 05:43:15,771 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:43:15,771 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 688 transitions.
[2024-03-09 05:43:15,772 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:43:15,773 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 183.0) internal successors, (915), 5 states have internal predecessors, (915), 0 states have call successors, (0), 0 states 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:43:15,774 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 183.0) internal successors, (915), 5 states have internal predecessors, (915), 0 states have call successors, (0), 0 states 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:43:15,774 INFO  L175             Difference]: Start difference. First operand has 191 places, 216 transitions, 672 flow. Second operand 4 states and 688 transitions.
[2024-03-09 05:43:15,774 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 217 transitions, 704 flow
[2024-03-09 05:43:15,776 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 217 transitions, 704 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-09 05:43:15,778 INFO  L231             Difference]: Finished difference. Result has 196 places, 217 transitions, 691 flow
[2024-03-09 05:43:15,779 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=672, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=691, PETRI_PLACES=196, PETRI_TRANSITIONS=217}
[2024-03-09 05:43:15,779 INFO  L281   CegarLoopForPetriNet]: 175 programPoint places, 21 predicate places.
[2024-03-09 05:43:15,779 INFO  L495      AbstractCegarLoop]: Abstraction has has 196 places, 217 transitions, 691 flow
[2024-03-09 05:43:15,780 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 169.25) internal successors, (677), 4 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:43:15,780 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:43:15,780 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]
[2024-03-09 05:43:15,780 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-03-09 05:43:15,780 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-09 05:43:15,781 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:43:15,781 INFO  L85        PathProgramCache]: Analyzing trace with hash 1729463404, now seen corresponding path program 1 times
[2024-03-09 05:43:15,781 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:43:15,781 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125346632]
[2024-03-09 05:43:15,782 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:43:15,782 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:43:15,790 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:43:15,833 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:43:15,834 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:43:15,834 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125346632]
[2024-03-09 05:43:15,834 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125346632] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:43:15,834 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:43:15,834 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-03-09 05:43:15,835 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101056927]
[2024-03-09 05:43:15,835 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:43:15,835 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-03-09 05:43:15,835 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:43:15,836 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-03-09 05:43:15,836 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-03-09 05:43:15,881 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 168 out of 183
[2024-03-09 05:43:15,882 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 217 transitions, 691 flow. Second operand  has 4 states, 4 states have (on average 169.25) internal successors, (677), 4 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:43:15,882 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:43:15,882 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 183
[2024-03-09 05:43:15,882 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:43:15,991 INFO  L124   PetriNetUnfolderBase]: 164/1206 cut-off events.
[2024-03-09 05:43:15,991 INFO  L125   PetriNetUnfolderBase]: For 124/124 co-relation queries the response was YES.
[2024-03-09 05:43:15,994 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1851 conditions, 1206 events. 164/1206 cut-off events. For 124/124 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 8113 event pairs, 16 based on Foata normal form. 1/1085 useless extension candidates. Maximal degree in co-relation 1748. Up to 94 conditions per place. 
[2024-03-09 05:43:15,996 INFO  L140   encePairwiseOnDemand]: 179/183 looper letters, 12 selfloop transitions, 4 changer transitions 0/218 dead transitions.
[2024-03-09 05:43:15,997 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 218 transitions, 725 flow
[2024-03-09 05:43:15,997 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-03-09 05:43:15,997 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-03-09 05:43:15,999 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 689 transitions.
[2024-03-09 05:43:15,999 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9412568306010929
[2024-03-09 05:43:15,999 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 689 transitions.
[2024-03-09 05:43:15,999 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 689 transitions.
[2024-03-09 05:43:16,000 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:43:16,000 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 689 transitions.
[2024-03-09 05:43:16,002 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 172.25) internal successors, (689), 4 states have internal predecessors, (689), 0 states have call successors, (0), 0 states 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:43:16,003 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 183.0) internal successors, (915), 5 states have internal predecessors, (915), 0 states have call successors, (0), 0 states 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:43:16,003 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 183.0) internal successors, (915), 5 states have internal predecessors, (915), 0 states have call successors, (0), 0 states 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:43:16,003 INFO  L175             Difference]: Start difference. First operand has 196 places, 217 transitions, 691 flow. Second operand 4 states and 689 transitions.
[2024-03-09 05:43:16,004 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 218 transitions, 725 flow
[2024-03-09 05:43:16,007 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 218 transitions, 722 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-09 05:43:16,009 INFO  L231             Difference]: Finished difference. Result has 199 places, 217 transitions, 700 flow
[2024-03-09 05:43:16,009 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=688, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=700, PETRI_PLACES=199, PETRI_TRANSITIONS=217}
[2024-03-09 05:43:16,010 INFO  L281   CegarLoopForPetriNet]: 175 programPoint places, 24 predicate places.
[2024-03-09 05:43:16,010 INFO  L495      AbstractCegarLoop]: Abstraction has has 199 places, 217 transitions, 700 flow
[2024-03-09 05:43:16,011 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 169.25) internal successors, (677), 4 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:43:16,011 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:43:16,011 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]
[2024-03-09 05:43:16,011 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-03-09 05:43:16,011 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-09 05:43:16,012 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:43:16,012 INFO  L85        PathProgramCache]: Analyzing trace with hash -1249346588, now seen corresponding path program 1 times
[2024-03-09 05:43:16,012 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:43:16,012 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334523180]
[2024-03-09 05:43:16,012 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:43:16,013 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:43:16,022 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:43:16,061 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:43:16,061 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:43:16,061 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334523180]
[2024-03-09 05:43:16,061 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334523180] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:43:16,061 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:43:16,062 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-03-09 05:43:16,062 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260715730]
[2024-03-09 05:43:16,062 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:43:16,062 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-03-09 05:43:16,063 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:43:16,063 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-03-09 05:43:16,063 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-03-09 05:43:16,102 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 167 out of 183
[2024-03-09 05:43:16,103 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 217 transitions, 700 flow. Second operand  has 4 states, 4 states have (on average 168.25) internal successors, (673), 4 states have internal predecessors, (673), 0 states have call successors, (0), 0 states 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:43:16,103 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:43:16,103 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 183
[2024-03-09 05:43:16,103 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:43:16,217 INFO  L124   PetriNetUnfolderBase]: 164/1205 cut-off events.
[2024-03-09 05:43:16,217 INFO  L125   PetriNetUnfolderBase]: For 142/142 co-relation queries the response was YES.
[2024-03-09 05:43:16,220 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1862 conditions, 1205 events. 164/1205 cut-off events. For 142/142 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 8087 event pairs, 17 based on Foata normal form. 1/1083 useless extension candidates. Maximal degree in co-relation 1754. Up to 94 conditions per place. 
[2024-03-09 05:43:16,223 INFO  L140   encePairwiseOnDemand]: 179/183 looper letters, 12 selfloop transitions, 4 changer transitions 0/217 dead transitions.
[2024-03-09 05:43:16,223 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 217 transitions, 732 flow
[2024-03-09 05:43:16,223 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-03-09 05:43:16,223 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-03-09 05:43:16,224 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 685 transitions.
[2024-03-09 05:43:16,225 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9357923497267759
[2024-03-09 05:43:16,225 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 685 transitions.
[2024-03-09 05:43:16,225 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 685 transitions.
[2024-03-09 05:43:16,225 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:43:16,225 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 685 transitions.
[2024-03-09 05:43:16,235 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 171.25) internal successors, (685), 4 states have internal predecessors, (685), 0 states have call successors, (0), 0 states 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:43:16,236 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 183.0) internal successors, (915), 5 states have internal predecessors, (915), 0 states have call successors, (0), 0 states 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:43:16,237 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 183.0) internal successors, (915), 5 states have internal predecessors, (915), 0 states have call successors, (0), 0 states 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:43:16,237 INFO  L175             Difference]: Start difference. First operand has 199 places, 217 transitions, 700 flow. Second operand 4 states and 685 transitions.
[2024-03-09 05:43:16,237 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 217 transitions, 732 flow
[2024-03-09 05:43:16,240 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 217 transitions, 724 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-03-09 05:43:16,242 INFO  L231             Difference]: Finished difference. Result has 200 places, 217 transitions, 704 flow
[2024-03-09 05:43:16,242 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=692, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=704, PETRI_PLACES=200, PETRI_TRANSITIONS=217}
[2024-03-09 05:43:16,243 INFO  L281   CegarLoopForPetriNet]: 175 programPoint places, 25 predicate places.
[2024-03-09 05:43:16,243 INFO  L495      AbstractCegarLoop]: Abstraction has has 200 places, 217 transitions, 704 flow
[2024-03-09 05:43:16,243 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 168.25) internal successors, (673), 4 states have internal predecessors, (673), 0 states have call successors, (0), 0 states 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:43:16,243 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:43:16,243 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]
[2024-03-09 05:43:16,243 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-03-09 05:43:16,244 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-09 05:43:16,244 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:43:16,244 INFO  L85        PathProgramCache]: Analyzing trace with hash -350592489, now seen corresponding path program 1 times
[2024-03-09 05:43:16,244 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:43:16,244 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950261120]
[2024-03-09 05:43:16,245 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:43:16,245 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:43:16,253 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:43:16,269 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:43:16,269 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:43:16,269 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950261120]
[2024-03-09 05:43:16,269 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950261120] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:43:16,270 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:43:16,270 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-09 05:43:16,270 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440838206]
[2024-03-09 05:43:16,270 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:43:16,270 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 05:43:16,271 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:43:16,271 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 05:43:16,271 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 05:43:16,291 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 166 out of 183
[2024-03-09 05:43:16,292 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 217 transitions, 704 flow. Second operand  has 3 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 0 states have call successors, (0), 0 states 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:43:16,292 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:43:16,292 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 183
[2024-03-09 05:43:16,292 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:43:16,398 INFO  L124   PetriNetUnfolderBase]: 177/1243 cut-off events.
[2024-03-09 05:43:16,398 INFO  L125   PetriNetUnfolderBase]: For 169/179 co-relation queries the response was YES.
[2024-03-09 05:43:16,401 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1932 conditions, 1243 events. 177/1243 cut-off events. For 169/179 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 8603 event pairs, 14 based on Foata normal form. 0/1114 useless extension candidates. Maximal degree in co-relation 1884. Up to 94 conditions per place. 
[2024-03-09 05:43:16,404 INFO  L140   encePairwiseOnDemand]: 177/183 looper letters, 16 selfloop transitions, 7 changer transitions 0/222 dead transitions.
[2024-03-09 05:43:16,405 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 222 transitions, 766 flow
[2024-03-09 05:43:16,405 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 05:43:16,405 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 05:43:16,406 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 516 transitions.
[2024-03-09 05:43:16,406 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9398907103825137
[2024-03-09 05:43:16,406 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 516 transitions.
[2024-03-09 05:43:16,407 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 516 transitions.
[2024-03-09 05:43:16,407 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:43:16,407 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 516 transitions.
[2024-03-09 05:43:16,408 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 172.0) internal successors, (516), 3 states have internal predecessors, (516), 0 states have call successors, (0), 0 states 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:43:16,409 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states 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:43:16,409 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states 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:43:16,410 INFO  L175             Difference]: Start difference. First operand has 200 places, 217 transitions, 704 flow. Second operand 3 states and 516 transitions.
[2024-03-09 05:43:16,410 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 222 transitions, 766 flow
[2024-03-09 05:43:16,413 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 222 transitions, 758 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-03-09 05:43:16,415 INFO  L231             Difference]: Finished difference. Result has 201 places, 222 transitions, 752 flow
[2024-03-09 05:43:16,415 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=696, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=752, PETRI_PLACES=201, PETRI_TRANSITIONS=222}
[2024-03-09 05:43:16,416 INFO  L281   CegarLoopForPetriNet]: 175 programPoint places, 26 predicate places.
[2024-03-09 05:43:16,416 INFO  L495      AbstractCegarLoop]: Abstraction has has 201 places, 222 transitions, 752 flow
[2024-03-09 05:43:16,417 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 0 states have call successors, (0), 0 states 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:43:16,417 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:43:16,417 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 05:43:16,417 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-03-09 05:43:16,417 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-09 05:43:16,417 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:43:16,418 INFO  L85        PathProgramCache]: Analyzing trace with hash 1033142490, now seen corresponding path program 1 times
[2024-03-09 05:43:16,418 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:43:16,418 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239667917]
[2024-03-09 05:43:16,418 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:43:16,418 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:43:16,438 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:43:16,684 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:43:16,685 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:43:16,685 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239667917]
[2024-03-09 05:43:16,685 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239667917] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:43:16,685 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:43:16,685 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 05:43:16,686 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539286983]
[2024-03-09 05:43:16,686 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:43:16,686 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 05:43:16,686 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:43:16,687 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 05:43:16,687 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 05:43:16,794 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 150 out of 183
[2024-03-09 05:43:16,795 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 222 transitions, 752 flow. Second operand  has 6 states, 6 states have (on average 152.33333333333334) internal successors, (914), 6 states have internal predecessors, (914), 0 states have call successors, (0), 0 states 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:43:16,795 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:43:16,795 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 183
[2024-03-09 05:43:16,795 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:43:17,088 INFO  L124   PetriNetUnfolderBase]: 452/2089 cut-off events.
[2024-03-09 05:43:17,089 INFO  L125   PetriNetUnfolderBase]: For 543/623 co-relation queries the response was YES.
[2024-03-09 05:43:17,092 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3943 conditions, 2089 events. 452/2089 cut-off events. For 543/623 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 16237 event pairs, 68 based on Foata normal form. 11/1907 useless extension candidates. Maximal degree in co-relation 3896. Up to 605 conditions per place. 
[2024-03-09 05:43:17,096 INFO  L140   encePairwiseOnDemand]: 160/183 looper letters, 52 selfloop transitions, 83 changer transitions 0/303 dead transitions.
[2024-03-09 05:43:17,096 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 303 transitions, 1358 flow
[2024-03-09 05:43:17,097 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 05:43:17,097 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 05:43:17,098 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 999 transitions.
[2024-03-09 05:43:17,099 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9098360655737705
[2024-03-09 05:43:17,099 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 999 transitions.
[2024-03-09 05:43:17,099 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 999 transitions.
[2024-03-09 05:43:17,100 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:43:17,100 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 999 transitions.
[2024-03-09 05:43:17,101 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 166.5) internal successors, (999), 6 states have internal predecessors, (999), 0 states have call successors, (0), 0 states 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:43:17,103 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 183.0) internal successors, (1281), 7 states have internal predecessors, (1281), 0 states have call successors, (0), 0 states 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:43:17,103 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 183.0) internal successors, (1281), 7 states have internal predecessors, (1281), 0 states have call successors, (0), 0 states 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:43:17,104 INFO  L175             Difference]: Start difference. First operand has 201 places, 222 transitions, 752 flow. Second operand 6 states and 999 transitions.
[2024-03-09 05:43:17,104 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 303 transitions, 1358 flow
[2024-03-09 05:43:17,110 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 303 transitions, 1344 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-09 05:43:17,113 INFO  L231             Difference]: Finished difference. Result has 209 places, 303 transitions, 1474 flow
[2024-03-09 05:43:17,113 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=738, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1474, PETRI_PLACES=209, PETRI_TRANSITIONS=303}
[2024-03-09 05:43:17,113 INFO  L281   CegarLoopForPetriNet]: 175 programPoint places, 34 predicate places.
[2024-03-09 05:43:17,114 INFO  L495      AbstractCegarLoop]: Abstraction has has 209 places, 303 transitions, 1474 flow
[2024-03-09 05:43:17,114 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 152.33333333333334) internal successors, (914), 6 states have internal predecessors, (914), 0 states have call successors, (0), 0 states 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:43:17,114 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:43:17,114 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 05:43:17,114 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-03-09 05:43:17,115 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-09 05:43:17,115 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:43:17,115 INFO  L85        PathProgramCache]: Analyzing trace with hash -1424845874, now seen corresponding path program 1 times
[2024-03-09 05:43:17,115 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:43:17,115 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486376360]
[2024-03-09 05:43:17,115 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:43:17,116 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:43:17,133 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:43:17,400 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:43:17,400 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:43:17,401 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486376360]
[2024-03-09 05:43:17,401 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486376360] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:43:17,401 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:43:17,401 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 05:43:17,401 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215540868]
[2024-03-09 05:43:17,401 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:43:17,402 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 05:43:17,402 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:43:17,403 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 05:43:17,403 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 05:43:17,609 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 160 out of 183
[2024-03-09 05:43:17,610 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 303 transitions, 1474 flow. Second operand  has 6 states, 6 states have (on average 161.5) internal successors, (969), 6 states have internal predecessors, (969), 0 states have call successors, (0), 0 states 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:43:17,610 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:43:17,610 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 183
[2024-03-09 05:43:17,610 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:43:17,824 INFO  L124   PetriNetUnfolderBase]: 458/2068 cut-off events.
[2024-03-09 05:43:17,825 INFO  L125   PetriNetUnfolderBase]: For 1278/1323 co-relation queries the response was YES.
[2024-03-09 05:43:17,829 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4614 conditions, 2068 events. 458/2068 cut-off events. For 1278/1323 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 15938 event pairs, 41 based on Foata normal form. 8/1936 useless extension candidates. Maximal degree in co-relation 4563. Up to 338 conditions per place. 
[2024-03-09 05:43:17,835 INFO  L140   encePairwiseOnDemand]: 172/183 looper letters, 46 selfloop transitions, 43 changer transitions 8/343 dead transitions.
[2024-03-09 05:43:17,835 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 343 transitions, 1933 flow
[2024-03-09 05:43:17,835 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 05:43:17,836 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 05:43:17,837 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1002 transitions.
[2024-03-09 05:43:17,837 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.912568306010929
[2024-03-09 05:43:17,837 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 1002 transitions.
[2024-03-09 05:43:17,838 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 1002 transitions.
[2024-03-09 05:43:17,838 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:43:17,838 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1002 transitions.
[2024-03-09 05:43:17,840 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 167.0) internal successors, (1002), 6 states have internal predecessors, (1002), 0 states have call successors, (0), 0 states 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:43:17,842 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 183.0) internal successors, (1281), 7 states have internal predecessors, (1281), 0 states have call successors, (0), 0 states 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:43:17,842 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 183.0) internal successors, (1281), 7 states have internal predecessors, (1281), 0 states have call successors, (0), 0 states 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:43:17,842 INFO  L175             Difference]: Start difference. First operand has 209 places, 303 transitions, 1474 flow. Second operand 6 states and 1002 transitions.
[2024-03-09 05:43:17,842 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 343 transitions, 1933 flow
[2024-03-09 05:43:17,850 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 343 transitions, 1879 flow, removed 27 selfloop flow, removed 0 redundant places.
[2024-03-09 05:43:17,854 INFO  L231             Difference]: Finished difference. Result has 219 places, 335 transitions, 1877 flow
[2024-03-09 05:43:17,854 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=1420, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1877, PETRI_PLACES=219, PETRI_TRANSITIONS=335}
[2024-03-09 05:43:17,855 INFO  L281   CegarLoopForPetriNet]: 175 programPoint places, 44 predicate places.
[2024-03-09 05:43:17,855 INFO  L495      AbstractCegarLoop]: Abstraction has has 219 places, 335 transitions, 1877 flow
[2024-03-09 05:43:17,855 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 161.5) internal successors, (969), 6 states have internal predecessors, (969), 0 states have call successors, (0), 0 states 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:43:17,855 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:43:17,856 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 05:43:17,856 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-03-09 05:43:17,856 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-09 05:43:17,856 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:43:17,856 INFO  L85        PathProgramCache]: Analyzing trace with hash -370415864, now seen corresponding path program 1 times
[2024-03-09 05:43:17,856 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:43:17,857 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823972094]
[2024-03-09 05:43:17,857 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:43:17,857 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:43:17,878 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:43:18,198 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:43:18,198 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:43:18,198 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823972094]
[2024-03-09 05:43:18,199 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823972094] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:43:18,199 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:43:18,199 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-03-09 05:43:18,199 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304276712]
[2024-03-09 05:43:18,199 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:43:18,199 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-03-09 05:43:18,200 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:43:18,200 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-03-09 05:43:18,200 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2024-03-09 05:43:18,665 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 144 out of 183
[2024-03-09 05:43:18,667 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 335 transitions, 1877 flow. Second operand  has 10 states, 10 states have (on average 145.9) internal successors, (1459), 10 states have internal predecessors, (1459), 0 states have call successors, (0), 0 states 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:43:18,667 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:43:18,667 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 183
[2024-03-09 05:43:18,667 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:43:19,338 INFO  L124   PetriNetUnfolderBase]: 497/2129 cut-off events.
[2024-03-09 05:43:19,338 INFO  L125   PetriNetUnfolderBase]: For 1896/2108 co-relation queries the response was YES.
[2024-03-09 05:43:19,344 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5477 conditions, 2129 events. 497/2129 cut-off events. For 1896/2108 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 17107 event pairs, 59 based on Foata normal form. 90/2072 useless extension candidates. Maximal degree in co-relation 5421. Up to 348 conditions per place. 
[2024-03-09 05:43:19,351 INFO  L140   encePairwiseOnDemand]: 167/183 looper letters, 207 selfloop transitions, 73 changer transitions 0/437 dead transitions.
[2024-03-09 05:43:19,351 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 437 transitions, 3123 flow
[2024-03-09 05:43:19,351 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-03-09 05:43:19,352 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-03-09 05:43:19,354 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1704 transitions.
[2024-03-09 05:43:19,354 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8464977645305514
[2024-03-09 05:43:19,355 INFO  L72            ComplementDD]: Start complementDD. Operand 11 states and 1704 transitions.
[2024-03-09 05:43:19,355 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 11 states and 1704 transitions.
[2024-03-09 05:43:19,356 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:43:19,356 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1704 transitions.
[2024-03-09 05:43:19,359 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 12 states, 11 states have (on average 154.9090909090909) internal successors, (1704), 11 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states 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:43:19,361 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 12 states, 12 states have (on average 183.0) internal successors, (2196), 12 states have internal predecessors, (2196), 0 states have call successors, (0), 0 states 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:43:19,362 INFO  L81            ComplementDD]: Finished complementDD. Result  has 12 states, 12 states have (on average 183.0) internal successors, (2196), 12 states have internal predecessors, (2196), 0 states have call successors, (0), 0 states 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:43:19,362 INFO  L175             Difference]: Start difference. First operand has 219 places, 335 transitions, 1877 flow. Second operand 11 states and 1704 transitions.
[2024-03-09 05:43:19,362 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 437 transitions, 3123 flow
[2024-03-09 05:43:19,374 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 437 transitions, 3087 flow, removed 18 selfloop flow, removed 0 redundant places.
[2024-03-09 05:43:19,416 INFO  L231             Difference]: Finished difference. Result has 231 places, 359 transitions, 2309 flow
[2024-03-09 05:43:19,417 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=1841, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=335, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2309, PETRI_PLACES=231, PETRI_TRANSITIONS=359}
[2024-03-09 05:43:19,418 INFO  L281   CegarLoopForPetriNet]: 175 programPoint places, 56 predicate places.
[2024-03-09 05:43:19,418 INFO  L495      AbstractCegarLoop]: Abstraction has has 231 places, 359 transitions, 2309 flow
[2024-03-09 05:43:19,419 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 145.9) internal successors, (1459), 10 states have internal predecessors, (1459), 0 states have call successors, (0), 0 states 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:43:19,419 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:43:19,420 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 05:43:19,420 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-03-09 05:43:19,420 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-09 05:43:19,420 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:43:19,421 INFO  L85        PathProgramCache]: Analyzing trace with hash -1380633078, now seen corresponding path program 1 times
[2024-03-09 05:43:19,421 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:43:19,421 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093751607]
[2024-03-09 05:43:19,421 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:43:19,421 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:43:19,440 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:43:19,788 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:43:19,788 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:43:19,788 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093751607]
[2024-03-09 05:43:19,788 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093751607] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:43:19,788 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:43:19,788 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-03-09 05:43:19,789 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745751216]
[2024-03-09 05:43:19,789 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:43:19,789 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-03-09 05:43:19,790 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:43:19,790 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-03-09 05:43:19,790 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2024-03-09 05:43:20,132 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 147 out of 183
[2024-03-09 05:43:20,134 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 359 transitions, 2309 flow. Second operand  has 10 states, 10 states have (on average 148.8) internal successors, (1488), 10 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states 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:43:20,134 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:43:20,134 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 183
[2024-03-09 05:43:20,134 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:43:20,463 INFO  L124   PetriNetUnfolderBase]: 438/1960 cut-off events.
[2024-03-09 05:43:20,464 INFO  L125   PetriNetUnfolderBase]: For 3484/3640 co-relation queries the response was YES.
[2024-03-09 05:43:20,468 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5633 conditions, 1960 events. 438/1960 cut-off events. For 3484/3640 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 15627 event pairs, 26 based on Foata normal form. 41/1871 useless extension candidates. Maximal degree in co-relation 5570. Up to 474 conditions per place. 
[2024-03-09 05:43:20,474 INFO  L140   encePairwiseOnDemand]: 171/183 looper letters, 154 selfloop transitions, 18 changer transitions 0/363 dead transitions.
[2024-03-09 05:43:20,474 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 363 transitions, 2703 flow
[2024-03-09 05:43:20,475 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-03-09 05:43:20,475 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-03-09 05:43:20,477 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1509 transitions.
[2024-03-09 05:43:20,477 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8245901639344262
[2024-03-09 05:43:20,478 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 1509 transitions.
[2024-03-09 05:43:20,478 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 1509 transitions.
[2024-03-09 05:43:20,479 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:43:20,479 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1509 transitions.
[2024-03-09 05:43:20,481 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 11 states, 10 states have (on average 150.9) internal successors, (1509), 10 states have internal predecessors, (1509), 0 states have call successors, (0), 0 states 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:43:20,483 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 11 states, 11 states have (on average 183.0) internal successors, (2013), 11 states have internal predecessors, (2013), 0 states have call successors, (0), 0 states 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:43:20,484 INFO  L81            ComplementDD]: Finished complementDD. Result  has 11 states, 11 states have (on average 183.0) internal successors, (2013), 11 states have internal predecessors, (2013), 0 states have call successors, (0), 0 states 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:43:20,484 INFO  L175             Difference]: Start difference. First operand has 231 places, 359 transitions, 2309 flow. Second operand 10 states and 1509 transitions.
[2024-03-09 05:43:20,484 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 363 transitions, 2703 flow
[2024-03-09 05:43:20,501 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 363 transitions, 2697 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-03-09 05:43:20,505 INFO  L231             Difference]: Finished difference. Result has 238 places, 360 transitions, 2375 flow
[2024-03-09 05:43:20,505 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=2291, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=338, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2375, PETRI_PLACES=238, PETRI_TRANSITIONS=360}
[2024-03-09 05:43:20,505 INFO  L281   CegarLoopForPetriNet]: 175 programPoint places, 63 predicate places.
[2024-03-09 05:43:20,506 INFO  L495      AbstractCegarLoop]: Abstraction has has 238 places, 360 transitions, 2375 flow
[2024-03-09 05:43:20,507 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 148.8) internal successors, (1488), 10 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states 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:43:20,507 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:43:20,507 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 05:43:20,507 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-03-09 05:43:20,507 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting threadErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-09 05:43:20,507 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:43:20,508 INFO  L85        PathProgramCache]: Analyzing trace with hash -298044953, now seen corresponding path program 1 times
[2024-03-09 05:43:20,508 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:43:20,508 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888877499]
[2024-03-09 05:43:20,508 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:43:20,508 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:43:20,521 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:43:20,554 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:43:20,555 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:43:20,555 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888877499]
[2024-03-09 05:43:20,555 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888877499] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:43:20,556 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:43:20,556 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-09 05:43:20,556 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347790389]
[2024-03-09 05:43:20,556 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:43:20,557 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 05:43:20,557 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:43:20,558 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 05:43:20,558 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 05:43:20,578 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 168 out of 183
[2024-03-09 05:43:20,579 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 360 transitions, 2375 flow. Second operand  has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:43:20,579 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:43:20,579 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 183
[2024-03-09 05:43:20,579 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:43:20,782 INFO  L124   PetriNetUnfolderBase]: 459/2059 cut-off events.
[2024-03-09 05:43:20,782 INFO  L125   PetriNetUnfolderBase]: For 3213/3284 co-relation queries the response was YES.
[2024-03-09 05:43:20,788 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5513 conditions, 2059 events. 459/2059 cut-off events. For 3213/3284 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 16639 event pairs, 26 based on Foata normal form. 11/1956 useless extension candidates. Maximal degree in co-relation 5433. Up to 275 conditions per place. 
[2024-03-09 05:43:20,791 INFO  L140   encePairwiseOnDemand]: 176/183 looper letters, 14 selfloop transitions, 11 changer transitions 31/367 dead transitions.
[2024-03-09 05:43:20,791 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 367 transitions, 2453 flow
[2024-03-09 05:43:20,791 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 05:43:20,791 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 05:43:20,792 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 520 transitions.
[2024-03-09 05:43:20,792 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9471766848816029
[2024-03-09 05:43:20,793 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 520 transitions.
[2024-03-09 05:43:20,793 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 520 transitions.
[2024-03-09 05:43:20,793 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:43:20,793 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 520 transitions.
[2024-03-09 05:43:20,794 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 0 states have call successors, (0), 0 states 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:43:20,795 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states 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:43:20,795 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states 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:43:20,795 INFO  L175             Difference]: Start difference. First operand has 238 places, 360 transitions, 2375 flow. Second operand 3 states and 520 transitions.
[2024-03-09 05:43:20,796 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 367 transitions, 2453 flow
[2024-03-09 05:43:20,816 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 367 transitions, 2417 flow, removed 4 selfloop flow, removed 5 redundant places.
[2024-03-09 05:43:20,819 INFO  L231             Difference]: Finished difference. Result has 237 places, 336 transitions, 2110 flow
[2024-03-09 05:43:20,820 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=2339, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=360, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=349, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2110, PETRI_PLACES=237, PETRI_TRANSITIONS=336}
[2024-03-09 05:43:20,820 INFO  L281   CegarLoopForPetriNet]: 175 programPoint places, 62 predicate places.
[2024-03-09 05:43:20,820 INFO  L495      AbstractCegarLoop]: Abstraction has has 237 places, 336 transitions, 2110 flow
[2024-03-09 05:43:20,821 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:43:20,821 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:43:20,821 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 05:43:20,821 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-03-09 05:43:20,821 INFO  L420      AbstractCegarLoop]: === Iteration 16 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-09 05:43:20,822 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:43:20,822 INFO  L85        PathProgramCache]: Analyzing trace with hash 1971044348, now seen corresponding path program 1 times
[2024-03-09 05:43:20,822 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:43:20,822 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679975612]
[2024-03-09 05:43:20,822 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:43:20,822 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:43:20,841 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:43:21,387 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:43:21,387 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:43:21,387 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679975612]
[2024-03-09 05:43:21,388 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679975612] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 05:43:21,388 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989076682]
[2024-03-09 05:43:21,388 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:43:21,389 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 05:43:21,389 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 05:43:21,397 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 05:43:21,403 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-03-09 05:43:21,521 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:43:21,523 INFO  L262         TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 27 conjunts are in the unsatisfiable core
[2024-03-09 05:43:21,534 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 05:43:21,579 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-03-09 05:43:21,656 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-03-09 05:43:21,656 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15
[2024-03-09 05:43:22,054 INFO  L349             Elim1Store]: treesize reduction 17, result has 22.7 percent of original size
[2024-03-09 05:43:22,054 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24
[2024-03-09 05:43:22,131 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:43:22,132 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19
[2024-03-09 05:43:22,222 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2024-03-09 05:43:22,240 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2024-03-09 05:43:22,251 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2024-03-09 05:43:22,274 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:43:22,274 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2024-03-09 05:43:22,303 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:43:22,303 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2024-03-09 05:43:22,343 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45
[2024-03-09 05:43:22,356 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:43:22,356 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-03-09 05:43:22,356 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1989076682] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:43:22,356 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-03-09 05:43:22,356 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [15] total 20
[2024-03-09 05:43:22,357 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070361390]
[2024-03-09 05:43:22,357 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:43:22,358 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2024-03-09 05:43:22,358 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:43:22,358 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2024-03-09 05:43:22,359 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420
[2024-03-09 05:43:23,213 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 133 out of 183
[2024-03-09 05:43:23,215 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 336 transitions, 2110 flow. Second operand  has 14 states, 14 states have (on average 135.21428571428572) internal successors, (1893), 14 states have internal predecessors, (1893), 0 states have call successors, (0), 0 states 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:43:23,215 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:43:23,215 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 183
[2024-03-09 05:43:23,215 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:43:24,335 INFO  L124   PetriNetUnfolderBase]: 645/2485 cut-off events.
[2024-03-09 05:43:24,335 INFO  L125   PetriNetUnfolderBase]: For 5227/5277 co-relation queries the response was YES.
[2024-03-09 05:43:24,344 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7940 conditions, 2485 events. 645/2485 cut-off events. For 5227/5277 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 19387 event pairs, 54 based on Foata normal form. 16/2382 useless extension candidates. Maximal degree in co-relation 7855. Up to 354 conditions per place. 
[2024-03-09 05:43:24,352 INFO  L140   encePairwiseOnDemand]: 164/183 looper letters, 261 selfloop transitions, 81 changer transitions 35/526 dead transitions.
[2024-03-09 05:43:24,352 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 526 transitions, 4646 flow
[2024-03-09 05:43:24,353 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2024-03-09 05:43:24,353 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 19 states.
[2024-03-09 05:43:24,357 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2649 transitions.
[2024-03-09 05:43:24,357 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.7618636755823986
[2024-03-09 05:43:24,358 INFO  L72            ComplementDD]: Start complementDD. Operand 19 states and 2649 transitions.
[2024-03-09 05:43:24,358 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 19 states and 2649 transitions.
[2024-03-09 05:43:24,359 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:43:24,359 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2649 transitions.
[2024-03-09 05:43:24,362 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 20 states, 19 states have (on average 139.42105263157896) internal successors, (2649), 19 states have internal predecessors, (2649), 0 states have call successors, (0), 0 states 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:43:24,366 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 20 states, 20 states have (on average 183.0) internal successors, (3660), 20 states have internal predecessors, (3660), 0 states have call successors, (0), 0 states 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:43:24,366 INFO  L81            ComplementDD]: Finished complementDD. Result  has 20 states, 20 states have (on average 183.0) internal successors, (3660), 20 states have internal predecessors, (3660), 0 states have call successors, (0), 0 states 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:43:24,367 INFO  L175             Difference]: Start difference. First operand has 237 places, 336 transitions, 2110 flow. Second operand 19 states and 2649 transitions.
[2024-03-09 05:43:24,367 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 526 transitions, 4646 flow
[2024-03-09 05:43:24,395 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 526 transitions, 4613 flow, removed 2 selfloop flow, removed 5 redundant places.
[2024-03-09 05:43:24,401 INFO  L231             Difference]: Finished difference. Result has 254 places, 387 transitions, 2973 flow
[2024-03-09 05:43:24,401 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=2079, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=336, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=2973, PETRI_PLACES=254, PETRI_TRANSITIONS=387}
[2024-03-09 05:43:24,402 INFO  L281   CegarLoopForPetriNet]: 175 programPoint places, 79 predicate places.
[2024-03-09 05:43:24,402 INFO  L495      AbstractCegarLoop]: Abstraction has has 254 places, 387 transitions, 2973 flow
[2024-03-09 05:43:24,402 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 14 states, 14 states have (on average 135.21428571428572) internal successors, (1893), 14 states have internal predecessors, (1893), 0 states have call successors, (0), 0 states 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:43:24,402 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:43:24,403 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 05:43:24,411 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2024-03-09 05:43:24,605 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,2 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 05:43:24,606 INFO  L420      AbstractCegarLoop]: === Iteration 17 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-09 05:43:24,607 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:43:24,608 INFO  L85        PathProgramCache]: Analyzing trace with hash 504181754, now seen corresponding path program 2 times
[2024-03-09 05:43:24,608 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:43:24,608 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557720689]
[2024-03-09 05:43:24,608 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:43:24,609 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:43:24,635 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:43:25,334 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:43:25,334 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:43:25,334 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557720689]
[2024-03-09 05:43:25,335 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557720689] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 05:43:25,335 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1846054671]
[2024-03-09 05:43:25,335 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-03-09 05:43:25,335 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 05:43:25,336 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 05:43:25,336 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 05:43:25,341 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2024-03-09 05:43:25,508 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-03-09 05:43:25,509 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-09 05:43:25,511 INFO  L262         TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 67 conjunts are in the unsatisfiable core
[2024-03-09 05:43:25,519 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 05:43:25,640 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-03-09 05:43:25,748 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-03-09 05:43:25,749 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15
[2024-03-09 05:43:26,515 INFO  L349             Elim1Store]: treesize reduction 17, result has 22.7 percent of original size
[2024-03-09 05:43:26,515 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24
[2024-03-09 05:43:26,522 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:43:26,523 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11
[2024-03-09 05:43:27,019 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:43:27,020 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11
[2024-03-09 05:43:27,028 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:43:27,029 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19
[2024-03-09 05:43:27,066 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-09 05:43:27,147 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18
[2024-03-09 05:43:27,252 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28
[2024-03-09 05:43:27,349 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3
[2024-03-09 05:43:27,362 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2024-03-09 05:43:27,418 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:43:27,421 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21
[2024-03-09 05:43:27,460 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38
[2024-03-09 05:43:27,545 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:43:27,546 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-03-09 05:43:27,585 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:43:27,587 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-03-09 05:43:27,631 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:43:27,633 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-03-09 05:43:27,765 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-03-09 05:43:27,810 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:43:27,811 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-03-09 05:43:27,811 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1846054671] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:43:27,811 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-03-09 05:43:27,812 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [15] total 38
[2024-03-09 05:43:27,812 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542175716]
[2024-03-09 05:43:27,812 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:43:27,813 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 25 states
[2024-03-09 05:43:27,814 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:43:27,815 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants.
[2024-03-09 05:43:27,815 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1318, Unknown=0, NotChecked=0, Total=1482
[2024-03-09 05:43:29,872 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 109 out of 183
[2024-03-09 05:43:29,873 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 387 transitions, 2973 flow. Second operand  has 25 states, 25 states have (on average 111.04) internal successors, (2776), 25 states have internal predecessors, (2776), 0 states have call successors, (0), 0 states 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:43:29,874 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:43:29,874 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 183
[2024-03-09 05:43:29,874 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:43:33,889 INFO  L124   PetriNetUnfolderBase]: 2244/8270 cut-off events.
[2024-03-09 05:43:33,889 INFO  L125   PetriNetUnfolderBase]: For 24954/24999 co-relation queries the response was YES.
[2024-03-09 05:43:33,918 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28229 conditions, 8270 events. 2244/8270 cut-off events. For 24954/24999 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 84602 event pairs, 374 based on Foata normal form. 29/7927 useless extension candidates. Maximal degree in co-relation 23901. Up to 1547 conditions per place. 
[2024-03-09 05:43:33,936 INFO  L140   encePairwiseOnDemand]: 144/183 looper letters, 770 selfloop transitions, 172 changer transitions 37/1105 dead transitions.
[2024-03-09 05:43:33,937 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 1105 transitions, 11901 flow
[2024-03-09 05:43:33,937 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. 
[2024-03-09 05:43:33,937 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 40 states.
[2024-03-09 05:43:33,941 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 4734 transitions.
[2024-03-09 05:43:33,942 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.6467213114754098
[2024-03-09 05:43:33,943 INFO  L72            ComplementDD]: Start complementDD. Operand 40 states and 4734 transitions.
[2024-03-09 05:43:33,943 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 40 states and 4734 transitions.
[2024-03-09 05:43:33,944 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:43:33,944 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 40 states and 4734 transitions.
[2024-03-09 05:43:33,949 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 41 states, 40 states have (on average 118.35) internal successors, (4734), 40 states have internal predecessors, (4734), 0 states have call successors, (0), 0 states 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:43:33,956 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 41 states, 41 states have (on average 183.0) internal successors, (7503), 41 states have internal predecessors, (7503), 0 states have call successors, (0), 0 states 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:43:33,957 INFO  L81            ComplementDD]: Finished complementDD. Result  has 41 states, 41 states have (on average 183.0) internal successors, (7503), 41 states have internal predecessors, (7503), 0 states have call successors, (0), 0 states 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:43:33,957 INFO  L175             Difference]: Start difference. First operand has 254 places, 387 transitions, 2973 flow. Second operand 40 states and 4734 transitions.
[2024-03-09 05:43:33,957 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 1105 transitions, 11901 flow
[2024-03-09 05:43:34,081 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 1105 transitions, 11797 flow, removed 28 selfloop flow, removed 9 redundant places.
[2024-03-09 05:43:34,090 INFO  L231             Difference]: Finished difference. Result has 305 places, 542 transitions, 5349 flow
[2024-03-09 05:43:34,091 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=2929, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=387, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=40, PETRI_FLOW=5349, PETRI_PLACES=305, PETRI_TRANSITIONS=542}
[2024-03-09 05:43:34,091 INFO  L281   CegarLoopForPetriNet]: 175 programPoint places, 130 predicate places.
[2024-03-09 05:43:34,091 INFO  L495      AbstractCegarLoop]: Abstraction has has 305 places, 542 transitions, 5349 flow
[2024-03-09 05:43:34,092 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 25 states, 25 states have (on average 111.04) internal successors, (2776), 25 states have internal predecessors, (2776), 0 states have call successors, (0), 0 states 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:43:34,092 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:43:34,092 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 05:43:34,147 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2024-03-09 05:43:34,293 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16
[2024-03-09 05:43:34,294 INFO  L420      AbstractCegarLoop]: === Iteration 18 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-09 05:43:34,295 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:43:34,295 INFO  L85        PathProgramCache]: Analyzing trace with hash -22561660, now seen corresponding path program 3 times
[2024-03-09 05:43:34,295 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:43:34,295 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354271018]
[2024-03-09 05:43:34,295 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:43:34,296 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:43:34,321 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:43:35,037 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:43:35,037 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:43:35,037 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354271018]
[2024-03-09 05:43:35,038 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354271018] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 05:43:35,038 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [108271751]
[2024-03-09 05:43:35,038 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-03-09 05:43:35,038 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 05:43:35,038 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 05:43:35,039 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 05:43:35,041 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2024-03-09 05:43:35,194 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2024-03-09 05:43:35,194 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-09 05:43:35,196 INFO  L262         TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 31 conjunts are in the unsatisfiable core
[2024-03-09 05:43:35,200 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 05:43:35,224 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-03-09 05:43:35,281 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-03-09 05:43:35,281 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15
[2024-03-09 05:43:35,592 INFO  L349             Elim1Store]: treesize reduction 17, result has 22.7 percent of original size
[2024-03-09 05:43:35,592 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24
[2024-03-09 05:43:35,638 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:43:35,639 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19
[2024-03-09 05:43:35,656 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2024-03-09 05:43:35,712 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2024-03-09 05:43:35,760 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:43:35,760 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2024-03-09 05:43:35,810 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:43:35,810 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2024-03-09 05:43:36,022 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2024-03-09 05:43:36,079 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:43:36,079 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45
[2024-03-09 05:43:36,116 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:43:36,117 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45
[2024-03-09 05:43:36,146 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:43:36,147 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45
[2024-03-09 05:43:36,167 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:43:36,167 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45
[2024-03-09 05:43:36,203 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45
[2024-03-09 05:43:36,212 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:43:36,213 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-03-09 05:43:36,213 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [108271751] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:43:36,213 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-03-09 05:43:36,213 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [15] total 26
[2024-03-09 05:43:36,213 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721333436]
[2024-03-09 05:43:36,213 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:43:36,213 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2024-03-09 05:43:36,214 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:43:36,214 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2024-03-09 05:43:36,214 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=589, Unknown=0, NotChecked=0, Total=702
[2024-03-09 05:43:36,842 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 133 out of 183
[2024-03-09 05:43:36,843 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 542 transitions, 5349 flow. Second operand  has 15 states, 15 states have (on average 135.06666666666666) internal successors, (2026), 15 states have internal predecessors, (2026), 0 states have call successors, (0), 0 states 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:43:36,843 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:43:36,843 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 183
[2024-03-09 05:43:36,843 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:43:39,289 INFO  L124   PetriNetUnfolderBase]: 1847/7011 cut-off events.
[2024-03-09 05:43:39,289 INFO  L125   PetriNetUnfolderBase]: For 37915/38128 co-relation queries the response was YES.
[2024-03-09 05:43:39,320 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28871 conditions, 7011 events. 1847/7011 cut-off events. For 37915/38128 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 69645 event pairs, 148 based on Foata normal form. 105/6894 useless extension candidates. Maximal degree in co-relation 28746. Up to 1255 conditions per place. 
[2024-03-09 05:43:39,338 INFO  L140   encePairwiseOnDemand]: 160/183 looper letters, 279 selfloop transitions, 248 changer transitions 21/721 dead transitions.
[2024-03-09 05:43:39,338 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 721 transitions, 8283 flow
[2024-03-09 05:43:39,339 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. 
[2024-03-09 05:43:39,339 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 24 states.
[2024-03-09 05:43:39,341 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 3361 transitions.
[2024-03-09 05:43:39,342 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.7652550091074681
[2024-03-09 05:43:39,342 INFO  L72            ComplementDD]: Start complementDD. Operand 24 states and 3361 transitions.
[2024-03-09 05:43:39,343 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 24 states and 3361 transitions.
[2024-03-09 05:43:39,343 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:43:39,343 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 3361 transitions.
[2024-03-09 05:43:39,347 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 25 states, 24 states have (on average 140.04166666666666) internal successors, (3361), 24 states have internal predecessors, (3361), 0 states have call successors, (0), 0 states 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:43:39,351 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 25 states, 25 states have (on average 183.0) internal successors, (4575), 25 states have internal predecessors, (4575), 0 states have call successors, (0), 0 states 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:43:39,351 INFO  L81            ComplementDD]: Finished complementDD. Result  has 25 states, 25 states have (on average 183.0) internal successors, (4575), 25 states have internal predecessors, (4575), 0 states have call successors, (0), 0 states 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:43:39,351 INFO  L175             Difference]: Start difference. First operand has 305 places, 542 transitions, 5349 flow. Second operand 24 states and 3361 transitions.
[2024-03-09 05:43:39,351 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 721 transitions, 8283 flow
[2024-03-09 05:43:39,525 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 721 transitions, 8228 flow, removed 11 selfloop flow, removed 12 redundant places.
[2024-03-09 05:43:39,533 INFO  L231             Difference]: Finished difference. Result has 316 places, 604 transitions, 6827 flow
[2024-03-09 05:43:39,534 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=5296, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=542, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=186, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=345, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=6827, PETRI_PLACES=316, PETRI_TRANSITIONS=604}
[2024-03-09 05:43:39,534 INFO  L281   CegarLoopForPetriNet]: 175 programPoint places, 141 predicate places.
[2024-03-09 05:43:39,534 INFO  L495      AbstractCegarLoop]: Abstraction has has 316 places, 604 transitions, 6827 flow
[2024-03-09 05:43:39,535 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 15 states, 15 states have (on average 135.06666666666666) internal successors, (2026), 15 states have internal predecessors, (2026), 0 states have call successors, (0), 0 states 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:43:39,535 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:43:39,535 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 05:43:39,540 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2024-03-09 05:43:39,740 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17
[2024-03-09 05:43:39,741 INFO  L420      AbstractCegarLoop]: === Iteration 19 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-09 05:43:39,741 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:43:39,742 INFO  L85        PathProgramCache]: Analyzing trace with hash 220302916, now seen corresponding path program 4 times
[2024-03-09 05:43:39,742 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:43:39,742 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764435482]
[2024-03-09 05:43:39,742 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:43:39,743 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:43:39,769 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:43:40,361 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:43:40,362 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:43:40,362 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764435482]
[2024-03-09 05:43:40,362 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764435482] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 05:43:40,362 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2035644572]
[2024-03-09 05:43:40,362 INFO  L93    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2024-03-09 05:43:40,362 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 05:43:40,362 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 05:43:40,363 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 05:43:40,365 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2024-03-09 05:43:40,561 INFO  L228   tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2024-03-09 05:43:40,562 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-09 05:43:40,564 INFO  L262         TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 69 conjunts are in the unsatisfiable core
[2024-03-09 05:43:40,576 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 05:43:40,698 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-03-09 05:43:40,798 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-03-09 05:43:40,799 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15
[2024-03-09 05:43:41,644 INFO  L349             Elim1Store]: treesize reduction 19, result has 20.8 percent of original size
[2024-03-09 05:43:41,644 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45
[2024-03-09 05:43:41,653 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:43:41,654 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11
[2024-03-09 05:43:41,890 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:43:41,891 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11
[2024-03-09 05:43:41,895 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:43:41,896 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19
[2024-03-09 05:43:41,930 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-09 05:43:42,174 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3
[2024-03-09 05:43:42,181 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2024-03-09 05:43:42,226 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18
[2024-03-09 05:43:42,282 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28
[2024-03-09 05:43:42,345 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38
[2024-03-09 05:43:42,450 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:43:42,453 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-03-09 05:43:42,504 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:43:42,505 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-03-09 05:43:42,526 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:43:42,527 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-03-09 05:43:42,553 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:43:42,554 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-03-09 05:43:42,637 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-03-09 05:43:42,676 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:43:42,677 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 05:43:42,724 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse0 (* c_threadThread1of1ForFork0_~j~0 4))) (and (forall ((v_ArrVal_661 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_661) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse0)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_661 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_661) c_~datas~0.base) (+ c_~datas~0.offset 3 .cse0)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_661 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_661) c_~datas~0.base) (+ c_~datas~0.offset .cse0)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_661 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_661) c_~datas~0.base) (+ c_~datas~0.offset .cse0 1)) |c_threadThread1of1ForFork0_#t~nondet4|)))) is different from false
[2024-03-09 05:43:59,361 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (* c_threadThread1of1ForFork0_~j~0 4))) (let ((.cse2 (+ c_~datas~0.offset 3 .cse1))) (let ((.cse0 (store |c_#race| c_~datas~0.base (store (select |c_#race| c_~datas~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_661 (Array Int Int)) (v_ArrVal_660 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_660) |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_661) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_661 (Array Int Int)) (v_ArrVal_660 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_660) |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_661) c_~datas~0.base) (+ c_~datas~0.offset .cse1 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_661 (Array Int Int)) (v_ArrVal_660 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_660) |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_661) c_~datas~0.base) (+ c_~datas~0.offset .cse1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_661 (Array Int Int)) (v_ArrVal_660 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_660) |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_661) c_~datas~0.base) .cse2))))))) is different from false
[2024-03-09 05:43:59,912 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse5 (* c_threadThread1of1ForFork0_~j~0 4))) (let ((.cse3 (+ c_~datas~0.offset .cse5 1)) (.cse2 (+ c_~datas~0.offset 2 .cse5)) (.cse4 (+ c_~datas~0.offset 3 .cse5))) (let ((.cse0 (store |c_#race| c_~datas~0.base (store (store (store (select |c_#race| c_~datas~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_661 (Array Int Int)) (v_ArrVal_660 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_660) .cse1 v_ArrVal_661) c_~datas~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_661 (Array Int Int)) (v_ArrVal_660 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_660) .cse1 v_ArrVal_661) c_~datas~0.base) .cse3) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_661 (Array Int Int)) (v_ArrVal_660 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_660) .cse1 v_ArrVal_661) c_~datas~0.base) .cse4))) (forall ((v_ArrVal_661 (Array Int Int)) (v_ArrVal_660 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_660) .cse1 v_ArrVal_661) c_~datas~0.base) (+ c_~datas~0.offset .cse5)) |c_threadThread1of1ForFork0_#t~nondet4|)))))) is different from false
[2024-03-09 05:44:00,094 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:44:00,095 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 57 treesize of output 73
[2024-03-09 05:44:00,106 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:44:00,107 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 257 treesize of output 158
[2024-03-09 05:44:00,120 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24
[2024-03-09 05:44:00,129 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17
[2024-03-09 05:44:00,158 INFO  L349             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-03-09 05:44:00,159 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 58 treesize of output 1
[2024-03-09 05:44:00,168 INFO  L349             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-03-09 05:44:00,168 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 58 treesize of output 1
[2024-03-09 05:44:00,175 INFO  L349             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-03-09 05:44:00,176 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 58 treesize of output 1
[2024-03-09 05:44:00,871 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4
[2024-03-09 05:44:00,880 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 64
[2024-03-09 05:44:00,891 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30
[2024-03-09 05:44:01,026 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:44:01,026 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 40
[2024-03-09 05:44:01,091 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2024-03-09 05:44:01,092 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2035644572] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 05:44:01,092 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 05:44:01,092 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 23, 17] total 51
[2024-03-09 05:44:01,092 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020549637]
[2024-03-09 05:44:01,093 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 05:44:01,095 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 52 states
[2024-03-09 05:44:01,096 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:44:01,097 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants.
[2024-03-09 05:44:01,098 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=2029, Unknown=83, NotChecked=288, Total=2652
[2024-03-09 05:44:01,501 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 91 out of 183
[2024-03-09 05:44:01,506 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 604 transitions, 6827 flow. Second operand  has 52 states, 52 states have (on average 93.84615384615384) internal successors, (4880), 52 states have internal predecessors, (4880), 0 states have call successors, (0), 0 states 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:44:01,506 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:44:01,506 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 183
[2024-03-09 05:44:01,506 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:44:18,334 INFO  L124   PetriNetUnfolderBase]: 3502/13001 cut-off events.
[2024-03-09 05:44:18,335 INFO  L125   PetriNetUnfolderBase]: For 78188/78369 co-relation queries the response was YES.
[2024-03-09 05:44:18,394 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 51150 conditions, 13001 events. 3502/13001 cut-off events. For 78188/78369 co-relation queries the response was YES. Maximal size of possible extension queue 427. Compared 145834 event pairs, 175 based on Foata normal form. 121/12587 useless extension candidates. Maximal degree in co-relation 50406. Up to 1653 conditions per place. 
[2024-03-09 05:44:18,418 INFO  L140   encePairwiseOnDemand]: 143/183 looper letters, 997 selfloop transitions, 363 changer transitions 266/1739 dead transitions.
[2024-03-09 05:44:18,418 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 396 places, 1739 transitions, 21709 flow
[2024-03-09 05:44:18,419 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. 
[2024-03-09 05:44:18,419 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 82 states.
[2024-03-09 05:44:18,423 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 8197 transitions.
[2024-03-09 05:44:18,426 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5462481673997068
[2024-03-09 05:44:18,426 INFO  L72            ComplementDD]: Start complementDD. Operand 82 states and 8197 transitions.
[2024-03-09 05:44:18,426 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 82 states and 8197 transitions.
[2024-03-09 05:44:18,427 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:44:18,427 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 82 states and 8197 transitions.
[2024-03-09 05:44:18,435 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 83 states, 82 states have (on average 99.96341463414635) internal successors, (8197), 82 states have internal predecessors, (8197), 0 states have call successors, (0), 0 states 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:44:18,445 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 83 states, 83 states have (on average 183.0) internal successors, (15189), 83 states have internal predecessors, (15189), 0 states have call successors, (0), 0 states 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:44:18,447 INFO  L81            ComplementDD]: Finished complementDD. Result  has 83 states, 83 states have (on average 183.0) internal successors, (15189), 83 states have internal predecessors, (15189), 0 states have call successors, (0), 0 states 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:44:18,447 INFO  L175             Difference]: Start difference. First operand has 316 places, 604 transitions, 6827 flow. Second operand 82 states and 8197 transitions.
[2024-03-09 05:44:18,447 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 396 places, 1739 transitions, 21709 flow
[2024-03-09 05:44:18,834 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 386 places, 1739 transitions, 20509 flow, removed 300 selfloop flow, removed 10 redundant places.
[2024-03-09 05:44:18,849 INFO  L231             Difference]: Finished difference. Result has 408 places, 754 transitions, 9618 flow
[2024-03-09 05:44:18,849 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=6422, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=604, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=170, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=387, PETRI_DIFFERENCE_SUBTRAHEND_STATES=82, PETRI_FLOW=9618, PETRI_PLACES=408, PETRI_TRANSITIONS=754}
[2024-03-09 05:44:18,850 INFO  L281   CegarLoopForPetriNet]: 175 programPoint places, 233 predicate places.
[2024-03-09 05:44:18,850 INFO  L495      AbstractCegarLoop]: Abstraction has has 408 places, 754 transitions, 9618 flow
[2024-03-09 05:44:18,851 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 52 states, 52 states have (on average 93.84615384615384) internal successors, (4880), 52 states have internal predecessors, (4880), 0 states have call successors, (0), 0 states 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:44:18,851 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:44:18,851 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 05:44:18,858 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2024-03-09 05:44:19,052 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 05:44:19,053 INFO  L420      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-09 05:44:19,053 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:44:19,054 INFO  L85        PathProgramCache]: Analyzing trace with hash 1567358074, now seen corresponding path program 1 times
[2024-03-09 05:44:19,054 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:44:19,054 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027447110]
[2024-03-09 05:44:19,054 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:44:19,055 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:44:19,074 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:44:19,746 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:44:19,747 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:44:19,747 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027447110]
[2024-03-09 05:44:19,747 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027447110] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 05:44:19,748 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [232023755]
[2024-03-09 05:44:19,748 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:44:19,748 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 05:44:19,749 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 05:44:19,750 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 05:44:19,752 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2024-03-09 05:44:19,888 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:44:19,890 INFO  L262         TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 62 conjunts are in the unsatisfiable core
[2024-03-09 05:44:19,894 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 05:44:20,061 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-03-09 05:44:20,195 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-03-09 05:44:20,196 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15
[2024-03-09 05:44:21,091 INFO  L349             Elim1Store]: treesize reduction 17, result has 22.7 percent of original size
[2024-03-09 05:44:21,092 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24
[2024-03-09 05:44:21,098 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:44:21,099 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11
[2024-03-09 05:44:21,400 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:44:21,401 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19
[2024-03-09 05:44:21,415 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:44:21,416 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11
[2024-03-09 05:44:21,601 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2024-03-09 05:44:21,608 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3
[2024-03-09 05:44:21,701 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-09 05:44:21,776 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18
[2024-03-09 05:44:21,847 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28
[2024-03-09 05:44:21,933 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38
[2024-03-09 05:44:22,024 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-03-09 05:44:22,090 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:44:22,090 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 05:44:22,121 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_760 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_760) |c_ULTIMATE.start_main_#t~mem21#1.base|) (+ 2 |c_ULTIMATE.start_main_#t~mem21#1.offset| .cse0)) 0)) (forall ((v_ArrVal_760 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_760) |c_ULTIMATE.start_main_#t~mem21#1.base|) (+ |c_ULTIMATE.start_main_#t~mem21#1.offset| 1 .cse0)) 0)) (forall ((v_ArrVal_760 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_760) |c_ULTIMATE.start_main_#t~mem21#1.base|) (+ |c_ULTIMATE.start_main_#t~mem21#1.offset| .cse0)) 0)) (forall ((v_ArrVal_760 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_760) |c_ULTIMATE.start_main_#t~mem21#1.base|) (+ |c_ULTIMATE.start_main_#t~mem21#1.offset| 3 .cse0)) 0)))) is different from false
[2024-03-09 05:44:22,144 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_#t~mem21#1.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_#t~mem21#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_#t~mem21#1.base|) .cse2 0)))) (and (forall ((v_ArrVal_760 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_760) |c_ULTIMATE.start_main_#t~mem21#1.base|) (+ |c_ULTIMATE.start_main_#t~mem21#1.offset| .cse1)) 0)) (forall ((v_ArrVal_760 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_760) |c_ULTIMATE.start_main_#t~mem21#1.base|) (+ |c_ULTIMATE.start_main_#t~mem21#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_760 (Array Int Int))) (= 0 (select (select (store .cse0 c_~datas~0.base v_ArrVal_760) |c_ULTIMATE.start_main_#t~mem21#1.base|) (+ 2 |c_ULTIMATE.start_main_#t~mem21#1.offset| .cse1)))) (forall ((v_ArrVal_760 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_760) |c_ULTIMATE.start_main_#t~mem21#1.base|) .cse2) 0)))))) is different from false
[2024-03-09 05:44:22,172 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse3 (+ 2 |c_ULTIMATE.start_main_#t~mem21#1.offset| .cse2)) (.cse1 (+ |c_ULTIMATE.start_main_#t~mem21#1.offset| 3 .cse2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_#t~mem21#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_#t~mem21#1.base|) .cse3 0) .cse1 0)))) (and (forall ((v_ArrVal_760 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_760) |c_ULTIMATE.start_main_#t~mem21#1.base|) .cse1) 0)) (forall ((v_ArrVal_760 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_760) |c_ULTIMATE.start_main_#t~mem21#1.base|) (+ |c_ULTIMATE.start_main_#t~mem21#1.offset| 1 .cse2)) 0)) (forall ((v_ArrVal_760 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_760) |c_ULTIMATE.start_main_#t~mem21#1.base|) .cse3) 0)) (forall ((v_ArrVal_760 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_760) |c_ULTIMATE.start_main_#t~mem21#1.base|) (+ |c_ULTIMATE.start_main_#t~mem21#1.offset| .cse2)) 0)))))) is different from false
[2024-03-09 05:44:22,200 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse3 (+ |c_ULTIMATE.start_main_#t~mem21#1.offset| 1 .cse2)) (.cse4 (+ 2 |c_ULTIMATE.start_main_#t~mem21#1.offset| .cse2)) (.cse1 (+ |c_ULTIMATE.start_main_#t~mem21#1.offset| 3 .cse2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_#t~mem21#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_#t~mem21#1.base|) .cse3 0) .cse4 0) .cse1 0)))) (and (forall ((v_ArrVal_760 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_760) |c_ULTIMATE.start_main_#t~mem21#1.base|) .cse1) 0)) (forall ((v_ArrVal_760 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_760) |c_ULTIMATE.start_main_#t~mem21#1.base|) (+ |c_ULTIMATE.start_main_#t~mem21#1.offset| .cse2)) 0)) (forall ((v_ArrVal_760 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_760) |c_ULTIMATE.start_main_#t~mem21#1.base|) .cse3) 0)) (forall ((v_ArrVal_760 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_760) |c_ULTIMATE.start_main_#t~mem21#1.base|) .cse4) 0)))))) is different from false
[2024-03-09 05:44:22,222 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:44:22,223 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 66
[2024-03-09 05:44:22,231 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:44:22,231 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 81 treesize of output 38
[2024-03-09 05:44:22,238 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3
[2024-03-09 05:44:22,250 INFO  L349             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-03-09 05:44:22,251 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1
[2024-03-09 05:44:22,264 INFO  L349             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-03-09 05:44:22,265 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1
[2024-03-09 05:44:22,272 INFO  L349             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-03-09 05:44:22,273 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1
[2024-03-09 05:44:22,341 WARN  L854   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_754 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_~datas~0.base v_ArrVal_754) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) c_~datas~0.base))) is different from false
[2024-03-09 05:44:27,366 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 122
[2024-03-09 05:44:27,377 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 50
[2024-03-09 05:44:27,384 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46
[2024-03-09 05:44:27,390 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4
[2024-03-09 05:44:27,556 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:44:27,556 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 39
[2024-03-09 05:44:27,620 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:44:27,620 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [232023755] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 05:44:27,620 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 05:44:27,620 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 22, 18] total 51
[2024-03-09 05:44:27,621 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901379022]
[2024-03-09 05:44:27,621 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 05:44:27,622 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 52 states
[2024-03-09 05:44:27,623 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:44:27,623 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants.
[2024-03-09 05:44:27,624 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=1911, Unknown=24, NotChecked=470, Total=2652
[2024-03-09 05:44:27,825 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 91 out of 183
[2024-03-09 05:44:27,830 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 408 places, 754 transitions, 9618 flow. Second operand  has 52 states, 52 states have (on average 93.9423076923077) internal successors, (4885), 52 states have internal predecessors, (4885), 0 states have call successors, (0), 0 states 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:44:27,830 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:44:27,830 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 183
[2024-03-09 05:44:27,831 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:44:40,035 INFO  L124   PetriNetUnfolderBase]: 2518/11024 cut-off events.
[2024-03-09 05:44:40,035 INFO  L125   PetriNetUnfolderBase]: For 67338/67443 co-relation queries the response was YES.
[2024-03-09 05:44:40,098 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 42858 conditions, 11024 events. 2518/11024 cut-off events. For 67338/67443 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 125137 event pairs, 211 based on Foata normal form. 70/10614 useless extension candidates. Maximal degree in co-relation 41993. Up to 1374 conditions per place. 
[2024-03-09 05:44:40,118 INFO  L140   encePairwiseOnDemand]: 148/183 looper letters, 673 selfloop transitions, 189 changer transitions 497/1494 dead transitions.
[2024-03-09 05:44:40,118 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 466 places, 1494 transitions, 21787 flow
[2024-03-09 05:44:40,119 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. 
[2024-03-09 05:44:40,119 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 65 states.
[2024-03-09 05:44:40,123 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 6396 transitions.
[2024-03-09 05:44:40,124 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5377049180327869
[2024-03-09 05:44:40,124 INFO  L72            ComplementDD]: Start complementDD. Operand 65 states and 6396 transitions.
[2024-03-09 05:44:40,124 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 65 states and 6396 transitions.
[2024-03-09 05:44:40,126 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:44:40,126 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 65 states and 6396 transitions.
[2024-03-09 05:44:40,131 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 66 states, 65 states have (on average 98.4) internal successors, (6396), 65 states have internal predecessors, (6396), 0 states have call successors, (0), 0 states 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:44:40,139 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 66 states, 66 states have (on average 183.0) internal successors, (12078), 66 states have internal predecessors, (12078), 0 states have call successors, (0), 0 states 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:44:40,139 INFO  L81            ComplementDD]: Finished complementDD. Result  has 66 states, 66 states have (on average 183.0) internal successors, (12078), 66 states have internal predecessors, (12078), 0 states have call successors, (0), 0 states 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:44:40,140 INFO  L175             Difference]: Start difference. First operand has 408 places, 754 transitions, 9618 flow. Second operand 65 states and 6396 transitions.
[2024-03-09 05:44:40,140 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 466 places, 1494 transitions, 21787 flow
[2024-03-09 05:44:40,610 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 427 places, 1494 transitions, 20328 flow, removed 265 selfloop flow, removed 39 redundant places.
[2024-03-09 05:44:40,623 INFO  L231             Difference]: Finished difference. Result has 431 places, 536 transitions, 4850 flow
[2024-03-09 05:44:40,623 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=8461, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=753, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=145, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=607, PETRI_DIFFERENCE_SUBTRAHEND_STATES=65, PETRI_FLOW=4850, PETRI_PLACES=431, PETRI_TRANSITIONS=536}
[2024-03-09 05:44:40,624 INFO  L281   CegarLoopForPetriNet]: 175 programPoint places, 256 predicate places.
[2024-03-09 05:44:40,624 INFO  L495      AbstractCegarLoop]: Abstraction has has 431 places, 536 transitions, 4850 flow
[2024-03-09 05:44:40,625 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 52 states, 52 states have (on average 93.9423076923077) internal successors, (4885), 52 states have internal predecessors, (4885), 0 states have call successors, (0), 0 states 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:44:40,625 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:44:40,625 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:40,633 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0
[2024-03-09 05:44:40,825 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 05:44:40,826 INFO  L420      AbstractCegarLoop]: === Iteration 21 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-09 05:44:40,827 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:44:40,827 INFO  L85        PathProgramCache]: Analyzing trace with hash 741024356, now seen corresponding path program 5 times
[2024-03-09 05:44:40,827 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:44:40,828 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406357602]
[2024-03-09 05:44:40,828 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:44:40,828 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:44:40,850 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:44:41,732 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:44:41,732 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:44:41,732 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406357602]
[2024-03-09 05:44:41,733 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406357602] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 05:44:41,733 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820365360]
[2024-03-09 05:44:41,733 INFO  L93    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2024-03-09 05:44:41,733 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 05:44:41,733 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 05:44:41,735 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 05:44:41,736 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2024-03-09 05:44:41,873 INFO  L228   tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-03-09 05:44:41,873 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-09 05:44:41,875 INFO  L262         TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 32 conjunts are in the unsatisfiable core
[2024-03-09 05:44:41,879 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 05:44:41,914 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-03-09 05:44:41,997 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-03-09 05:44:41,998 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15
[2024-03-09 05:44:42,435 INFO  L349             Elim1Store]: treesize reduction 19, result has 20.8 percent of original size
[2024-03-09 05:44:42,436 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33
[2024-03-09 05:44:42,553 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:44:42,555 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19
[2024-03-09 05:44:42,632 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2024-03-09 05:44:42,694 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2024-03-09 05:44:42,754 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:44:42,755 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2024-03-09 05:44:42,892 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2024-03-09 05:44:42,967 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:44:42,967 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 35
[2024-03-09 05:44:43,008 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:44:43,009 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2024-03-09 05:44:43,087 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:44:43,090 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45
[2024-03-09 05:44:43,131 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:44:43,132 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45
[2024-03-09 05:44:43,162 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:44:43,163 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45
[2024-03-09 05:44:43,217 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45
[2024-03-09 05:44:43,232 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:44:43,232 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-03-09 05:44:43,233 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1820365360] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:44:43,233 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-03-09 05:44:43,233 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [15] total 26
[2024-03-09 05:44:43,233 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732433991]
[2024-03-09 05:44:43,233 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:44:43,234 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2024-03-09 05:44:43,234 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:44:43,235 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2024-03-09 05:44:43,236 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=601, Unknown=0, NotChecked=0, Total=702
[2024-03-09 05:44:44,853 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 133 out of 183
[2024-03-09 05:44:44,855 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 431 places, 536 transitions, 4850 flow. Second operand  has 15 states, 15 states have (on average 135.06666666666666) internal successors, (2026), 15 states have internal predecessors, (2026), 0 states have call successors, (0), 0 states 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:44:44,855 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:44:44,855 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 183
[2024-03-09 05:44:44,855 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:44:48,056 INFO  L124   PetriNetUnfolderBase]: 1508/7648 cut-off events.
[2024-03-09 05:44:48,056 INFO  L125   PetriNetUnfolderBase]: For 33193/33473 co-relation queries the response was YES.
[2024-03-09 05:44:48,094 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25199 conditions, 7648 events. 1508/7648 cut-off events. For 33193/33473 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 82971 event pairs, 167 based on Foata normal form. 167/7448 useless extension candidates. Maximal degree in co-relation 24620. Up to 761 conditions per place. 
[2024-03-09 05:44:48,107 INFO  L140   encePairwiseOnDemand]: 164/183 looper letters, 194 selfloop transitions, 181 changer transitions 56/646 dead transitions.
[2024-03-09 05:44:48,107 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 440 places, 646 transitions, 6797 flow
[2024-03-09 05:44:48,108 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. 
[2024-03-09 05:44:48,108 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 23 states.
[2024-03-09 05:44:48,110 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 3200 transitions.
[2024-03-09 05:44:48,111 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.7602755999049655
[2024-03-09 05:44:48,111 INFO  L72            ComplementDD]: Start complementDD. Operand 23 states and 3200 transitions.
[2024-03-09 05:44:48,111 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 23 states and 3200 transitions.
[2024-03-09 05:44:48,112 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:44:48,112 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 3200 transitions.
[2024-03-09 05:44:48,115 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 24 states, 23 states have (on average 139.1304347826087) internal successors, (3200), 23 states have internal predecessors, (3200), 0 states have call successors, (0), 0 states 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:44:48,118 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 24 states, 24 states have (on average 183.0) internal successors, (4392), 24 states have internal predecessors, (4392), 0 states have call successors, (0), 0 states 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:44:48,118 INFO  L81            ComplementDD]: Finished complementDD. Result  has 24 states, 24 states have (on average 183.0) internal successors, (4392), 24 states have internal predecessors, (4392), 0 states have call successors, (0), 0 states 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:44:48,118 INFO  L175             Difference]: Start difference. First operand has 431 places, 536 transitions, 4850 flow. Second operand 23 states and 3200 transitions.
[2024-03-09 05:44:48,119 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 440 places, 646 transitions, 6797 flow
[2024-03-09 05:44:48,360 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 395 places, 646 transitions, 5859 flow, removed 272 selfloop flow, removed 45 redundant places.
[2024-03-09 05:44:48,366 INFO  L231             Difference]: Finished difference. Result has 398 places, 529 transitions, 4429 flow
[2024-03-09 05:44:48,367 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=4142, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=536, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=181, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=355, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=4429, PETRI_PLACES=398, PETRI_TRANSITIONS=529}
[2024-03-09 05:44:48,367 INFO  L281   CegarLoopForPetriNet]: 175 programPoint places, 223 predicate places.
[2024-03-09 05:44:48,367 INFO  L495      AbstractCegarLoop]: Abstraction has has 398 places, 529 transitions, 4429 flow
[2024-03-09 05:44:48,367 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 15 states, 15 states have (on average 135.06666666666666) internal successors, (2026), 15 states have internal predecessors, (2026), 0 states have call successors, (0), 0 states 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:44:48,367 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:44:48,368 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 05:44:48,375 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0
[2024-03-09 05:44:48,568 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 05:44:48,569 INFO  L420      AbstractCegarLoop]: === Iteration 22 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-09 05:44:48,569 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:44:48,570 INFO  L85        PathProgramCache]: Analyzing trace with hash 1986083962, now seen corresponding path program 6 times
[2024-03-09 05:44:48,570 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:44:48,570 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637083563]
[2024-03-09 05:44:48,570 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:44:48,571 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:44:48,594 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:44:49,417 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:44:49,417 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:44:49,417 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637083563]
[2024-03-09 05:44:49,418 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637083563] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 05:44:49,418 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773609807]
[2024-03-09 05:44:49,418 INFO  L93    rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2024-03-09 05:44:49,418 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 05:44:49,418 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 05:44:49,420 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 05:44:49,421 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2024-03-09 05:44:49,627 INFO  L228   tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s)
[2024-03-09 05:44:49,627 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-09 05:44:49,629 INFO  L262         TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 65 conjunts are in the unsatisfiable core
[2024-03-09 05:44:49,634 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 05:44:49,816 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-03-09 05:44:49,973 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-03-09 05:44:49,973 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15
[2024-03-09 05:44:51,244 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:44:51,245 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11
[2024-03-09 05:44:51,266 INFO  L349             Elim1Store]: treesize reduction 17, result has 22.7 percent of original size
[2024-03-09 05:44:51,266 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24
[2024-03-09 05:44:51,884 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:44:51,885 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11
[2024-03-09 05:44:51,893 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:44:51,895 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19
[2024-03-09 05:44:51,941 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-09 05:44:52,261 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18
[2024-03-09 05:44:52,359 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3
[2024-03-09 05:44:52,373 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2024-03-09 05:44:52,474 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28
[2024-03-09 05:44:52,581 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38
[2024-03-09 05:44:52,691 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:44:52,692 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-03-09 05:44:52,721 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:44:52,722 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-03-09 05:44:52,759 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:44:52,759 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-03-09 05:44:52,803 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:44:52,804 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-03-09 05:44:52,921 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-03-09 05:44:52,986 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:44:52,986 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-03-09 05:44:52,987 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1773609807] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:44:52,987 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-03-09 05:44:52,987 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [15] total 37
[2024-03-09 05:44:52,987 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781359865]
[2024-03-09 05:44:52,987 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:44:52,988 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 24 states
[2024-03-09 05:44:52,988 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:44:52,988 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants.
[2024-03-09 05:44:52,989 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1243, Unknown=0, NotChecked=0, Total=1406
[2024-03-09 05:44:57,436 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 110 out of 183
[2024-03-09 05:44:57,438 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 398 places, 529 transitions, 4429 flow. Second operand  has 24 states, 24 states have (on average 112.08333333333333) internal successors, (2690), 24 states have internal predecessors, (2690), 0 states have call successors, (0), 0 states 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:44:57,438 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:44:57,438 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 183
[2024-03-09 05:44:57,439 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:45:03,240 INFO  L124   PetriNetUnfolderBase]: 1741/7911 cut-off events.
[2024-03-09 05:45:03,240 INFO  L125   PetriNetUnfolderBase]: For 28202/28375 co-relation queries the response was YES.
[2024-03-09 05:45:03,283 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25768 conditions, 7911 events. 1741/7911 cut-off events. For 28202/28375 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 84278 event pairs, 303 based on Foata normal form. 99/7647 useless extension candidates. Maximal degree in co-relation 25575. Up to 1489 conditions per place. 
[2024-03-09 05:45:03,298 INFO  L140   encePairwiseOnDemand]: 149/183 looper letters, 471 selfloop transitions, 150 changer transitions 148/911 dead transitions.
[2024-03-09 05:45:03,298 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 436 places, 911 transitions, 9699 flow
[2024-03-09 05:45:03,298 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. 
[2024-03-09 05:45:03,298 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 45 states.
[2024-03-09 05:45:03,301 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 5277 transitions.
[2024-03-09 05:45:03,302 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.6408014571948998
[2024-03-09 05:45:03,302 INFO  L72            ComplementDD]: Start complementDD. Operand 45 states and 5277 transitions.
[2024-03-09 05:45:03,303 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 45 states and 5277 transitions.
[2024-03-09 05:45:03,303 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:45:03,304 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 45 states and 5277 transitions.
[2024-03-09 05:45:03,308 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 46 states, 45 states have (on average 117.26666666666667) internal successors, (5277), 45 states have internal predecessors, (5277), 0 states have call successors, (0), 0 states 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:45:03,312 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 46 states, 46 states have (on average 183.0) internal successors, (8418), 46 states have internal predecessors, (8418), 0 states have call successors, (0), 0 states 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:45:03,312 INFO  L81            ComplementDD]: Finished complementDD. Result  has 46 states, 46 states have (on average 183.0) internal successors, (8418), 46 states have internal predecessors, (8418), 0 states have call successors, (0), 0 states 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:45:03,313 INFO  L175             Difference]: Start difference. First operand has 398 places, 529 transitions, 4429 flow. Second operand 45 states and 5277 transitions.
[2024-03-09 05:45:03,313 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 436 places, 911 transitions, 9699 flow
[2024-03-09 05:45:03,527 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 405 places, 911 transitions, 8796 flow, removed 104 selfloop flow, removed 31 redundant places.
[2024-03-09 05:45:03,535 INFO  L231             Difference]: Finished difference. Result has 414 places, 539 transitions, 4435 flow
[2024-03-09 05:45:03,535 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=3867, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=529, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=127, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=395, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=4435, PETRI_PLACES=414, PETRI_TRANSITIONS=539}
[2024-03-09 05:45:03,536 INFO  L281   CegarLoopForPetriNet]: 175 programPoint places, 239 predicate places.
[2024-03-09 05:45:03,536 INFO  L495      AbstractCegarLoop]: Abstraction has has 414 places, 539 transitions, 4435 flow
[2024-03-09 05:45:03,536 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 24 states, 24 states have (on average 112.08333333333333) internal successors, (2690), 24 states have internal predecessors, (2690), 0 states have call successors, (0), 0 states 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:45:03,536 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:45:03,536 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 05:45:03,542 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0
[2024-03-09 05:45:03,740 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21
[2024-03-09 05:45:03,745 INFO  L420      AbstractCegarLoop]: === Iteration 23 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-09 05:45:03,745 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:45:03,746 INFO  L85        PathProgramCache]: Analyzing trace with hash -284770824, now seen corresponding path program 1 times
[2024-03-09 05:45:03,746 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:45:03,747 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083878489]
[2024-03-09 05:45:03,747 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:45:03,747 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:45:03,765 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:45:04,517 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:45:04,517 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:45:04,517 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083878489]
[2024-03-09 05:45:04,517 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083878489] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 05:45:04,517 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124447955]
[2024-03-09 05:45:04,517 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:45:04,518 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 05:45:04,518 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 05:45:04,518 INFO  L229       MonitoredProcess]: Starting monitored process 9 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 05:45:04,520 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2024-03-09 05:45:04,681 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:45:04,683 INFO  L262         TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 32 conjunts are in the unsatisfiable core
[2024-03-09 05:45:04,688 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 05:45:04,728 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-03-09 05:45:04,839 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-03-09 05:45:04,840 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15
[2024-03-09 05:45:05,312 INFO  L349             Elim1Store]: treesize reduction 19, result has 20.8 percent of original size
[2024-03-09 05:45:05,313 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33
[2024-03-09 05:45:05,461 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:45:05,463 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19
[2024-03-09 05:45:05,500 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2024-03-09 05:45:05,557 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2024-03-09 05:45:05,651 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2024-03-09 05:45:05,730 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:45:05,730 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2024-03-09 05:45:05,800 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:45:05,801 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2024-03-09 05:45:05,884 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:45:05,884 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45
[2024-03-09 05:45:05,910 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:45:05,911 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45
[2024-03-09 05:45:05,946 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:45:05,947 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45
[2024-03-09 05:45:05,969 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:45:05,970 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45
[2024-03-09 05:45:06,021 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45
[2024-03-09 05:45:06,033 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:45:06,033 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-03-09 05:45:06,033 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2124447955] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:45:06,033 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-03-09 05:45:06,033 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [15] total 26
[2024-03-09 05:45:06,034 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619689107]
[2024-03-09 05:45:06,034 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:45:06,034 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2024-03-09 05:45:06,034 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:45:06,034 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2024-03-09 05:45:06,035 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=605, Unknown=0, NotChecked=0, Total=702
[2024-03-09 05:45:07,574 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 133 out of 183
[2024-03-09 05:45:07,575 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 414 places, 539 transitions, 4435 flow. Second operand  has 15 states, 15 states have (on average 135.06666666666666) internal successors, (2026), 15 states have internal predecessors, (2026), 0 states have call successors, (0), 0 states 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:45:07,575 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:45:07,575 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 183
[2024-03-09 05:45:07,575 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:45:10,255 INFO  L124   PetriNetUnfolderBase]: 1409/7438 cut-off events.
[2024-03-09 05:45:10,255 INFO  L125   PetriNetUnfolderBase]: For 20197/20366 co-relation queries the response was YES.
[2024-03-09 05:45:10,292 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21424 conditions, 7438 events. 1409/7438 cut-off events. For 20197/20366 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 81206 event pairs, 130 based on Foata normal form. 77/7114 useless extension candidates. Maximal degree in co-relation 21334. Up to 634 conditions per place. 
[2024-03-09 05:45:10,306 INFO  L140   encePairwiseOnDemand]: 164/183 looper letters, 141 selfloop transitions, 175 changer transitions 72/605 dead transitions.
[2024-03-09 05:45:10,306 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 421 places, 605 transitions, 5803 flow
[2024-03-09 05:45:10,307 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. 
[2024-03-09 05:45:10,307 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 21 states.
[2024-03-09 05:45:10,308 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 2903 transitions.
[2024-03-09 05:45:10,309 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.7553994275305751
[2024-03-09 05:45:10,309 INFO  L72            ComplementDD]: Start complementDD. Operand 21 states and 2903 transitions.
[2024-03-09 05:45:10,309 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 21 states and 2903 transitions.
[2024-03-09 05:45:10,309 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:45:10,309 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 2903 transitions.
[2024-03-09 05:45:10,312 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 22 states, 21 states have (on average 138.23809523809524) internal successors, (2903), 21 states have internal predecessors, (2903), 0 states have call successors, (0), 0 states 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:45:10,327 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 22 states, 22 states have (on average 183.0) internal successors, (4026), 22 states have internal predecessors, (4026), 0 states have call successors, (0), 0 states 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:45:10,327 INFO  L81            ComplementDD]: Finished complementDD. Result  has 22 states, 22 states have (on average 183.0) internal successors, (4026), 22 states have internal predecessors, (4026), 0 states have call successors, (0), 0 states 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:45:10,327 INFO  L175             Difference]: Start difference. First operand has 414 places, 539 transitions, 4435 flow. Second operand 21 states and 2903 transitions.
[2024-03-09 05:45:10,327 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 421 places, 605 transitions, 5803 flow
[2024-03-09 05:45:10,440 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 386 places, 605 transitions, 5425 flow, removed 114 selfloop flow, removed 35 redundant places.
[2024-03-09 05:45:10,446 INFO  L231             Difference]: Finished difference. Result has 389 places, 498 transitions, 4154 flow
[2024-03-09 05:45:10,446 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=4118, PETRI_DIFFERENCE_MINUEND_PLACES=366, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=539, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=175, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=364, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=4154, PETRI_PLACES=389, PETRI_TRANSITIONS=498}
[2024-03-09 05:45:10,446 INFO  L281   CegarLoopForPetriNet]: 175 programPoint places, 214 predicate places.
[2024-03-09 05:45:10,447 INFO  L495      AbstractCegarLoop]: Abstraction has has 389 places, 498 transitions, 4154 flow
[2024-03-09 05:45:10,447 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 15 states, 15 states have (on average 135.06666666666666) internal successors, (2026), 15 states have internal predecessors, (2026), 0 states have call successors, (0), 0 states 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:45:10,447 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:45:10,447 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:10,454 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0
[2024-03-09 05:45:10,648 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22
[2024-03-09 05:45:10,649 INFO  L420      AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-09 05:45:10,650 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:45:10,650 INFO  L85        PathProgramCache]: Analyzing trace with hash -391086566, now seen corresponding path program 1 times
[2024-03-09 05:45:10,650 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:45:10,651 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6696917]
[2024-03-09 05:45:10,651 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:45:10,651 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:45:10,667 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:45:10,803 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:45:10,803 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:45:10,803 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6696917]
[2024-03-09 05:45:10,803 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6696917] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:45:10,803 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:45:10,803 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-03-09 05:45:10,804 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496864488]
[2024-03-09 05:45:10,804 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:45:10,804 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-03-09 05:45:10,804 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:45:10,805 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-03-09 05:45:10,805 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-03-09 05:45:11,018 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 156 out of 183
[2024-03-09 05:45:11,019 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 389 places, 498 transitions, 4154 flow. Second operand  has 8 states, 8 states have (on average 157.625) internal successors, (1261), 8 states have internal predecessors, (1261), 0 states have call successors, (0), 0 states 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:45:11,019 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:45:11,019 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 183
[2024-03-09 05:45:11,019 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:45:12,565 INFO  L124   PetriNetUnfolderBase]: 1960/8873 cut-off events.
[2024-03-09 05:45:12,565 INFO  L125   PetriNetUnfolderBase]: For 17431/17496 co-relation queries the response was YES.
[2024-03-09 05:45:12,602 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23549 conditions, 8873 events. 1960/8873 cut-off events. For 17431/17496 co-relation queries the response was YES. Maximal size of possible extension queue 409. Compared 99192 event pairs, 492 based on Foata normal form. 141/8797 useless extension candidates. Maximal degree in co-relation 23479. Up to 1864 conditions per place. 
[2024-03-09 05:45:12,615 INFO  L140   encePairwiseOnDemand]: 169/183 looper letters, 62 selfloop transitions, 34 changer transitions 0/567 dead transitions.
[2024-03-09 05:45:12,615 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 380 places, 567 transitions, 4534 flow
[2024-03-09 05:45:12,616 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2024-03-09 05:45:12,616 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 15 states.
[2024-03-09 05:45:12,617 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2445 transitions.
[2024-03-09 05:45:12,617 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8907103825136612
[2024-03-09 05:45:12,617 INFO  L72            ComplementDD]: Start complementDD. Operand 15 states and 2445 transitions.
[2024-03-09 05:45:12,618 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 15 states and 2445 transitions.
[2024-03-09 05:45:12,618 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:45:12,618 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2445 transitions.
[2024-03-09 05:45:12,620 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 16 states, 15 states have (on average 163.0) internal successors, (2445), 15 states have internal predecessors, (2445), 0 states have call successors, (0), 0 states 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:45:12,621 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 16 states, 16 states have (on average 183.0) internal successors, (2928), 16 states have internal predecessors, (2928), 0 states have call successors, (0), 0 states 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:45:12,621 INFO  L81            ComplementDD]: Finished complementDD. Result  has 16 states, 16 states have (on average 183.0) internal successors, (2928), 16 states have internal predecessors, (2928), 0 states have call successors, (0), 0 states 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:45:12,621 INFO  L175             Difference]: Start difference. First operand has 389 places, 498 transitions, 4154 flow. Second operand 15 states and 2445 transitions.
[2024-03-09 05:45:12,621 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 380 places, 567 transitions, 4534 flow
[2024-03-09 05:45:12,712 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 567 transitions, 4215 flow, removed 15 selfloop flow, removed 22 redundant places.
[2024-03-09 05:45:12,717 INFO  L231             Difference]: Finished difference. Result has 369 places, 528 transitions, 4086 flow
[2024-03-09 05:45:12,717 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=3835, PETRI_DIFFERENCE_MINUEND_PLACES=344, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=498, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=484, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=4086, PETRI_PLACES=369, PETRI_TRANSITIONS=528}
[2024-03-09 05:45:12,718 INFO  L281   CegarLoopForPetriNet]: 175 programPoint places, 194 predicate places.
[2024-03-09 05:45:12,718 INFO  L495      AbstractCegarLoop]: Abstraction has has 369 places, 528 transitions, 4086 flow
[2024-03-09 05:45:12,718 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 157.625) internal successors, (1261), 8 states have internal predecessors, (1261), 0 states have call successors, (0), 0 states 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:45:12,718 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:45:12,718 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:12,718 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2024-03-09 05:45:12,719 INFO  L420      AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-09 05:45:12,719 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:45:12,719 INFO  L85        PathProgramCache]: Analyzing trace with hash -1673861368, now seen corresponding path program 1 times
[2024-03-09 05:45:12,719 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:45:12,719 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130859689]
[2024-03-09 05:45:12,719 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:45:12,719 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:45:12,733 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:45:12,824 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:45:12,824 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:45:12,824 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130859689]
[2024-03-09 05:45:12,825 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130859689] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:45:12,825 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:45:12,825 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-03-09 05:45:12,825 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738593420]
[2024-03-09 05:45:12,825 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:45:12,825 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-03-09 05:45:12,826 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:45:12,826 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-03-09 05:45:12,827 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-03-09 05:45:12,991 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 158 out of 183
[2024-03-09 05:45:12,993 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 528 transitions, 4086 flow. Second operand  has 7 states, 7 states have (on average 159.71428571428572) internal successors, (1118), 7 states have internal predecessors, (1118), 0 states have call successors, (0), 0 states 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:45:12,993 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:45:12,993 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 183
[2024-03-09 05:45:12,993 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:45:14,977 INFO  L124   PetriNetUnfolderBase]: 2209/10605 cut-off events.
[2024-03-09 05:45:14,977 INFO  L125   PetriNetUnfolderBase]: For 23576/23809 co-relation queries the response was YES.
[2024-03-09 05:45:15,023 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 30842 conditions, 10605 events. 2209/10605 cut-off events. For 23576/23809 co-relation queries the response was YES. Maximal size of possible extension queue 500. Compared 125961 event pairs, 379 based on Foata normal form. 95/10437 useless extension candidates. Maximal degree in co-relation 30768. Up to 1680 conditions per place. 
[2024-03-09 05:45:15,041 INFO  L140   encePairwiseOnDemand]: 170/183 looper letters, 82 selfloop transitions, 36 changer transitions 0/592 dead transitions.
[2024-03-09 05:45:15,041 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 592 transitions, 4700 flow
[2024-03-09 05:45:15,043 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2024-03-09 05:45:15,043 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 15 states.
[2024-03-09 05:45:15,044 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2466 transitions.
[2024-03-09 05:45:15,044 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.898360655737705
[2024-03-09 05:45:15,044 INFO  L72            ComplementDD]: Start complementDD. Operand 15 states and 2466 transitions.
[2024-03-09 05:45:15,045 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 15 states and 2466 transitions.
[2024-03-09 05:45:15,045 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:45:15,045 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2466 transitions.
[2024-03-09 05:45:15,047 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 16 states, 15 states have (on average 164.4) internal successors, (2466), 15 states have internal predecessors, (2466), 0 states have call successors, (0), 0 states 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:45:15,049 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 16 states, 16 states have (on average 183.0) internal successors, (2928), 16 states have internal predecessors, (2928), 0 states have call successors, (0), 0 states 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:45:15,049 INFO  L81            ComplementDD]: Finished complementDD. Result  has 16 states, 16 states have (on average 183.0) internal successors, (2928), 16 states have internal predecessors, (2928), 0 states have call successors, (0), 0 states 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:45:15,049 INFO  L175             Difference]: Start difference. First operand has 369 places, 528 transitions, 4086 flow. Second operand 15 states and 2466 transitions.
[2024-03-09 05:45:15,049 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 592 transitions, 4700 flow
[2024-03-09 05:45:15,173 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 381 places, 592 transitions, 4676 flow, removed 9 selfloop flow, removed 2 redundant places.
[2024-03-09 05:45:15,179 INFO  L231             Difference]: Finished difference. Result has 390 places, 561 transitions, 4438 flow
[2024-03-09 05:45:15,179 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=4066, PETRI_DIFFERENCE_MINUEND_PLACES=367, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=528, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=514, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=4438, PETRI_PLACES=390, PETRI_TRANSITIONS=561}
[2024-03-09 05:45:15,179 INFO  L281   CegarLoopForPetriNet]: 175 programPoint places, 215 predicate places.
[2024-03-09 05:45:15,180 INFO  L495      AbstractCegarLoop]: Abstraction has has 390 places, 561 transitions, 4438 flow
[2024-03-09 05:45:15,180 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 159.71428571428572) internal successors, (1118), 7 states have internal predecessors, (1118), 0 states have call successors, (0), 0 states 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:45:15,180 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:45:15,180 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:15,180 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2024-03-09 05:45:15,180 INFO  L420      AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-09 05:45:15,180 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:45:15,180 INFO  L85        PathProgramCache]: Analyzing trace with hash -1553423610, now seen corresponding path program 1 times
[2024-03-09 05:45:15,181 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:45:15,181 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488554570]
[2024-03-09 05:45:15,181 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:45:15,181 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:45:15,193 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:45:15,306 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:45:15,306 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:45:15,306 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488554570]
[2024-03-09 05:45:15,306 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488554570] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:45:15,306 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:45:15,306 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-03-09 05:45:15,307 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172247151]
[2024-03-09 05:45:15,307 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:45:15,307 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-03-09 05:45:15,307 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:45:15,308 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-03-09 05:45:15,308 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-03-09 05:45:15,462 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 157 out of 183
[2024-03-09 05:45:15,463 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 390 places, 561 transitions, 4438 flow. Second operand  has 7 states, 7 states have (on average 158.71428571428572) internal successors, (1111), 7 states have internal predecessors, (1111), 0 states have call successors, (0), 0 states 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:45:15,463 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:45:15,463 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 183
[2024-03-09 05:45:15,464 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:45:17,525 INFO  L124   PetriNetUnfolderBase]: 2096/10450 cut-off events.
[2024-03-09 05:45:17,526 INFO  L125   PetriNetUnfolderBase]: For 32192/32456 co-relation queries the response was YES.
[2024-03-09 05:45:17,594 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 32300 conditions, 10450 events. 2096/10450 cut-off events. For 32192/32456 co-relation queries the response was YES. Maximal size of possible extension queue 446. Compared 124522 event pairs, 378 based on Foata normal form. 180/10373 useless extension candidates. Maximal degree in co-relation 32217. Up to 1729 conditions per place. 
[2024-03-09 05:45:17,617 INFO  L140   encePairwiseOnDemand]: 170/183 looper letters, 88 selfloop transitions, 45 changer transitions 1/606 dead transitions.
[2024-03-09 05:45:17,617 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 404 places, 606 transitions, 5083 flow
[2024-03-09 05:45:17,618 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2024-03-09 05:45:17,618 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 15 states.
[2024-03-09 05:45:17,620 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2457 transitions.
[2024-03-09 05:45:17,620 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8950819672131147
[2024-03-09 05:45:17,620 INFO  L72            ComplementDD]: Start complementDD. Operand 15 states and 2457 transitions.
[2024-03-09 05:45:17,620 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 15 states and 2457 transitions.
[2024-03-09 05:45:17,621 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:45:17,621 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2457 transitions.
[2024-03-09 05:45:17,623 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 16 states, 15 states have (on average 163.8) internal successors, (2457), 15 states have internal predecessors, (2457), 0 states have call successors, (0), 0 states 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:45:17,624 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 16 states, 16 states have (on average 183.0) internal successors, (2928), 16 states have internal predecessors, (2928), 0 states have call successors, (0), 0 states 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:45:17,624 INFO  L81            ComplementDD]: Finished complementDD. Result  has 16 states, 16 states have (on average 183.0) internal successors, (2928), 16 states have internal predecessors, (2928), 0 states have call successors, (0), 0 states 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:45:17,625 INFO  L175             Difference]: Start difference. First operand has 390 places, 561 transitions, 4438 flow. Second operand 15 states and 2457 transitions.
[2024-03-09 05:45:17,625 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 404 places, 606 transitions, 5083 flow
[2024-03-09 05:45:17,806 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 401 places, 606 transitions, 4947 flow, removed 64 selfloop flow, removed 3 redundant places.
[2024-03-09 05:45:17,812 INFO  L231             Difference]: Finished difference. Result has 405 places, 574 transitions, 4545 flow
[2024-03-09 05:45:17,812 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=4332, PETRI_DIFFERENCE_MINUEND_PLACES=387, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=561, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=529, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=4545, PETRI_PLACES=405, PETRI_TRANSITIONS=574}
[2024-03-09 05:45:17,813 INFO  L281   CegarLoopForPetriNet]: 175 programPoint places, 230 predicate places.
[2024-03-09 05:45:17,813 INFO  L495      AbstractCegarLoop]: Abstraction has has 405 places, 574 transitions, 4545 flow
[2024-03-09 05:45:17,813 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 158.71428571428572) internal successors, (1111), 7 states have internal predecessors, (1111), 0 states have call successors, (0), 0 states 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:45:17,813 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:45:17,813 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:17,813 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2024-03-09 05:45:17,814 INFO  L420      AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-09 05:45:17,814 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:45:17,814 INFO  L85        PathProgramCache]: Analyzing trace with hash -59164576, now seen corresponding path program 1 times
[2024-03-09 05:45:17,814 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:45:17,814 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503612038]
[2024-03-09 05:45:17,814 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:45:17,815 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:45:17,828 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:45:17,852 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2024-03-09 05:45:17,852 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:45:17,852 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503612038]
[2024-03-09 05:45:17,852 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503612038] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:45:17,852 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:45:17,853 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-03-09 05:45:17,853 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039409244]
[2024-03-09 05:45:17,853 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:45:17,853 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 05:45:17,853 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:45:17,854 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 05:45:17,854 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 05:45:17,884 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 173 out of 183
[2024-03-09 05:45:17,884 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 405 places, 574 transitions, 4545 flow. Second operand  has 3 states, 3 states have (on average 174.0) internal successors, (522), 3 states have internal predecessors, (522), 0 states have call successors, (0), 0 states 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:45:17,885 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:45:17,885 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 183
[2024-03-09 05:45:17,885 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:45:19,323 INFO  L124   PetriNetUnfolderBase]: 1421/9009 cut-off events.
[2024-03-09 05:45:19,323 INFO  L125   PetriNetUnfolderBase]: For 29082/29245 co-relation queries the response was YES.
[2024-03-09 05:45:19,371 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27190 conditions, 9009 events. 1421/9009 cut-off events. For 29082/29245 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 108903 event pairs, 124 based on Foata normal form. 106/8925 useless extension candidates. Maximal degree in co-relation 27103. Up to 590 conditions per place. 
[2024-03-09 05:45:19,384 INFO  L140   encePairwiseOnDemand]: 180/183 looper letters, 13 selfloop transitions, 6 changer transitions 0/575 dead transitions.
[2024-03-09 05:45:19,385 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 407 places, 575 transitions, 4585 flow
[2024-03-09 05:45:19,386 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 05:45:19,386 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 05:45:19,386 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 526 transitions.
[2024-03-09 05:45:19,386 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9581056466302368
[2024-03-09 05:45:19,387 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 526 transitions.
[2024-03-09 05:45:19,387 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 526 transitions.
[2024-03-09 05:45:19,387 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:45:19,387 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 526 transitions.
[2024-03-09 05:45:19,387 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 175.33333333333334) internal successors, (526), 3 states have internal predecessors, (526), 0 states have call successors, (0), 0 states 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:45:19,388 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states 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:45:19,388 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states 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:45:19,388 INFO  L175             Difference]: Start difference. First operand has 405 places, 574 transitions, 4545 flow. Second operand 3 states and 526 transitions.
[2024-03-09 05:45:19,388 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 407 places, 575 transitions, 4585 flow
[2024-03-09 05:45:19,557 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 402 places, 575 transitions, 4531 flow, removed 18 selfloop flow, removed 5 redundant places.
[2024-03-09 05:45:19,563 INFO  L231             Difference]: Finished difference. Result has 403 places, 575 transitions, 4515 flow
[2024-03-09 05:45:19,563 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=4491, PETRI_DIFFERENCE_MINUEND_PLACES=400, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=574, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=568, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=4515, PETRI_PLACES=403, PETRI_TRANSITIONS=575}
[2024-03-09 05:45:19,563 INFO  L281   CegarLoopForPetriNet]: 175 programPoint places, 228 predicate places.
[2024-03-09 05:45:19,563 INFO  L495      AbstractCegarLoop]: Abstraction has has 403 places, 575 transitions, 4515 flow
[2024-03-09 05:45:19,564 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 174.0) internal successors, (522), 3 states have internal predecessors, (522), 0 states have call successors, (0), 0 states 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:45:19,564 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:45:19,564 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 05:45:19,564 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2024-03-09 05:45:19,564 INFO  L420      AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-09 05:45:19,564 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:45:19,564 INFO  L85        PathProgramCache]: Analyzing trace with hash 280235922, now seen corresponding path program 1 times
[2024-03-09 05:45:19,564 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:45:19,564 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533500806]
[2024-03-09 05:45:19,565 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:45:19,565 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:45:19,580 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:45:19,662 INFO  L134       CoverageAnalysis]: Checked inductivity of 28 backedges. 17 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked.
[2024-03-09 05:45:19,662 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:45:19,662 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533500806]
[2024-03-09 05:45:19,662 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533500806] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 05:45:19,662 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1043590771]
[2024-03-09 05:45:19,663 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:45:19,663 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 05:45:19,663 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 05:45:19,664 INFO  L229       MonitoredProcess]: Starting monitored process 10 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 05:45:19,665 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process
[2024-03-09 05:45:19,803 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:45:19,804 INFO  L262         TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 6 conjunts are in the unsatisfiable core
[2024-03-09 05:45:19,806 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 05:45:20,052 INFO  L134       CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:45:20,052 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-03-09 05:45:20,053 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1043590771] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:45:20,053 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-03-09 05:45:20,053 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 10
[2024-03-09 05:45:20,053 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198797260]
[2024-03-09 05:45:20,053 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:45:20,054 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-03-09 05:45:20,054 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:45:20,054 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-03-09 05:45:20,055 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2024-03-09 05:45:20,159 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 161 out of 183
[2024-03-09 05:45:20,160 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 403 places, 575 transitions, 4515 flow. Second operand  has 7 states, 7 states have (on average 163.28571428571428) internal successors, (1143), 7 states have internal predecessors, (1143), 0 states have call successors, (0), 0 states 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:45:20,160 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:45:20,160 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 183
[2024-03-09 05:45:20,160 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:45:22,052 INFO  L124   PetriNetUnfolderBase]: 1494/9890 cut-off events.
[2024-03-09 05:45:22,052 INFO  L125   PetriNetUnfolderBase]: For 29879/30176 co-relation queries the response was YES.
[2024-03-09 05:45:22,106 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 30563 conditions, 9890 events. 1494/9890 cut-off events. For 29879/30176 co-relation queries the response was YES. Maximal size of possible extension queue 441. Compared 122549 event pairs, 113 based on Foata normal form. 107/9775 useless extension candidates. Maximal degree in co-relation 30474. Up to 603 conditions per place. 
[2024-03-09 05:45:22,124 INFO  L140   encePairwiseOnDemand]: 171/183 looper letters, 48 selfloop transitions, 90 changer transitions 0/627 dead transitions.
[2024-03-09 05:45:22,124 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 415 places, 627 transitions, 5231 flow
[2024-03-09 05:45:22,125 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2024-03-09 05:45:22,125 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 13 states.
[2024-03-09 05:45:22,126 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2147 transitions.
[2024-03-09 05:45:22,126 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9024800336275746
[2024-03-09 05:45:22,126 INFO  L72            ComplementDD]: Start complementDD. Operand 13 states and 2147 transitions.
[2024-03-09 05:45:22,127 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 13 states and 2147 transitions.
[2024-03-09 05:45:22,127 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:45:22,127 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2147 transitions.
[2024-03-09 05:45:22,129 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 14 states, 13 states have (on average 165.15384615384616) internal successors, (2147), 13 states have internal predecessors, (2147), 0 states have call successors, (0), 0 states 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:45:22,130 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 14 states, 14 states have (on average 183.0) internal successors, (2562), 14 states have internal predecessors, (2562), 0 states have call successors, (0), 0 states 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:45:22,130 INFO  L81            ComplementDD]: Finished complementDD. Result  has 14 states, 14 states have (on average 183.0) internal successors, (2562), 14 states have internal predecessors, (2562), 0 states have call successors, (0), 0 states 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:45:22,130 INFO  L175             Difference]: Start difference. First operand has 403 places, 575 transitions, 4515 flow. Second operand 13 states and 2147 transitions.
[2024-03-09 05:45:22,130 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 415 places, 627 transitions, 5231 flow
[2024-03-09 05:45:22,320 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 414 places, 627 transitions, 5225 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-09 05:45:22,326 INFO  L231             Difference]: Finished difference. Result has 421 places, 612 transitions, 5124 flow
[2024-03-09 05:45:22,327 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=4509, PETRI_DIFFERENCE_MINUEND_PLACES=402, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=575, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=514, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=5124, PETRI_PLACES=421, PETRI_TRANSITIONS=612}
[2024-03-09 05:45:22,327 INFO  L281   CegarLoopForPetriNet]: 175 programPoint places, 246 predicate places.
[2024-03-09 05:45:22,327 INFO  L495      AbstractCegarLoop]: Abstraction has has 421 places, 612 transitions, 5124 flow
[2024-03-09 05:45:22,328 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 163.28571428571428) internal successors, (1143), 7 states have internal predecessors, (1143), 0 states have call successors, (0), 0 states 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:45:22,328 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:45:22,328 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 05:45:22,335 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0
[2024-03-09 05:45:22,528 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27
[2024-03-09 05:45:22,529 INFO  L420      AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-09 05:45:22,530 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:45:22,530 INFO  L85        PathProgramCache]: Analyzing trace with hash -881120131, now seen corresponding path program 1 times
[2024-03-09 05:45:22,531 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:45:22,531 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987661392]
[2024-03-09 05:45:22,531 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:45:22,531 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:45:22,550 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:45:22,645 INFO  L134       CoverageAnalysis]: Checked inductivity of 29 backedges. 17 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:45:22,645 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:45:22,645 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987661392]
[2024-03-09 05:45:22,646 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987661392] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 05:45:22,646 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1776786255]
[2024-03-09 05:45:22,646 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:45:22,646 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 05:45:22,646 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 05:45:22,647 INFO  L229       MonitoredProcess]: Starting monitored process 11 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 05:45:22,648 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process
[2024-03-09 05:45:22,791 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:45:22,792 INFO  L262         TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 7 conjunts are in the unsatisfiable core
[2024-03-09 05:45:22,794 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 05:45:23,064 INFO  L134       CoverageAnalysis]: Checked inductivity of 29 backedges. 17 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:45:23,065 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 05:45:23,338 INFO  L134       CoverageAnalysis]: Checked inductivity of 29 backedges. 17 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:45:23,339 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1776786255] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 05:45:23,339 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 05:45:23,339 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11
[2024-03-09 05:45:23,339 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002201914]
[2024-03-09 05:45:23,339 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 05:45:23,340 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-03-09 05:45:23,340 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:45:23,341 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-03-09 05:45:23,341 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110
[2024-03-09 05:45:23,577 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 163 out of 183
[2024-03-09 05:45:23,578 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 421 places, 612 transitions, 5124 flow. Second operand  has 11 states, 11 states have (on average 165.0) internal successors, (1815), 11 states have internal predecessors, (1815), 0 states have call successors, (0), 0 states 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:45:23,579 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:45:23,579 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 183
[2024-03-09 05:45:23,579 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:45:25,605 INFO  L124   PetriNetUnfolderBase]: 1527/10399 cut-off events.
[2024-03-09 05:45:25,605 INFO  L125   PetriNetUnfolderBase]: For 36378/36764 co-relation queries the response was YES.
[2024-03-09 05:45:25,681 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 33761 conditions, 10399 events. 1527/10399 cut-off events. For 36378/36764 co-relation queries the response was YES. Maximal size of possible extension queue 483. Compared 131563 event pairs, 119 based on Foata normal form. 77/10217 useless extension candidates. Maximal degree in co-relation 33665. Up to 997 conditions per place. 
[2024-03-09 05:45:25,706 INFO  L140   encePairwiseOnDemand]: 173/183 looper letters, 102 selfloop transitions, 27 changer transitions 0/631 dead transitions.
[2024-03-09 05:45:25,706 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 430 places, 631 transitions, 5558 flow
[2024-03-09 05:45:25,707 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-03-09 05:45:25,707 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-03-09 05:45:25,708 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1671 transitions.
[2024-03-09 05:45:25,708 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9131147540983606
[2024-03-09 05:45:25,709 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 1671 transitions.
[2024-03-09 05:45:25,709 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 1671 transitions.
[2024-03-09 05:45:25,709 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:45:25,709 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1671 transitions.
[2024-03-09 05:45:25,710 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 11 states, 10 states have (on average 167.1) internal successors, (1671), 10 states have internal predecessors, (1671), 0 states have call successors, (0), 0 states 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:45:25,711 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 11 states, 11 states have (on average 183.0) internal successors, (2013), 11 states have internal predecessors, (2013), 0 states have call successors, (0), 0 states 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:45:25,711 INFO  L81            ComplementDD]: Finished complementDD. Result  has 11 states, 11 states have (on average 183.0) internal successors, (2013), 11 states have internal predecessors, (2013), 0 states have call successors, (0), 0 states 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:45:25,712 INFO  L175             Difference]: Start difference. First operand has 421 places, 612 transitions, 5124 flow. Second operand 10 states and 1671 transitions.
[2024-03-09 05:45:25,712 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 430 places, 631 transitions, 5558 flow
[2024-03-09 05:45:25,963 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 426 places, 631 transitions, 5510 flow, removed 16 selfloop flow, removed 4 redundant places.
[2024-03-09 05:45:25,969 INFO  L231             Difference]: Finished difference. Result has 431 places, 620 transitions, 5277 flow
[2024-03-09 05:45:25,970 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=5048, PETRI_DIFFERENCE_MINUEND_PLACES=417, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=608, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=583, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5277, PETRI_PLACES=431, PETRI_TRANSITIONS=620}
[2024-03-09 05:45:25,970 INFO  L281   CegarLoopForPetriNet]: 175 programPoint places, 256 predicate places.
[2024-03-09 05:45:25,970 INFO  L495      AbstractCegarLoop]: Abstraction has has 431 places, 620 transitions, 5277 flow
[2024-03-09 05:45:25,971 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 165.0) internal successors, (1815), 11 states have internal predecessors, (1815), 0 states have call successors, (0), 0 states 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:45:25,971 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:45:25,971 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 05:45:25,978 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0
[2024-03-09 05:45:26,171 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28
[2024-03-09 05:45:26,172 INFO  L420      AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-09 05:45:26,173 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:45:26,173 INFO  L85        PathProgramCache]: Analyzing trace with hash -1288814347, now seen corresponding path program 1 times
[2024-03-09 05:45:26,173 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:45:26,173 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379370444]
[2024-03-09 05:45:26,174 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:45:26,174 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:45:26,200 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-09 05:45:26,200 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-03-09 05:45:26,210 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-09 05:45:26,231 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-03-09 05:45:26,232 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-03-09 05:45:26,232 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 18 remaining)
[2024-03-09 05:45:26,233 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (16 of 18 remaining)
[2024-03-09 05:45:26,234 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (15 of 18 remaining)
[2024-03-09 05:45:26,234 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (14 of 18 remaining)
[2024-03-09 05:45:26,234 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (13 of 18 remaining)
[2024-03-09 05:45:26,234 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (12 of 18 remaining)
[2024-03-09 05:45:26,234 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (11 of 18 remaining)
[2024-03-09 05:45:26,234 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (10 of 18 remaining)
[2024-03-09 05:45:26,234 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (9 of 18 remaining)
[2024-03-09 05:45:26,234 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (8 of 18 remaining)
[2024-03-09 05:45:26,234 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (7 of 18 remaining)
[2024-03-09 05:45:26,234 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (6 of 18 remaining)
[2024-03-09 05:45:26,234 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (5 of 18 remaining)
[2024-03-09 05:45:26,235 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (4 of 18 remaining)
[2024-03-09 05:45:26,235 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 18 remaining)
[2024-03-09 05:45:26,235 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 18 remaining)
[2024-03-09 05:45:26,235 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (1 of 18 remaining)
[2024-03-09 05:45:26,235 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (0 of 18 remaining)
[2024-03-09 05:45:26,235 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2024-03-09 05:45:26,235 INFO  L445         BasicCegarLoop]: Path program histogram: [6, 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:45:26,237 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-03-09 05:45:26,237 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2024-03-09 05:45:26,257 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2024-03-09 05:45:26,260 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 220 places, 230 transitions, 476 flow
[2024-03-09 05:45:26,298 INFO  L124   PetriNetUnfolderBase]: 27/455 cut-off events.
[2024-03-09 05:45:26,298 INFO  L125   PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES.
[2024-03-09 05:45:26,299 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 467 conditions, 455 events. 27/455 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1197 event pairs, 0 based on Foata normal form. 0/387 useless extension candidates. Maximal degree in co-relation 270. Up to 9 conditions per place. 
[2024-03-09 05:45:26,299 INFO  L82        GeneralOperation]: Start removeDead. Operand has 220 places, 230 transitions, 476 flow
[2024-03-09 05:45:26,302 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 220 places, 230 transitions, 476 flow
[2024-03-09 05:45:26,303 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-09 05:45:26,303 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;@4e978215, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-03-09 05:45:26,303 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 22 error locations.
[2024-03-09 05:45:26,306 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-03-09 05:45:26,306 INFO  L124   PetriNetUnfolderBase]: 2/34 cut-off events.
[2024-03-09 05:45:26,306 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-03-09 05:45:26,306 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:45:26,306 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]
[2024-03-09 05:45:26,306 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:45:26,306 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:45:26,306 INFO  L85        PathProgramCache]: Analyzing trace with hash -2033249673, now seen corresponding path program 1 times
[2024-03-09 05:45:26,306 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:45:26,307 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331626354]
[2024-03-09 05:45:26,307 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:45:26,307 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:45:26,313 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:45:26,324 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:45:26,325 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:45:26,325 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331626354]
[2024-03-09 05:45:26,325 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331626354] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:45:26,325 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:45:26,325 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-09 05:45:26,325 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406237493]
[2024-03-09 05:45:26,325 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:45:26,325 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 05:45:26,326 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:45:26,326 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 05:45:26,326 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 05:45:26,353 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 212 out of 230
[2024-03-09 05:45:26,354 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 230 transitions, 476 flow. Second operand  has 3 states, 3 states have (on average 213.33333333333334) internal successors, (640), 3 states have internal predecessors, (640), 0 states have call successors, (0), 0 states 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:45:26,354 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:45:26,354 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 230
[2024-03-09 05:45:26,354 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:45:26,481 INFO  L124   PetriNetUnfolderBase]: 67/976 cut-off events.
[2024-03-09 05:45:26,482 INFO  L125   PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES.
[2024-03-09 05:45:26,484 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1045 conditions, 976 events. 67/976 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 4482 event pairs, 16 based on Foata normal form. 11/836 useless extension candidates. Maximal degree in co-relation 607. Up to 50 conditions per place. 
[2024-03-09 05:45:26,486 INFO  L140   encePairwiseOnDemand]: 223/230 looper letters, 11 selfloop transitions, 2 changer transitions 2/225 dead transitions.
[2024-03-09 05:45:26,486 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 225 transitions, 492 flow
[2024-03-09 05:45:26,487 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 05:45:26,487 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 05:45:26,487 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 654 transitions.
[2024-03-09 05:45:26,488 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9478260869565217
[2024-03-09 05:45:26,488 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 654 transitions.
[2024-03-09 05:45:26,488 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 654 transitions.
[2024-03-09 05:45:26,488 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:45:26,488 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 654 transitions.
[2024-03-09 05:45:26,489 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 218.0) internal successors, (654), 3 states have internal predecessors, (654), 0 states have call successors, (0), 0 states 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:45:26,489 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 230.0) internal successors, (920), 4 states have internal predecessors, (920), 0 states have call successors, (0), 0 states 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:45:26,489 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 230.0) internal successors, (920), 4 states have internal predecessors, (920), 0 states have call successors, (0), 0 states 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:45:26,489 INFO  L175             Difference]: Start difference. First operand has 220 places, 230 transitions, 476 flow. Second operand 3 states and 654 transitions.
[2024-03-09 05:45:26,489 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 225 transitions, 492 flow
[2024-03-09 05:45:26,491 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 225 transitions, 492 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-09 05:45:26,493 INFO  L231             Difference]: Finished difference. Result has 221 places, 223 transitions, 466 flow
[2024-03-09 05:45:26,493 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=466, PETRI_PLACES=221, PETRI_TRANSITIONS=223}
[2024-03-09 05:45:26,493 INFO  L281   CegarLoopForPetriNet]: 220 programPoint places, 1 predicate places.
[2024-03-09 05:45:26,494 INFO  L495      AbstractCegarLoop]: Abstraction has has 221 places, 223 transitions, 466 flow
[2024-03-09 05:45:26,494 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 213.33333333333334) internal successors, (640), 3 states have internal predecessors, (640), 0 states have call successors, (0), 0 states 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:45:26,494 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:45:26,494 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:45:26,494 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2024-03-09 05:45:26,494 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:45:26,495 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:45:26,495 INFO  L85        PathProgramCache]: Analyzing trace with hash 1952605300, now seen corresponding path program 1 times
[2024-03-09 05:45:26,495 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:45:26,495 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576568025]
[2024-03-09 05:45:26,495 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:45:26,495 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:45:26,501 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:45:26,512 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:45:26,512 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:45:26,512 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576568025]
[2024-03-09 05:45:26,512 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576568025] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:45:26,512 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:45:26,513 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-09 05:45:26,513 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882687332]
[2024-03-09 05:45:26,513 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:45:26,513 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 05:45:26,513 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:45:26,514 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 05:45:26,514 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 05:45:26,546 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 207 out of 230
[2024-03-09 05:45:26,547 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 223 transitions, 466 flow. Second operand  has 3 states, 3 states have (on average 207.66666666666666) internal successors, (623), 3 states have internal predecessors, (623), 0 states have call successors, (0), 0 states 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:45:26,547 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:45:26,547 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 230
[2024-03-09 05:45:26,547 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:45:26,848 INFO  L124   PetriNetUnfolderBase]: 486/3131 cut-off events.
[2024-03-09 05:45:26,848 INFO  L125   PetriNetUnfolderBase]: For 87/87 co-relation queries the response was YES.
[2024-03-09 05:45:26,856 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3698 conditions, 3131 events. 486/3131 cut-off events. For 87/87 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 25851 event pairs, 113 based on Foata normal form. 0/2650 useless extension candidates. Maximal degree in co-relation 3658. Up to 322 conditions per place. 
[2024-03-09 05:45:26,862 INFO  L140   encePairwiseOnDemand]: 215/230 looper letters, 22 selfloop transitions, 11 changer transitions 0/237 dead transitions.
[2024-03-09 05:45:26,862 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 237 transitions, 571 flow
[2024-03-09 05:45:26,863 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 05:45:26,863 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 05:45:26,863 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 658 transitions.
[2024-03-09 05:45:26,864 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9536231884057971
[2024-03-09 05:45:26,864 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 658 transitions.
[2024-03-09 05:45:26,864 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 658 transitions.
[2024-03-09 05:45:26,864 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:45:26,864 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 658 transitions.
[2024-03-09 05:45:26,865 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 219.33333333333334) internal successors, (658), 3 states have internal predecessors, (658), 0 states have call successors, (0), 0 states 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:45:26,865 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 230.0) internal successors, (920), 4 states have internal predecessors, (920), 0 states have call successors, (0), 0 states 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:45:26,865 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 230.0) internal successors, (920), 4 states have internal predecessors, (920), 0 states have call successors, (0), 0 states 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:45:26,865 INFO  L175             Difference]: Start difference. First operand has 221 places, 223 transitions, 466 flow. Second operand 3 states and 658 transitions.
[2024-03-09 05:45:26,865 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 237 transitions, 571 flow
[2024-03-09 05:45:26,866 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 237 transitions, 567 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-09 05:45:26,868 INFO  L231             Difference]: Finished difference. Result has 221 places, 234 transitions, 558 flow
[2024-03-09 05:45:26,868 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=558, PETRI_PLACES=221, PETRI_TRANSITIONS=234}
[2024-03-09 05:45:26,868 INFO  L281   CegarLoopForPetriNet]: 220 programPoint places, 1 predicate places.
[2024-03-09 05:45:26,869 INFO  L495      AbstractCegarLoop]: Abstraction has has 221 places, 234 transitions, 558 flow
[2024-03-09 05:45:26,869 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 207.66666666666666) internal successors, (623), 3 states have internal predecessors, (623), 0 states have call successors, (0), 0 states 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:45:26,869 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:45:26,869 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:45:26,869 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2024-03-09 05:45:26,869 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-09 05:45:26,869 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:45:26,869 INFO  L85        PathProgramCache]: Analyzing trace with hash 1119439621, now seen corresponding path program 1 times
[2024-03-09 05:45:26,869 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:45:26,869 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604538584]
[2024-03-09 05:45:26,870 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:45:26,870 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:45:26,876 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:45:26,919 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:45:26,920 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:45:26,920 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604538584]
[2024-03-09 05:45:26,920 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604538584] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:45:26,920 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:45:26,920 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 05:45:26,920 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142145696]
[2024-03-09 05:45:26,920 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:45:26,921 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-03-09 05:45:26,921 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:45:26,921 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-03-09 05:45:26,922 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-03-09 05:45:27,005 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 211 out of 230
[2024-03-09 05:45:27,007 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 234 transitions, 558 flow. Second operand  has 5 states, 5 states have (on average 212.4) internal successors, (1062), 5 states have internal predecessors, (1062), 0 states have call successors, (0), 0 states 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:45:27,007 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:45:27,007 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 230
[2024-03-09 05:45:27,007 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:45:27,288 INFO  L124   PetriNetUnfolderBase]: 459/3065 cut-off events.
[2024-03-09 05:45:27,288 INFO  L125   PetriNetUnfolderBase]: For 229/279 co-relation queries the response was YES.
[2024-03-09 05:45:27,297 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3850 conditions, 3065 events. 459/3065 cut-off events. For 229/279 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 25189 event pairs, 107 based on Foata normal form. 2/2661 useless extension candidates. Maximal degree in co-relation 1323. Up to 307 conditions per place. 
[2024-03-09 05:45:27,304 INFO  L140   encePairwiseOnDemand]: 222/230 looper letters, 14 selfloop transitions, 6 changer transitions 1/240 dead transitions.
[2024-03-09 05:45:27,305 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 240 transitions, 612 flow
[2024-03-09 05:45:27,305 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 05:45:27,306 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 05:45:27,306 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1288 transitions.
[2024-03-09 05:45:27,306 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9333333333333333
[2024-03-09 05:45:27,307 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 1288 transitions.
[2024-03-09 05:45:27,307 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 1288 transitions.
[2024-03-09 05:45:27,307 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:45:27,307 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1288 transitions.
[2024-03-09 05:45:27,308 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 214.66666666666666) internal successors, (1288), 6 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states 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:45:27,309 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 230.0) internal successors, (1610), 7 states have internal predecessors, (1610), 0 states have call successors, (0), 0 states 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:45:27,309 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 230.0) internal successors, (1610), 7 states have internal predecessors, (1610), 0 states have call successors, (0), 0 states 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:45:27,309 INFO  L175             Difference]: Start difference. First operand has 221 places, 234 transitions, 558 flow. Second operand 6 states and 1288 transitions.
[2024-03-09 05:45:27,309 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 240 transitions, 612 flow
[2024-03-09 05:45:27,311 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 240 transitions, 590 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-09 05:45:27,313 INFO  L231             Difference]: Finished difference. Result has 228 places, 239 transitions, 582 flow
[2024-03-09 05:45:27,313 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=582, PETRI_PLACES=228, PETRI_TRANSITIONS=239}
[2024-03-09 05:45:27,314 INFO  L281   CegarLoopForPetriNet]: 220 programPoint places, 8 predicate places.
[2024-03-09 05:45:27,314 INFO  L495      AbstractCegarLoop]: Abstraction has has 228 places, 239 transitions, 582 flow
[2024-03-09 05:45:27,314 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 212.4) internal successors, (1062), 5 states have internal predecessors, (1062), 0 states have call successors, (0), 0 states 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:45:27,314 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:45:27,314 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]
[2024-03-09 05:45:27,314 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2024-03-09 05:45:27,314 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-09 05:45:27,314 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:45:27,315 INFO  L85        PathProgramCache]: Analyzing trace with hash 96307507, now seen corresponding path program 1 times
[2024-03-09 05:45:27,315 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:45:27,315 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354197734]
[2024-03-09 05:45:27,315 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:45:27,315 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:45:27,322 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:45:27,450 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:45:27,450 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:45:27,450 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354197734]
[2024-03-09 05:45:27,451 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354197734] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:45:27,451 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:45:27,451 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 05:45:27,451 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212027288]
[2024-03-09 05:45:27,451 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:45:27,451 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 05:45:27,452 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:45:27,452 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 05:45:27,452 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 05:45:27,683 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 192 out of 230
[2024-03-09 05:45:27,684 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 239 transitions, 582 flow. Second operand  has 6 states, 6 states have (on average 193.16666666666666) internal successors, (1159), 6 states have internal predecessors, (1159), 0 states have call successors, (0), 0 states 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:45:27,684 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:45:27,685 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 230
[2024-03-09 05:45:27,685 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:45:29,550 INFO  L124   PetriNetUnfolderBase]: 3950/17927 cut-off events.
[2024-03-09 05:45:29,550 INFO  L125   PetriNetUnfolderBase]: For 277/291 co-relation queries the response was YES.
[2024-03-09 05:45:29,610 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 24213 conditions, 17927 events. 3950/17927 cut-off events. For 277/291 co-relation queries the response was YES. Maximal size of possible extension queue 474. Compared 213252 event pairs, 575 based on Foata normal form. 12/15595 useless extension candidates. Maximal degree in co-relation 24069. Up to 2931 conditions per place. 
[2024-03-09 05:45:29,661 INFO  L140   encePairwiseOnDemand]: 203/230 looper letters, 46 selfloop transitions, 48 changer transitions 0/299 dead transitions.
[2024-03-09 05:45:29,662 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 299 transitions, 901 flow
[2024-03-09 05:45:29,662 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 05:45:29,662 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 05:45:29,663 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1249 transitions.
[2024-03-09 05:45:29,663 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9050724637681159
[2024-03-09 05:45:29,663 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 1249 transitions.
[2024-03-09 05:45:29,664 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 1249 transitions.
[2024-03-09 05:45:29,664 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:45:29,664 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1249 transitions.
[2024-03-09 05:45:29,665 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 208.16666666666666) internal successors, (1249), 6 states have internal predecessors, (1249), 0 states have call successors, (0), 0 states 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:45:29,666 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 230.0) internal successors, (1610), 7 states have internal predecessors, (1610), 0 states have call successors, (0), 0 states 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:45:29,666 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 230.0) internal successors, (1610), 7 states have internal predecessors, (1610), 0 states have call successors, (0), 0 states 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:45:29,666 INFO  L175             Difference]: Start difference. First operand has 228 places, 239 transitions, 582 flow. Second operand 6 states and 1249 transitions.
[2024-03-09 05:45:29,666 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 299 transitions, 901 flow
[2024-03-09 05:45:29,669 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 299 transitions, 899 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-09 05:45:29,672 INFO  L231             Difference]: Finished difference. Result has 237 places, 287 transitions, 922 flow
[2024-03-09 05:45:29,672 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=580, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=922, PETRI_PLACES=237, PETRI_TRANSITIONS=287}
[2024-03-09 05:45:29,672 INFO  L281   CegarLoopForPetriNet]: 220 programPoint places, 17 predicate places.
[2024-03-09 05:45:29,672 INFO  L495      AbstractCegarLoop]: Abstraction has has 237 places, 287 transitions, 922 flow
[2024-03-09 05:45:29,673 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 193.16666666666666) internal successors, (1159), 6 states have internal predecessors, (1159), 0 states have call successors, (0), 0 states 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:45:29,673 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:45:29,673 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]
[2024-03-09 05:45:29,673 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2024-03-09 05:45:29,673 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-09 05:45:29,673 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:45:29,673 INFO  L85        PathProgramCache]: Analyzing trace with hash 1838169526, now seen corresponding path program 1 times
[2024-03-09 05:45:29,673 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:45:29,673 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127030129]
[2024-03-09 05:45:29,673 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:45:29,674 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:45:29,681 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:45:29,692 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:45:29,692 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:45:29,693 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127030129]
[2024-03-09 05:45:29,693 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127030129] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:45:29,693 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:45:29,693 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-09 05:45:29,693 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815541844]
[2024-03-09 05:45:29,693 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:45:29,693 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 05:45:29,693 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:45:29,694 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 05:45:29,694 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 05:45:29,708 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 212 out of 230
[2024-03-09 05:45:29,709 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 287 transitions, 922 flow. Second operand  has 3 states, 3 states have (on average 213.0) internal successors, (639), 3 states have internal predecessors, (639), 0 states have call successors, (0), 0 states 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:45:29,709 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:45:29,709 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 230
[2024-03-09 05:45:29,709 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:45:30,286 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([516] L1056-5-->L1056-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[][156], [Black: 245#true, Black: 229#(= |#race~threads_mask~0| 0), 259#(= |#race~datas~0| 0), Black: 235#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 236#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), Black: 239#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 156#L1056-6true, Black: 237#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 250#(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)), 31#L1040-10true, 207#L1040-8true, threadThread1of2ForFork0InUse, Black: 248#(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: 247#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), threadThread2of2ForFork0InUse, Black: 249#(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))])
[2024-03-09 05:45:30,286 INFO  L294   olderBase$Statistics]: this new event has 138 ancestors and is not cut-off event
[2024-03-09 05:45:30,286 INFO  L297   olderBase$Statistics]:   existing Event has 138 ancestors and is not cut-off event
[2024-03-09 05:45:30,286 INFO  L297   olderBase$Statistics]:   existing Event has 138 ancestors and is not cut-off event
[2024-03-09 05:45:30,286 INFO  L297   olderBase$Statistics]:   existing Event has 138 ancestors and is not cut-off event
[2024-03-09 05:45:31,746 INFO  L124   PetriNetUnfolderBase]: 3994/19706 cut-off events.
[2024-03-09 05:45:31,746 INFO  L125   PetriNetUnfolderBase]: For 1588/1594 co-relation queries the response was YES.
[2024-03-09 05:45:31,790 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 29102 conditions, 19706 events. 3994/19706 cut-off events. For 1588/1594 co-relation queries the response was YES. Maximal size of possible extension queue 515. Compared 245797 event pairs, 513 based on Foata normal form. 0/17311 useless extension candidates. Maximal degree in co-relation 13273. Up to 2268 conditions per place. 
[2024-03-09 05:45:31,829 INFO  L140   encePairwiseOnDemand]: 224/230 looper letters, 12 selfloop transitions, 3 changer transitions 4/288 dead transitions.
[2024-03-09 05:45:31,829 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 288 transitions, 959 flow
[2024-03-09 05:45:31,830 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 05:45:31,830 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 05:45:31,830 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 654 transitions.
[2024-03-09 05:45:31,830 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9478260869565217
[2024-03-09 05:45:31,831 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 654 transitions.
[2024-03-09 05:45:31,831 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 654 transitions.
[2024-03-09 05:45:31,831 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:45:31,831 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 654 transitions.
[2024-03-09 05:45:31,832 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 218.0) internal successors, (654), 3 states have internal predecessors, (654), 0 states have call successors, (0), 0 states 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:45:31,832 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 230.0) internal successors, (920), 4 states have internal predecessors, (920), 0 states have call successors, (0), 0 states 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:45:31,832 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 230.0) internal successors, (920), 4 states have internal predecessors, (920), 0 states have call successors, (0), 0 states 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:45:31,832 INFO  L175             Difference]: Start difference. First operand has 237 places, 287 transitions, 922 flow. Second operand 3 states and 654 transitions.
[2024-03-09 05:45:31,832 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 288 transitions, 959 flow
[2024-03-09 05:45:31,845 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 288 transitions, 959 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-09 05:45:31,847 INFO  L231             Difference]: Finished difference. Result has 237 places, 283 transitions, 913 flow
[2024-03-09 05:45:31,847 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=916, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=913, PETRI_PLACES=237, PETRI_TRANSITIONS=283}
[2024-03-09 05:45:31,847 INFO  L281   CegarLoopForPetriNet]: 220 programPoint places, 17 predicate places.
[2024-03-09 05:45:31,847 INFO  L495      AbstractCegarLoop]: Abstraction has has 237 places, 283 transitions, 913 flow
[2024-03-09 05:45:31,848 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 213.0) internal successors, (639), 3 states have internal predecessors, (639), 0 states have call successors, (0), 0 states 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:45:31,848 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:45:31,848 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:45:31,848 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2024-03-09 05:45:31,848 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-09 05:45:31,848 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:45:31,848 INFO  L85        PathProgramCache]: Analyzing trace with hash -917359253, now seen corresponding path program 1 times
[2024-03-09 05:45:31,848 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:45:31,848 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798157666]
[2024-03-09 05:45:31,848 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:45:31,848 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:45:31,854 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:45:31,882 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:45:31,882 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:45:31,882 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798157666]
[2024-03-09 05:45:31,882 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798157666] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:45:31,883 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:45:31,883 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-03-09 05:45:31,883 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292015803]
[2024-03-09 05:45:31,883 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:45:31,883 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-03-09 05:45:31,883 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:45:31,883 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-03-09 05:45:31,883 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-03-09 05:45:31,967 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 212 out of 230
[2024-03-09 05:45:31,967 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 283 transitions, 913 flow. Second operand  has 4 states, 4 states have (on average 213.25) internal successors, (853), 4 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:45:31,967 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:45:31,967 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 230
[2024-03-09 05:45:31,967 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:45:32,341 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([516] L1056-5-->L1056-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[][149], [Black: 245#true, Black: 257#true, 262#true, Black: 229#(= |#race~threads_mask~0| 0), 259#(= |#race~datas~0| 0), Black: 235#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 236#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), Black: 239#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 156#L1056-6true, Black: 237#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 250#(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)), 31#L1040-10true, 207#L1040-8true, threadThread1of2ForFork0InUse, Black: 248#(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: 247#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), threadThread2of2ForFork0InUse, Black: 249#(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))])
[2024-03-09 05:45:32,341 INFO  L294   olderBase$Statistics]: this new event has 138 ancestors and is not cut-off event
[2024-03-09 05:45:32,341 INFO  L297   olderBase$Statistics]:   existing Event has 138 ancestors and is not cut-off event
[2024-03-09 05:45:32,341 INFO  L297   olderBase$Statistics]:   existing Event has 138 ancestors and is not cut-off event
[2024-03-09 05:45:32,341 INFO  L297   olderBase$Statistics]:   existing Event has 138 ancestors and is not cut-off event
[2024-03-09 05:45:32,353 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([607] L1058-5-->L1058-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[][161], [Black: 245#true, 18#L1058-6true, Black: 257#true, 262#true, Black: 229#(= |#race~threads_mask~0| 0), 259#(= |#race~datas~0| 0), Black: 235#(= |ULTIMATE.start_main_~i~0#1| 0), 106#L1040-9true, Black: 236#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), Black: 239#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 237#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 250#(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)), 207#L1040-8true, threadThread1of2ForFork0InUse, Black: 248#(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: 247#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), threadThread2of2ForFork0InUse, Black: 249#(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))])
[2024-03-09 05:45:32,353 INFO  L294   olderBase$Statistics]: this new event has 138 ancestors and is not cut-off event
[2024-03-09 05:45:32,353 INFO  L297   olderBase$Statistics]:   existing Event has 138 ancestors and is not cut-off event
[2024-03-09 05:45:32,353 INFO  L297   olderBase$Statistics]:   existing Event has 138 ancestors and is not cut-off event
[2024-03-09 05:45:32,353 INFO  L297   olderBase$Statistics]:   existing Event has 138 ancestors and is not cut-off event
[2024-03-09 05:45:32,380 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([607] L1058-5-->L1058-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[][161], [Black: 245#true, 18#L1058-6true, Black: 257#true, 262#true, Black: 229#(= |#race~threads_mask~0| 0), 259#(= |#race~datas~0| 0), Black: 235#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 236#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), Black: 239#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 237#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 250#(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)), 31#L1040-10true, 207#L1040-8true, threadThread1of2ForFork0InUse, Black: 248#(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: 247#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), threadThread2of2ForFork0InUse, Black: 249#(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))])
[2024-03-09 05:45:32,380 INFO  L294   olderBase$Statistics]: this new event has 139 ancestors and is not cut-off event
[2024-03-09 05:45:32,380 INFO  L297   olderBase$Statistics]:   existing Event has 139 ancestors and is not cut-off event
[2024-03-09 05:45:32,380 INFO  L297   olderBase$Statistics]:   existing Event has 139 ancestors and is not cut-off event
[2024-03-09 05:45:32,380 INFO  L297   olderBase$Statistics]:   existing Event has 139 ancestors and is not cut-off event
[2024-03-09 05:45:33,631 INFO  L124   PetriNetUnfolderBase]: 3593/17694 cut-off events.
[2024-03-09 05:45:33,631 INFO  L125   PetriNetUnfolderBase]: For 1645/1651 co-relation queries the response was YES.
[2024-03-09 05:45:33,700 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27377 conditions, 17694 events. 3593/17694 cut-off events. For 1645/1651 co-relation queries the response was YES. Maximal size of possible extension queue 448. Compared 216323 event pairs, 574 based on Foata normal form. 1/15667 useless extension candidates. Maximal degree in co-relation 25638. Up to 2005 conditions per place. 
[2024-03-09 05:45:33,748 INFO  L140   encePairwiseOnDemand]: 226/230 looper letters, 15 selfloop transitions, 4 changer transitions 0/288 dead transitions.
[2024-03-09 05:45:33,749 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 288 transitions, 961 flow
[2024-03-09 05:45:33,749 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-03-09 05:45:33,749 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-03-09 05:45:33,750 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 868 transitions.
[2024-03-09 05:45:33,750 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9434782608695652
[2024-03-09 05:45:33,750 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 868 transitions.
[2024-03-09 05:45:33,750 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 868 transitions.
[2024-03-09 05:45:33,750 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:45:33,750 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 868 transitions.
[2024-03-09 05:45:33,751 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states 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:45:33,752 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 230.0) internal successors, (1150), 5 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states 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:45:33,752 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 230.0) internal successors, (1150), 5 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states 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:45:33,752 INFO  L175             Difference]: Start difference. First operand has 237 places, 283 transitions, 913 flow. Second operand 4 states and 868 transitions.
[2024-03-09 05:45:33,752 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 288 transitions, 961 flow
[2024-03-09 05:45:33,771 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 288 transitions, 951 flow, removed 5 selfloop flow, removed 3 redundant places.
[2024-03-09 05:45:33,773 INFO  L231             Difference]: Finished difference. Result has 236 places, 286 transitions, 928 flow
[2024-03-09 05:45:33,773 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=903, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=928, PETRI_PLACES=236, PETRI_TRANSITIONS=286}
[2024-03-09 05:45:33,774 INFO  L281   CegarLoopForPetriNet]: 220 programPoint places, 16 predicate places.
[2024-03-09 05:45:33,774 INFO  L495      AbstractCegarLoop]: Abstraction has has 236 places, 286 transitions, 928 flow
[2024-03-09 05:45:33,774 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 213.25) internal successors, (853), 4 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:45:33,774 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:45:33,774 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 05:45:33,774 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35
[2024-03-09 05:45:33,774 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:45:33,774 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:45:33,774 INFO  L85        PathProgramCache]: Analyzing trace with hash -43618573, now seen corresponding path program 1 times
[2024-03-09 05:45:33,775 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:45:33,775 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074328219]
[2024-03-09 05:45:33,775 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:45:33,775 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:45:33,780 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:45:33,809 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:45:33,810 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:45:33,810 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074328219]
[2024-03-09 05:45:33,810 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074328219] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:45:33,810 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:45:33,810 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-03-09 05:45:33,810 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403941844]
[2024-03-09 05:45:33,810 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:45:33,810 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-03-09 05:45:33,810 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:45:33,811 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-03-09 05:45:33,811 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-03-09 05:45:33,885 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 212 out of 230
[2024-03-09 05:45:33,885 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 286 transitions, 928 flow. Second operand  has 4 states, 4 states have (on average 213.25) internal successors, (853), 4 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:45:33,886 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:45:33,886 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 230
[2024-03-09 05:45:33,886 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:45:34,255 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([516] L1056-5-->L1056-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[][148], [Black: 245#true, Black: 257#true, 262#true, Black: 229#(= |#race~threads_mask~0| 0), 269#true, 259#(= |#race~datas~0| 0), Black: 265#(and (<= (+ ~threads_mask~0 1) 0) (= |ULTIMATE.start_main_#t~nondet14#1| 1)), Black: 264#(<= (+ ~threads_mask~0 1) 0), Black: 235#(= |ULTIMATE.start_main_~i~0#1| 0), 156#L1056-6true, 250#(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)), 31#L1040-10true, 207#L1040-8true, threadThread1of2ForFork0InUse, Black: 248#(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)), threadThread2of2ForFork0InUse, Black: 247#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 249#(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))])
[2024-03-09 05:45:34,256 INFO  L294   olderBase$Statistics]: this new event has 139 ancestors and is not cut-off event
[2024-03-09 05:45:34,256 INFO  L297   olderBase$Statistics]:   existing Event has 139 ancestors and is not cut-off event
[2024-03-09 05:45:34,256 INFO  L297   olderBase$Statistics]:   existing Event has 139 ancestors and is not cut-off event
[2024-03-09 05:45:34,256 INFO  L297   olderBase$Statistics]:   existing Event has 139 ancestors and is not cut-off event
[2024-03-09 05:45:34,267 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([607] L1058-5-->L1058-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[][160], [Black: 245#true, 18#L1058-6true, Black: 257#true, 262#true, Black: 229#(= |#race~threads_mask~0| 0), 269#true, 259#(= |#race~datas~0| 0), Black: 265#(and (<= (+ ~threads_mask~0 1) 0) (= |ULTIMATE.start_main_#t~nondet14#1| 1)), Black: 264#(<= (+ ~threads_mask~0 1) 0), Black: 235#(= |ULTIMATE.start_main_~i~0#1| 0), 106#L1040-9true, 250#(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)), 207#L1040-8true, threadThread1of2ForFork0InUse, Black: 248#(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: 247#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), threadThread2of2ForFork0InUse, Black: 249#(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))])
[2024-03-09 05:45:34,267 INFO  L294   olderBase$Statistics]: this new event has 139 ancestors and is not cut-off event
[2024-03-09 05:45:34,267 INFO  L297   olderBase$Statistics]:   existing Event has 139 ancestors and is not cut-off event
[2024-03-09 05:45:34,267 INFO  L297   olderBase$Statistics]:   existing Event has 139 ancestors and is not cut-off event
[2024-03-09 05:45:34,267 INFO  L297   olderBase$Statistics]:   existing Event has 139 ancestors and is not cut-off event
[2024-03-09 05:45:34,294 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([607] L1058-5-->L1058-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[][160], [Black: 245#true, 18#L1058-6true, Black: 257#true, 262#true, Black: 229#(= |#race~threads_mask~0| 0), 269#true, 259#(= |#race~datas~0| 0), Black: 265#(and (<= (+ ~threads_mask~0 1) 0) (= |ULTIMATE.start_main_#t~nondet14#1| 1)), Black: 264#(<= (+ ~threads_mask~0 1) 0), Black: 235#(= |ULTIMATE.start_main_~i~0#1| 0), 250#(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)), 31#L1040-10true, 207#L1040-8true, threadThread1of2ForFork0InUse, Black: 248#(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: 247#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), threadThread2of2ForFork0InUse, Black: 249#(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))])
[2024-03-09 05:45:34,294 INFO  L294   olderBase$Statistics]: this new event has 140 ancestors and is not cut-off event
[2024-03-09 05:45:34,294 INFO  L297   olderBase$Statistics]:   existing Event has 140 ancestors and is not cut-off event
[2024-03-09 05:45:34,294 INFO  L297   olderBase$Statistics]:   existing Event has 140 ancestors and is not cut-off event
[2024-03-09 05:45:34,294 INFO  L297   olderBase$Statistics]:   existing Event has 140 ancestors and is not cut-off event
[2024-03-09 05:45:35,592 INFO  L124   PetriNetUnfolderBase]: 3592/17692 cut-off events.
[2024-03-09 05:45:35,592 INFO  L125   PetriNetUnfolderBase]: For 1714/1720 co-relation queries the response was YES.
[2024-03-09 05:45:35,634 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27371 conditions, 17692 events. 3592/17692 cut-off events. For 1714/1720 co-relation queries the response was YES. Maximal size of possible extension queue 448. Compared 216422 event pairs, 574 based on Foata normal form. 1/15617 useless extension candidates. Maximal degree in co-relation 25626. Up to 2005 conditions per place. 
[2024-03-09 05:45:35,666 INFO  L140   encePairwiseOnDemand]: 226/230 looper letters, 14 selfloop transitions, 4 changer transitions 0/287 dead transitions.
[2024-03-09 05:45:35,667 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 287 transitions, 966 flow
[2024-03-09 05:45:35,667 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-03-09 05:45:35,668 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-03-09 05:45:35,668 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 867 transitions.
[2024-03-09 05:45:35,668 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9423913043478261
[2024-03-09 05:45:35,668 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 867 transitions.
[2024-03-09 05:45:35,668 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 867 transitions.
[2024-03-09 05:45:35,668 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:45:35,668 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 867 transitions.
[2024-03-09 05:45:35,669 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 216.75) internal successors, (867), 4 states have internal predecessors, (867), 0 states have call successors, (0), 0 states 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:45:35,670 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 230.0) internal successors, (1150), 5 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states 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:45:35,670 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 230.0) internal successors, (1150), 5 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states 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:45:35,670 INFO  L175             Difference]: Start difference. First operand has 236 places, 286 transitions, 928 flow. Second operand 4 states and 867 transitions.
[2024-03-09 05:45:35,670 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 287 transitions, 966 flow
[2024-03-09 05:45:35,684 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 287 transitions, 966 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-09 05:45:35,686 INFO  L231             Difference]: Finished difference. Result has 241 places, 287 transitions, 947 flow
[2024-03-09 05:45:35,687 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=928, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=947, PETRI_PLACES=241, PETRI_TRANSITIONS=287}
[2024-03-09 05:45:35,687 INFO  L281   CegarLoopForPetriNet]: 220 programPoint places, 21 predicate places.
[2024-03-09 05:45:35,687 INFO  L495      AbstractCegarLoop]: Abstraction has has 241 places, 287 transitions, 947 flow
[2024-03-09 05:45:35,687 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 213.25) internal successors, (853), 4 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:45:35,687 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:45:35,688 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]
[2024-03-09 05:45:35,688 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36
[2024-03-09 05:45:35,688 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-09 05:45:35,688 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:45:35,688 INFO  L85        PathProgramCache]: Analyzing trace with hash -1579712532, now seen corresponding path program 1 times
[2024-03-09 05:45:35,688 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:45:35,688 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477718966]
[2024-03-09 05:45:35,688 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:45:35,688 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:45:35,694 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:45:35,726 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:45:35,726 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:45:35,726 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477718966]
[2024-03-09 05:45:35,726 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477718966] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:45:35,726 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:45:35,727 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-03-09 05:45:35,727 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534948570]
[2024-03-09 05:45:35,727 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:45:35,727 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-03-09 05:45:35,727 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:45:35,728 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-03-09 05:45:35,728 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-03-09 05:45:35,807 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 212 out of 230
[2024-03-09 05:45:35,808 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 287 transitions, 947 flow. Second operand  has 4 states, 4 states have (on average 213.25) internal successors, (853), 4 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:45:35,808 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:45:35,808 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 230
[2024-03-09 05:45:35,808 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:45:36,213 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([516] L1056-5-->L1056-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[][149], [Black: 245#true, Black: 257#true, 262#true, Black: 229#(= |#race~threads_mask~0| 0), 269#true, 276#true, 259#(= |#race~datas~0| 0), Black: 265#(and (<= (+ ~threads_mask~0 1) 0) (= |ULTIMATE.start_main_#t~nondet14#1| 1)), Black: 264#(<= (+ ~threads_mask~0 1) 0), Black: 235#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 271#(<= (+ ~threads_mask~0 1) 0), Black: 272#(and (<= 2 |ULTIMATE.start_main_#t~nondet14#1|) (<= (+ ~threads_mask~0 1) 0)), 156#L1056-6true, 250#(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)), 31#L1040-10true, 207#L1040-8true, threadThread1of2ForFork0InUse, Black: 248#(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: 247#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), threadThread2of2ForFork0InUse, Black: 249#(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))])
[2024-03-09 05:45:36,213 INFO  L294   olderBase$Statistics]: this new event has 139 ancestors and is not cut-off event
[2024-03-09 05:45:36,213 INFO  L297   olderBase$Statistics]:   existing Event has 139 ancestors and is not cut-off event
[2024-03-09 05:45:36,213 INFO  L297   olderBase$Statistics]:   existing Event has 139 ancestors and is not cut-off event
[2024-03-09 05:45:36,213 INFO  L297   olderBase$Statistics]:   existing Event has 139 ancestors and is not cut-off event
[2024-03-09 05:45:36,226 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([607] L1058-5-->L1058-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[][161], [Black: 245#true, 18#L1058-6true, Black: 257#true, 262#true, Black: 229#(= |#race~threads_mask~0| 0), 269#true, 276#true, 259#(= |#race~datas~0| 0), Black: 265#(and (<= (+ ~threads_mask~0 1) 0) (= |ULTIMATE.start_main_#t~nondet14#1| 1)), Black: 264#(<= (+ ~threads_mask~0 1) 0), Black: 235#(= |ULTIMATE.start_main_~i~0#1| 0), 106#L1040-9true, Black: 271#(<= (+ ~threads_mask~0 1) 0), Black: 272#(and (<= 2 |ULTIMATE.start_main_#t~nondet14#1|) (<= (+ ~threads_mask~0 1) 0)), 250#(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)), 207#L1040-8true, threadThread1of2ForFork0InUse, Black: 248#(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: 247#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), threadThread2of2ForFork0InUse, Black: 249#(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))])
[2024-03-09 05:45:36,226 INFO  L294   olderBase$Statistics]: this new event has 139 ancestors and is not cut-off event
[2024-03-09 05:45:36,226 INFO  L297   olderBase$Statistics]:   existing Event has 139 ancestors and is not cut-off event
[2024-03-09 05:45:36,226 INFO  L297   olderBase$Statistics]:   existing Event has 139 ancestors and is not cut-off event
[2024-03-09 05:45:36,226 INFO  L297   olderBase$Statistics]:   existing Event has 139 ancestors and is not cut-off event
[2024-03-09 05:45:36,255 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([607] L1058-5-->L1058-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[][161], [Black: 245#true, 18#L1058-6true, Black: 257#true, 262#true, Black: 229#(= |#race~threads_mask~0| 0), 269#true, 276#true, 259#(= |#race~datas~0| 0), Black: 265#(and (<= (+ ~threads_mask~0 1) 0) (= |ULTIMATE.start_main_#t~nondet14#1| 1)), Black: 264#(<= (+ ~threads_mask~0 1) 0), Black: 235#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 271#(<= (+ ~threads_mask~0 1) 0), Black: 272#(and (<= 2 |ULTIMATE.start_main_#t~nondet14#1|) (<= (+ ~threads_mask~0 1) 0)), 250#(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)), 31#L1040-10true, 207#L1040-8true, threadThread1of2ForFork0InUse, Black: 248#(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: 247#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), threadThread2of2ForFork0InUse, Black: 249#(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))])
[2024-03-09 05:45:36,256 INFO  L294   olderBase$Statistics]: this new event has 140 ancestors and is not cut-off event
[2024-03-09 05:45:36,256 INFO  L297   olderBase$Statistics]:   existing Event has 140 ancestors and is not cut-off event
[2024-03-09 05:45:36,256 INFO  L297   olderBase$Statistics]:   existing Event has 140 ancestors and is not cut-off event
[2024-03-09 05:45:36,256 INFO  L297   olderBase$Statistics]:   existing Event has 140 ancestors and is not cut-off event
[2024-03-09 05:45:37,567 INFO  L124   PetriNetUnfolderBase]: 3591/17690 cut-off events.
[2024-03-09 05:45:37,567 INFO  L125   PetriNetUnfolderBase]: For 1826/1832 co-relation queries the response was YES.
[2024-03-09 05:45:37,644 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27478 conditions, 17690 events. 3591/17690 cut-off events. For 1826/1832 co-relation queries the response was YES. Maximal size of possible extension queue 448. Compared 216564 event pairs, 574 based on Foata normal form. 1/15666 useless extension candidates. Maximal degree in co-relation 27369. Up to 2005 conditions per place. 
[2024-03-09 05:45:37,693 INFO  L140   encePairwiseOnDemand]: 226/230 looper letters, 15 selfloop transitions, 4 changer transitions 0/288 dead transitions.
[2024-03-09 05:45:37,694 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 288 transitions, 987 flow
[2024-03-09 05:45:37,695 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-03-09 05:45:37,696 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-03-09 05:45:37,696 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 868 transitions.
[2024-03-09 05:45:37,696 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9434782608695652
[2024-03-09 05:45:37,696 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 868 transitions.
[2024-03-09 05:45:37,696 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 868 transitions.
[2024-03-09 05:45:37,697 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:45:37,697 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 868 transitions.
[2024-03-09 05:45:37,697 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states 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:45:37,698 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 230.0) internal successors, (1150), 5 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states 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:45:37,698 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 230.0) internal successors, (1150), 5 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states 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:45:37,698 INFO  L175             Difference]: Start difference. First operand has 241 places, 287 transitions, 947 flow. Second operand 4 states and 868 transitions.
[2024-03-09 05:45:37,698 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 288 transitions, 987 flow
[2024-03-09 05:45:37,717 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 288 transitions, 984 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-09 05:45:37,720 INFO  L231             Difference]: Finished difference. Result has 244 places, 287 transitions, 956 flow
[2024-03-09 05:45:37,720 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=944, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=956, PETRI_PLACES=244, PETRI_TRANSITIONS=287}
[2024-03-09 05:45:37,720 INFO  L281   CegarLoopForPetriNet]: 220 programPoint places, 24 predicate places.
[2024-03-09 05:45:37,720 INFO  L495      AbstractCegarLoop]: Abstraction has has 244 places, 287 transitions, 956 flow
[2024-03-09 05:45:37,721 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 213.25) internal successors, (853), 4 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:45:37,721 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:45:37,721 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]
[2024-03-09 05:45:37,721 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37
[2024-03-09 05:45:37,721 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-09 05:45:37,721 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:45:37,722 INFO  L85        PathProgramCache]: Analyzing trace with hash -263555228, now seen corresponding path program 1 times
[2024-03-09 05:45:37,722 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:45:37,722 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603731636]
[2024-03-09 05:45:37,722 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:45:37,722 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:45:37,728 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:45:37,758 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:45:37,759 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:45:37,759 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603731636]
[2024-03-09 05:45:37,759 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603731636] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:45:37,760 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:45:37,760 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-03-09 05:45:37,760 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964601154]
[2024-03-09 05:45:37,760 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:45:37,761 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-03-09 05:45:37,761 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:45:37,762 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-03-09 05:45:37,762 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-03-09 05:45:37,883 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 211 out of 230
[2024-03-09 05:45:37,884 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 287 transitions, 956 flow. Second operand  has 4 states, 4 states have (on average 212.25) internal successors, (849), 4 states have internal predecessors, (849), 0 states have call successors, (0), 0 states 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:45:37,884 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:45:37,884 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 230
[2024-03-09 05:45:37,884 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:45:38,294 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([516] L1056-5-->L1056-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[][148], [Black: 245#true, Black: 257#true, 262#true, Black: 229#(= |#race~threads_mask~0| 0), 276#true, 259#(= |#race~datas~0| 0), Black: 265#(and (<= (+ ~threads_mask~0 1) 0) (= |ULTIMATE.start_main_#t~nondet14#1| 1)), Black: 264#(<= (+ ~threads_mask~0 1) 0), Black: 235#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 271#(<= (+ ~threads_mask~0 1) 0), Black: 272#(and (<= 2 |ULTIMATE.start_main_#t~nondet14#1|) (<= (+ ~threads_mask~0 1) 0)), 156#L1056-6true, 282#true, 250#(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: 279#(and (<= 0 (+ ~threads_mask~0 1)) (= |ULTIMATE.start_main_#t~nondet14#1| 1)), 31#L1040-10true, 207#L1040-8true, threadThread1of2ForFork0InUse, Black: 248#(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)), threadThread2of2ForFork0InUse, Black: 247#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 249#(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))])
[2024-03-09 05:45:38,294 INFO  L294   olderBase$Statistics]: this new event has 143 ancestors and is not cut-off event
[2024-03-09 05:45:38,295 INFO  L297   olderBase$Statistics]:   existing Event has 143 ancestors and is not cut-off event
[2024-03-09 05:45:38,295 INFO  L297   olderBase$Statistics]:   existing Event has 143 ancestors and is not cut-off event
[2024-03-09 05:45:38,295 INFO  L297   olderBase$Statistics]:   existing Event has 143 ancestors and is not cut-off event
[2024-03-09 05:45:38,307 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([607] L1058-5-->L1058-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[][160], [Black: 245#true, 18#L1058-6true, Black: 257#true, 262#true, Black: 229#(= |#race~threads_mask~0| 0), 276#true, 259#(= |#race~datas~0| 0), Black: 265#(and (<= (+ ~threads_mask~0 1) 0) (= |ULTIMATE.start_main_#t~nondet14#1| 1)), Black: 264#(<= (+ ~threads_mask~0 1) 0), Black: 235#(= |ULTIMATE.start_main_~i~0#1| 0), 106#L1040-9true, Black: 271#(<= (+ ~threads_mask~0 1) 0), Black: 272#(and (<= 2 |ULTIMATE.start_main_#t~nondet14#1|) (<= (+ ~threads_mask~0 1) 0)), 282#true, 250#(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: 279#(and (<= 0 (+ ~threads_mask~0 1)) (= |ULTIMATE.start_main_#t~nondet14#1| 1)), 207#L1040-8true, threadThread1of2ForFork0InUse, Black: 248#(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)), threadThread2of2ForFork0InUse, Black: 247#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 249#(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))])
[2024-03-09 05:45:38,307 INFO  L294   olderBase$Statistics]: this new event has 143 ancestors and is not cut-off event
[2024-03-09 05:45:38,307 INFO  L297   olderBase$Statistics]:   existing Event has 143 ancestors and is not cut-off event
[2024-03-09 05:45:38,307 INFO  L297   olderBase$Statistics]:   existing Event has 143 ancestors and is not cut-off event
[2024-03-09 05:45:38,308 INFO  L297   olderBase$Statistics]:   existing Event has 143 ancestors and is not cut-off event
[2024-03-09 05:45:38,336 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([607] L1058-5-->L1058-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[][160], [Black: 245#true, 18#L1058-6true, Black: 257#true, 262#true, Black: 229#(= |#race~threads_mask~0| 0), 276#true, 259#(= |#race~datas~0| 0), Black: 265#(and (<= (+ ~threads_mask~0 1) 0) (= |ULTIMATE.start_main_#t~nondet14#1| 1)), Black: 264#(<= (+ ~threads_mask~0 1) 0), Black: 235#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 271#(<= (+ ~threads_mask~0 1) 0), Black: 272#(and (<= 2 |ULTIMATE.start_main_#t~nondet14#1|) (<= (+ ~threads_mask~0 1) 0)), 282#true, 250#(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: 279#(and (<= 0 (+ ~threads_mask~0 1)) (= |ULTIMATE.start_main_#t~nondet14#1| 1)), 31#L1040-10true, 207#L1040-8true, threadThread1of2ForFork0InUse, Black: 248#(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)), threadThread2of2ForFork0InUse, Black: 247#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 249#(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))])
[2024-03-09 05:45:38,336 INFO  L294   olderBase$Statistics]: this new event has 144 ancestors and is not cut-off event
[2024-03-09 05:45:38,336 INFO  L297   olderBase$Statistics]:   existing Event has 144 ancestors and is not cut-off event
[2024-03-09 05:45:38,336 INFO  L297   olderBase$Statistics]:   existing Event has 144 ancestors and is not cut-off event
[2024-03-09 05:45:38,336 INFO  L297   olderBase$Statistics]:   existing Event has 144 ancestors and is not cut-off event
[2024-03-09 05:45:39,730 INFO  L124   PetriNetUnfolderBase]: 3610/17728 cut-off events.
[2024-03-09 05:45:39,730 INFO  L125   PetriNetUnfolderBase]: For 1897/1903 co-relation queries the response was YES.
[2024-03-09 05:45:39,778 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27647 conditions, 17728 events. 3610/17728 cut-off events. For 1897/1903 co-relation queries the response was YES. Maximal size of possible extension queue 452. Compared 217116 event pairs, 592 based on Foata normal form. 1/15687 useless extension candidates. Maximal degree in co-relation 27537. Up to 2005 conditions per place. 
[2024-03-09 05:45:39,812 INFO  L140   encePairwiseOnDemand]: 226/230 looper letters, 15 selfloop transitions, 4 changer transitions 0/287 dead transitions.
[2024-03-09 05:45:39,812 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 287 transitions, 994 flow
[2024-03-09 05:45:39,813 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-03-09 05:45:39,813 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-03-09 05:45:39,814 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 864 transitions.
[2024-03-09 05:45:39,814 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9391304347826087
[2024-03-09 05:45:39,814 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 864 transitions.
[2024-03-09 05:45:39,814 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 864 transitions.
[2024-03-09 05:45:39,814 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:45:39,815 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 864 transitions.
[2024-03-09 05:45:39,815 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 216.0) internal successors, (864), 4 states have internal predecessors, (864), 0 states have call successors, (0), 0 states 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:45:39,816 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 230.0) internal successors, (1150), 5 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states 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:45:39,816 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 230.0) internal successors, (1150), 5 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states 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:45:39,816 INFO  L175             Difference]: Start difference. First operand has 244 places, 287 transitions, 956 flow. Second operand 4 states and 864 transitions.
[2024-03-09 05:45:39,816 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 287 transitions, 994 flow
[2024-03-09 05:45:39,833 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 287 transitions, 986 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-03-09 05:45:39,835 INFO  L231             Difference]: Finished difference. Result has 245 places, 287 transitions, 960 flow
[2024-03-09 05:45:39,835 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=948, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=960, PETRI_PLACES=245, PETRI_TRANSITIONS=287}
[2024-03-09 05:45:39,836 INFO  L281   CegarLoopForPetriNet]: 220 programPoint places, 25 predicate places.
[2024-03-09 05:45:39,836 INFO  L495      AbstractCegarLoop]: Abstraction has has 245 places, 287 transitions, 960 flow
[2024-03-09 05:45:39,836 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 212.25) internal successors, (849), 4 states have internal predecessors, (849), 0 states have call successors, (0), 0 states 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:45:39,836 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:45:39,836 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]
[2024-03-09 05:45:39,836 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38
[2024-03-09 05:45:39,836 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-09 05:45:39,837 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:45:39,837 INFO  L85        PathProgramCache]: Analyzing trace with hash -1243699433, now seen corresponding path program 1 times
[2024-03-09 05:45:39,837 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:45:39,837 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036590551]
[2024-03-09 05:45:39,837 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:45:39,837 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:45:39,843 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:45:39,856 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:45:39,856 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:45:39,856 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036590551]
[2024-03-09 05:45:39,857 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036590551] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:45:39,857 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:45:39,857 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-09 05:45:39,857 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201304812]
[2024-03-09 05:45:39,857 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:45:39,857 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 05:45:39,857 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:45:39,858 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 05:45:39,858 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 05:45:39,890 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 209 out of 230
[2024-03-09 05:45:39,891 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 287 transitions, 960 flow. Second operand  has 3 states, 3 states have (on average 211.0) internal successors, (633), 3 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:45:39,891 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:45:39,891 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 230
[2024-03-09 05:45:39,891 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:45:40,298 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([516] L1056-5-->L1056-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[][147], [Black: 245#true, Black: 287#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet14#1|)) (<= 0 (+ ~threads_mask~0 1))), Black: 257#true, 262#true, Black: 229#(= |#race~threads_mask~0| 0), 259#(= |#race~datas~0| 0), Black: 265#(and (<= (+ ~threads_mask~0 1) 0) (= |ULTIMATE.start_main_#t~nondet14#1| 1)), 290#true, Black: 264#(<= (+ ~threads_mask~0 1) 0), Black: 235#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 271#(<= (+ ~threads_mask~0 1) 0), Black: 272#(and (<= 2 |ULTIMATE.start_main_#t~nondet14#1|) (<= (+ ~threads_mask~0 1) 0)), 156#L1056-6true, 282#true, 250#(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)), 31#L1040-10true, Black: 279#(and (<= 0 (+ ~threads_mask~0 1)) (= |ULTIMATE.start_main_#t~nondet14#1| 1)), 207#L1040-8true, threadThread1of2ForFork0InUse, Black: 248#(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: 247#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), threadThread2of2ForFork0InUse, Black: 249#(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))])
[2024-03-09 05:45:40,299 INFO  L294   olderBase$Statistics]: this new event has 143 ancestors and is not cut-off event
[2024-03-09 05:45:40,299 INFO  L297   olderBase$Statistics]:   existing Event has 143 ancestors and is not cut-off event
[2024-03-09 05:45:40,299 INFO  L297   olderBase$Statistics]:   existing Event has 143 ancestors and is not cut-off event
[2024-03-09 05:45:40,299 INFO  L297   olderBase$Statistics]:   existing Event has 143 ancestors and is not cut-off event
[2024-03-09 05:45:40,312 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([607] L1058-5-->L1058-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[][160], [Black: 245#true, Black: 287#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet14#1|)) (<= 0 (+ ~threads_mask~0 1))), 18#L1058-6true, Black: 257#true, 262#true, Black: 229#(= |#race~threads_mask~0| 0), 259#(= |#race~datas~0| 0), Black: 265#(and (<= (+ ~threads_mask~0 1) 0) (= |ULTIMATE.start_main_#t~nondet14#1| 1)), 290#true, Black: 264#(<= (+ ~threads_mask~0 1) 0), Black: 235#(= |ULTIMATE.start_main_~i~0#1| 0), 106#L1040-9true, Black: 271#(<= (+ ~threads_mask~0 1) 0), Black: 272#(and (<= 2 |ULTIMATE.start_main_#t~nondet14#1|) (<= (+ ~threads_mask~0 1) 0)), 282#true, 250#(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: 279#(and (<= 0 (+ ~threads_mask~0 1)) (= |ULTIMATE.start_main_#t~nondet14#1| 1)), 207#L1040-8true, threadThread1of2ForFork0InUse, Black: 248#(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: 247#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), threadThread2of2ForFork0InUse, Black: 249#(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))])
[2024-03-09 05:45:40,312 INFO  L294   olderBase$Statistics]: this new event has 143 ancestors and is not cut-off event
[2024-03-09 05:45:40,312 INFO  L297   olderBase$Statistics]:   existing Event has 143 ancestors and is not cut-off event
[2024-03-09 05:45:40,312 INFO  L297   olderBase$Statistics]:   existing Event has 143 ancestors and is not cut-off event
[2024-03-09 05:45:40,312 INFO  L297   olderBase$Statistics]:   existing Event has 143 ancestors and is not cut-off event
[2024-03-09 05:45:40,344 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([607] L1058-5-->L1058-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[][160], [Black: 245#true, Black: 287#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet14#1|)) (<= 0 (+ ~threads_mask~0 1))), 18#L1058-6true, Black: 257#true, 262#true, Black: 229#(= |#race~threads_mask~0| 0), 259#(= |#race~datas~0| 0), Black: 265#(and (<= (+ ~threads_mask~0 1) 0) (= |ULTIMATE.start_main_#t~nondet14#1| 1)), 290#true, Black: 264#(<= (+ ~threads_mask~0 1) 0), Black: 235#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 271#(<= (+ ~threads_mask~0 1) 0), Black: 272#(and (<= 2 |ULTIMATE.start_main_#t~nondet14#1|) (<= (+ ~threads_mask~0 1) 0)), 282#true, 250#(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)), 31#L1040-10true, Black: 279#(and (<= 0 (+ ~threads_mask~0 1)) (= |ULTIMATE.start_main_#t~nondet14#1| 1)), 207#L1040-8true, threadThread1of2ForFork0InUse, Black: 248#(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: 247#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), threadThread2of2ForFork0InUse, Black: 249#(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))])
[2024-03-09 05:45:40,344 INFO  L294   olderBase$Statistics]: this new event has 144 ancestors and is not cut-off event
[2024-03-09 05:45:40,344 INFO  L297   olderBase$Statistics]:   existing Event has 144 ancestors and is not cut-off event
[2024-03-09 05:45:40,344 INFO  L297   olderBase$Statistics]:   existing Event has 144 ancestors and is not cut-off event
[2024-03-09 05:45:40,344 INFO  L297   olderBase$Statistics]:   existing Event has 144 ancestors and is not cut-off event
[2024-03-09 05:45:41,661 INFO  L124   PetriNetUnfolderBase]: 3745/17769 cut-off events.
[2024-03-09 05:45:41,661 INFO  L125   PetriNetUnfolderBase]: For 2586/2817 co-relation queries the response was YES.
[2024-03-09 05:45:41,753 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27863 conditions, 17769 events. 3745/17769 cut-off events. For 2586/2817 co-relation queries the response was YES. Maximal size of possible extension queue 469. Compared 216861 event pairs, 518 based on Foata normal form. 3/15595 useless extension candidates. Maximal degree in co-relation 27754. Up to 1828 conditions per place. 
[2024-03-09 05:45:41,809 INFO  L140   encePairwiseOnDemand]: 222/230 looper letters, 22 selfloop transitions, 12 changer transitions 0/297 dead transitions.
[2024-03-09 05:45:41,809 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 297 transitions, 1064 flow
[2024-03-09 05:45:41,810 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 05:45:41,811 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 05:45:41,811 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 651 transitions.
[2024-03-09 05:45:41,811 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9434782608695652
[2024-03-09 05:45:41,811 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 651 transitions.
[2024-03-09 05:45:41,811 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 651 transitions.
[2024-03-09 05:45:41,812 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:45:41,812 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 651 transitions.
[2024-03-09 05:45:41,812 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 0 states have call successors, (0), 0 states 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:45:41,813 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 230.0) internal successors, (920), 4 states have internal predecessors, (920), 0 states have call successors, (0), 0 states 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:45:41,813 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 230.0) internal successors, (920), 4 states have internal predecessors, (920), 0 states have call successors, (0), 0 states 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:45:41,813 INFO  L175             Difference]: Start difference. First operand has 245 places, 287 transitions, 960 flow. Second operand 3 states and 651 transitions.
[2024-03-09 05:45:41,813 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 297 transitions, 1064 flow
[2024-03-09 05:45:41,830 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 297 transitions, 1056 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-03-09 05:45:41,833 INFO  L231             Difference]: Finished difference. Result has 246 places, 297 transitions, 1058 flow
[2024-03-09 05:45:41,833 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=952, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1058, PETRI_PLACES=246, PETRI_TRANSITIONS=297}
[2024-03-09 05:45:41,834 INFO  L281   CegarLoopForPetriNet]: 220 programPoint places, 26 predicate places.
[2024-03-09 05:45:41,834 INFO  L495      AbstractCegarLoop]: Abstraction has has 246 places, 297 transitions, 1058 flow
[2024-03-09 05:45:41,834 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 211.0) internal successors, (633), 3 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:45:41,834 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:45:41,834 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 05:45:41,834 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39
[2024-03-09 05:45:41,835 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-09 05:45:41,835 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:45:41,835 INFO  L85        PathProgramCache]: Analyzing trace with hash -174338931, now seen corresponding path program 1 times
[2024-03-09 05:45:41,835 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:45:41,835 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87422973]
[2024-03-09 05:45:41,835 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:45:41,836 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:45:41,849 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:45:42,040 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:45:42,040 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:45:42,040 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87422973]
[2024-03-09 05:45:42,041 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87422973] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:45:42,041 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:45:42,041 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 05:45:42,041 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645052653]
[2024-03-09 05:45:42,042 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:45:42,042 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 05:45:42,043 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:45:42,043 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 05:45:42,043 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 05:45:42,264 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 191 out of 230
[2024-03-09 05:45:42,265 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 297 transitions, 1058 flow. Second operand  has 6 states, 6 states have (on average 193.33333333333334) internal successors, (1160), 6 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states 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:45:42,265 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:45:42,265 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 230
[2024-03-09 05:45:42,266 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:45:46,672 INFO  L124   PetriNetUnfolderBase]: 10502/43558 cut-off events.
[2024-03-09 05:45:46,672 INFO  L125   PetriNetUnfolderBase]: For 10196/13574 co-relation queries the response was YES.
[2024-03-09 05:45:46,909 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 74872 conditions, 43558 events. 10502/43558 cut-off events. For 10196/13574 co-relation queries the response was YES. Maximal size of possible extension queue 1207. Compared 602898 event pairs, 1733 based on Foata normal form. 51/38286 useless extension candidates. Maximal degree in co-relation 74631. Up to 8390 conditions per place. 
[2024-03-09 05:45:47,063 INFO  L140   encePairwiseOnDemand]: 203/230 looper letters, 103 selfloop transitions, 136 changer transitions 0/457 dead transitions.
[2024-03-09 05:45:47,063 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 457 transitions, 2248 flow
[2024-03-09 05:45:47,064 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 05:45:47,064 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 05:45:47,064 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1287 transitions.
[2024-03-09 05:45:47,065 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9326086956521739
[2024-03-09 05:45:47,065 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 1287 transitions.
[2024-03-09 05:45:47,065 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 1287 transitions.
[2024-03-09 05:45:47,066 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:45:47,066 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1287 transitions.
[2024-03-09 05:45:47,067 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 214.5) internal successors, (1287), 6 states have internal predecessors, (1287), 0 states have call successors, (0), 0 states 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:45:47,068 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 230.0) internal successors, (1610), 7 states have internal predecessors, (1610), 0 states have call successors, (0), 0 states 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:45:47,068 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 230.0) internal successors, (1610), 7 states have internal predecessors, (1610), 0 states have call successors, (0), 0 states 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:45:47,068 INFO  L175             Difference]: Start difference. First operand has 246 places, 297 transitions, 1058 flow. Second operand 6 states and 1287 transitions.
[2024-03-09 05:45:47,068 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 457 transitions, 2248 flow
[2024-03-09 05:45:47,115 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 457 transitions, 2224 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-09 05:45:47,119 INFO  L231             Difference]: Finished difference. Result has 253 places, 430 transitions, 2172 flow
[2024-03-09 05:45:47,119 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=1034, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2172, PETRI_PLACES=253, PETRI_TRANSITIONS=430}
[2024-03-09 05:45:47,119 INFO  L281   CegarLoopForPetriNet]: 220 programPoint places, 33 predicate places.
[2024-03-09 05:45:47,120 INFO  L495      AbstractCegarLoop]: Abstraction has has 253 places, 430 transitions, 2172 flow
[2024-03-09 05:45:47,120 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 193.33333333333334) internal successors, (1160), 6 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states 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:45:47,120 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:45:47,120 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 05:45:47,120 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40
[2024-03-09 05:45:47,120 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-09 05:45:47,121 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:45:47,121 INFO  L85        PathProgramCache]: Analyzing trace with hash 77385569, now seen corresponding path program 1 times
[2024-03-09 05:45:47,121 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:45:47,121 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730755233]
[2024-03-09 05:45:47,121 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:45:47,121 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:45:47,140 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:45:47,322 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:45:47,323 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:45:47,323 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730755233]
[2024-03-09 05:45:47,323 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730755233] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:45:47,324 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:45:47,324 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 05:45:47,324 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782818788]
[2024-03-09 05:45:47,324 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:45:47,325 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 05:45:47,325 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:45:47,325 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 05:45:47,326 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 05:45:47,607 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 201 out of 230
[2024-03-09 05:45:47,608 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 430 transitions, 2172 flow. Second operand  has 6 states, 6 states have (on average 202.5) internal successors, (1215), 6 states have internal predecessors, (1215), 0 states have call successors, (0), 0 states 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:45:47,608 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:45:47,609 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 230
[2024-03-09 05:45:47,609 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:45:53,263 INFO  L124   PetriNetUnfolderBase]: 11462/50887 cut-off events.
[2024-03-09 05:45:53,264 INFO  L125   PetriNetUnfolderBase]: For 23738/26324 co-relation queries the response was YES.
[2024-03-09 05:45:53,444 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 94528 conditions, 50887 events. 11462/50887 cut-off events. For 23738/26324 co-relation queries the response was YES. Maximal size of possible extension queue 1541. Compared 744378 event pairs, 1332 based on Foata normal form. 173/44896 useless extension candidates. Maximal degree in co-relation 94276. Up to 7148 conditions per place. 
[2024-03-09 05:45:53,571 INFO  L140   encePairwiseOnDemand]: 215/230 looper letters, 110 selfloop transitions, 119 changer transitions 0/546 dead transitions.
[2024-03-09 05:45:53,571 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 546 transitions, 3498 flow
[2024-03-09 05:45:53,572 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 05:45:53,572 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 05:45:53,573 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1271 transitions.
[2024-03-09 05:45:53,573 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9210144927536232
[2024-03-09 05:45:53,573 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 1271 transitions.
[2024-03-09 05:45:53,573 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 1271 transitions.
[2024-03-09 05:45:53,573 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:45:53,574 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1271 transitions.
[2024-03-09 05:45:53,575 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 211.83333333333334) internal successors, (1271), 6 states have internal predecessors, (1271), 0 states have call successors, (0), 0 states 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:45:53,575 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 230.0) internal successors, (1610), 7 states have internal predecessors, (1610), 0 states have call successors, (0), 0 states 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:45:53,576 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 230.0) internal successors, (1610), 7 states have internal predecessors, (1610), 0 states have call successors, (0), 0 states 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:45:53,576 INFO  L175             Difference]: Start difference. First operand has 253 places, 430 transitions, 2172 flow. Second operand 6 states and 1271 transitions.
[2024-03-09 05:45:53,576 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 546 transitions, 3498 flow
[2024-03-09 05:45:53,665 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 546 transitions, 3444 flow, removed 27 selfloop flow, removed 0 redundant places.
[2024-03-09 05:45:53,670 INFO  L231             Difference]: Finished difference. Result has 263 places, 544 transitions, 3538 flow
[2024-03-09 05:45:53,670 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=2118, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=430, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=383, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3538, PETRI_PLACES=263, PETRI_TRANSITIONS=544}
[2024-03-09 05:45:53,671 INFO  L281   CegarLoopForPetriNet]: 220 programPoint places, 43 predicate places.
[2024-03-09 05:45:53,671 INFO  L495      AbstractCegarLoop]: Abstraction has has 263 places, 544 transitions, 3538 flow
[2024-03-09 05:45:53,671 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 202.5) internal successors, (1215), 6 states have internal predecessors, (1215), 0 states have call successors, (0), 0 states 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:45:53,671 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:45:53,671 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 05:45:53,672 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41
[2024-03-09 05:45:53,672 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-09 05:45:53,672 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:45:53,672 INFO  L85        PathProgramCache]: Analyzing trace with hash -952493381, now seen corresponding path program 1 times
[2024-03-09 05:45:53,672 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:45:53,672 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209953767]
[2024-03-09 05:45:53,673 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:45:53,673 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:45:53,687 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:45:53,986 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:45:53,986 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:45:53,987 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209953767]
[2024-03-09 05:45:53,987 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209953767] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:45:53,987 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:45:53,988 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-03-09 05:45:53,988 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640600140]
[2024-03-09 05:45:53,988 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:45:53,989 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-03-09 05:45:53,989 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:45:53,990 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-03-09 05:45:53,990 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2024-03-09 05:45:54,620 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 185 out of 230
[2024-03-09 05:45:54,622 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 544 transitions, 3538 flow. Second operand  has 10 states, 10 states have (on average 186.9) internal successors, (1869), 10 states have internal predecessors, (1869), 0 states have call successors, (0), 0 states 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:45:54,622 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:45:54,622 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 230
[2024-03-09 05:45:54,623 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:46:02,622 INFO  L124   PetriNetUnfolderBase]: 14641/55955 cut-off events.
[2024-03-09 05:46:02,623 INFO  L125   PetriNetUnfolderBase]: For 42180/78252 co-relation queries the response was YES.
[2024-03-09 05:46:02,891 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 127413 conditions, 55955 events. 14641/55955 cut-off events. For 42180/78252 co-relation queries the response was YES. Maximal size of possible extension queue 1618. Compared 787440 event pairs, 1855 based on Foata normal form. 800/50873 useless extension candidates. Maximal degree in co-relation 127159. Up to 8258 conditions per place. 
[2024-03-09 05:46:03,057 INFO  L140   encePairwiseOnDemand]: 210/230 looper letters, 396 selfloop transitions, 224 changer transitions 0/833 dead transitions.
[2024-03-09 05:46:03,057 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 833 transitions, 6930 flow
[2024-03-09 05:46:03,058 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-03-09 05:46:03,058 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-03-09 05:46:03,059 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2207 transitions.
[2024-03-09 05:46:03,059 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8723320158102766
[2024-03-09 05:46:03,060 INFO  L72            ComplementDD]: Start complementDD. Operand 11 states and 2207 transitions.
[2024-03-09 05:46:03,060 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 11 states and 2207 transitions.
[2024-03-09 05:46:03,060 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:46:03,060 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2207 transitions.
[2024-03-09 05:46:03,061 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 12 states, 11 states have (on average 200.63636363636363) internal successors, (2207), 11 states have internal predecessors, (2207), 0 states have call successors, (0), 0 states 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:46:03,063 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 12 states, 12 states have (on average 230.0) internal successors, (2760), 12 states have internal predecessors, (2760), 0 states have call successors, (0), 0 states 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:46:03,063 INFO  L81            ComplementDD]: Finished complementDD. Result  has 12 states, 12 states have (on average 230.0) internal successors, (2760), 12 states have internal predecessors, (2760), 0 states have call successors, (0), 0 states 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:46:03,063 INFO  L175             Difference]: Start difference. First operand has 263 places, 544 transitions, 3538 flow. Second operand 11 states and 2207 transitions.
[2024-03-09 05:46:03,063 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 833 transitions, 6930 flow
[2024-03-09 05:46:03,291 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 833 transitions, 6882 flow, removed 24 selfloop flow, removed 0 redundant places.
[2024-03-09 05:46:03,298 INFO  L231             Difference]: Finished difference. Result has 280 places, 670 transitions, 5498 flow
[2024-03-09 05:46:03,298 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=3490, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=544, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=124, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=381, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5498, PETRI_PLACES=280, PETRI_TRANSITIONS=670}
[2024-03-09 05:46:03,299 INFO  L281   CegarLoopForPetriNet]: 220 programPoint places, 60 predicate places.
[2024-03-09 05:46:03,299 INFO  L495      AbstractCegarLoop]: Abstraction has has 280 places, 670 transitions, 5498 flow
[2024-03-09 05:46:03,299 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 186.9) internal successors, (1869), 10 states have internal predecessors, (1869), 0 states have call successors, (0), 0 states 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:46:03,299 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:46:03,299 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 05:46:03,299 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42
[2024-03-09 05:46:03,300 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-09 05:46:03,300 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:46:03,300 INFO  L85        PathProgramCache]: Analyzing trace with hash -1962710595, now seen corresponding path program 1 times
[2024-03-09 05:46:03,300 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:46:03,300 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503322734]
[2024-03-09 05:46:03,300 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:46:03,301 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:46:03,314 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:46:03,594 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:46:03,594 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:46:03,594 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503322734]
[2024-03-09 05:46:03,595 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503322734] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:46:03,595 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:46:03,595 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-03-09 05:46:03,595 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643372550]
[2024-03-09 05:46:03,596 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:46:03,596 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-03-09 05:46:03,596 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:46:03,597 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-03-09 05:46:03,597 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2024-03-09 05:46:04,459 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 188 out of 230
[2024-03-09 05:46:04,461 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 670 transitions, 5498 flow. Second operand  has 10 states, 10 states have (on average 189.8) internal successors, (1898), 10 states have internal predecessors, (1898), 0 states have call successors, (0), 0 states 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:46:04,462 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:46:04,462 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 230
[2024-03-09 05:46:04,462 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:46:12,098 INFO  L124   PetriNetUnfolderBase]: 13405/55166 cut-off events.
[2024-03-09 05:46:12,098 INFO  L125   PetriNetUnfolderBase]: For 76824/113988 co-relation queries the response was YES.
[2024-03-09 05:46:12,417 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 134946 conditions, 55166 events. 13405/55166 cut-off events. For 76824/113988 co-relation queries the response was YES. Maximal size of possible extension queue 1686. Compared 800607 event pairs, 1317 based on Foata normal form. 706/49669 useless extension candidates. Maximal degree in co-relation 134686. Up to 11321 conditions per place. 
[2024-03-09 05:46:12,600 INFO  L140   encePairwiseOnDemand]: 218/230 looper letters, 392 selfloop transitions, 18 changer transitions 0/677 dead transitions.
[2024-03-09 05:46:12,601 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 677 transitions, 6404 flow
[2024-03-09 05:46:12,602 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-03-09 05:46:12,602 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-03-09 05:46:12,603 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1930 transitions.
[2024-03-09 05:46:12,603 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8391304347826087
[2024-03-09 05:46:12,603 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 1930 transitions.
[2024-03-09 05:46:12,603 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 1930 transitions.
[2024-03-09 05:46:12,603 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:46:12,604 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1930 transitions.
[2024-03-09 05:46:12,605 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 11 states, 10 states have (on average 193.0) internal successors, (1930), 10 states have internal predecessors, (1930), 0 states have call successors, (0), 0 states 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:46:12,606 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 11 states, 11 states have (on average 230.0) internal successors, (2530), 11 states have internal predecessors, (2530), 0 states have call successors, (0), 0 states 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:46:12,607 INFO  L81            ComplementDD]: Finished complementDD. Result  has 11 states, 11 states have (on average 230.0) internal successors, (2530), 11 states have internal predecessors, (2530), 0 states have call successors, (0), 0 states 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:46:12,607 INFO  L175             Difference]: Start difference. First operand has 280 places, 670 transitions, 5498 flow. Second operand 10 states and 1930 transitions.
[2024-03-09 05:46:12,607 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 677 transitions, 6404 flow
[2024-03-09 05:46:13,091 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 677 transitions, 6360 flow, removed 19 selfloop flow, removed 3 redundant places.
[2024-03-09 05:46:13,097 INFO  L231             Difference]: Finished difference. Result has 287 places, 671 transitions, 5526 flow
[2024-03-09 05:46:13,098 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=5442, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=667, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=649, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5526, PETRI_PLACES=287, PETRI_TRANSITIONS=671}
[2024-03-09 05:46:13,098 INFO  L281   CegarLoopForPetriNet]: 220 programPoint places, 67 predicate places.
[2024-03-09 05:46:13,098 INFO  L495      AbstractCegarLoop]: Abstraction has has 287 places, 671 transitions, 5526 flow
[2024-03-09 05:46:13,099 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 189.8) internal successors, (1898), 10 states have internal predecessors, (1898), 0 states have call successors, (0), 0 states 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:46:13,099 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:46:13,099 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 05:46:13,099 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43
[2024-03-09 05:46:13,099 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting threadErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-09 05:46:13,100 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:46:13,100 INFO  L85        PathProgramCache]: Analyzing trace with hash -880122470, now seen corresponding path program 1 times
[2024-03-09 05:46:13,100 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:46:13,100 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838945175]
[2024-03-09 05:46:13,100 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:46:13,100 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:46:13,117 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:46:13,135 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:46:13,135 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:46:13,135 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838945175]
[2024-03-09 05:46:13,135 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838945175] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:46:13,135 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:46:13,135 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-09 05:46:13,136 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732792067]
[2024-03-09 05:46:13,136 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:46:13,136 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 05:46:13,136 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:46:13,137 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 05:46:13,137 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 05:46:13,171 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 211 out of 230
[2024-03-09 05:46:13,172 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 671 transitions, 5526 flow. Second operand  has 3 states, 3 states have (on average 213.66666666666666) internal successors, (641), 3 states have internal predecessors, (641), 0 states have call successors, (0), 0 states 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:46:13,172 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:46:13,172 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 230
[2024-03-09 05:46:13,172 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:46:15,098 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([706] L1041-->L1041-1: Formula: (= |v_#race~threads_mask~0_10| 0)  InVars {}  OutVars{#race~threads_mask~0=|v_#race~threads_mask~0_10|}  AuxVars[]  AssignedVars[#race~threads_mask~0][553], [Black: 257#true, 262#true, 259#(= |#race~datas~0| 0), Black: 265#(and (<= (+ ~threads_mask~0 1) 0) (= |ULTIMATE.start_main_#t~nondet14#1| 1)), Black: 264#(<= (+ ~threads_mask~0 1) 0), Black: 271#(<= (+ ~threads_mask~0 1) 0), Black: 272#(and (<= 2 |ULTIMATE.start_main_#t~nondet14#1|) (<= (+ ~threads_mask~0 1) 0)), Black: 336#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 338#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 279#(and (<= 0 (+ ~threads_mask~0 1)) (= |ULTIMATE.start_main_#t~nondet14#1| 1)), Black: 319#true, threadThread1of2ForFork0InUse, 296#true, 245#true, Black: 328#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 340#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), 374#(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) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (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) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), threadThread2of2ForFork0InUse, Black: 342#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), 75#L1051-2true, Black: 287#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet14#1|)) (<= 0 (+ ~threads_mask~0 1))), 162#L1041-1true, Black: 292#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet16#1|), Black: 227#true, Black: 298#(= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))), Black: 299#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1)))), Black: 235#(= |ULTIMATE.start_main_~i~0#1| 0), 40#L1041-21true, Black: 301#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 300#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), 334#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 368#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 370#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), 380#true, Black: 310#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset| 1)) 0)), Black: 372#(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) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 309#(= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset|)) 0), Black: 366#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 248#(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: 312#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem21#1.offset|)) 0)), Black: 311#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset| 1)) 0)), Black: 247#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 250#(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)), 307#true, Black: 249#(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))])
[2024-03-09 05:46:15,099 INFO  L294   olderBase$Statistics]: this new event has 155 ancestors and is cut-off event
[2024-03-09 05:46:15,099 INFO  L297   olderBase$Statistics]:   existing Event has 155 ancestors and is cut-off event
[2024-03-09 05:46:15,099 INFO  L297   olderBase$Statistics]:   existing Event has 155 ancestors and is cut-off event
[2024-03-09 05:46:15,099 INFO  L297   olderBase$Statistics]:   existing Event has 155 ancestors and is cut-off event
[2024-03-09 05:46:15,110 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([706] L1041-->L1041-1: Formula: (= |v_#race~threads_mask~0_10| 0)  InVars {}  OutVars{#race~threads_mask~0=|v_#race~threads_mask~0_10|}  AuxVars[]  AssignedVars[#race~threads_mask~0][553], [Black: 257#true, 262#true, 259#(= |#race~datas~0| 0), Black: 265#(and (<= (+ ~threads_mask~0 1) 0) (= |ULTIMATE.start_main_#t~nondet14#1| 1)), Black: 264#(<= (+ ~threads_mask~0 1) 0), Black: 271#(<= (+ ~threads_mask~0 1) 0), Black: 272#(and (<= 2 |ULTIMATE.start_main_#t~nondet14#1|) (<= (+ ~threads_mask~0 1) 0)), Black: 336#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 338#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 279#(and (<= 0 (+ ~threads_mask~0 1)) (= |ULTIMATE.start_main_#t~nondet14#1| 1)), Black: 319#true, threadThread1of2ForFork0InUse, 296#true, 245#true, Black: 328#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 340#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), 374#(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) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (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) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), threadThread2of2ForFork0InUse, Black: 342#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 287#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet14#1|)) (<= 0 (+ ~threads_mask~0 1))), 162#L1041-1true, Black: 292#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet16#1|), Black: 227#true, Black: 298#(= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))), Black: 299#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1)))), Black: 235#(= |ULTIMATE.start_main_~i~0#1| 0), 40#L1041-21true, Black: 301#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 300#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), 334#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 368#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 370#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), 380#true, Black: 310#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset| 1)) 0)), Black: 372#(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) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 309#(= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset|)) 0), Black: 366#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), 93#L1052-2true, Black: 248#(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: 312#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem21#1.offset|)) 0)), Black: 311#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset| 1)) 0)), Black: 247#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 250#(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)), 307#true, Black: 249#(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))])
[2024-03-09 05:46:15,111 INFO  L294   olderBase$Statistics]: this new event has 161 ancestors and is cut-off event
[2024-03-09 05:46:15,111 INFO  L297   olderBase$Statistics]:   existing Event has 161 ancestors and is cut-off event
[2024-03-09 05:46:15,111 INFO  L297   olderBase$Statistics]:   existing Event has 161 ancestors and is cut-off event
[2024-03-09 05:46:15,111 INFO  L297   olderBase$Statistics]:   existing Event has 161 ancestors and is cut-off event
[2024-03-09 05:46:15,806 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([706] L1041-->L1041-1: Formula: (= |v_#race~threads_mask~0_10| 0)  InVars {}  OutVars{#race~threads_mask~0=|v_#race~threads_mask~0_10|}  AuxVars[]  AssignedVars[#race~threads_mask~0][393], [Black: 257#true, 262#true, 259#(= |#race~datas~0| 0), Black: 265#(and (<= (+ ~threads_mask~0 1) 0) (= |ULTIMATE.start_main_#t~nondet14#1| 1)), Black: 264#(<= (+ ~threads_mask~0 1) 0), Black: 271#(<= (+ ~threads_mask~0 1) 0), Black: 272#(and (<= 2 |ULTIMATE.start_main_#t~nondet14#1|) (<= (+ ~threads_mask~0 1) 0)), Black: 336#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 338#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 279#(and (<= 0 (+ ~threads_mask~0 1)) (= |ULTIMATE.start_main_#t~nondet14#1| 1)), Black: 319#true, 296#true, 245#true, threadThread1of2ForFork0InUse, Black: 328#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 340#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), 374#(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) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (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) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), threadThread2of2ForFork0InUse, Black: 342#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), 75#L1051-2true, Black: 287#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet14#1|)) (<= 0 (+ ~threads_mask~0 1))), 162#L1041-1true, 29#L1042true, Black: 292#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet16#1|), Black: 227#true, Black: 298#(= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))), Black: 299#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1)))), Black: 301#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 235#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 300#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), 334#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 368#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 370#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), 380#true, Black: 310#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset| 1)) 0)), Black: 372#(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) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 366#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 309#(= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset|)) 0), Black: 312#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem21#1.offset|)) 0)), Black: 248#(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: 311#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset| 1)) 0)), Black: 247#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 307#true, Black: 250#(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: 249#(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))])
[2024-03-09 05:46:15,807 INFO  L294   olderBase$Statistics]: this new event has 158 ancestors and is cut-off event
[2024-03-09 05:46:15,807 INFO  L297   olderBase$Statistics]:   existing Event has 158 ancestors and is cut-off event
[2024-03-09 05:46:15,807 INFO  L297   olderBase$Statistics]:   existing Event has 158 ancestors and is cut-off event
[2024-03-09 05:46:15,807 INFO  L297   olderBase$Statistics]:   existing Event has 158 ancestors and is cut-off event
[2024-03-09 05:46:15,807 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([706] L1041-->L1041-1: Formula: (= |v_#race~threads_mask~0_10| 0)  InVars {}  OutVars{#race~threads_mask~0=|v_#race~threads_mask~0_10|}  AuxVars[]  AssignedVars[#race~threads_mask~0][393], [Black: 257#true, 262#true, 259#(= |#race~datas~0| 0), Black: 265#(and (<= (+ ~threads_mask~0 1) 0) (= |ULTIMATE.start_main_#t~nondet14#1| 1)), Black: 264#(<= (+ ~threads_mask~0 1) 0), Black: 271#(<= (+ ~threads_mask~0 1) 0), Black: 272#(and (<= 2 |ULTIMATE.start_main_#t~nondet14#1|) (<= (+ ~threads_mask~0 1) 0)), Black: 336#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 338#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 279#(and (<= 0 (+ ~threads_mask~0 1)) (= |ULTIMATE.start_main_#t~nondet14#1| 1)), Black: 319#true, 296#true, 245#true, threadThread1of2ForFork0InUse, Black: 328#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 340#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), 374#(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) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (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) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), threadThread2of2ForFork0InUse, Black: 342#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 287#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet14#1|)) (<= 0 (+ ~threads_mask~0 1))), 162#L1041-1true, 29#L1042true, Black: 292#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet16#1|), Black: 227#true, Black: 298#(= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))), Black: 299#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1)))), Black: 301#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 235#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 300#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), 334#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 368#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 370#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), 380#true, Black: 310#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset| 1)) 0)), Black: 372#(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) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 366#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 309#(= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset|)) 0), 93#L1052-2true, Black: 312#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem21#1.offset|)) 0)), Black: 248#(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: 311#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset| 1)) 0)), Black: 247#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 307#true, Black: 250#(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: 249#(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))])
[2024-03-09 05:46:15,807 INFO  L294   olderBase$Statistics]: this new event has 164 ancestors and is cut-off event
[2024-03-09 05:46:15,808 INFO  L297   olderBase$Statistics]:   existing Event has 164 ancestors and is cut-off event
[2024-03-09 05:46:15,808 INFO  L297   olderBase$Statistics]:   existing Event has 164 ancestors and is cut-off event
[2024-03-09 05:46:15,808 INFO  L297   olderBase$Statistics]:   existing Event has 164 ancestors and is cut-off event
[2024-03-09 05:46:16,674 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([706] L1041-->L1041-1: Formula: (= |v_#race~threads_mask~0_10| 0)  InVars {}  OutVars{#race~threads_mask~0=|v_#race~threads_mask~0_10|}  AuxVars[]  AssignedVars[#race~threads_mask~0][669], [Black: 257#true, 262#true, 259#(= |#race~datas~0| 0), Black: 265#(and (<= (+ ~threads_mask~0 1) 0) (= |ULTIMATE.start_main_#t~nondet14#1| 1)), Black: 264#(<= (+ ~threads_mask~0 1) 0), Black: 271#(<= (+ ~threads_mask~0 1) 0), Black: 272#(and (<= 2 |ULTIMATE.start_main_#t~nondet14#1|) (<= (+ ~threads_mask~0 1) 0)), Black: 336#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 338#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 279#(and (<= 0 (+ ~threads_mask~0 1)) (= |ULTIMATE.start_main_#t~nondet14#1| 1)), Black: 319#true, threadThread1of2ForFork0InUse, 296#true, 245#true, Black: 328#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), threadThread2of2ForFork0InUse, 374#(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) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (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) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 340#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 342#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 287#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet14#1|)) (<= 0 (+ ~threads_mask~0 1))), 162#L1041-1true, Black: 292#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet16#1|), Black: 227#true, 16#L1052-21true, Black: 298#(= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))), Black: 299#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1)))), 40#L1041-21true, Black: 235#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 301#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 300#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), 334#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 368#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), 380#true, Black: 370#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 310#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset| 1)) 0)), Black: 372#(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) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 366#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 309#(= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset|)) 0), Black: 312#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem21#1.offset|)) 0)), Black: 248#(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: 311#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset| 1)) 0)), Black: 247#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 307#true, Black: 250#(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: 249#(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))])
[2024-03-09 05:46:16,675 INFO  L294   olderBase$Statistics]: this new event has 169 ancestors and is cut-off event
[2024-03-09 05:46:16,675 INFO  L297   olderBase$Statistics]:   existing Event has 169 ancestors and is cut-off event
[2024-03-09 05:46:16,675 INFO  L297   olderBase$Statistics]:   existing Event has 169 ancestors and is cut-off event
[2024-03-09 05:46:16,675 INFO  L297   olderBase$Statistics]:   existing Event has 169 ancestors and is cut-off event
[2024-03-09 05:46:17,263 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([706] L1041-->L1041-1: Formula: (= |v_#race~threads_mask~0_10| 0)  InVars {}  OutVars{#race~threads_mask~0=|v_#race~threads_mask~0_10|}  AuxVars[]  AssignedVars[#race~threads_mask~0][440], [Black: 257#true, 262#true, 259#(= |#race~datas~0| 0), Black: 265#(and (<= (+ ~threads_mask~0 1) 0) (= |ULTIMATE.start_main_#t~nondet14#1| 1)), Black: 264#(<= (+ ~threads_mask~0 1) 0), Black: 271#(<= (+ ~threads_mask~0 1) 0), Black: 272#(and (<= 2 |ULTIMATE.start_main_#t~nondet14#1|) (<= (+ ~threads_mask~0 1) 0)), Black: 336#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 338#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 279#(and (<= 0 (+ ~threads_mask~0 1)) (= |ULTIMATE.start_main_#t~nondet14#1| 1)), Black: 319#true, 296#true, 245#true, threadThread1of2ForFork0InUse, Black: 328#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 340#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), 374#(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) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (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) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), threadThread2of2ForFork0InUse, Black: 342#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 287#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet14#1|)) (<= 0 (+ ~threads_mask~0 1))), 162#L1041-1true, 29#L1042true, Black: 292#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet16#1|), 16#L1052-21true, Black: 227#true, Black: 298#(= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))), Black: 299#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1)))), Black: 301#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 235#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 300#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), 334#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 368#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 370#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), 380#true, Black: 310#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset| 1)) 0)), Black: 372#(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) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 366#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 309#(= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset|)) 0), Black: 312#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem21#1.offset|)) 0)), Black: 248#(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: 311#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset| 1)) 0)), Black: 247#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 307#true, Black: 250#(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: 249#(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))])
[2024-03-09 05:46:17,263 INFO  L294   olderBase$Statistics]: this new event has 172 ancestors and is cut-off event
[2024-03-09 05:46:17,263 INFO  L297   olderBase$Statistics]:   existing Event has 172 ancestors and is cut-off event
[2024-03-09 05:46:17,264 INFO  L297   olderBase$Statistics]:   existing Event has 172 ancestors and is cut-off event
[2024-03-09 05:46:17,264 INFO  L297   olderBase$Statistics]:   existing Event has 172 ancestors and is cut-off event
[2024-03-09 05:46:20,574 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([706] L1041-->L1041-1: Formula: (= |v_#race~threads_mask~0_10| 0)  InVars {}  OutVars{#race~threads_mask~0=|v_#race~threads_mask~0_10|}  AuxVars[]  AssignedVars[#race~threads_mask~0][539], [Black: 257#true, 262#true, 259#(= |#race~datas~0| 0), Black: 265#(and (<= (+ ~threads_mask~0 1) 0) (= |ULTIMATE.start_main_#t~nondet14#1| 1)), Black: 264#(<= (+ ~threads_mask~0 1) 0), 54#L1053true, Black: 271#(<= (+ ~threads_mask~0 1) 0), Black: 272#(and (<= 2 |ULTIMATE.start_main_#t~nondet14#1|) (<= (+ ~threads_mask~0 1) 0)), Black: 336#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 338#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 279#(and (<= 0 (+ ~threads_mask~0 1)) (= |ULTIMATE.start_main_#t~nondet14#1| 1)), Black: 319#true, threadThread1of2ForFork0InUse, 296#true, 245#true, Black: 328#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), threadThread2of2ForFork0InUse, 374#(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) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (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) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 340#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 342#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 287#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet14#1|)) (<= 0 (+ ~threads_mask~0 1))), 162#L1041-1true, Black: 292#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet16#1|), Black: 227#true, Black: 298#(= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))), Black: 299#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1)))), Black: 235#(= |ULTIMATE.start_main_~i~0#1| 0), 40#L1041-21true, Black: 301#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 300#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), 334#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 368#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), 380#true, Black: 370#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 310#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset| 1)) 0)), Black: 372#(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) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 366#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 309#(= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset|)) 0), Black: 312#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem21#1.offset|)) 0)), Black: 248#(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: 311#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset| 1)) 0)), Black: 247#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 307#true, Black: 250#(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: 249#(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))])
[2024-03-09 05:46:20,574 INFO  L294   olderBase$Statistics]: this new event has 172 ancestors and is not cut-off event
[2024-03-09 05:46:20,574 INFO  L297   olderBase$Statistics]:   existing Event has 172 ancestors and is not cut-off event
[2024-03-09 05:46:20,575 INFO  L297   olderBase$Statistics]:   existing Event has 172 ancestors and is not cut-off event
[2024-03-09 05:46:20,575 INFO  L297   olderBase$Statistics]:   existing Event has 172 ancestors and is not cut-off event
[2024-03-09 05:46:21,609 INFO  L124   PetriNetUnfolderBase]: 14273/59849 cut-off events.
[2024-03-09 05:46:21,610 INFO  L125   PetriNetUnfolderBase]: For 75265/82688 co-relation queries the response was YES.
[2024-03-09 05:46:21,982 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 135721 conditions, 59849 events. 14273/59849 cut-off events. For 75265/82688 co-relation queries the response was YES. Maximal size of possible extension queue 1799. Compared 885724 event pairs, 1131 based on Foata normal form. 231/53135 useless extension candidates. Maximal degree in co-relation 135421. Up to 7007 conditions per place. 
[2024-03-09 05:46:22,158 INFO  L140   encePairwiseOnDemand]: 221/230 looper letters, 28 selfloop transitions, 19 changer transitions 0/688 dead transitions.
[2024-03-09 05:46:22,159 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 688 transitions, 5706 flow
[2024-03-09 05:46:22,160 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 05:46:22,160 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 05:46:22,160 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 658 transitions.
[2024-03-09 05:46:22,160 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9536231884057971
[2024-03-09 05:46:22,161 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 658 transitions.
[2024-03-09 05:46:22,161 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 658 transitions.
[2024-03-09 05:46:22,161 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:46:22,161 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 658 transitions.
[2024-03-09 05:46:22,161 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 219.33333333333334) internal successors, (658), 3 states have internal predecessors, (658), 0 states have call successors, (0), 0 states 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:46:22,162 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 230.0) internal successors, (920), 4 states have internal predecessors, (920), 0 states have call successors, (0), 0 states 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:46:22,162 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 230.0) internal successors, (920), 4 states have internal predecessors, (920), 0 states have call successors, (0), 0 states 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:46:22,162 INFO  L175             Difference]: Start difference. First operand has 287 places, 671 transitions, 5526 flow. Second operand 3 states and 658 transitions.
[2024-03-09 05:46:22,162 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 688 transitions, 5706 flow
[2024-03-09 05:46:22,715 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 688 transitions, 5670 flow, removed 4 selfloop flow, removed 5 redundant places.
[2024-03-09 05:46:22,721 INFO  L231             Difference]: Finished difference. Result has 286 places, 686 transitions, 5672 flow
[2024-03-09 05:46:22,721 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=5490, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=671, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=652, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=5672, PETRI_PLACES=286, PETRI_TRANSITIONS=686}
[2024-03-09 05:46:22,721 INFO  L281   CegarLoopForPetriNet]: 220 programPoint places, 66 predicate places.
[2024-03-09 05:46:22,722 INFO  L495      AbstractCegarLoop]: Abstraction has has 286 places, 686 transitions, 5672 flow
[2024-03-09 05:46:22,722 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 213.66666666666666) internal successors, (641), 3 states have internal predecessors, (641), 0 states have call successors, (0), 0 states 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:46:22,722 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:46:22,722 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 05:46:22,722 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44
[2024-03-09 05:46:22,722 INFO  L420      AbstractCegarLoop]: === Iteration 16 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-09 05:46:22,723 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:46:22,723 INFO  L85        PathProgramCache]: Analyzing trace with hash 664455343, now seen corresponding path program 1 times
[2024-03-09 05:46:22,723 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:46:22,723 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024141644]
[2024-03-09 05:46:22,723 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:46:22,723 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:46:22,744 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:46:23,231 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:46:23,232 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:46:23,232 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024141644]
[2024-03-09 05:46:23,232 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024141644] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 05:46:23,233 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2129808861]
[2024-03-09 05:46:23,233 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:46:23,233 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 05:46:23,233 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 05:46:23,235 INFO  L229       MonitoredProcess]: Starting monitored process 12 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 05:46:23,238 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process
[2024-03-09 05:46:23,393 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:46:23,394 INFO  L262         TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 31 conjunts are in the unsatisfiable core
[2024-03-09 05:46:23,403 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 05:46:23,408 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-03-09 05:46:23,454 INFO  L349             Elim1Store]: treesize reduction 18, result has 35.7 percent of original size
[2024-03-09 05:46:23,455 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21
[2024-03-09 05:46:23,566 INFO  L349             Elim1Store]: treesize reduction 8, result has 61.9 percent of original size
[2024-03-09 05:46:23,567 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22
[2024-03-09 05:46:24,093 INFO  L349             Elim1Store]: treesize reduction 19, result has 20.8 percent of original size
[2024-03-09 05:46:24,094 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32
[2024-03-09 05:46:24,192 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12
[2024-03-09 05:46:24,225 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2024-03-09 05:46:24,234 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2024-03-09 05:46:24,250 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:46:24,251 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2024-03-09 05:46:24,271 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:46:24,272 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2024-03-09 05:46:24,309 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45
[2024-03-09 05:46:24,320 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:46:24,321 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-03-09 05:46:24,321 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2129808861] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:46:24,321 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-03-09 05:46:24,321 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14] total 20
[2024-03-09 05:46:24,321 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225554971]
[2024-03-09 05:46:24,321 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:46:24,322 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2024-03-09 05:46:24,322 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:46:24,322 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2024-03-09 05:46:24,323 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420
[2024-03-09 05:46:25,538 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 172 out of 230
[2024-03-09 05:46:25,540 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 686 transitions, 5672 flow. Second operand  has 14 states, 14 states have (on average 174.21428571428572) internal successors, (2439), 14 states have internal predecessors, (2439), 0 states have call successors, (0), 0 states 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:46:25,540 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:46:25,540 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 230
[2024-03-09 05:46:25,540 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:46:39,451 INFO  L124   PetriNetUnfolderBase]: 24242/82021 cut-off events.
[2024-03-09 05:46:39,451 INFO  L125   PetriNetUnfolderBase]: For 153330/155979 co-relation queries the response was YES.
[2024-03-09 05:46:40,081 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 228747 conditions, 82021 events. 24242/82021 cut-off events. For 153330/155979 co-relation queries the response was YES. Maximal size of possible extension queue 2148. Compared 1157773 event pairs, 2722 based on Foata normal form. 213/74632 useless extension candidates. Maximal degree in co-relation 228364. Up to 11947 conditions per place. 
[2024-03-09 05:46:40,504 INFO  L140   encePairwiseOnDemand]: 206/230 looper letters, 979 selfloop transitions, 484 changer transitions 10/1684 dead transitions.
[2024-03-09 05:46:40,505 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 1684 transitions, 19359 flow
[2024-03-09 05:46:40,505 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. 
[2024-03-09 05:46:40,506 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 20 states.
[2024-03-09 05:46:40,507 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3680 transitions.
[2024-03-09 05:46:40,507 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8
[2024-03-09 05:46:40,508 INFO  L72            ComplementDD]: Start complementDD. Operand 20 states and 3680 transitions.
[2024-03-09 05:46:40,508 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 20 states and 3680 transitions.
[2024-03-09 05:46:40,508 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:46:40,508 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 3680 transitions.
[2024-03-09 05:46:40,511 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 21 states, 20 states have (on average 184.0) internal successors, (3680), 20 states have internal predecessors, (3680), 0 states have call successors, (0), 0 states 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:46:40,513 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 21 states, 21 states have (on average 230.0) internal successors, (4830), 21 states have internal predecessors, (4830), 0 states have call successors, (0), 0 states 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:46:40,513 INFO  L81            ComplementDD]: Finished complementDD. Result  has 21 states, 21 states have (on average 230.0) internal successors, (4830), 21 states have internal predecessors, (4830), 0 states have call successors, (0), 0 states 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:46:40,513 INFO  L175             Difference]: Start difference. First operand has 286 places, 686 transitions, 5672 flow. Second operand 20 states and 3680 transitions.
[2024-03-09 05:46:40,513 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 1684 transitions, 19359 flow
[2024-03-09 05:46:41,692 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 1684 transitions, 19321 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-09 05:46:41,706 INFO  L231             Difference]: Finished difference. Result has 312 places, 1089 transitions, 12480 flow
[2024-03-09 05:46:41,707 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=5634, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=686, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=123, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=409, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=12480, PETRI_PLACES=312, PETRI_TRANSITIONS=1089}
[2024-03-09 05:46:41,707 INFO  L281   CegarLoopForPetriNet]: 220 programPoint places, 92 predicate places.
[2024-03-09 05:46:41,708 INFO  L495      AbstractCegarLoop]: Abstraction has has 312 places, 1089 transitions, 12480 flow
[2024-03-09 05:46:41,708 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 14 states, 14 states have (on average 174.21428571428572) internal successors, (2439), 14 states have internal predecessors, (2439), 0 states have call successors, (0), 0 states 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:46:41,708 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:46:41,708 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 05:46:41,715 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0
[2024-03-09 05:46:41,913 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45
[2024-03-09 05:46:41,914 INFO  L420      AbstractCegarLoop]: === Iteration 17 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-09 05:46:41,915 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:46:41,915 INFO  L85        PathProgramCache]: Analyzing trace with hash 822543803, now seen corresponding path program 2 times
[2024-03-09 05:46:41,915 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:46:41,915 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612311768]
[2024-03-09 05:46:41,916 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:46:41,916 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:46:41,939 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:46:42,706 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:46:42,707 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:46:42,707 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612311768]
[2024-03-09 05:46:42,707 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612311768] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 05:46:42,707 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [539981756]
[2024-03-09 05:46:42,708 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-03-09 05:46:42,708 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 05:46:42,708 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 05:46:42,710 INFO  L229       MonitoredProcess]: Starting monitored process 13 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 05:46:42,711 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process
[2024-03-09 05:46:42,905 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-03-09 05:46:42,905 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-09 05:46:42,907 INFO  L262         TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 35 conjunts are in the unsatisfiable core
[2024-03-09 05:46:42,912 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 05:46:42,931 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-03-09 05:46:43,036 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-03-09 05:46:43,037 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15
[2024-03-09 05:46:43,538 INFO  L349             Elim1Store]: treesize reduction 17, result has 22.7 percent of original size
[2024-03-09 05:46:43,538 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24
[2024-03-09 05:46:43,632 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:46:43,633 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19
[2024-03-09 05:46:43,665 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2024-03-09 05:46:43,728 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2024-03-09 05:46:43,812 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:46:43,813 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2024-03-09 05:46:44,069 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2024-03-09 05:46:44,159 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:46:44,160 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 35
[2024-03-09 05:46:44,195 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:46:44,195 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2024-03-09 05:46:44,278 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:46:44,279 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45
[2024-03-09 05:46:44,321 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:46:44,323 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45
[2024-03-09 05:46:44,364 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:46:44,365 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45
[2024-03-09 05:46:44,421 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45
[2024-03-09 05:46:44,434 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:46:44,435 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-03-09 05:46:44,435 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [539981756] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:46:44,435 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-03-09 05:46:44,436 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [15] total 25
[2024-03-09 05:46:44,436 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274200073]
[2024-03-09 05:46:44,437 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:46:44,437 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2024-03-09 05:46:44,438 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:46:44,438 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2024-03-09 05:46:44,439 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=552, Unknown=0, NotChecked=0, Total=650
[2024-03-09 05:46:46,374 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 173 out of 230
[2024-03-09 05:46:46,376 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 1089 transitions, 12480 flow. Second operand  has 15 states, 15 states have (on average 175.06666666666666) internal successors, (2626), 15 states have internal predecessors, (2626), 0 states have call successors, (0), 0 states 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:46:46,376 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:46:46,376 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 230
[2024-03-09 05:46:46,377 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:47:06,248 INFO  L124   PetriNetUnfolderBase]: 25400/88112 cut-off events.
[2024-03-09 05:47:06,248 INFO  L125   PetriNetUnfolderBase]: For 256314/261121 co-relation queries the response was YES.
[2024-03-09 05:47:07,051 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 269148 conditions, 88112 events. 25400/88112 cut-off events. For 256314/261121 co-relation queries the response was YES. Maximal size of possible extension queue 2290. Compared 1263382 event pairs, 2459 based on Foata normal form. 536/80664 useless extension candidates. Maximal degree in co-relation 268671. Up to 12119 conditions per place. 
[2024-03-09 05:47:07,372 INFO  L140   encePairwiseOnDemand]: 202/230 looper letters, 804 selfloop transitions, 929 changer transitions 1/1946 dead transitions.
[2024-03-09 05:47:07,372 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 1946 transitions, 26403 flow
[2024-03-09 05:47:07,373 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. 
[2024-03-09 05:47:07,374 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 26 states.
[2024-03-09 05:47:07,375 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 4859 transitions.
[2024-03-09 05:47:07,376 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8125418060200669
[2024-03-09 05:47:07,376 INFO  L72            ComplementDD]: Start complementDD. Operand 26 states and 4859 transitions.
[2024-03-09 05:47:07,376 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 26 states and 4859 transitions.
[2024-03-09 05:47:07,377 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:47:07,377 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 4859 transitions.
[2024-03-09 05:47:07,380 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 27 states, 26 states have (on average 186.8846153846154) internal successors, (4859), 26 states have internal predecessors, (4859), 0 states have call successors, (0), 0 states 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:47:07,383 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 27 states, 27 states have (on average 230.0) internal successors, (6210), 27 states have internal predecessors, (6210), 0 states have call successors, (0), 0 states 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:47:07,383 INFO  L81            ComplementDD]: Finished complementDD. Result  has 27 states, 27 states have (on average 230.0) internal successors, (6210), 27 states have internal predecessors, (6210), 0 states have call successors, (0), 0 states 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:47:07,383 INFO  L175             Difference]: Start difference. First operand has 312 places, 1089 transitions, 12480 flow. Second operand 26 states and 4859 transitions.
[2024-03-09 05:47:07,383 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 337 places, 1946 transitions, 26403 flow
[2024-03-09 05:47:09,538 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 331 places, 1946 transitions, 26263 flow, removed 64 selfloop flow, removed 6 redundant places.
[2024-03-09 05:47:09,559 INFO  L231             Difference]: Finished difference. Result has 342 places, 1555 transitions, 22779 flow
[2024-03-09 05:47:09,560 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=12356, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1089, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=481, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=503, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=22779, PETRI_PLACES=342, PETRI_TRANSITIONS=1555}
[2024-03-09 05:47:09,560 INFO  L281   CegarLoopForPetriNet]: 220 programPoint places, 122 predicate places.
[2024-03-09 05:47:09,560 INFO  L495      AbstractCegarLoop]: Abstraction has has 342 places, 1555 transitions, 22779 flow
[2024-03-09 05:47:09,561 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 15 states, 15 states have (on average 175.06666666666666) internal successors, (2626), 15 states have internal predecessors, (2626), 0 states have call successors, (0), 0 states 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:47:09,561 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:47:09,561 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 05:47:09,569 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0
[2024-03-09 05:47:09,762 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46
[2024-03-09 05:47:09,763 INFO  L420      AbstractCegarLoop]: === Iteration 18 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-09 05:47:09,763 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:47:09,764 INFO  L85        PathProgramCache]: Analyzing trace with hash -297008755, now seen corresponding path program 3 times
[2024-03-09 05:47:09,764 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:47:09,764 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396615594]
[2024-03-09 05:47:09,764 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:47:09,765 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:47:09,785 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:47:10,549 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:47:10,550 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:47:10,550 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396615594]
[2024-03-09 05:47:10,550 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396615594] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 05:47:10,550 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081470647]
[2024-03-09 05:47:10,550 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-03-09 05:47:10,550 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 05:47:10,550 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 05:47:10,551 INFO  L229       MonitoredProcess]: Starting monitored process 14 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 05:47:10,553 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process
[2024-03-09 05:47:10,741 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2024-03-09 05:47:10,741 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-09 05:47:10,744 INFO  L262         TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 60 conjunts are in the unsatisfiable core
[2024-03-09 05:47:10,749 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 05:47:10,927 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-03-09 05:47:11,075 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-03-09 05:47:11,076 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15
[2024-03-09 05:47:12,050 INFO  L349             Elim1Store]: treesize reduction 17, result has 22.7 percent of original size
[2024-03-09 05:47:12,051 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24
[2024-03-09 05:47:12,409 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:47:12,410 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19
[2024-03-09 05:47:12,493 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-09 05:47:12,893 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2024-03-09 05:47:12,966 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18
[2024-03-09 05:47:13,044 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28
[2024-03-09 05:47:13,131 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38
[2024-03-09 05:47:13,252 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:47:13,253 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-03-09 05:47:13,284 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:47:13,285 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-03-09 05:47:13,316 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:47:13,317 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-03-09 05:47:13,356 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:47:13,358 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-03-09 05:47:13,477 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-03-09 05:47:13,543 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:47:13,543 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-03-09 05:47:13,544 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2081470647] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:47:13,544 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-03-09 05:47:13,544 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [15] total 37
[2024-03-09 05:47:13,544 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109514310]
[2024-03-09 05:47:13,544 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:47:13,544 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 24 states
[2024-03-09 05:47:13,544 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:47:13,545 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants.
[2024-03-09 05:47:13,545 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1245, Unknown=0, NotChecked=0, Total=1406
[2024-03-09 05:47:18,683 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 149 out of 230
[2024-03-09 05:47:18,685 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 1555 transitions, 22779 flow. Second operand  has 24 states, 24 states have (on average 151.08333333333334) internal successors, (3626), 24 states have internal predecessors, (3626), 0 states have call successors, (0), 0 states 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:47:18,685 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:47:18,685 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 230
[2024-03-09 05:47:18,685 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:48:30,430 INFO  L124   PetriNetUnfolderBase]: 80180/261798 cut-off events.
[2024-03-09 05:48:30,431 INFO  L125   PetriNetUnfolderBase]: For 1163439/1171114 co-relation queries the response was YES.
[2024-03-09 05:48:33,241 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 885769 conditions, 261798 events. 80180/261798 cut-off events. For 1163439/1171114 co-relation queries the response was YES. Maximal size of possible extension queue 6964. Compared 4275855 event pairs, 10946 based on Foata normal form. 1077/237779 useless extension candidates. Maximal degree in co-relation 871863. Up to 40687 conditions per place. 
[2024-03-09 05:48:34,492 INFO  L140   encePairwiseOnDemand]: 181/230 looper letters, 3481 selfloop transitions, 1842 changer transitions 2/5513 dead transitions.
[2024-03-09 05:48:34,492 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 390 places, 5513 transitions, 94105 flow
[2024-03-09 05:48:34,493 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. 
[2024-03-09 05:48:34,493 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 49 states.
[2024-03-09 05:48:34,496 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 8035 transitions.
[2024-03-09 05:48:34,498 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.7129547471162379
[2024-03-09 05:48:34,498 INFO  L72            ComplementDD]: Start complementDD. Operand 49 states and 8035 transitions.
[2024-03-09 05:48:34,498 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 49 states and 8035 transitions.
[2024-03-09 05:48:34,499 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:48:34,499 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 49 states and 8035 transitions.
[2024-03-09 05:48:34,504 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 50 states, 49 states have (on average 163.9795918367347) internal successors, (8035), 49 states have internal predecessors, (8035), 0 states have call successors, (0), 0 states 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:48:34,509 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 50 states, 50 states have (on average 230.0) internal successors, (11500), 50 states have internal predecessors, (11500), 0 states have call successors, (0), 0 states 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:48:34,510 INFO  L81            ComplementDD]: Finished complementDD. Result  has 50 states, 50 states have (on average 230.0) internal successors, (11500), 50 states have internal predecessors, (11500), 0 states have call successors, (0), 0 states 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:48:34,510 INFO  L175             Difference]: Start difference. First operand has 342 places, 1555 transitions, 22779 flow. Second operand 49 states and 8035 transitions.
[2024-03-09 05:48:34,510 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 390 places, 5513 transitions, 94105 flow
[2024-03-09 05:49:06,335 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 383 places, 5513 transitions, 91678 flow, removed 1167 selfloop flow, removed 7 redundant places.
[2024-03-09 05:49:06,392 INFO  L231             Difference]: Finished difference. Result has 415 places, 3428 transitions, 63589 flow
[2024-03-09 05:49:06,393 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=21970, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1555, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=446, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=719, PETRI_DIFFERENCE_SUBTRAHEND_STATES=49, PETRI_FLOW=63589, PETRI_PLACES=415, PETRI_TRANSITIONS=3428}
[2024-03-09 05:49:06,393 INFO  L281   CegarLoopForPetriNet]: 220 programPoint places, 195 predicate places.
[2024-03-09 05:49:06,393 INFO  L495      AbstractCegarLoop]: Abstraction has has 415 places, 3428 transitions, 63589 flow
[2024-03-09 05:49:06,394 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 24 states, 24 states have (on average 151.08333333333334) internal successors, (3626), 24 states have internal predecessors, (3626), 0 states have call successors, (0), 0 states 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:49:06,394 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:49:06,394 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 05:49:06,402 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0
[2024-03-09 05:49:06,595 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47,14 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 05:49:06,596 INFO  L420      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-09 05:49:06,597 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:49:06,597 INFO  L85        PathProgramCache]: Analyzing trace with hash 1316675581, now seen corresponding path program 1 times
[2024-03-09 05:49:06,597 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:49:06,598 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297037611]
[2024-03-09 05:49:06,598 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:49:06,598 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:49:06,618 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:49:07,204 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:49:07,204 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:49:07,204 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297037611]
[2024-03-09 05:49:07,204 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297037611] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 05:49:07,205 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1180349461]
[2024-03-09 05:49:07,205 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:49:07,205 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 05:49:07,206 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 05:49:07,207 INFO  L229       MonitoredProcess]: Starting monitored process 15 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 05:49:07,208 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process
[2024-03-09 05:49:07,398 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:49:07,400 INFO  L262         TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 69 conjunts are in the unsatisfiable core
[2024-03-09 05:49:07,406 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 05:49:07,541 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-03-09 05:49:07,615 INFO  L349             Elim1Store]: treesize reduction 18, result has 35.7 percent of original size
[2024-03-09 05:49:07,615 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21
[2024-03-09 05:49:07,779 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:49:07,785 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-03-09 05:49:07,785 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 18
[2024-03-09 05:49:08,663 INFO  L349             Elim1Store]: treesize reduction 19, result has 20.8 percent of original size
[2024-03-09 05:49:08,664 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 44
[2024-03-09 05:49:08,668 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11
[2024-03-09 05:49:08,912 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:49:08,913 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18
[2024-03-09 05:49:08,923 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:49:08,923 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11
[2024-03-09 05:49:09,109 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12
[2024-03-09 05:49:09,114 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3
[2024-03-09 05:49:09,200 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-09 05:49:09,262 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18
[2024-03-09 05:49:09,329 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28
[2024-03-09 05:49:09,396 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38
[2024-03-09 05:49:09,499 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-03-09 05:49:09,564 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:49:09,565 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 05:49:09,591 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_2030 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_2030) |c_ULTIMATE.start_main_#t~mem21#1.base|) (+ 2 |c_ULTIMATE.start_main_#t~mem21#1.offset| .cse0)) 0)) (forall ((v_ArrVal_2030 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_2030) |c_ULTIMATE.start_main_#t~mem21#1.base|) (+ |c_ULTIMATE.start_main_#t~mem21#1.offset| 3 .cse0)) 0)) (forall ((v_ArrVal_2030 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_2030) |c_ULTIMATE.start_main_#t~mem21#1.base|) (+ |c_ULTIMATE.start_main_#t~mem21#1.offset| .cse0)) 0)) (forall ((v_ArrVal_2030 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_2030) |c_ULTIMATE.start_main_#t~mem21#1.base|) (+ |c_ULTIMATE.start_main_#t~mem21#1.offset| 1 .cse0)) 0)))) is different from false
[2024-03-09 05:49:09,609 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_#t~mem21#1.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_#t~mem21#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_#t~mem21#1.base|) .cse2 0)))) (and (forall ((v_ArrVal_2030 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_2030) |c_ULTIMATE.start_main_#t~mem21#1.base|) (+ |c_ULTIMATE.start_main_#t~mem21#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_2030 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_2030) |c_ULTIMATE.start_main_#t~mem21#1.base|) (+ |c_ULTIMATE.start_main_#t~mem21#1.offset| .cse1)) 0)) (forall ((v_ArrVal_2030 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_2030) |c_ULTIMATE.start_main_#t~mem21#1.base|) (+ 2 |c_ULTIMATE.start_main_#t~mem21#1.offset| .cse1)) 0)) (forall ((v_ArrVal_2030 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_2030) |c_ULTIMATE.start_main_#t~mem21#1.base|) .cse2) 0)))))) is different from false
[2024-03-09 05:49:09,626 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ 2 |c_ULTIMATE.start_main_#t~mem21#1.offset| .cse1)) (.cse3 (+ |c_ULTIMATE.start_main_#t~mem21#1.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_#t~mem21#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_#t~mem21#1.base|) .cse2 0) .cse3 0)))) (and (forall ((v_ArrVal_2030 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_2030) |c_ULTIMATE.start_main_#t~mem21#1.base|) (+ |c_ULTIMATE.start_main_#t~mem21#1.offset| .cse1)) 0)) (forall ((v_ArrVal_2030 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_2030) |c_ULTIMATE.start_main_#t~mem21#1.base|) (+ |c_ULTIMATE.start_main_#t~mem21#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_2030 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_2030) |c_ULTIMATE.start_main_#t~mem21#1.base|) .cse2) 0)) (forall ((v_ArrVal_2030 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_2030) |c_ULTIMATE.start_main_#t~mem21#1.base|) .cse3) 0)))))) is different from false
[2024-03-09 05:49:09,644 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse4 (+ |c_ULTIMATE.start_main_#t~mem21#1.offset| 1 .cse2)) (.cse1 (+ 2 |c_ULTIMATE.start_main_#t~mem21#1.offset| .cse2)) (.cse3 (+ |c_ULTIMATE.start_main_#t~mem21#1.offset| 3 .cse2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_#t~mem21#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_#t~mem21#1.base|) .cse4 0) .cse1 0) .cse3 0)))) (and (forall ((v_ArrVal_2030 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_2030) |c_ULTIMATE.start_main_#t~mem21#1.base|) .cse1) 0)) (forall ((v_ArrVal_2030 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_2030) |c_ULTIMATE.start_main_#t~mem21#1.base|) (+ |c_ULTIMATE.start_main_#t~mem21#1.offset| .cse2)) 0)) (forall ((v_ArrVal_2030 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_2030) |c_ULTIMATE.start_main_#t~mem21#1.base|) .cse3) 0)) (forall ((v_ArrVal_2030 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_2030) |c_ULTIMATE.start_main_#t~mem21#1.base|) .cse4) 0)))))) is different from false
[2024-03-09 05:49:09,660 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:49:09,661 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 67
[2024-03-09 05:49:09,667 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:49:09,668 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 83 treesize of output 39
[2024-03-09 05:49:09,674 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3
[2024-03-09 05:49:09,681 INFO  L349             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-03-09 05:49:09,681 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1
[2024-03-09 05:49:09,691 INFO  L349             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-03-09 05:49:09,692 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 1
[2024-03-09 05:49:09,701 INFO  L349             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-03-09 05:49:09,701 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1
[2024-03-09 05:49:09,771 WARN  L854   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2023 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_~datas~0.base v_ArrVal_2023) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) c_~datas~0.base))) is different from false
[2024-03-09 05:49:09,802 WARN  L854   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2023 (Array Int Int)) (v_ArrVal_2022 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_2022) c_~datas~0.base v_ArrVal_2023) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) c_~datas~0.base))) is different from false
[2024-03-09 05:49:09,822 WARN  L854   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2023 (Array Int Int)) (v_ArrVal_2022 (Array Int Int))) (not (= c_~datas~0.base (select (select (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2022) c_~datas~0.base v_ArrVal_2023) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) is different from false
[2024-03-09 05:49:10,163 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4
[2024-03-09 05:49:10,168 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 163 treesize of output 119
[2024-03-09 05:49:10,174 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48
[2024-03-09 05:49:10,179 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46
[2024-03-09 05:49:10,398 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:49:10,399 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1180349461] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 05:49:10,399 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 05:49:10,399 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 22, 17] total 50
[2024-03-09 05:49:10,399 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528996310]
[2024-03-09 05:49:10,399 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 05:49:10,399 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 51 states
[2024-03-09 05:49:10,400 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:49:10,400 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants.
[2024-03-09 05:49:10,401 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=1693, Unknown=7, NotChecked=630, Total=2550
[2024-03-09 05:49:10,798 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 129 out of 230
[2024-03-09 05:49:10,800 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 415 places, 3428 transitions, 63589 flow. Second operand  has 51 states, 51 states have (on average 132.0) internal successors, (6732), 51 states have internal predecessors, (6732), 0 states have call successors, (0), 0 states 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:49:10,800 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:49:10,801 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 230
[2024-03-09 05:49:10,801 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
