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


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


Checking for data races
Using default analysis
Version 0e0057cc
Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data -tc /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/config/AutomizerReach.xml -i /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/thread-join-counter-outer-race-2.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 16aae8574de5f988bdb62192b0f1c38f229e863d3fcdd951b69c8764a59a97c7
--- Real Ultimate output ---
This is Ultimate 0.2.4-dev-0e0057c
[2024-03-12 01:57:14,793 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-03-12 01:57:14,832 INFO  L114        SettingsManager]: Loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2024-03-12 01:57:14,835 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-03-12 01:57:14,835 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-03-12 01:57:14,854 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-03-12 01:57:14,854 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-03-12 01:57:14,855 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-03-12 01:57:14,855 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-03-12 01:57:14,855 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-03-12 01:57:14,856 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-03-12 01:57:14,856 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-03-12 01:57:14,856 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-03-12 01:57:14,857 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-03-12 01:57:14,857 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-03-12 01:57:14,857 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-03-12 01:57:14,857 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-03-12 01:57:14,858 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-03-12 01:57:14,858 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-03-12 01:57:14,858 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-03-12 01:57:14,858 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-03-12 01:57:14,859 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-03-12 01:57:14,859 INFO  L153        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2024-03-12 01:57:14,859 INFO  L153        SettingsManager]:  * Check unreachability of reach_error function=false
[2024-03-12 01:57:14,860 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-03-12 01:57:14,860 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-03-12 01:57:14,860 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-03-12 01:57:14,860 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-03-12 01:57:14,861 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-03-12 01:57:14,861 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-03-12 01:57:14,861 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-03-12 01:57:14,861 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-03-12 01:57:14,862 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-03-12 01:57:14,862 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-03-12 01:57:14,862 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-03-12 01:57:14,862 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-03-12 01:57:14,865 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-03-12 01:57:14,866 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-03-12 01:57:14,866 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-03-12 01:57:14,866 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-03-12 01:57:14,866 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-03-12 01:57:14,866 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 -> 16aae8574de5f988bdb62192b0f1c38f229e863d3fcdd951b69c8764a59a97c7
[2024-03-12 01:57:15,028 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-03-12 01:57:15,051 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-03-12 01:57:15,053 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-03-12 01:57:15,054 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-03-12 01:57:15,054 INFO  L274        PluginConnector]: CDTParser initialized
[2024-03-12 01:57:15,055 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/thread-join-counter-outer-race-2.i
[2024-03-12 01:57:16,210 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-03-12 01:57:16,374 INFO  L384              CDTParser]: Found 1 translation units.
[2024-03-12 01:57:16,375 INFO  L180              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/thread-join-counter-outer-race-2.i
[2024-03-12 01:57:16,385 INFO  L427              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data/226c3b492/50fc3b29923f4668ad337278cfa26711/FLAG00ccc7259
[2024-03-12 01:57:16,395 INFO  L435              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data/226c3b492/50fc3b29923f4668ad337278cfa26711
[2024-03-12 01:57:16,397 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-03-12 01:57:16,398 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-03-12 01:57:16,398 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-03-12 01:57:16,398 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-03-12 01:57:16,402 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-03-12 01:57:16,403 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.03 01:57:16" (1/1) ...
[2024-03-12 01:57:16,404 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1938ac3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:57:16, skipping insertion in model container
[2024-03-12 01:57:16,404 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.03 01:57:16" (1/1) ...
[2024-03-12 01:57:16,439 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-03-12 01:57:16,656 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2024-03-12 01:57:16,668 INFO  L202         MainTranslator]: Completed pre-run
[2024-03-12 01:57:16,696 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2024-03-12 01:57:16,716 WARN  L675               CHandler]: The function pthread_detach is called, but not defined or handled by StandardFunctionHandler.
[2024-03-12 01:57:16,737 INFO  L206         MainTranslator]: Completed translation
[2024-03-12 01:57:16,738 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:57:16 WrapperNode
[2024-03-12 01:57:16,738 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-03-12 01:57:16,740 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-03-12 01:57:16,740 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-03-12 01:57:16,741 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-03-12 01:57:16,750 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:57:16" (1/1) ...
[2024-03-12 01:57:16,761 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:57:16" (1/1) ...
[2024-03-12 01:57:16,788 INFO  L138                Inliner]: procedures = 160, calls = 42, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 105
[2024-03-12 01:57:16,788 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-03-12 01:57:16,789 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-03-12 01:57:16,789 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-03-12 01:57:16,789 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-03-12 01:57:16,796 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:57:16" (1/1) ...
[2024-03-12 01:57:16,796 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:57:16" (1/1) ...
[2024-03-12 01:57:16,799 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:57:16" (1/1) ...
[2024-03-12 01:57:16,799 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:57:16" (1/1) ...
[2024-03-12 01:57:16,804 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:57:16" (1/1) ...
[2024-03-12 01:57:16,806 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:57:16" (1/1) ...
[2024-03-12 01:57:16,807 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:57:16" (1/1) ...
[2024-03-12 01:57:16,808 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:57:16" (1/1) ...
[2024-03-12 01:57:16,810 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-03-12 01:57:16,811 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-03-12 01:57:16,811 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-03-12 01:57:16,811 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-03-12 01:57:16,812 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:57:16" (1/1) ...
[2024-03-12 01:57:16,816 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-03-12 01:57:16,827 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 01:57:16,838 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-03-12 01:57:16,850 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-03-12 01:57:16,884 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2024-03-12 01:57:16,885 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2024-03-12 01:57:16,885 INFO  L130     BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock
[2024-03-12 01:57:16,885 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-03-12 01:57:16,885 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2024-03-12 01:57:16,885 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-03-12 01:57:16,886 INFO  L130     BoogieDeclarations]: Found specification of procedure pthread_detach
[2024-03-12 01:57:16,886 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2024-03-12 01:57:16,886 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2024-03-12 01:57:16,886 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2024-03-12 01:57:16,886 INFO  L130     BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock
[2024-03-12 01:57:16,887 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-03-12 01:57:16,887 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-03-12 01:57:16,888 WARN  L213             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-03-12 01:57:17,001 INFO  L241             CfgBuilder]: Building ICFG
[2024-03-12 01:57:17,003 INFO  L267             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-03-12 01:57:17,193 INFO  L282             CfgBuilder]: Performing block encoding
[2024-03-12 01:57:17,217 INFO  L304             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-03-12 01:57:17,217 INFO  L309             CfgBuilder]: Removed 2 assume(true) statements.
[2024-03-12 01:57:17,218 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.03 01:57:17 BoogieIcfgContainer
[2024-03-12 01:57:17,218 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-03-12 01:57:17,220 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-03-12 01:57:17,220 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-03-12 01:57:17,222 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-03-12 01:57:17,222 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.03 01:57:16" (1/3) ...
[2024-03-12 01:57:17,222 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@251d65be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.03 01:57:17, skipping insertion in model container
[2024-03-12 01:57:17,223 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:57:16" (2/3) ...
[2024-03-12 01:57:17,223 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@251d65be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.03 01:57:17, skipping insertion in model container
[2024-03-12 01:57:17,223 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.03 01:57:17" (3/3) ...
[2024-03-12 01:57:17,224 INFO  L112   eAbstractionObserver]: Analyzing ICFG thread-join-counter-outer-race-2.i
[2024-03-12 01:57:17,230 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2024-03-12 01:57:17,237 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-03-12 01:57:17,237 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations.
[2024-03-12 01:57:17,237 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-03-12 01:57:17,275 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-03-12 01:57:17,301 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 139 places, 140 transitions, 284 flow
[2024-03-12 01:57:17,352 INFO  L124   PetriNetUnfolderBase]: 7/184 cut-off events.
[2024-03-12 01:57:17,352 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-03-12 01:57:17,357 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 188 conditions, 184 events. 7/184 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 252 event pairs, 0 based on Foata normal form. 0/163 useless extension candidates. Maximal degree in co-relation 93. Up to 4 conditions per place. 
[2024-03-12 01:57:17,357 INFO  L82        GeneralOperation]: Start removeDead. Operand has 139 places, 140 transitions, 284 flow
[2024-03-12 01:57:17,362 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 139 places, 140 transitions, 284 flow
[2024-03-12 01:57:17,374 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-12 01:57:17,380 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;@39e84bcd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-03-12 01:57:17,380 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 12 error locations.
[2024-03-12 01:57:17,390 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-03-12 01:57:17,390 INFO  L124   PetriNetUnfolderBase]: 2/54 cut-off events.
[2024-03-12 01:57:17,390 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-03-12 01:57:17,390 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:57:17,391 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:57:17,391 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 9 more)] ===
[2024-03-12 01:57:17,395 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:57:17,395 INFO  L85        PathProgramCache]: Analyzing trace with hash 268548463, now seen corresponding path program 1 times
[2024-03-12 01:57:17,402 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:57:17,402 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189376971]
[2024-03-12 01:57:17,402 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:57:17,403 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:57:17,487 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:57:17,582 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:57:17,582 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:57:17,582 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189376971]
[2024-03-12 01:57:17,583 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189376971] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:57:17,583 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:57:17,583 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 01:57:17,584 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090248218]
[2024-03-12 01:57:17,585 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:57:17,591 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 01:57:17,595 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:57:17,614 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 01:57:17,614 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 01:57:17,643 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 115 out of 140
[2024-03-12 01:57:17,645 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 140 transitions, 284 flow. Second operand  has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:57:17,645 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:57:17,646 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 140
[2024-03-12 01:57:17,646 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:57:17,810 INFO  L124   PetriNetUnfolderBase]: 116/739 cut-off events.
[2024-03-12 01:57:17,810 INFO  L125   PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES.
[2024-03-12 01:57:17,813 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1009 conditions, 739 events. 116/739 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 4403 event pairs, 37 based on Foata normal form. 5/664 useless extension candidates. Maximal degree in co-relation 902. Up to 144 conditions per place. 
[2024-03-12 01:57:17,817 INFO  L140   encePairwiseOnDemand]: 126/140 looper letters, 32 selfloop transitions, 8 changer transitions 1/155 dead transitions.
[2024-03-12 01:57:17,817 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 155 transitions, 394 flow
[2024-03-12 01:57:17,819 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 01:57:17,821 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 01:57:17,827 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 393 transitions.
[2024-03-12 01:57:17,829 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9357142857142857
[2024-03-12 01:57:17,830 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 393 transitions.
[2024-03-12 01:57:17,830 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 393 transitions.
[2024-03-12 01:57:17,832 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:57:17,834 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 393 transitions.
[2024-03-12 01:57:17,839 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:57:17,845 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:57:17,845 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:57:17,846 INFO  L175             Difference]: Start difference. First operand has 139 places, 140 transitions, 284 flow. Second operand 3 states and 393 transitions.
[2024-03-12 01:57:17,847 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 155 transitions, 394 flow
[2024-03-12 01:57:17,850 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 155 transitions, 394 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-12 01:57:17,853 INFO  L231             Difference]: Finished difference. Result has 143 places, 144 transitions, 346 flow
[2024-03-12 01:57:17,854 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=346, PETRI_PLACES=143, PETRI_TRANSITIONS=144}
[2024-03-12 01:57:17,857 INFO  L281   CegarLoopForPetriNet]: 139 programPoint places, 4 predicate places.
[2024-03-12 01:57:17,857 INFO  L495      AbstractCegarLoop]: Abstraction has has 143 places, 144 transitions, 346 flow
[2024-03-12 01:57:17,857 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:57:17,857 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:57:17,858 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:57:17,858 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-03-12 01:57:17,858 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 9 more)] ===
[2024-03-12 01:57:17,858 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:57:17,859 INFO  L85        PathProgramCache]: Analyzing trace with hash 1243325860, now seen corresponding path program 1 times
[2024-03-12 01:57:17,859 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:57:17,859 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932713187]
[2024-03-12 01:57:17,859 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:57:17,859 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:57:17,878 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:57:17,917 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:57:17,917 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:57:17,917 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932713187]
[2024-03-12 01:57:17,917 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932713187] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:57:17,917 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:57:17,918 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 01:57:17,918 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410555281]
[2024-03-12 01:57:17,918 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:57:17,919 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 01:57:17,919 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:57:17,920 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 01:57:17,920 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 01:57:17,950 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 115 out of 140
[2024-03-12 01:57:17,951 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 144 transitions, 346 flow. Second operand  has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:57:17,951 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:57:17,951 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 140
[2024-03-12 01:57:17,951 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:57:18,088 INFO  L124   PetriNetUnfolderBase]: 134/875 cut-off events.
[2024-03-12 01:57:18,089 INFO  L125   PetriNetUnfolderBase]: For 172/177 co-relation queries the response was YES.
[2024-03-12 01:57:18,090 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1365 conditions, 875 events. 134/875 cut-off events. For 172/177 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 5670 event pairs, 84 based on Foata normal form. 4/796 useless extension candidates. Maximal degree in co-relation 1246. Up to 266 conditions per place. 
[2024-03-12 01:57:18,092 INFO  L140   encePairwiseOnDemand]: 134/140 looper letters, 29 selfloop transitions, 7 changer transitions 0/153 dead transitions.
[2024-03-12 01:57:18,093 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 153 transitions, 446 flow
[2024-03-12 01:57:18,094 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 01:57:18,094 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 01:57:18,096 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 376 transitions.
[2024-03-12 01:57:18,097 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8952380952380953
[2024-03-12 01:57:18,097 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 376 transitions.
[2024-03-12 01:57:18,097 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 376 transitions.
[2024-03-12 01:57:18,098 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:57:18,098 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 376 transitions.
[2024-03-12 01:57:18,099 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:57:18,102 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:57:18,102 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:57:18,102 INFO  L175             Difference]: Start difference. First operand has 143 places, 144 transitions, 346 flow. Second operand 3 states and 376 transitions.
[2024-03-12 01:57:18,103 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 153 transitions, 446 flow
[2024-03-12 01:57:18,106 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 153 transitions, 426 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-12 01:57:18,109 INFO  L231             Difference]: Finished difference. Result has 144 places, 149 transitions, 386 flow
[2024-03-12 01:57:18,110 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=386, PETRI_PLACES=144, PETRI_TRANSITIONS=149}
[2024-03-12 01:57:18,111 INFO  L281   CegarLoopForPetriNet]: 139 programPoint places, 5 predicate places.
[2024-03-12 01:57:18,111 INFO  L495      AbstractCegarLoop]: Abstraction has has 144 places, 149 transitions, 386 flow
[2024-03-12 01:57:18,112 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:57:18,112 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:57:18,112 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:57:18,112 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-03-12 01:57:18,112 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 9 more)] ===
[2024-03-12 01:57:18,113 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:57:18,113 INFO  L85        PathProgramCache]: Analyzing trace with hash -63629006, now seen corresponding path program 1 times
[2024-03-12 01:57:18,113 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:57:18,113 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400876356]
[2024-03-12 01:57:18,113 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:57:18,114 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:57:18,128 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:57:18,157 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:57:18,158 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:57:18,158 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400876356]
[2024-03-12 01:57:18,158 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400876356] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:57:18,158 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:57:18,158 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 01:57:18,159 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231121859]
[2024-03-12 01:57:18,159 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:57:18,159 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 01:57:18,160 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:57:18,160 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 01:57:18,160 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 01:57:18,169 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 122 out of 140
[2024-03-12 01:57:18,170 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 149 transitions, 386 flow. Second operand  has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:57:18,170 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:57:18,170 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 140
[2024-03-12 01:57:18,170 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:57:18,280 INFO  L124   PetriNetUnfolderBase]: 93/806 cut-off events.
[2024-03-12 01:57:18,280 INFO  L125   PetriNetUnfolderBase]: For 61/61 co-relation queries the response was YES.
[2024-03-12 01:57:18,281 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1163 conditions, 806 events. 93/806 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 5289 event pairs, 51 based on Foata normal form. 0/738 useless extension candidates. Maximal degree in co-relation 1049. Up to 147 conditions per place. 
[2024-03-12 01:57:18,283 INFO  L140   encePairwiseOnDemand]: 136/140 looper letters, 17 selfloop transitions, 3 changer transitions 1/155 dead transitions.
[2024-03-12 01:57:18,283 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 155 transitions, 440 flow
[2024-03-12 01:57:18,284 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 01:57:18,284 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 01:57:18,285 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 388 transitions.
[2024-03-12 01:57:18,285 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9238095238095239
[2024-03-12 01:57:18,285 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 388 transitions.
[2024-03-12 01:57:18,285 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 388 transitions.
[2024-03-12 01:57:18,285 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:57:18,285 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 388 transitions.
[2024-03-12 01:57:18,286 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:57:18,287 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:57:18,287 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:57:18,288 INFO  L175             Difference]: Start difference. First operand has 144 places, 149 transitions, 386 flow. Second operand 3 states and 388 transitions.
[2024-03-12 01:57:18,288 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 155 transitions, 440 flow
[2024-03-12 01:57:18,289 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 155 transitions, 426 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-12 01:57:18,291 INFO  L231             Difference]: Finished difference. Result has 146 places, 151 transitions, 394 flow
[2024-03-12 01:57:18,291 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=394, PETRI_PLACES=146, PETRI_TRANSITIONS=151}
[2024-03-12 01:57:18,292 INFO  L281   CegarLoopForPetriNet]: 139 programPoint places, 7 predicate places.
[2024-03-12 01:57:18,292 INFO  L495      AbstractCegarLoop]: Abstraction has has 146 places, 151 transitions, 394 flow
[2024-03-12 01:57:18,292 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:57:18,292 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:57:18,293 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:57:18,293 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-03-12 01:57:18,293 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 9 more)] ===
[2024-03-12 01:57:18,293 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:57:18,293 INFO  L85        PathProgramCache]: Analyzing trace with hash 1231976187, now seen corresponding path program 1 times
[2024-03-12 01:57:18,294 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:57:18,294 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532449814]
[2024-03-12 01:57:18,294 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:57:18,294 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:57:18,317 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:57:18,648 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:57:18,648 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:57:18,648 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532449814]
[2024-03-12 01:57:18,648 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532449814] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:57:18,649 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:57:18,649 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 01:57:18,649 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102564454]
[2024-03-12 01:57:18,649 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:57:18,649 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-12 01:57:18,650 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:57:18,650 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-12 01:57:18,650 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-12 01:57:18,697 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 115 out of 140
[2024-03-12 01:57:18,698 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 151 transitions, 394 flow. Second operand  has 6 states, 6 states have (on average 116.66666666666667) internal successors, (700), 6 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:57:18,698 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:57:18,698 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 140
[2024-03-12 01:57:18,698 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:57:18,823 INFO  L124   PetriNetUnfolderBase]: 108/1003 cut-off events.
[2024-03-12 01:57:18,823 INFO  L125   PetriNetUnfolderBase]: For 53/53 co-relation queries the response was YES.
[2024-03-12 01:57:18,825 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1447 conditions, 1003 events. 108/1003 cut-off events. For 53/53 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 6803 event pairs, 49 based on Foata normal form. 0/929 useless extension candidates. Maximal degree in co-relation 1328. Up to 167 conditions per place. 
[2024-03-12 01:57:18,827 INFO  L140   encePairwiseOnDemand]: 134/140 looper letters, 32 selfloop transitions, 5 changer transitions 0/166 dead transitions.
[2024-03-12 01:57:18,827 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 166 transitions, 498 flow
[2024-03-12 01:57:18,828 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 01:57:18,828 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 01:57:18,829 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 728 transitions.
[2024-03-12 01:57:18,829 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8666666666666667
[2024-03-12 01:57:18,829 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 728 transitions.
[2024-03-12 01:57:18,830 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 728 transitions.
[2024-03-12 01:57:18,830 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:57:18,830 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 728 transitions.
[2024-03-12 01:57:18,832 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 121.33333333333333) internal successors, (728), 6 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:57:18,833 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 140.0) internal successors, (980), 7 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:57:18,834 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 140.0) internal successors, (980), 7 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:57:18,834 INFO  L175             Difference]: Start difference. First operand has 146 places, 151 transitions, 394 flow. Second operand 6 states and 728 transitions.
[2024-03-12 01:57:18,834 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 166 transitions, 498 flow
[2024-03-12 01:57:18,836 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 166 transitions, 492 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-12 01:57:18,837 INFO  L231             Difference]: Finished difference. Result has 148 places, 150 transitions, 396 flow
[2024-03-12 01:57:18,838 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=386, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=396, PETRI_PLACES=148, PETRI_TRANSITIONS=150}
[2024-03-12 01:57:18,838 INFO  L281   CegarLoopForPetriNet]: 139 programPoint places, 9 predicate places.
[2024-03-12 01:57:18,838 INFO  L495      AbstractCegarLoop]: Abstraction has has 148 places, 150 transitions, 396 flow
[2024-03-12 01:57:18,839 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 116.66666666666667) internal successors, (700), 6 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:57:18,839 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:57:18,839 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]
[2024-03-12 01:57:18,839 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-03-12 01:57:18,840 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 9 more)] ===
[2024-03-12 01:57:18,840 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:57:18,840 INFO  L85        PathProgramCache]: Analyzing trace with hash 1655414337, now seen corresponding path program 1 times
[2024-03-12 01:57:18,840 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:57:18,840 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495216805]
[2024-03-12 01:57:18,840 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:57:18,841 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:57:18,852 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:57:18,875 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:57:18,875 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:57:18,875 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495216805]
[2024-03-12 01:57:18,876 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495216805] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:57:18,876 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:57:18,876 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 01:57:18,876 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480875603]
[2024-03-12 01:57:18,876 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:57:18,876 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 01:57:18,877 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:57:18,877 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 01:57:18,877 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 01:57:18,897 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 117 out of 140
[2024-03-12 01:57:18,898 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 150 transitions, 396 flow. Second operand  has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:57:18,898 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:57:18,898 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 140
[2024-03-12 01:57:18,898 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:57:19,005 INFO  L124   PetriNetUnfolderBase]: 175/1019 cut-off events.
[2024-03-12 01:57:19,005 INFO  L125   PetriNetUnfolderBase]: For 168/175 co-relation queries the response was YES.
[2024-03-12 01:57:19,006 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1667 conditions, 1019 events. 175/1019 cut-off events. For 168/175 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 6929 event pairs, 79 based on Foata normal form. 3/937 useless extension candidates. Maximal degree in co-relation 1548. Up to 303 conditions per place. 
[2024-03-12 01:57:19,008 INFO  L140   encePairwiseOnDemand]: 133/140 looper letters, 30 selfloop transitions, 11 changer transitions 0/163 dead transitions.
[2024-03-12 01:57:19,008 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 163 transitions, 518 flow
[2024-03-12 01:57:19,009 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 01:57:19,009 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 01:57:19,010 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 383 transitions.
[2024-03-12 01:57:19,010 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9119047619047619
[2024-03-12 01:57:19,010 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 383 transitions.
[2024-03-12 01:57:19,010 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 383 transitions.
[2024-03-12 01:57:19,010 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:57:19,010 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 383 transitions.
[2024-03-12 01:57:19,011 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:57:19,012 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:57:19,012 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:57:19,013 INFO  L175             Difference]: Start difference. First operand has 148 places, 150 transitions, 396 flow. Second operand 3 states and 383 transitions.
[2024-03-12 01:57:19,013 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 163 transitions, 518 flow
[2024-03-12 01:57:19,014 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 163 transitions, 508 flow, removed 0 selfloop flow, removed 5 redundant places.
[2024-03-12 01:57:19,016 INFO  L231             Difference]: Finished difference. Result has 147 places, 157 transitions, 474 flow
[2024-03-12 01:57:19,016 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=386, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=474, PETRI_PLACES=147, PETRI_TRANSITIONS=157}
[2024-03-12 01:57:19,017 INFO  L281   CegarLoopForPetriNet]: 139 programPoint places, 8 predicate places.
[2024-03-12 01:57:19,017 INFO  L495      AbstractCegarLoop]: Abstraction has has 147 places, 157 transitions, 474 flow
[2024-03-12 01:57:19,017 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:57:19,017 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:57:19,017 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:57:19,018 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-03-12 01:57:19,018 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 9 more)] ===
[2024-03-12 01:57:19,018 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:57:19,018 INFO  L85        PathProgramCache]: Analyzing trace with hash -1695768376, now seen corresponding path program 1 times
[2024-03-12 01:57:19,018 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:57:19,018 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528467269]
[2024-03-12 01:57:19,018 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:57:19,019 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:57:19,031 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:57:19,053 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:57:19,053 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:57:19,053 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528467269]
[2024-03-12 01:57:19,053 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528467269] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:57:19,053 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:57:19,054 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 01:57:19,054 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234839063]
[2024-03-12 01:57:19,054 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:57:19,054 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 01:57:19,054 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:57:19,055 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 01:57:19,055 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 01:57:19,063 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 120 out of 140
[2024-03-12 01:57:19,064 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 157 transitions, 474 flow. Second operand  has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:57:19,064 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:57:19,064 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 140
[2024-03-12 01:57:19,064 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:57:19,168 INFO  L124   PetriNetUnfolderBase]: 151/958 cut-off events.
[2024-03-12 01:57:19,168 INFO  L125   PetriNetUnfolderBase]: For 265/265 co-relation queries the response was YES.
[2024-03-12 01:57:19,169 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1664 conditions, 958 events. 151/958 cut-off events. For 265/265 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 6805 event pairs, 69 based on Foata normal form. 0/913 useless extension candidates. Maximal degree in co-relation 1543. Up to 227 conditions per place. 
[2024-03-12 01:57:19,172 INFO  L140   encePairwiseOnDemand]: 135/140 looper letters, 21 selfloop transitions, 4 changer transitions 3/166 dead transitions.
[2024-03-12 01:57:19,172 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 166 transitions, 548 flow
[2024-03-12 01:57:19,172 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 01:57:19,172 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 01:57:19,173 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 387 transitions.
[2024-03-12 01:57:19,173 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9214285714285714
[2024-03-12 01:57:19,173 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 387 transitions.
[2024-03-12 01:57:19,173 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 387 transitions.
[2024-03-12 01:57:19,174 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:57:19,174 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 387 transitions.
[2024-03-12 01:57:19,175 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:57:19,175 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:57:19,176 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:57:19,176 INFO  L175             Difference]: Start difference. First operand has 147 places, 157 transitions, 474 flow. Second operand 3 states and 387 transitions.
[2024-03-12 01:57:19,176 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 166 transitions, 548 flow
[2024-03-12 01:57:19,178 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 166 transitions, 526 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-12 01:57:19,179 INFO  L231             Difference]: Finished difference. Result has 149 places, 157 transitions, 474 flow
[2024-03-12 01:57:19,180 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=452, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=474, PETRI_PLACES=149, PETRI_TRANSITIONS=157}
[2024-03-12 01:57:19,180 INFO  L281   CegarLoopForPetriNet]: 139 programPoint places, 10 predicate places.
[2024-03-12 01:57:19,181 INFO  L495      AbstractCegarLoop]: Abstraction has has 149 places, 157 transitions, 474 flow
[2024-03-12 01:57:19,181 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:57:19,181 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:57:19,181 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:57:19,182 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-03-12 01:57:19,182 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 9 more)] ===
[2024-03-12 01:57:19,182 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:57:19,182 INFO  L85        PathProgramCache]: Analyzing trace with hash -1491030606, now seen corresponding path program 1 times
[2024-03-12 01:57:19,182 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:57:19,182 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208265645]
[2024-03-12 01:57:19,182 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:57:19,183 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:57:19,197 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:57:19,271 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2024-03-12 01:57:19,271 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:57:19,271 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208265645]
[2024-03-12 01:57:19,271 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208265645] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:57:19,271 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:57:19,271 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-03-12 01:57:19,271 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823487817]
[2024-03-12 01:57:19,272 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:57:19,272 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 01:57:19,272 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:57:19,273 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 01:57:19,273 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 01:57:19,283 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 125 out of 140
[2024-03-12 01:57:19,284 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 157 transitions, 474 flow. Second operand  has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:57:19,284 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:57:19,284 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 140
[2024-03-12 01:57:19,284 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:57:19,345 INFO  L124   PetriNetUnfolderBase]: 22/460 cut-off events.
[2024-03-12 01:57:19,345 INFO  L125   PetriNetUnfolderBase]: For 96/102 co-relation queries the response was YES.
[2024-03-12 01:57:19,346 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 731 conditions, 460 events. 22/460 cut-off events. For 96/102 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2236 event pairs, 7 based on Foata normal form. 6/453 useless extension candidates. Maximal degree in co-relation 612. Up to 45 conditions per place. 
[2024-03-12 01:57:19,347 INFO  L140   encePairwiseOnDemand]: 131/140 looper letters, 6 selfloop transitions, 9 changer transitions 2/139 dead transitions.
[2024-03-12 01:57:19,347 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 139 transitions, 394 flow
[2024-03-12 01:57:19,348 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 01:57:19,348 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 01:57:19,349 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 396 transitions.
[2024-03-12 01:57:19,349 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9428571428571428
[2024-03-12 01:57:19,349 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 396 transitions.
[2024-03-12 01:57:19,349 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 396 transitions.
[2024-03-12 01:57:19,349 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:57:19,349 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 396 transitions.
[2024-03-12 01:57:19,350 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:57:19,351 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:57:19,351 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:57:19,351 INFO  L175             Difference]: Start difference. First operand has 149 places, 157 transitions, 474 flow. Second operand 3 states and 396 transitions.
[2024-03-12 01:57:19,351 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 139 transitions, 394 flow
[2024-03-12 01:57:19,353 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 139 transitions, 356 flow, removed 11 selfloop flow, removed 6 redundant places.
[2024-03-12 01:57:19,354 INFO  L231             Difference]: Finished difference. Result has 141 places, 136 transitions, 347 flow
[2024-03-12 01:57:19,355 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=347, PETRI_PLACES=141, PETRI_TRANSITIONS=136}
[2024-03-12 01:57:19,355 INFO  L281   CegarLoopForPetriNet]: 139 programPoint places, 2 predicate places.
[2024-03-12 01:57:19,355 INFO  L495      AbstractCegarLoop]: Abstraction has has 141 places, 136 transitions, 347 flow
[2024-03-12 01:57:19,356 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:57:19,356 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:57:19,356 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:57:19,356 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-03-12 01:57:19,356 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 9 more)] ===
[2024-03-12 01:57:19,356 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:57:19,356 INFO  L85        PathProgramCache]: Analyzing trace with hash -232023352, now seen corresponding path program 1 times
[2024-03-12 01:57:19,357 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:57:19,357 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698973607]
[2024-03-12 01:57:19,357 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:57:19,357 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:57:19,377 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-12 01:57:19,378 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-03-12 01:57:19,388 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-12 01:57:19,410 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-03-12 01:57:19,411 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-03-12 01:57:19,411 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 12 remaining)
[2024-03-12 01:57:19,413 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (10 of 12 remaining)
[2024-03-12 01:57:19,413 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (9 of 12 remaining)
[2024-03-12 01:57:19,413 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (8 of 12 remaining)
[2024-03-12 01:57:19,413 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (7 of 12 remaining)
[2024-03-12 01:57:19,413 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 12 remaining)
[2024-03-12 01:57:19,413 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 12 remaining)
[2024-03-12 01:57:19,414 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 12 remaining)
[2024-03-12 01:57:19,414 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (3 of 12 remaining)
[2024-03-12 01:57:19,414 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 12 remaining)
[2024-03-12 01:57:19,414 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 12 remaining)
[2024-03-12 01:57:19,414 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (0 of 12 remaining)
[2024-03-12 01:57:19,414 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-03-12 01:57:19,414 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:57:19,416 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-03-12 01:57:19,416 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2024-03-12 01:57:19,435 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-03-12 01:57:19,437 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 173 places, 172 transitions, 354 flow
[2024-03-12 01:57:19,465 INFO  L124   PetriNetUnfolderBase]: 10/278 cut-off events.
[2024-03-12 01:57:19,465 INFO  L125   PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES.
[2024-03-12 01:57:19,466 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 286 conditions, 278 events. 10/278 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 434 event pairs, 0 based on Foata normal form. 0/245 useless extension candidates. Maximal degree in co-relation 185. Up to 6 conditions per place. 
[2024-03-12 01:57:19,466 INFO  L82        GeneralOperation]: Start removeDead. Operand has 173 places, 172 transitions, 354 flow
[2024-03-12 01:57:19,468 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 173 places, 172 transitions, 354 flow
[2024-03-12 01:57:19,469 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-12 01:57:19,470 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@39e84bcd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-03-12 01:57:19,470 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 15 error locations.
[2024-03-12 01:57:19,474 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-03-12 01:57:19,474 INFO  L124   PetriNetUnfolderBase]: 2/54 cut-off events.
[2024-03-12 01:57:19,474 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-03-12 01:57:19,474 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:57:19,474 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:57:19,474 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-03-12 01:57:19,475 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:57:19,475 INFO  L85        PathProgramCache]: Analyzing trace with hash 1655717231, now seen corresponding path program 1 times
[2024-03-12 01:57:19,475 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:57:19,475 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002035067]
[2024-03-12 01:57:19,475 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:57:19,475 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:57:19,482 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:57:19,504 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:57:19,505 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:57:19,505 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002035067]
[2024-03-12 01:57:19,505 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002035067] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:57:19,505 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:57:19,505 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 01:57:19,505 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664167188]
[2024-03-12 01:57:19,505 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:57:19,506 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 01:57:19,506 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:57:19,506 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 01:57:19,506 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 01:57:19,530 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 138 out of 172
[2024-03-12 01:57:19,530 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 172 transitions, 354 flow. Second operand  has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:57:19,531 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:57:19,531 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 172
[2024-03-12 01:57:19,531 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:57:20,465 INFO  L124   PetriNetUnfolderBase]: 2738/8867 cut-off events.
[2024-03-12 01:57:20,465 INFO  L125   PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES.
[2024-03-12 01:57:20,476 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13375 conditions, 8867 events. 2738/8867 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 92260 event pairs, 1071 based on Foata normal form. 56/7813 useless extension candidates. Maximal degree in co-relation 11927. Up to 2307 conditions per place. 
[2024-03-12 01:57:20,503 INFO  L140   encePairwiseOnDemand]: 154/172 looper letters, 46 selfloop transitions, 11 changer transitions 1/195 dead transitions.
[2024-03-12 01:57:20,503 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 195 transitions, 519 flow
[2024-03-12 01:57:20,504 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 01:57:20,504 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 01:57:20,505 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 480 transitions.
[2024-03-12 01:57:20,505 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9302325581395349
[2024-03-12 01:57:20,505 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 480 transitions.
[2024-03-12 01:57:20,505 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 480 transitions.
[2024-03-12 01:57:20,505 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:57:20,505 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 480 transitions.
[2024-03-12 01:57:20,506 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 160.0) internal successors, (480), 3 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:57:20,507 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:57:20,508 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:57:20,508 INFO  L175             Difference]: Start difference. First operand has 173 places, 172 transitions, 354 flow. Second operand 3 states and 480 transitions.
[2024-03-12 01:57:20,508 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 195 transitions, 519 flow
[2024-03-12 01:57:20,509 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 195 transitions, 519 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-12 01:57:20,510 INFO  L231             Difference]: Finished difference. Result has 177 places, 179 transitions, 442 flow
[2024-03-12 01:57:20,511 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=442, PETRI_PLACES=177, PETRI_TRANSITIONS=179}
[2024-03-12 01:57:20,511 INFO  L281   CegarLoopForPetriNet]: 173 programPoint places, 4 predicate places.
[2024-03-12 01:57:20,511 INFO  L495      AbstractCegarLoop]: Abstraction has has 177 places, 179 transitions, 442 flow
[2024-03-12 01:57:20,512 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:57:20,512 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:57:20,512 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:57:20,512 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-03-12 01:57:20,512 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-03-12 01:57:20,512 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:57:20,512 INFO  L85        PathProgramCache]: Analyzing trace with hash -1113049264, now seen corresponding path program 1 times
[2024-03-12 01:57:20,513 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:57:20,513 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892287125]
[2024-03-12 01:57:20,513 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:57:20,513 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:57:20,523 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:57:20,541 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:57:20,541 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:57:20,542 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892287125]
[2024-03-12 01:57:20,542 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892287125] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:57:20,542 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:57:20,542 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 01:57:20,542 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132041435]
[2024-03-12 01:57:20,542 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:57:20,542 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 01:57:20,543 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:57:20,543 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 01:57:20,543 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 01:57:20,577 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 140 out of 172
[2024-03-12 01:57:20,577 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 179 transitions, 442 flow. Second operand  has 3 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:57:20,577 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:57:20,578 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 172
[2024-03-12 01:57:20,578 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:57:21,714 INFO  L124   PetriNetUnfolderBase]: 2944/10805 cut-off events.
[2024-03-12 01:57:21,714 INFO  L125   PetriNetUnfolderBase]: For 3068/3172 co-relation queries the response was YES.
[2024-03-12 01:57:21,731 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18674 conditions, 10805 events. 2944/10805 cut-off events. For 3068/3172 co-relation queries the response was YES. Maximal size of possible extension queue 408. Compared 120877 event pairs, 1867 based on Foata normal form. 56/9735 useless extension candidates. Maximal degree in co-relation 16750. Up to 4168 conditions per place. 
[2024-03-12 01:57:21,769 INFO  L140   encePairwiseOnDemand]: 164/172 looper letters, 42 selfloop transitions, 12 changer transitions 0/197 dead transitions.
[2024-03-12 01:57:21,770 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 197 transitions, 610 flow
[2024-03-12 01:57:21,770 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 01:57:21,770 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 01:57:21,771 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 464 transitions.
[2024-03-12 01:57:21,771 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8992248062015504
[2024-03-12 01:57:21,772 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 464 transitions.
[2024-03-12 01:57:21,772 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 464 transitions.
[2024-03-12 01:57:21,772 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:57:21,773 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 464 transitions.
[2024-03-12 01:57:21,775 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:57:21,776 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:57:21,777 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:57:21,777 INFO  L175             Difference]: Start difference. First operand has 177 places, 179 transitions, 442 flow. Second operand 3 states and 464 transitions.
[2024-03-12 01:57:21,777 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 197 transitions, 610 flow
[2024-03-12 01:57:21,782 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 197 transitions, 580 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-12 01:57:21,784 INFO  L231             Difference]: Finished difference. Result has 178 places, 189 transitions, 526 flow
[2024-03-12 01:57:21,784 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=526, PETRI_PLACES=178, PETRI_TRANSITIONS=189}
[2024-03-12 01:57:21,786 INFO  L281   CegarLoopForPetriNet]: 173 programPoint places, 5 predicate places.
[2024-03-12 01:57:21,786 INFO  L495      AbstractCegarLoop]: Abstraction has has 178 places, 189 transitions, 526 flow
[2024-03-12 01:57:21,786 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:57:21,786 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:57:21,786 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:57:21,787 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-03-12 01:57:21,787 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-03-12 01:57:21,788 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:57:21,788 INFO  L85        PathProgramCache]: Analyzing trace with hash -96813646, now seen corresponding path program 1 times
[2024-03-12 01:57:21,788 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:57:21,788 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192407232]
[2024-03-12 01:57:21,788 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:57:21,788 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:57:21,800 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:57:21,817 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:57:21,818 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:57:21,818 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192407232]
[2024-03-12 01:57:21,819 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192407232] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:57:21,819 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:57:21,819 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 01:57:21,819 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987114905]
[2024-03-12 01:57:21,819 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:57:21,820 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 01:57:21,820 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:57:21,820 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 01:57:21,822 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 01:57:21,832 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 148 out of 172
[2024-03-12 01:57:21,832 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 189 transitions, 526 flow. Second operand  has 3 states, 3 states have (on average 149.33333333333334) internal successors, (448), 3 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:57:21,832 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:57:21,833 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 172
[2024-03-12 01:57:21,833 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:57:22,967 INFO  L124   PetriNetUnfolderBase]: 2291/10343 cut-off events.
[2024-03-12 01:57:22,968 INFO  L125   PetriNetUnfolderBase]: For 1031/1095 co-relation queries the response was YES.
[2024-03-12 01:57:22,983 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16091 conditions, 10343 events. 2291/10343 cut-off events. For 1031/1095 co-relation queries the response was YES. Maximal size of possible extension queue 392. Compared 120937 event pairs, 1380 based on Foata normal form. 4/9297 useless extension candidates. Maximal degree in co-relation 14542. Up to 2487 conditions per place. 
[2024-03-12 01:57:23,002 INFO  L140   encePairwiseOnDemand]: 167/172 looper letters, 28 selfloop transitions, 4 changer transitions 0/200 dead transitions.
[2024-03-12 01:57:23,003 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 200 transitions, 612 flow
[2024-03-12 01:57:23,004 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 01:57:23,004 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 01:57:23,004 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 477 transitions.
[2024-03-12 01:57:23,005 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9244186046511628
[2024-03-12 01:57:23,005 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 477 transitions.
[2024-03-12 01:57:23,005 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 477 transitions.
[2024-03-12 01:57:23,005 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:57:23,005 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 477 transitions.
[2024-03-12 01:57:23,006 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:57:23,007 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:57:23,007 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:57:23,008 INFO  L175             Difference]: Start difference. First operand has 178 places, 189 transitions, 526 flow. Second operand 3 states and 477 transitions.
[2024-03-12 01:57:23,008 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 200 transitions, 612 flow
[2024-03-12 01:57:23,012 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 200 transitions, 588 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-12 01:57:23,013 INFO  L231             Difference]: Finished difference. Result has 180 places, 192 transitions, 532 flow
[2024-03-12 01:57:23,013 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=532, PETRI_PLACES=180, PETRI_TRANSITIONS=192}
[2024-03-12 01:57:23,014 INFO  L281   CegarLoopForPetriNet]: 173 programPoint places, 7 predicate places.
[2024-03-12 01:57:23,014 INFO  L495      AbstractCegarLoop]: Abstraction has has 180 places, 192 transitions, 532 flow
[2024-03-12 01:57:23,014 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 149.33333333333334) internal successors, (448), 3 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:57:23,014 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:57:23,014 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:57:23,014 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-03-12 01:57:23,015 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-03-12 01:57:23,015 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:57:23,015 INFO  L85        PathProgramCache]: Analyzing trace with hash 553040026, now seen corresponding path program 1 times
[2024-03-12 01:57:23,015 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:57:23,015 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309000061]
[2024-03-12 01:57:23,015 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:57:23,015 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:57:23,026 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:57:23,208 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:57:23,209 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:57:23,209 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309000061]
[2024-03-12 01:57:23,209 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309000061] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:57:23,209 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:57:23,209 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 01:57:23,209 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267935046]
[2024-03-12 01:57:23,209 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:57:23,209 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-12 01:57:23,210 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:57:23,210 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-12 01:57:23,210 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-12 01:57:23,261 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 142 out of 172
[2024-03-12 01:57:23,261 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 192 transitions, 532 flow. Second operand  has 6 states, 6 states have (on average 143.66666666666666) internal successors, (862), 6 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:57:23,262 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:57:23,262 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 172
[2024-03-12 01:57:23,262 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:57:24,426 INFO  L124   PetriNetUnfolderBase]: 2332/11779 cut-off events.
[2024-03-12 01:57:24,426 INFO  L125   PetriNetUnfolderBase]: For 889/963 co-relation queries the response was YES.
[2024-03-12 01:57:24,446 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18028 conditions, 11779 events. 2332/11779 cut-off events. For 889/963 co-relation queries the response was YES. Maximal size of possible extension queue 373. Compared 140137 event pairs, 1385 based on Foata normal form. 3/10634 useless extension candidates. Maximal degree in co-relation 16116. Up to 2402 conditions per place. 
[2024-03-12 01:57:24,471 INFO  L140   encePairwiseOnDemand]: 166/172 looper letters, 53 selfloop transitions, 5 changer transitions 0/223 dead transitions.
[2024-03-12 01:57:24,471 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 223 transitions, 710 flow
[2024-03-12 01:57:24,472 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 01:57:24,472 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 01:57:24,473 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 911 transitions.
[2024-03-12 01:57:24,474 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8827519379844961
[2024-03-12 01:57:24,474 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 911 transitions.
[2024-03-12 01:57:24,474 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 911 transitions.
[2024-03-12 01:57:24,475 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:57:24,475 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 911 transitions.
[2024-03-12 01:57:24,476 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 151.83333333333334) internal successors, (911), 6 states have internal predecessors, (911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:57:24,478 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 172.0) internal successors, (1204), 7 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:57:24,478 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 172.0) internal successors, (1204), 7 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:57:24,478 INFO  L175             Difference]: Start difference. First operand has 180 places, 192 transitions, 532 flow. Second operand 6 states and 911 transitions.
[2024-03-12 01:57:24,479 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 223 transitions, 710 flow
[2024-03-12 01:57:24,484 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 223 transitions, 702 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-12 01:57:24,487 INFO  L231             Difference]: Finished difference. Result has 182 places, 191 transitions, 532 flow
[2024-03-12 01:57:24,487 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=522, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=532, PETRI_PLACES=182, PETRI_TRANSITIONS=191}
[2024-03-12 01:57:24,487 INFO  L281   CegarLoopForPetriNet]: 173 programPoint places, 9 predicate places.
[2024-03-12 01:57:24,488 INFO  L495      AbstractCegarLoop]: Abstraction has has 182 places, 191 transitions, 532 flow
[2024-03-12 01:57:24,488 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 143.66666666666666) internal successors, (862), 6 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:57:24,488 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:57:24,488 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]
[2024-03-12 01:57:24,488 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-03-12 01:57:24,488 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-03-12 01:57:24,489 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:57:24,489 INFO  L85        PathProgramCache]: Analyzing trace with hash 2032798112, now seen corresponding path program 1 times
[2024-03-12 01:57:24,489 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:57:24,489 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621106851]
[2024-03-12 01:57:24,489 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:57:24,489 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:57:24,499 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:57:24,516 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:57:24,516 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:57:24,516 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621106851]
[2024-03-12 01:57:24,516 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621106851] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:57:24,516 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:57:24,516 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 01:57:24,516 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115529042]
[2024-03-12 01:57:24,516 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:57:24,517 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 01:57:24,517 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:57:24,517 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 01:57:24,517 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 01:57:24,544 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 142 out of 172
[2024-03-12 01:57:24,545 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 191 transitions, 532 flow. Second operand  has 3 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:57:24,545 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:57:24,545 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 172
[2024-03-12 01:57:24,545 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:57:25,012 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([426] L705-4-->L705-1: Formula: (= 0 |v_#race~threads_alive~0_7|)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|}  AuxVars[]  AssignedVars[#race~threads_alive~0][160], [Black: 190#(= |#race~data~0| 0), 75#L685-2true, 201#true, 194#true, Black: 176#true, 77#L705-1true, 109#L685-7true, Black: 184#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet12#1|), threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse])
[2024-03-12 01:57:25,012 INFO  L294   olderBase$Statistics]: this new event has 142 ancestors and is cut-off event
[2024-03-12 01:57:25,013 INFO  L297   olderBase$Statistics]:   existing Event has 135 ancestors and is cut-off event
[2024-03-12 01:57:25,013 INFO  L297   olderBase$Statistics]:   existing Event has 135 ancestors and is cut-off event
[2024-03-12 01:57:25,013 INFO  L297   olderBase$Statistics]:   existing Event has 142 ancestors and is cut-off event
[2024-03-12 01:57:25,189 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([426] L705-4-->L705-1: Formula: (= 0 |v_#race~threads_alive~0_7|)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|}  AuxVars[]  AssignedVars[#race~threads_alive~0][72], [Black: 190#(= |#race~data~0| 0), 75#L685-2true, 201#true, Black: 176#true, 194#true, 77#L705-1true, 47#L687true, Black: 184#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet12#1|), threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse])
[2024-03-12 01:57:25,190 INFO  L294   olderBase$Statistics]: this new event has 144 ancestors and is cut-off event
[2024-03-12 01:57:25,190 INFO  L297   olderBase$Statistics]:   existing Event has 144 ancestors and is cut-off event
[2024-03-12 01:57:25,190 INFO  L297   olderBase$Statistics]:   existing Event has 137 ancestors and is cut-off event
[2024-03-12 01:57:25,190 INFO  L297   olderBase$Statistics]:   existing Event has 137 ancestors and is cut-off event
[2024-03-12 01:57:25,236 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([426] L705-4-->L705-1: Formula: (= 0 |v_#race~threads_alive~0_7|)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|}  AuxVars[]  AssignedVars[#race~threads_alive~0][72], [Black: 190#(= |#race~data~0| 0), 75#L685-2true, 201#true, 194#true, Black: 176#true, 85#L687-3true, 77#L705-1true, Black: 184#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet12#1|), threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse])
[2024-03-12 01:57:25,236 INFO  L294   olderBase$Statistics]: this new event has 145 ancestors and is cut-off event
[2024-03-12 01:57:25,236 INFO  L297   olderBase$Statistics]:   existing Event has 138 ancestors and is cut-off event
[2024-03-12 01:57:25,236 INFO  L297   olderBase$Statistics]:   existing Event has 145 ancestors and is cut-off event
[2024-03-12 01:57:25,236 INFO  L297   olderBase$Statistics]:   existing Event has 138 ancestors and is cut-off event
[2024-03-12 01:57:25,324 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([426] L705-4-->L705-1: Formula: (= 0 |v_#race~threads_alive~0_7|)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|}  AuxVars[]  AssignedVars[#race~threads_alive~0][72], [Black: 190#(= |#race~data~0| 0), 75#L685-2true, 201#true, Black: 176#true, 194#true, 77#L705-1true, 129#L688-3true, Black: 184#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet12#1|), threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse])
[2024-03-12 01:57:25,324 INFO  L294   olderBase$Statistics]: this new event has 147 ancestors and is cut-off event
[2024-03-12 01:57:25,324 INFO  L297   olderBase$Statistics]:   existing Event has 147 ancestors and is cut-off event
[2024-03-12 01:57:25,325 INFO  L297   olderBase$Statistics]:   existing Event has 140 ancestors and is cut-off event
[2024-03-12 01:57:25,325 INFO  L297   olderBase$Statistics]:   existing Event has 140 ancestors and is cut-off event
[2024-03-12 01:57:25,717 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([426] L705-4-->L705-1: Formula: (= 0 |v_#race~threads_alive~0_7|)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|}  AuxVars[]  AssignedVars[#race~threads_alive~0][72], [75#L685-2true, Black: 190#(= |#race~data~0| 0), 113#L690-3true, 201#true, 194#true, Black: 176#true, 77#L705-1true, Black: 184#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet12#1|), threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse])
[2024-03-12 01:57:25,717 INFO  L294   olderBase$Statistics]: this new event has 157 ancestors and is cut-off event
[2024-03-12 01:57:25,717 INFO  L297   olderBase$Statistics]:   existing Event has 150 ancestors and is cut-off event
[2024-03-12 01:57:25,717 INFO  L297   olderBase$Statistics]:   existing Event has 157 ancestors and is cut-off event
[2024-03-12 01:57:25,717 INFO  L297   olderBase$Statistics]:   existing Event has 150 ancestors and is cut-off event
[2024-03-12 01:57:26,008 INFO  L124   PetriNetUnfolderBase]: 4357/14940 cut-off events.
[2024-03-12 01:57:26,008 INFO  L125   PetriNetUnfolderBase]: For 5196/5624 co-relation queries the response was YES.
[2024-03-12 01:57:26,039 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27114 conditions, 14940 events. 4357/14940 cut-off events. For 5196/5624 co-relation queries the response was YES. Maximal size of possible extension queue 534. Compared 171737 event pairs, 2217 based on Foata normal form. 111/13302 useless extension candidates. Maximal degree in co-relation 24183. Up to 5572 conditions per place. 
[2024-03-12 01:57:26,077 INFO  L140   encePairwiseOnDemand]: 163/172 looper letters, 49 selfloop transitions, 19 changer transitions 0/217 dead transitions.
[2024-03-12 01:57:26,077 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 217 transitions, 769 flow
[2024-03-12 01:57:26,078 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 01:57:26,078 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 01:57:26,079 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 472 transitions.
[2024-03-12 01:57:26,079 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9147286821705426
[2024-03-12 01:57:26,079 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 472 transitions.
[2024-03-12 01:57:26,080 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 472 transitions.
[2024-03-12 01:57:26,080 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:57:26,080 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 472 transitions.
[2024-03-12 01:57:26,081 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 157.33333333333334) internal successors, (472), 3 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:57:26,082 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:57:26,082 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:57:26,082 INFO  L175             Difference]: Start difference. First operand has 182 places, 191 transitions, 532 flow. Second operand 3 states and 472 transitions.
[2024-03-12 01:57:26,082 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 217 transitions, 769 flow
[2024-03-12 01:57:26,085 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 217 transitions, 759 flow, removed 0 selfloop flow, removed 5 redundant places.
[2024-03-12 01:57:26,087 INFO  L231             Difference]: Finished difference. Result has 181 places, 206 transitions, 704 flow
[2024-03-12 01:57:26,087 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=522, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=704, PETRI_PLACES=181, PETRI_TRANSITIONS=206}
[2024-03-12 01:57:26,087 INFO  L281   CegarLoopForPetriNet]: 173 programPoint places, 8 predicate places.
[2024-03-12 01:57:26,088 INFO  L495      AbstractCegarLoop]: Abstraction has has 181 places, 206 transitions, 704 flow
[2024-03-12 01:57:26,088 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:57:26,088 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:57:26,088 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:57:26,088 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-03-12 01:57:26,088 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-03-12 01:57:26,088 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:57:26,089 INFO  L85        PathProgramCache]: Analyzing trace with hash -1537485145, now seen corresponding path program 1 times
[2024-03-12 01:57:26,089 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:57:26,089 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521799967]
[2024-03-12 01:57:26,089 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:57:26,089 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:57:26,099 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:57:26,116 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:57:26,116 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:57:26,117 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521799967]
[2024-03-12 01:57:26,117 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521799967] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:57:26,117 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:57:26,117 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 01:57:26,117 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901236534]
[2024-03-12 01:57:26,117 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:57:26,117 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 01:57:26,118 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:57:26,118 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 01:57:26,118 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 01:57:26,132 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 146 out of 172
[2024-03-12 01:57:26,133 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 206 transitions, 704 flow. Second operand  has 3 states, 3 states have (on average 149.0) internal successors, (447), 3 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:57:26,133 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:57:26,133 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 172
[2024-03-12 01:57:26,133 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:57:26,585 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([426] L705-4-->L705-1: Formula: (= 0 |v_#race~threads_alive~0_7|)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|}  AuxVars[]  AssignedVars[#race~threads_alive~0][156], [Black: 190#(= |#race~data~0| 0), 75#L685-2true, 201#true, Black: 176#true, 77#L705-1true, 207#true, 109#L685-7true, Black: 184#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet12#1|), threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, Black: 203#(= |threadThread1of2ForFork0_#t~nondet2| |#race~threads_alive~0|)])
[2024-03-12 01:57:26,585 INFO  L294   olderBase$Statistics]: this new event has 142 ancestors and is cut-off event
[2024-03-12 01:57:26,585 INFO  L297   olderBase$Statistics]:   existing Event has 142 ancestors and is cut-off event
[2024-03-12 01:57:26,585 INFO  L297   olderBase$Statistics]:   existing Event has 135 ancestors and is cut-off event
[2024-03-12 01:57:26,585 INFO  L297   olderBase$Statistics]:   existing Event has 135 ancestors and is cut-off event
[2024-03-12 01:57:26,706 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([426] L705-4-->L705-1: Formula: (= 0 |v_#race~threads_alive~0_7|)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|}  AuxVars[]  AssignedVars[#race~threads_alive~0][72], [Black: 190#(= |#race~data~0| 0), 75#L685-2true, 201#true, Black: 176#true, 77#L705-1true, 47#L687true, 207#true, Black: 184#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet12#1|), threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, Black: 203#(= |threadThread1of2ForFork0_#t~nondet2| |#race~threads_alive~0|)])
[2024-03-12 01:57:26,706 INFO  L294   olderBase$Statistics]: this new event has 144 ancestors and is cut-off event
[2024-03-12 01:57:26,706 INFO  L297   olderBase$Statistics]:   existing Event has 137 ancestors and is cut-off event
[2024-03-12 01:57:26,706 INFO  L297   olderBase$Statistics]:   existing Event has 144 ancestors and is cut-off event
[2024-03-12 01:57:26,706 INFO  L297   olderBase$Statistics]:   existing Event has 137 ancestors and is cut-off event
[2024-03-12 01:57:27,675 INFO  L124   PetriNetUnfolderBase]: 3672/15174 cut-off events.
[2024-03-12 01:57:27,675 INFO  L125   PetriNetUnfolderBase]: For 5284/5598 co-relation queries the response was YES.
[2024-03-12 01:57:27,707 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27074 conditions, 15174 events. 3672/15174 cut-off events. For 5284/5598 co-relation queries the response was YES. Maximal size of possible extension queue 516. Compared 184700 event pairs, 1926 based on Foata normal form. 13/13768 useless extension candidates. Maximal degree in co-relation 24499. Up to 3881 conditions per place. 
[2024-03-12 01:57:27,742 INFO  L140   encePairwiseOnDemand]: 166/172 looper letters, 34 selfloop transitions, 7 changer transitions 0/222 dead transitions.
[2024-03-12 01:57:27,742 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 222 transitions, 829 flow
[2024-03-12 01:57:27,742 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 01:57:27,742 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 01:57:27,743 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 477 transitions.
[2024-03-12 01:57:27,743 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9244186046511628
[2024-03-12 01:57:27,744 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 477 transitions.
[2024-03-12 01:57:27,744 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 477 transitions.
[2024-03-12 01:57:27,744 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:57:27,744 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 477 transitions.
[2024-03-12 01:57:27,745 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:57:27,745 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:57:27,746 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:57:27,746 INFO  L175             Difference]: Start difference. First operand has 181 places, 206 transitions, 704 flow. Second operand 3 states and 477 transitions.
[2024-03-12 01:57:27,746 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 222 transitions, 829 flow
[2024-03-12 01:57:27,755 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 222 transitions, 791 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-12 01:57:27,757 INFO  L231             Difference]: Finished difference. Result has 183 places, 211 transitions, 722 flow
[2024-03-12 01:57:27,758 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=666, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=722, PETRI_PLACES=183, PETRI_TRANSITIONS=211}
[2024-03-12 01:57:27,758 INFO  L281   CegarLoopForPetriNet]: 173 programPoint places, 10 predicate places.
[2024-03-12 01:57:27,758 INFO  L495      AbstractCegarLoop]: Abstraction has has 183 places, 211 transitions, 722 flow
[2024-03-12 01:57:27,758 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 149.0) internal successors, (447), 3 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:57:27,758 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:57:27,759 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:57:27,759 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-03-12 01:57:27,759 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-03-12 01:57:27,759 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:57:27,759 INFO  L85        PathProgramCache]: Analyzing trace with hash -298496673, now seen corresponding path program 1 times
[2024-03-12 01:57:27,759 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:57:27,759 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501858690]
[2024-03-12 01:57:27,759 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:57:27,760 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:57:27,770 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:57:27,815 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2024-03-12 01:57:27,816 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:57:27,816 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501858690]
[2024-03-12 01:57:27,816 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501858690] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:57:27,816 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:57:27,816 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-03-12 01:57:27,816 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48947527]
[2024-03-12 01:57:27,816 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:57:27,817 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 01:57:27,817 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:57:27,817 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 01:57:27,817 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 01:57:27,826 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 152 out of 172
[2024-03-12 01:57:27,826 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 211 transitions, 722 flow. Second operand  has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:57:27,826 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:57:27,826 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 172
[2024-03-12 01:57:27,826 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:57:28,200 INFO  L124   PetriNetUnfolderBase]: 544/4025 cut-off events.
[2024-03-12 01:57:28,201 INFO  L125   PetriNetUnfolderBase]: For 1131/1327 co-relation queries the response was YES.
[2024-03-12 01:57:28,209 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6789 conditions, 4025 events. 544/4025 cut-off events. For 1131/1327 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 41331 event pairs, 197 based on Foata normal form. 66/3830 useless extension candidates. Maximal degree in co-relation 5993. Up to 535 conditions per place. 
[2024-03-12 01:57:28,216 INFO  L140   encePairwiseOnDemand]: 160/172 looper letters, 15 selfloop transitions, 12 changer transitions 0/211 dead transitions.
[2024-03-12 01:57:28,216 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 211 transitions, 727 flow
[2024-03-12 01:57:28,216 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 01:57:28,216 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 01:57:28,217 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 488 transitions.
[2024-03-12 01:57:28,217 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9457364341085271
[2024-03-12 01:57:28,217 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 488 transitions.
[2024-03-12 01:57:28,217 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 488 transitions.
[2024-03-12 01:57:28,218 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:57:28,218 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 488 transitions.
[2024-03-12 01:57:28,219 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 162.66666666666666) internal successors, (488), 3 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:57:28,219 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:57:28,220 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:57:28,220 INFO  L175             Difference]: Start difference. First operand has 183 places, 211 transitions, 722 flow. Second operand 3 states and 488 transitions.
[2024-03-12 01:57:28,220 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 211 transitions, 727 flow
[2024-03-12 01:57:28,224 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 211 transitions, 713 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-12 01:57:28,225 INFO  L231             Difference]: Finished difference. Result has 184 places, 208 transitions, 698 flow
[2024-03-12 01:57:28,226 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=634, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=698, PETRI_PLACES=184, PETRI_TRANSITIONS=208}
[2024-03-12 01:57:28,226 INFO  L281   CegarLoopForPetriNet]: 173 programPoint places, 11 predicate places.
[2024-03-12 01:57:28,226 INFO  L495      AbstractCegarLoop]: Abstraction has has 184 places, 208 transitions, 698 flow
[2024-03-12 01:57:28,226 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:57:28,227 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:57:28,227 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:57:28,227 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-03-12 01:57:28,227 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-03-12 01:57:28,227 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:57:28,227 INFO  L85        PathProgramCache]: Analyzing trace with hash -1551220723, now seen corresponding path program 1 times
[2024-03-12 01:57:28,227 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:57:28,227 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690857995]
[2024-03-12 01:57:28,228 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:57:28,228 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:57:28,239 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:57:28,257 INFO  L134       CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked.
[2024-03-12 01:57:28,258 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:57:28,258 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690857995]
[2024-03-12 01:57:28,258 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690857995] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:57:28,258 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:57:28,258 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 01:57:28,258 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780817366]
[2024-03-12 01:57:28,258 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:57:28,258 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 01:57:28,258 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:57:28,259 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 01:57:28,259 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 01:57:28,283 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 142 out of 172
[2024-03-12 01:57:28,283 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 208 transitions, 698 flow. Second operand  has 3 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:57:28,283 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:57:28,283 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 172
[2024-03-12 01:57:28,283 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:57:28,810 INFO  L124   PetriNetUnfolderBase]: 840/4808 cut-off events.
[2024-03-12 01:57:28,811 INFO  L125   PetriNetUnfolderBase]: For 2669/3127 co-relation queries the response was YES.
[2024-03-12 01:57:28,822 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9724 conditions, 4808 events. 840/4808 cut-off events. For 2669/3127 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 49759 event pairs, 412 based on Foata normal form. 9/4483 useless extension candidates. Maximal degree in co-relation 8725. Up to 1408 conditions per place. 
[2024-03-12 01:57:28,832 INFO  L140   encePairwiseOnDemand]: 165/172 looper letters, 56 selfloop transitions, 11 changer transitions 0/223 dead transitions.
[2024-03-12 01:57:28,832 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 223 transitions, 907 flow
[2024-03-12 01:57:28,833 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 01:57:28,833 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 01:57:28,834 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 467 transitions.
[2024-03-12 01:57:28,834 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9050387596899225
[2024-03-12 01:57:28,834 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 467 transitions.
[2024-03-12 01:57:28,834 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 467 transitions.
[2024-03-12 01:57:28,835 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:57:28,835 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 467 transitions.
[2024-03-12 01:57:28,836 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:57:28,836 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:57:28,837 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:57:28,837 INFO  L175             Difference]: Start difference. First operand has 184 places, 208 transitions, 698 flow. Second operand 3 states and 467 transitions.
[2024-03-12 01:57:28,837 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 223 transitions, 907 flow
[2024-03-12 01:57:28,841 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 223 transitions, 888 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-12 01:57:28,843 INFO  L231             Difference]: Finished difference. Result has 187 places, 215 transitions, 784 flow
[2024-03-12 01:57:28,844 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=686, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=784, PETRI_PLACES=187, PETRI_TRANSITIONS=215}
[2024-03-12 01:57:28,844 INFO  L281   CegarLoopForPetriNet]: 173 programPoint places, 14 predicate places.
[2024-03-12 01:57:28,844 INFO  L495      AbstractCegarLoop]: Abstraction has has 187 places, 215 transitions, 784 flow
[2024-03-12 01:57:28,844 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:57:28,844 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:57:28,845 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:57:28,845 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-03-12 01:57:28,845 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-03-12 01:57:28,845 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:57:28,845 INFO  L85        PathProgramCache]: Analyzing trace with hash 242078175, now seen corresponding path program 1 times
[2024-03-12 01:57:28,845 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:57:28,845 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884835841]
[2024-03-12 01:57:28,845 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:57:28,845 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:57:28,862 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-12 01:57:28,862 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-03-12 01:57:28,871 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-12 01:57:28,882 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-03-12 01:57:28,882 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-03-12 01:57:28,882 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (14 of 15 remaining)
[2024-03-12 01:57:28,882 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining)
[2024-03-12 01:57:28,882 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining)
[2024-03-12 01:57:28,882 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining)
[2024-03-12 01:57:28,882 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining)
[2024-03-12 01:57:28,883 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 15 remaining)
[2024-03-12 01:57:28,883 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (8 of 15 remaining)
[2024-03-12 01:57:28,883 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining)
[2024-03-12 01:57:28,883 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining)
[2024-03-12 01:57:28,883 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining)
[2024-03-12 01:57:28,883 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 15 remaining)
[2024-03-12 01:57:28,883 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (3 of 15 remaining)
[2024-03-12 01:57:28,883 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining)
[2024-03-12 01:57:28,883 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining)
[2024-03-12 01:57:28,884 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining)
[2024-03-12 01:57:28,884 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-03-12 01:57:28,884 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:57:28,888 INFO  L228   ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances
[2024-03-12 01:57:28,888 INFO  L178   ceAbstractionStarter]: Computing trace abstraction results
[2024-03-12 01:57:28,937 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet8 could not be translated
[2024-03-12 01:57:28,938 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre14 could not be translated
[2024-03-12 01:57:28,939 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem16 could not be translated
[2024-03-12 01:57:28,939 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem16 could not be translated
[2024-03-12 01:57:28,940 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not
[2024-03-12 01:57:28,940 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not
[2024-03-12 01:57:28,940 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not
[2024-03-12 01:57:28,940 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:57:28,940 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:57:28,941 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated
[2024-03-12 01:57:28,941 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet6 could not be translated
[2024-03-12 01:57:28,941 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated
[2024-03-12 01:57:28,941 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet6 could not be translated
[2024-03-12 01:57:28,949 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.03 01:57:28 BasicIcfg
[2024-03-12 01:57:28,949 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-03-12 01:57:28,949 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2024-03-12 01:57:28,949 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2024-03-12 01:57:28,949 INFO  L274        PluginConnector]: Witness Printer initialized
[2024-03-12 01:57:28,950 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.03 01:57:17" (3/4) ...
[2024-03-12 01:57:28,951 INFO  L140         WitnessPrinter]: No result that supports witness generation found
[2024-03-12 01:57:28,952 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-03-12 01:57:28,952 INFO  L158              Benchmark]: Toolchain (without parser) took 12554.72ms. Allocated memory was 104.9MB in the beginning and 2.1GB in the end (delta: 2.0GB). Free memory was 64.9MB in the beginning and 610.6MB in the end (delta: -545.7MB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB.
[2024-03-12 01:57:28,953 INFO  L158              Benchmark]: CDTParser took 0.11ms. Allocated memory is still 104.9MB. Free memory is still 74.6MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-03-12 01:57:28,953 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 340.55ms. Allocated memory was 104.9MB in the beginning and 125.8MB in the end (delta: 21.0MB). Free memory was 64.6MB in the beginning and 98.1MB in the end (delta: -33.5MB). Peak memory consumption was 26.4MB. Max. memory is 16.1GB.
[2024-03-12 01:57:28,953 INFO  L158              Benchmark]: Boogie Procedure Inliner took 48.31ms. Allocated memory is still 125.8MB. Free memory was 98.0MB in the beginning and 96.7MB in the end (delta: 1.4MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB.
[2024-03-12 01:57:28,953 INFO  L158              Benchmark]: Boogie Preprocessor took 21.49ms. Allocated memory is still 125.8MB. Free memory was 96.7MB in the beginning and 95.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-03-12 01:57:28,953 INFO  L158              Benchmark]: RCFGBuilder took 407.42ms. Allocated memory is still 125.8MB. Free memory was 94.6MB in the beginning and 75.7MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB.
[2024-03-12 01:57:28,954 INFO  L158              Benchmark]: TraceAbstraction took 11729.13ms. Allocated memory was 125.8MB in the beginning and 2.1GB in the end (delta: 2.0GB). Free memory was 75.1MB in the beginning and 610.6MB in the end (delta: -535.5MB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB.
[2024-03-12 01:57:28,954 INFO  L158              Benchmark]: Witness Printer took 2.74ms. Allocated memory is still 2.1GB. Free memory is still 610.6MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-03-12 01:57:28,955 INFO  L338   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.11ms. Allocated memory is still 104.9MB. Free memory is still 74.6MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 340.55ms. Allocated memory was 104.9MB in the beginning and 125.8MB in the end (delta: 21.0MB). Free memory was 64.6MB in the beginning and 98.1MB in the end (delta: -33.5MB). Peak memory consumption was 26.4MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 48.31ms. Allocated memory is still 125.8MB. Free memory was 98.0MB in the beginning and 96.7MB in the end (delta: 1.4MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 21.49ms. Allocated memory is still 125.8MB. Free memory was 96.7MB in the beginning and 95.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB.
 * RCFGBuilder took 407.42ms. Allocated memory is still 125.8MB. Free memory was 94.6MB in the beginning and 75.7MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB.
 * TraceAbstraction took 11729.13ms. Allocated memory was 125.8MB in the beginning and 2.1GB in the end (delta: 2.0GB). Free memory was 75.1MB in the beginning and 610.6MB in the end (delta: -535.5MB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB.
 * Witness Printer took 2.74ms. Allocated memory is still 2.1GB. Free memory is still 610.6MB. There was no memory consumed. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator:
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet8 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~pre14 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~mem16 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~mem16 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet6 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet6 could not be translated
  - GenericResult: Unfinished Backtranslation
    The program execution was not completely translated back.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - DataRaceFoundResult [Line: 708]: Data race detected
[2024-03-12 01:57:28,979 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet8 could not be translated
[2024-03-12 01:57:28,980 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre14 could not be translated
[2024-03-12 01:57:28,980 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem16 could not be translated
[2024-03-12 01:57:28,980 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem16 could not be translated
[2024-03-12 01:57:28,980 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not
[2024-03-12 01:57:28,981 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not
[2024-03-12 01:57:28,981 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not
[2024-03-12 01:57:28,981 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:57:28,981 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:57:28,981 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated
[2024-03-12 01:57:28,981 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet6 could not be translated
[2024-03-12 01:57:28,981 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated
[2024-03-12 01:57:28,982 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet6 could not be translated
[2024-03-12 01:57:29,057 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet8 could not be translated
[2024-03-12 01:57:29,058 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre14 could not be translated
[2024-03-12 01:57:29,058 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem16 could not be translated
[2024-03-12 01:57:29,058 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem16 could not be translated
[2024-03-12 01:57:29,058 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not
[2024-03-12 01:57:29,058 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not
[2024-03-12 01:57:29,058 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not
[2024-03-12 01:57:29,059 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:57:29,059 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:57:29,059 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated
[2024-03-12 01:57:29,059 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet6 could not be translated
[2024-03-12 01:57:29,059 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated
[2024-03-12 01:57:29,059 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet6 could not be translated
    Data race detected
The following path leads to a data race: 
[L678]               0  int threads_alive = 0;
        VAL             [threads_alive=0]
[L679]               0  pthread_mutex_t threads_alive_mutex = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } };
        VAL             [threads_alive=0, threads_alive_mutex={1:0}]
[L680]               0  pthread_cond_t threads_alive_cond = { { {0}, {0}, {0, 0}, {0, 0}, 0, 0, {0, 0} } };
        VAL             [threads_alive=0, threads_alive_cond={2:0}, threads_alive_mutex={1:0}]
[L681]               0  int data = 0;
        VAL             [data=0, threads_alive=0, threads_alive_cond={2:0}, threads_alive_mutex={1:0}]
[L682]               0  pthread_mutex_t data_mutex = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } };
        VAL             [data=0, data_mutex={3:0}, threads_alive=0, threads_alive_cond={2:0}, threads_alive_mutex={1:0}]
[L694]               0  int breads_total = __VERIFIER_nondet_int();
        VAL             [breads_total=1, data=0, data_mutex={3:0}, threads_alive=0, threads_alive_cond={2:0}, threads_alive_mutex={1:0}]
[L695]  CALL         0  assume_abort_if_not(breads_total >= 0)
[L675]  COND FALSE   0  !(!cond)
        VAL             [\old(cond)=1, cond=1, data=0, data_mutex={3:0}, threads_alive=0, threads_alive_cond={2:0}, threads_alive_mutex={1:0}]
[L695]  RET          0  assume_abort_if_not(breads_total >= 0)
[L696]               0  int i = 0;
        VAL             [breads_total=1, data=0, data_mutex={3:0}, i=0, threads_alive=0, threads_alive_cond={2:0}, threads_alive_mutex={1:0}]
[L696]  COND TRUE    0  i < breads_total
        VAL             [breads_total=1, data=0, data_mutex={3:0}, i=0, threads_alive=0, threads_alive_cond={2:0}, threads_alive_mutex={1:0}]
[L698]               0  threads_alive++
        VAL             [breads_total=1, data=0, data_mutex={3:0}, i=0, threads_alive=1, threads_alive_cond={2:0}, threads_alive_mutex={1:0}]
[L700]               0  pthread_t tid;
        VAL             [breads_total=1, data=0, data_mutex={3:0}, i=0, threads_alive=1, threads_alive_cond={2:0}, threads_alive_mutex={1:0}, tid={5:0}]
[L701]  FCALL, FORK  0  pthread_create(&tid, ((void *)0), &thread, ((void *)0))
        VAL             [arg={0:0}, breads_total=1, data=0, data_mutex={3:0}, i=0, threads_alive=1, threads_alive_cond={2:0}, threads_alive_mutex={1:0}, tid={5:0}]
[L702]  EXPR         0  \read(tid)
        VAL             [arg={0:0}, breads_total=1, data=0, data_mutex={3:0}, i=0, threads_alive=1, threads_alive_cond={2:0}, threads_alive_mutex={1:0}, tid={5:0}]
[L702]               0  pthread_detach(tid)
        VAL             [arg={0:0}, breads_total=1, data=0, data_mutex={3:0}, i=0, threads_alive=1, threads_alive_cond={2:0}, threads_alive_mutex={1:0}, tid={5:0}]
[L696]               0  i++
        VAL             [arg={0:0}, breads_total=1, data=0, data_mutex={3:0}, i=1, threads_alive=1, threads_alive_cond={2:0}, threads_alive_mutex={1:0}, tid={5:0}]
[L696]  COND FALSE   0  !(i < breads_total)
        VAL             [arg={0:0}, breads_total=1, data=0, data_mutex={3:0}, i=1, threads_alive=1, threads_alive_cond={2:0}, threads_alive_mutex={1:0}]
[L685]               1  threads_alive--
        VAL             [arg={0:0}, arg={0:0}, data=0, data_mutex={3:0}, threads_alive=0, threads_alive_cond={2:0}, threads_alive_mutex={1:0}]
[L705]  COND FALSE   0  !(\read(threads_alive))
        VAL             [arg={0:0}, arg={0:0}, breads_total=1, data=0, data_mutex={3:0}, threads_alive=0, threads_alive_cond={2:0}, threads_alive_mutex={1:0}]
[L708]               0  return data;
        VAL             [arg={0:0}, arg={0:0}, breads_total=1, data=0, data_mutex={3:0}, threads_alive=0, threads_alive_cond={2:0}, threads_alive_mutex={1:0}]
[L689]               1  data = __VERIFIER_nondet_int()
        VAL             [arg={0:0}, arg={0:0}, data=0, data_mutex={3:0}, threads_alive=0, threads_alive_cond={2:0}, threads_alive_mutex={1:0}]
[L708]               0  return data;
        VAL             [arg={0:0}, arg={0:0}, breads_total=1, data=0, data_mutex={3:0}, threads_alive=0, threads_alive_cond={2:0}, threads_alive_mutex={1:0}]

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

  - UnprovableResult [Line: 698]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 705]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 698]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 702]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 701]: Unable to prove that petrification did provide enough thread instances (tool internal message)
    Unable to prove that petrification did provide enough thread instances (tool internal message)
 Reason: Not analyzed. 
  - UnprovableResult [Line: 685]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 685]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 689]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
    CFG has 3 procedures, 169 locations, 12 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.1s, OverallIterations: 8, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 200 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 98 mSDsluCounter, 29 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 370 IncrementalHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 29 mSDtfsCounter, 370 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=474occurred in iteration=5, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 572 NumberOfCodeBlocks, 572 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 467 ConstructedInterpolants, 0 QuantifiedInterpolants, 588 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 9/9 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
  - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances
    CFG has 4 procedures, 201 locations, 15 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 9.4s, OverallIterations: 9, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 355 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 166 mSDsluCounter, 85 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 669 IncrementalHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 85 mSDtfsCounter, 669 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=784occurred in iteration=8, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 693 NumberOfCodeBlocks, 693 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 574 ConstructedInterpolants, 0 QuantifiedInterpolants, 697 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 28/28 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
[2024-03-12 01:57:29,073 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
--- End real Ultimate output ---

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