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


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


Checking for data races
Using default analysis
Version 0e0057cc
Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data -tc /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/config/AutomizerReach.xml -i /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/thread-join-array-const-race.i -s /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c31a54802b36069ad17933a6a18dd94a6af410d31d2cd906e0e916fed918b284
--- Real Ultimate output ---
This is Ultimate 0.2.4-dev-0e0057c
[2024-03-09 06:35:43,351 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-03-09 06:35:43,398 INFO  L114        SettingsManager]: Loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2024-03-09 06:35:43,402 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-03-09 06:35:43,402 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-03-09 06:35:43,421 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-03-09 06:35:43,422 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-03-09 06:35:43,422 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-03-09 06:35:43,422 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-03-09 06:35:43,423 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-03-09 06:35:43,423 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-03-09 06:35:43,424 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-03-09 06:35:43,424 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-03-09 06:35:43,424 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-03-09 06:35:43,424 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-03-09 06:35:43,425 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-03-09 06:35:43,425 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-03-09 06:35:43,425 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-03-09 06:35:43,426 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-03-09 06:35:43,426 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-03-09 06:35:43,426 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-03-09 06:35:43,427 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-03-09 06:35:43,427 INFO  L153        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2024-03-09 06:35:43,427 INFO  L153        SettingsManager]:  * Check unreachability of reach_error function=false
[2024-03-09 06:35:43,427 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-03-09 06:35:43,428 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-03-09 06:35:43,428 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-03-09 06:35:43,428 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-03-09 06:35:43,429 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-03-09 06:35:43,429 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-03-09 06:35:43,429 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-03-09 06:35:43,430 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-03-09 06:35:43,430 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-03-09 06:35:43,430 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-03-09 06:35:43,430 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-03-09 06:35:43,431 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-03-09 06:35:43,431 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-03-09 06:35:43,431 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-03-09 06:35:43,432 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-03-09 06:35:43,432 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-03-09 06:35:43,432 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-03-09 06:35:43,433 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 -> c31a54802b36069ad17933a6a18dd94a6af410d31d2cd906e0e916fed918b284
[2024-03-09 06:35:43,613 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-03-09 06:35:43,630 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-03-09 06:35:43,632 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-03-09 06:35:43,633 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-03-09 06:35:43,633 INFO  L274        PluginConnector]: CDTParser initialized
[2024-03-09 06:35:43,634 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/thread-join-array-const-race.i
[2024-03-09 06:35:44,586 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-03-09 06:35:44,810 INFO  L384              CDTParser]: Found 1 translation units.
[2024-03-09 06:35:44,810 INFO  L180              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/thread-join-array-const-race.i
[2024-03-09 06:35:44,822 INFO  L427              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data/bb94ab867/d5c9aab0e7754cbbbadcf873f07027f3/FLAG55d86e1dc
[2024-03-09 06:35:45,202 INFO  L435              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data/bb94ab867/d5c9aab0e7754cbbbadcf873f07027f3
[2024-03-09 06:35:45,205 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-03-09 06:35:45,206 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-03-09 06:35:45,207 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-03-09 06:35:45,207 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-03-09 06:35:45,211 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-03-09 06:35:45,212 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:35:45" (1/1) ...
[2024-03-09 06:35:45,213 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@540f90c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:35:45, skipping insertion in model container
[2024-03-09 06:35:45,213 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:35:45" (1/1) ...
[2024-03-09 06:35:45,247 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-03-09 06:35:45,453 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2024-03-09 06:35:45,464 INFO  L202         MainTranslator]: Completed pre-run
[2024-03-09 06:35:45,491 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2024-03-09 06:35:45,515 INFO  L206         MainTranslator]: Completed translation
[2024-03-09 06:35:45,515 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:35:45 WrapperNode
[2024-03-09 06:35:45,516 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-03-09 06:35:45,517 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-03-09 06:35:45,517 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-03-09 06:35:45,517 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-03-09 06:35:45,522 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:35:45" (1/1) ...
[2024-03-09 06:35:45,532 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:35:45" (1/1) ...
[2024-03-09 06:35:45,553 INFO  L138                Inliner]: procedures = 158, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 54
[2024-03-09 06:35:45,554 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-03-09 06:35:45,554 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-03-09 06:35:45,554 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-03-09 06:35:45,555 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-03-09 06:35:45,561 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:35:45" (1/1) ...
[2024-03-09 06:35:45,562 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:35:45" (1/1) ...
[2024-03-09 06:35:45,564 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:35:45" (1/1) ...
[2024-03-09 06:35:45,565 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:35:45" (1/1) ...
[2024-03-09 06:35:45,569 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:35:45" (1/1) ...
[2024-03-09 06:35:45,571 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:35:45" (1/1) ...
[2024-03-09 06:35:45,572 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:35:45" (1/1) ...
[2024-03-09 06:35:45,573 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:35:45" (1/1) ...
[2024-03-09 06:35:45,575 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-03-09 06:35:45,576 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-03-09 06:35:45,576 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-03-09 06:35:45,576 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-03-09 06:35:45,576 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:35:45" (1/1) ...
[2024-03-09 06:35:45,582 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-03-09 06:35:45,589 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 06:35:45,602 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-03-09 06:35:45,604 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-03-09 06:35:45,632 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2024-03-09 06:35:45,632 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2024-03-09 06:35:45,632 INFO  L130     BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock
[2024-03-09 06:35:45,633 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-03-09 06:35:45,633 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2024-03-09 06:35:45,633 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-03-09 06:35:45,633 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2024-03-09 06:35:45,634 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2024-03-09 06:35:45,634 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2024-03-09 06:35:45,634 INFO  L130     BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock
[2024-03-09 06:35:45,634 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-03-09 06:35:45,635 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-03-09 06:35:45,636 WARN  L213             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-03-09 06:35:45,757 INFO  L241             CfgBuilder]: Building ICFG
[2024-03-09 06:35:45,759 INFO  L267             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-03-09 06:35:45,868 INFO  L282             CfgBuilder]: Performing block encoding
[2024-03-09 06:35:45,882 INFO  L304             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-03-09 06:35:45,882 INFO  L309             CfgBuilder]: Removed 2 assume(true) statements.
[2024-03-09 06:35:45,884 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.03 06:35:45 BoogieIcfgContainer
[2024-03-09 06:35:45,884 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-03-09 06:35:45,885 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-03-09 06:35:45,886 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-03-09 06:35:45,888 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-03-09 06:35:45,888 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 06:35:45" (1/3) ...
[2024-03-09 06:35:45,888 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a04371b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 06:35:45, skipping insertion in model container
[2024-03-09 06:35:45,888 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:35:45" (2/3) ...
[2024-03-09 06:35:45,889 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a04371b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 06:35:45, skipping insertion in model container
[2024-03-09 06:35:45,889 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.03 06:35:45" (3/3) ...
[2024-03-09 06:35:45,890 INFO  L112   eAbstractionObserver]: Analyzing ICFG thread-join-array-const-race.i
[2024-03-09 06:35:45,896 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2024-03-09 06:35:45,903 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-03-09 06:35:45,903 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations.
[2024-03-09 06:35:45,903 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-03-09 06:35:45,937 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2024-03-09 06:35:45,961 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 71 places, 71 transitions, 149 flow
[2024-03-09 06:35:46,006 INFO  L124   PetriNetUnfolderBase]: 5/99 cut-off events.
[2024-03-09 06:35:46,006 INFO  L125   PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES.
[2024-03-09 06:35:46,010 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 104 conditions, 99 events. 5/99 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 201 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 49. Up to 4 conditions per place. 
[2024-03-09 06:35:46,010 INFO  L82        GeneralOperation]: Start removeDead. Operand has 71 places, 71 transitions, 149 flow
[2024-03-09 06:35:46,013 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 71 places, 71 transitions, 149 flow
[2024-03-09 06:35:46,020 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-09 06:35:46,025 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;@6540b93f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-03-09 06:35:46,026 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 5 error locations.
[2024-03-09 06:35:46,033 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-03-09 06:35:46,034 INFO  L124   PetriNetUnfolderBase]: 2/36 cut-off events.
[2024-03-09 06:35:46,034 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-03-09 06:35:46,034 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:35:46,034 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]
[2024-03-09 06:35:46,035 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2024-03-09 06:35:46,038 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:35:46,038 INFO  L85        PathProgramCache]: Analyzing trace with hash -328016813, now seen corresponding path program 1 times
[2024-03-09 06:35:46,044 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:35:46,045 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600662365]
[2024-03-09 06:35:46,045 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:35:46,045 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:35:46,120 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:35:46,236 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:35:46,236 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:35:46,237 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600662365]
[2024-03-09 06:35:46,237 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600662365] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:35:46,237 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:35:46,237 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-03-09 06:35:46,238 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613058124]
[2024-03-09 06:35:46,239 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:35:46,245 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-03-09 06:35:46,249 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:35:46,269 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-03-09 06:35:46,269 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-03-09 06:35:46,310 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 58 out of 71
[2024-03-09 06:35:46,313 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 71 transitions, 149 flow. Second operand  has 4 states, 4 states have (on average 59.25) internal successors, (237), 4 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:35:46,313 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:35:46,313 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 71
[2024-03-09 06:35:46,313 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:35:46,359 INFO  L124   PetriNetUnfolderBase]: 8/158 cut-off events.
[2024-03-09 06:35:46,359 INFO  L125   PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES.
[2024-03-09 06:35:46,359 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 192 conditions, 158 events. 8/158 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 439 event pairs, 0 based on Foata normal form. 5/147 useless extension candidates. Maximal degree in co-relation 133. Up to 17 conditions per place. 
[2024-03-09 06:35:46,361 INFO  L140   encePairwiseOnDemand]: 64/71 looper letters, 10 selfloop transitions, 4 changer transitions 1/73 dead transitions.
[2024-03-09 06:35:46,361 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 73 transitions, 183 flow
[2024-03-09 06:35:46,362 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-03-09 06:35:46,364 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-03-09 06:35:46,369 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 251 transitions.
[2024-03-09 06:35:46,371 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8838028169014085
[2024-03-09 06:35:46,372 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 251 transitions.
[2024-03-09 06:35:46,372 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 251 transitions.
[2024-03-09 06:35:46,373 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:35:46,374 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 251 transitions.
[2024-03-09 06:35:46,377 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 62.75) internal successors, (251), 4 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:35:46,380 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 71.0) internal successors, (355), 5 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:35:46,380 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 71.0) internal successors, (355), 5 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:35:46,381 INFO  L175             Difference]: Start difference. First operand has 71 places, 71 transitions, 149 flow. Second operand 4 states and 251 transitions.
[2024-03-09 06:35:46,382 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 73 transitions, 183 flow
[2024-03-09 06:35:46,384 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 73 transitions, 183 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-09 06:35:46,386 INFO  L231             Difference]: Finished difference. Result has 75 places, 69 transitions, 157 flow
[2024-03-09 06:35:46,387 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=157, PETRI_PLACES=75, PETRI_TRANSITIONS=69}
[2024-03-09 06:35:46,390 INFO  L281   CegarLoopForPetriNet]: 71 programPoint places, 4 predicate places.
[2024-03-09 06:35:46,390 INFO  L495      AbstractCegarLoop]: Abstraction has has 75 places, 69 transitions, 157 flow
[2024-03-09 06:35:46,390 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 59.25) internal successors, (237), 4 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:35:46,390 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:35:46,390 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]
[2024-03-09 06:35:46,391 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-03-09 06:35:46,391 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2024-03-09 06:35:46,391 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:35:46,392 INFO  L85        PathProgramCache]: Analyzing trace with hash -749003099, now seen corresponding path program 1 times
[2024-03-09 06:35:46,392 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:35:46,392 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297616942]
[2024-03-09 06:35:46,392 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:35:46,392 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:35:46,409 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:35:46,441 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:35:46,442 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:35:46,442 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297616942]
[2024-03-09 06:35:46,442 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297616942] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:35:46,442 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:35:46,442 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-09 06:35:46,442 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838700439]
[2024-03-09 06:35:46,442 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:35:46,443 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 06:35:46,444 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:35:46,444 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 06:35:46,444 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 06:35:46,456 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 59 out of 71
[2024-03-09 06:35:46,456 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 69 transitions, 157 flow. Second operand  has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:35:46,456 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:35:46,457 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 71
[2024-03-09 06:35:46,457 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:35:46,482 INFO  L124   PetriNetUnfolderBase]: 6/130 cut-off events.
[2024-03-09 06:35:46,482 INFO  L125   PetriNetUnfolderBase]: For 5/11 co-relation queries the response was YES.
[2024-03-09 06:35:46,483 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 172 conditions, 130 events. 6/130 cut-off events. For 5/11 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 338 event pairs, 4 based on Foata normal form. 1/119 useless extension candidates. Maximal degree in co-relation 128. Up to 21 conditions per place. 
[2024-03-09 06:35:46,483 INFO  L140   encePairwiseOnDemand]: 66/71 looper letters, 9 selfloop transitions, 4 changer transitions 0/72 dead transitions.
[2024-03-09 06:35:46,483 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 72 transitions, 189 flow
[2024-03-09 06:35:46,484 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 06:35:46,484 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 06:35:46,485 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 191 transitions.
[2024-03-09 06:35:46,485 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8967136150234741
[2024-03-09 06:35:46,485 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 191 transitions.
[2024-03-09 06:35:46,485 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 191 transitions.
[2024-03-09 06:35:46,486 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:35:46,486 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 191 transitions.
[2024-03-09 06:35:46,487 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:35:46,488 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 71.0) internal successors, (284), 4 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:35:46,488 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 71.0) internal successors, (284), 4 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:35:46,488 INFO  L175             Difference]: Start difference. First operand has 75 places, 69 transitions, 157 flow. Second operand 3 states and 191 transitions.
[2024-03-09 06:35:46,488 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 72 transitions, 189 flow
[2024-03-09 06:35:46,489 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 72 transitions, 181 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-03-09 06:35:46,490 INFO  L231             Difference]: Finished difference. Result has 76 places, 72 transitions, 179 flow
[2024-03-09 06:35:46,490 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=179, PETRI_PLACES=76, PETRI_TRANSITIONS=72}
[2024-03-09 06:35:46,491 INFO  L281   CegarLoopForPetriNet]: 71 programPoint places, 5 predicate places.
[2024-03-09 06:35:46,491 INFO  L495      AbstractCegarLoop]: Abstraction has has 76 places, 72 transitions, 179 flow
[2024-03-09 06:35:46,491 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:35:46,491 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:35:46,491 INFO  L208   CegarLoopForPetriNet]: trace histogram [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]
[2024-03-09 06:35:46,492 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-03-09 06:35:46,492 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2024-03-09 06:35:46,492 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:35:46,492 INFO  L85        PathProgramCache]: Analyzing trace with hash -155908587, now seen corresponding path program 1 times
[2024-03-09 06:35:46,492 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:35:46,492 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293855130]
[2024-03-09 06:35:46,493 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:35:46,493 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:35:46,512 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-09 06:35:46,512 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-03-09 06:35:46,521 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-09 06:35:46,537 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-03-09 06:35:46,537 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-03-09 06:35:46,538 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining)
[2024-03-09 06:35:46,539 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (3 of 5 remaining)
[2024-03-09 06:35:46,540 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (2 of 5 remaining)
[2024-03-09 06:35:46,540 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 5 remaining)
[2024-03-09 06:35:46,540 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 5 remaining)
[2024-03-09 06:35:46,540 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-03-09 06:35:46,540 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1]
[2024-03-09 06:35:46,542 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-03-09 06:35:46,542 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2024-03-09 06:35:46,568 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2024-03-09 06:35:46,570 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 90 places, 89 transitions, 194 flow
[2024-03-09 06:35:46,588 INFO  L124   PetriNetUnfolderBase]: 10/180 cut-off events.
[2024-03-09 06:35:46,588 INFO  L125   PetriNetUnfolderBase]: For 6/7 co-relation queries the response was YES.
[2024-03-09 06:35:46,589 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 192 conditions, 180 events. 10/180 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 470 event pairs, 0 based on Foata normal form. 0/156 useless extension candidates. Maximal degree in co-relation 101. Up to 8 conditions per place. 
[2024-03-09 06:35:46,589 INFO  L82        GeneralOperation]: Start removeDead. Operand has 90 places, 89 transitions, 194 flow
[2024-03-09 06:35:46,590 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 90 places, 89 transitions, 194 flow
[2024-03-09 06:35:46,591 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-09 06:35:46,592 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;@6540b93f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-03-09 06:35:46,592 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2024-03-09 06:35:46,595 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-03-09 06:35:46,595 INFO  L124   PetriNetUnfolderBase]: 2/36 cut-off events.
[2024-03-09 06:35:46,595 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-03-09 06:35:46,595 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:35:46,595 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]
[2024-03-09 06:35:46,595 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2024-03-09 06:35:46,596 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:35:46,596 INFO  L85        PathProgramCache]: Analyzing trace with hash -1646010701, now seen corresponding path program 1 times
[2024-03-09 06:35:46,596 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:35:46,596 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393349314]
[2024-03-09 06:35:46,596 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:35:46,596 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:35:46,605 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:35:46,647 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:35:46,648 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:35:46,648 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393349314]
[2024-03-09 06:35:46,648 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393349314] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:35:46,648 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:35:46,648 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-03-09 06:35:46,648 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749964270]
[2024-03-09 06:35:46,648 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:35:46,649 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-03-09 06:35:46,649 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:35:46,649 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-03-09 06:35:46,649 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-03-09 06:35:46,673 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 72 out of 89
[2024-03-09 06:35:46,673 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 89 transitions, 194 flow. Second operand  has 4 states, 4 states have (on average 73.25) internal successors, (293), 4 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:35:46,673 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:35:46,673 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 89
[2024-03-09 06:35:46,673 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:35:46,750 INFO  L124   PetriNetUnfolderBase]: 72/568 cut-off events.
[2024-03-09 06:35:46,750 INFO  L125   PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES.
[2024-03-09 06:35:46,753 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 734 conditions, 568 events. 72/568 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 3512 event pairs, 20 based on Foata normal form. 16/535 useless extension candidates. Maximal degree in co-relation 189. Up to 106 conditions per place. 
[2024-03-09 06:35:46,754 INFO  L140   encePairwiseOnDemand]: 82/89 looper letters, 18 selfloop transitions, 4 changer transitions 0/94 dead transitions.
[2024-03-09 06:35:46,755 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 94 transitions, 248 flow
[2024-03-09 06:35:46,755 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-03-09 06:35:46,755 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-03-09 06:35:46,756 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 314 transitions.
[2024-03-09 06:35:46,756 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8820224719101124
[2024-03-09 06:35:46,756 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 314 transitions.
[2024-03-09 06:35:46,757 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 314 transitions.
[2024-03-09 06:35:46,757 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:35:46,757 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 314 transitions.
[2024-03-09 06:35:46,758 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 78.5) internal successors, (314), 4 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:35:46,759 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:35:46,759 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:35:46,759 INFO  L175             Difference]: Start difference. First operand has 90 places, 89 transitions, 194 flow. Second operand 4 states and 314 transitions.
[2024-03-09 06:35:46,759 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 94 transitions, 248 flow
[2024-03-09 06:35:46,760 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 94 transitions, 248 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-09 06:35:46,761 INFO  L231             Difference]: Finished difference. Result has 94 places, 88 transitions, 206 flow
[2024-03-09 06:35:46,762 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=206, PETRI_PLACES=94, PETRI_TRANSITIONS=88}
[2024-03-09 06:35:46,762 INFO  L281   CegarLoopForPetriNet]: 90 programPoint places, 4 predicate places.
[2024-03-09 06:35:46,762 INFO  L495      AbstractCegarLoop]: Abstraction has has 94 places, 88 transitions, 206 flow
[2024-03-09 06:35:46,763 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 73.25) internal successors, (293), 4 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:35:46,763 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:35:46,763 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]
[2024-03-09 06:35:46,763 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-03-09 06:35:46,763 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2024-03-09 06:35:46,763 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:35:46,764 INFO  L85        PathProgramCache]: Analyzing trace with hash -853170898, now seen corresponding path program 1 times
[2024-03-09 06:35:46,764 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:35:46,764 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592675403]
[2024-03-09 06:35:46,764 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:35:46,764 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:35:46,773 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:35:46,793 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:35:46,794 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:35:46,794 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592675403]
[2024-03-09 06:35:46,794 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592675403] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:35:46,794 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:35:46,794 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-09 06:35:46,794 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417838359]
[2024-03-09 06:35:46,794 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:35:46,795 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 06:35:46,795 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:35:46,795 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 06:35:46,795 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 06:35:46,809 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 72 out of 89
[2024-03-09 06:35:46,810 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 88 transitions, 206 flow. Second operand  has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:35:46,810 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:35:46,810 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 89
[2024-03-09 06:35:46,810 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:35:46,901 INFO  L124   PetriNetUnfolderBase]: 116/699 cut-off events.
[2024-03-09 06:35:46,901 INFO  L125   PetriNetUnfolderBase]: For 76/107 co-relation queries the response was YES.
[2024-03-09 06:35:46,903 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 991 conditions, 699 events. 116/699 cut-off events. For 76/107 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 4637 event pairs, 52 based on Foata normal form. 1/608 useless extension candidates. Maximal degree in co-relation 921. Up to 185 conditions per place. 
[2024-03-09 06:35:46,905 INFO  L140   encePairwiseOnDemand]: 83/89 looper letters, 18 selfloop transitions, 5 changer transitions 0/96 dead transitions.
[2024-03-09 06:35:46,905 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 96 transitions, 276 flow
[2024-03-09 06:35:46,906 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 06:35:46,906 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 06:35:46,906 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 240 transitions.
[2024-03-09 06:35:46,907 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.898876404494382
[2024-03-09 06:35:46,907 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 240 transitions.
[2024-03-09 06:35:46,907 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 240 transitions.
[2024-03-09 06:35:46,907 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:35:46,907 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 240 transitions.
[2024-03-09 06:35:46,908 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:35:46,909 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 89.0) internal successors, (356), 4 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:35:46,909 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 89.0) internal successors, (356), 4 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:35:46,909 INFO  L175             Difference]: Start difference. First operand has 94 places, 88 transitions, 206 flow. Second operand 3 states and 240 transitions.
[2024-03-09 06:35:46,909 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 96 transitions, 276 flow
[2024-03-09 06:35:46,910 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 96 transitions, 270 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-09 06:35:46,912 INFO  L231             Difference]: Finished difference. Result has 96 places, 92 transitions, 238 flow
[2024-03-09 06:35:46,912 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=238, PETRI_PLACES=96, PETRI_TRANSITIONS=92}
[2024-03-09 06:35:46,912 INFO  L281   CegarLoopForPetriNet]: 90 programPoint places, 6 predicate places.
[2024-03-09 06:35:46,912 INFO  L495      AbstractCegarLoop]: Abstraction has has 96 places, 92 transitions, 238 flow
[2024-03-09 06:35:46,913 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:35:46,913 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:35:46,913 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]
[2024-03-09 06:35:46,913 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-03-09 06:35:46,913 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2024-03-09 06:35:46,913 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:35:46,913 INFO  L85        PathProgramCache]: Analyzing trace with hash -1480076718, now seen corresponding path program 1 times
[2024-03-09 06:35:46,914 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:35:46,914 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415914012]
[2024-03-09 06:35:46,914 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:35:46,914 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:35:46,922 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:35:46,970 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-09 06:35:46,971 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:35:46,971 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415914012]
[2024-03-09 06:35:46,971 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415914012] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:35:46,971 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:35:46,971 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-03-09 06:35:46,971 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180396503]
[2024-03-09 06:35:46,971 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:35:46,972 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-03-09 06:35:46,972 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:35:46,972 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-03-09 06:35:46,972 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-03-09 06:35:47,021 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 72 out of 89
[2024-03-09 06:35:47,022 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 92 transitions, 238 flow. Second operand  has 4 states, 4 states have (on average 73.5) internal successors, (294), 4 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:35:47,022 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:35:47,022 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 89
[2024-03-09 06:35:47,022 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:35:47,117 INFO  L124   PetriNetUnfolderBase]: 63/581 cut-off events.
[2024-03-09 06:35:47,117 INFO  L125   PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES.
[2024-03-09 06:35:47,118 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 811 conditions, 581 events. 63/581 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 3341 event pairs, 24 based on Foata normal form. 15/545 useless extension candidates. Maximal degree in co-relation 651. Up to 72 conditions per place. 
[2024-03-09 06:35:47,120 INFO  L140   encePairwiseOnDemand]: 84/89 looper letters, 19 selfloop transitions, 4 changer transitions 3/103 dead transitions.
[2024-03-09 06:35:47,120 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 103 transitions, 318 flow
[2024-03-09 06:35:47,120 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-03-09 06:35:47,120 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-03-09 06:35:47,129 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 315 transitions.
[2024-03-09 06:35:47,129 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8848314606741573
[2024-03-09 06:35:47,129 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 315 transitions.
[2024-03-09 06:35:47,129 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 315 transitions.
[2024-03-09 06:35:47,129 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:35:47,130 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 315 transitions.
[2024-03-09 06:35:47,130 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 78.75) internal successors, (315), 4 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:35:47,131 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:35:47,132 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:35:47,132 INFO  L175             Difference]: Start difference. First operand has 96 places, 92 transitions, 238 flow. Second operand 4 states and 315 transitions.
[2024-03-09 06:35:47,132 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 103 transitions, 318 flow
[2024-03-09 06:35:47,133 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 103 transitions, 308 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-09 06:35:47,135 INFO  L231             Difference]: Finished difference. Result has 98 places, 93 transitions, 244 flow
[2024-03-09 06:35:47,135 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=244, PETRI_PLACES=98, PETRI_TRANSITIONS=93}
[2024-03-09 06:35:47,135 INFO  L281   CegarLoopForPetriNet]: 90 programPoint places, 8 predicate places.
[2024-03-09 06:35:47,136 INFO  L495      AbstractCegarLoop]: Abstraction has has 98 places, 93 transitions, 244 flow
[2024-03-09 06:35:47,136 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 73.5) internal successors, (294), 4 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:35:47,136 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:35:47,136 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 06:35:47,136 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-03-09 06:35:47,136 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2024-03-09 06:35:47,137 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:35:47,137 INFO  L85        PathProgramCache]: Analyzing trace with hash -1931209736, now seen corresponding path program 1 times
[2024-03-09 06:35:47,137 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:35:47,137 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973691281]
[2024-03-09 06:35:47,137 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:35:47,137 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:35:47,150 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:35:47,226 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:35:47,226 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:35:47,226 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973691281]
[2024-03-09 06:35:47,227 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973691281] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 06:35:47,227 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1823860221]
[2024-03-09 06:35:47,227 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:35:47,227 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 06:35:47,227 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 06:35:47,228 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 06:35:47,234 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-03-09 06:35:47,303 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:35:47,304 INFO  L262         TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core
[2024-03-09 06:35:47,306 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 06:35:47,405 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:35:47,405 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 06:35:47,455 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:35:47,456 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1823860221] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 06:35:47,456 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 06:35:47,456 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13
[2024-03-09 06:35:47,456 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881237101]
[2024-03-09 06:35:47,456 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 06:35:47,456 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2024-03-09 06:35:47,457 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:35:47,457 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2024-03-09 06:35:47,457 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156
[2024-03-09 06:35:47,538 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 69 out of 89
[2024-03-09 06:35:47,539 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 93 transitions, 244 flow. Second operand  has 13 states, 13 states have (on average 70.92307692307692) internal successors, (922), 13 states have internal predecessors, (922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:35:47,539 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:35:47,539 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 89
[2024-03-09 06:35:47,540 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:35:47,699 INFO  L124   PetriNetUnfolderBase]: 81/351 cut-off events.
[2024-03-09 06:35:47,699 INFO  L125   PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES.
[2024-03-09 06:35:47,699 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 558 conditions, 351 events. 81/351 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1830 event pairs, 6 based on Foata normal form. 15/347 useless extension candidates. Maximal degree in co-relation 550. Up to 56 conditions per place. 
[2024-03-09 06:35:47,700 INFO  L140   encePairwiseOnDemand]: 83/89 looper letters, 28 selfloop transitions, 8 changer transitions 0/85 dead transitions.
[2024-03-09 06:35:47,701 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 85 transitions, 276 flow
[2024-03-09 06:35:47,701 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-03-09 06:35:47,701 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-03-09 06:35:47,702 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 728 transitions.
[2024-03-09 06:35:47,703 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8179775280898877
[2024-03-09 06:35:47,703 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 728 transitions.
[2024-03-09 06:35:47,703 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 728 transitions.
[2024-03-09 06:35:47,703 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:35:47,703 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 728 transitions.
[2024-03-09 06:35:47,705 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 11 states, 10 states have (on average 72.8) internal successors, (728), 10 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-09 06:35:47,706 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 11 states, 11 states have (on average 89.0) internal successors, (979), 11 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:35:47,707 INFO  L81            ComplementDD]: Finished complementDD. Result  has 11 states, 11 states have (on average 89.0) internal successors, (979), 11 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:35:47,707 INFO  L175             Difference]: Start difference. First operand has 98 places, 93 transitions, 244 flow. Second operand 10 states and 728 transitions.
[2024-03-09 06:35:47,707 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 85 transitions, 276 flow
[2024-03-09 06:35:47,708 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 85 transitions, 275 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-09 06:35:47,709 INFO  L231             Difference]: Finished difference. Result has 79 places, 65 transitions, 179 flow
[2024-03-09 06:35:47,709 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=179, PETRI_PLACES=79, PETRI_TRANSITIONS=65}
[2024-03-09 06:35:47,709 INFO  L281   CegarLoopForPetriNet]: 90 programPoint places, -11 predicate places.
[2024-03-09 06:35:47,709 INFO  L495      AbstractCegarLoop]: Abstraction has has 79 places, 65 transitions, 179 flow
[2024-03-09 06:35:47,710 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 13 states, 13 states have (on average 70.92307692307692) internal successors, (922), 13 states have internal predecessors, (922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:35:47,710 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:35:47,710 INFO  L208   CegarLoopForPetriNet]: trace histogram [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]
[2024-03-09 06:35:47,717 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2024-03-09 06:35:47,917 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 06:35:47,918 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2024-03-09 06:35:47,919 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:35:47,919 INFO  L85        PathProgramCache]: Analyzing trace with hash -778921506, now seen corresponding path program 1 times
[2024-03-09 06:35:47,919 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:35:47,919 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051469256]
[2024-03-09 06:35:47,920 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:35:47,920 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:35:47,948 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:35:47,964 INFO  L134       CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2024-03-09 06:35:47,964 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:35:47,964 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051469256]
[2024-03-09 06:35:47,965 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051469256] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:35:47,965 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:35:47,965 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-09 06:35:47,965 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660671523]
[2024-03-09 06:35:47,965 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:35:47,965 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 06:35:47,965 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:35:47,966 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 06:35:47,966 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 06:35:47,978 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 72 out of 89
[2024-03-09 06:35:47,978 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 65 transitions, 179 flow. Second operand  has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:35:47,978 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:35:47,978 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 89
[2024-03-09 06:35:47,978 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:35:48,003 INFO  L124   PetriNetUnfolderBase]: 27/209 cut-off events.
[2024-03-09 06:35:48,003 INFO  L125   PetriNetUnfolderBase]: For 27/31 co-relation queries the response was YES.
[2024-03-09 06:35:48,003 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 348 conditions, 209 events. 27/209 cut-off events. For 27/31 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 799 event pairs, 16 based on Foata normal form. 0/200 useless extension candidates. Maximal degree in co-relation 340. Up to 55 conditions per place. 
[2024-03-09 06:35:48,004 INFO  L140   encePairwiseOnDemand]: 84/89 looper letters, 13 selfloop transitions, 5 changer transitions 0/70 dead transitions.
[2024-03-09 06:35:48,004 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 70 transitions, 227 flow
[2024-03-09 06:35:48,004 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 06:35:48,004 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 06:35:48,005 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 234 transitions.
[2024-03-09 06:35:48,005 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8764044943820225
[2024-03-09 06:35:48,005 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 234 transitions.
[2024-03-09 06:35:48,005 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 234 transitions.
[2024-03-09 06:35:48,005 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:35:48,005 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 234 transitions.
[2024-03-09 06:35:48,006 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:35:48,006 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 89.0) internal successors, (356), 4 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:35:48,006 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 89.0) internal successors, (356), 4 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:35:48,006 INFO  L175             Difference]: Start difference. First operand has 79 places, 65 transitions, 179 flow. Second operand 3 states and 234 transitions.
[2024-03-09 06:35:48,006 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 70 transitions, 227 flow
[2024-03-09 06:35:48,007 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 70 transitions, 210 flow, removed 1 selfloop flow, removed 6 redundant places.
[2024-03-09 06:35:48,008 INFO  L231             Difference]: Finished difference. Result has 77 places, 68 transitions, 198 flow
[2024-03-09 06:35:48,008 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=198, PETRI_PLACES=77, PETRI_TRANSITIONS=68}
[2024-03-09 06:35:48,009 INFO  L281   CegarLoopForPetriNet]: 90 programPoint places, -13 predicate places.
[2024-03-09 06:35:48,009 INFO  L495      AbstractCegarLoop]: Abstraction has has 77 places, 68 transitions, 198 flow
[2024-03-09 06:35:48,009 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:35:48,009 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:35:48,009 INFO  L208   CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 06:35:48,009 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-03-09 06:35:48,009 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2024-03-09 06:35:48,010 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:35:48,010 INFO  L85        PathProgramCache]: Analyzing trace with hash 1306650741, now seen corresponding path program 1 times
[2024-03-09 06:35:48,010 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:35:48,010 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979608013]
[2024-03-09 06:35:48,010 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:35:48,010 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:35:48,020 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-09 06:35:48,021 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-03-09 06:35:48,027 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-09 06:35:48,036 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-03-09 06:35:48,036 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-03-09 06:35:48,037 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining)
[2024-03-09 06:35:48,037 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 6 remaining)
[2024-03-09 06:35:48,037 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (3 of 6 remaining)
[2024-03-09 06:35:48,037 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 6 remaining)
[2024-03-09 06:35:48,037 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 6 remaining)
[2024-03-09 06:35:48,037 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 6 remaining)
[2024-03-09 06:35:48,037 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-03-09 06:35:48,037 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1]
[2024-03-09 06:35:48,038 WARN  L233   ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-03-09 06:35:48,038 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances.
[2024-03-09 06:35:48,053 INFO  L144    ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions.
[2024-03-09 06:35:48,054 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 109 places, 107 transitions, 241 flow
[2024-03-09 06:35:48,072 INFO  L124   PetriNetUnfolderBase]: 20/314 cut-off events.
[2024-03-09 06:35:48,073 INFO  L125   PetriNetUnfolderBase]: For 19/21 co-relation queries the response was YES.
[2024-03-09 06:35:48,073 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 339 conditions, 314 events. 20/314 cut-off events. For 19/21 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 996 event pairs, 1 based on Foata normal form. 0/271 useless extension candidates. Maximal degree in co-relation 188. Up to 16 conditions per place. 
[2024-03-09 06:35:48,073 INFO  L82        GeneralOperation]: Start removeDead. Operand has 109 places, 107 transitions, 241 flow
[2024-03-09 06:35:48,074 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 109 places, 107 transitions, 241 flow
[2024-03-09 06:35:48,075 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-09 06:35:48,075 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;@6540b93f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-03-09 06:35:48,076 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2024-03-09 06:35:48,077 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-03-09 06:35:48,077 INFO  L124   PetriNetUnfolderBase]: 2/36 cut-off events.
[2024-03-09 06:35:48,077 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-03-09 06:35:48,077 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:35:48,078 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]
[2024-03-09 06:35:48,078 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2024-03-09 06:35:48,078 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:35:48,078 INFO  L85        PathProgramCache]: Analyzing trace with hash 2077821395, now seen corresponding path program 1 times
[2024-03-09 06:35:48,078 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:35:48,078 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035087186]
[2024-03-09 06:35:48,078 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:35:48,078 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:35:48,082 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:35:48,106 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:35:48,106 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:35:48,106 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035087186]
[2024-03-09 06:35:48,106 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035087186] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:35:48,106 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:35:48,106 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-03-09 06:35:48,107 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140794003]
[2024-03-09 06:35:48,107 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:35:48,107 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-03-09 06:35:48,107 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:35:48,107 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-03-09 06:35:48,107 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-03-09 06:35:48,123 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 86 out of 107
[2024-03-09 06:35:48,124 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 107 transitions, 241 flow. Second operand  has 4 states, 4 states have (on average 87.25) internal successors, (349), 4 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:35:48,124 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:35:48,124 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 107
[2024-03-09 06:35:48,124 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:35:48,323 INFO  L124   PetriNetUnfolderBase]: 412/2191 cut-off events.
[2024-03-09 06:35:48,323 INFO  L125   PetriNetUnfolderBase]: For 232/232 co-relation queries the response was YES.
[2024-03-09 06:35:48,326 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2962 conditions, 2191 events. 412/2191 cut-off events. For 232/232 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 18620 event pairs, 175 based on Foata normal form. 63/2061 useless extension candidates. Maximal degree in co-relation 757. Up to 495 conditions per place. 
[2024-03-09 06:35:48,332 INFO  L140   encePairwiseOnDemand]: 100/107 looper letters, 24 selfloop transitions, 4 changer transitions 0/114 dead transitions.
[2024-03-09 06:35:48,332 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 114 transitions, 311 flow
[2024-03-09 06:35:48,333 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-03-09 06:35:48,333 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-03-09 06:35:48,334 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 376 transitions.
[2024-03-09 06:35:48,334 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8785046728971962
[2024-03-09 06:35:48,334 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 376 transitions.
[2024-03-09 06:35:48,334 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 376 transitions.
[2024-03-09 06:35:48,334 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:35:48,334 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 376 transitions.
[2024-03-09 06:35:48,335 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 94.0) internal successors, (376), 4 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-09 06:35:48,336 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 107.0) internal successors, (535), 5 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:35:48,336 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 107.0) internal successors, (535), 5 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:35:48,336 INFO  L175             Difference]: Start difference. First operand has 109 places, 107 transitions, 241 flow. Second operand 4 states and 376 transitions.
[2024-03-09 06:35:48,336 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 114 transitions, 311 flow
[2024-03-09 06:35:48,337 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 114 transitions, 311 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-09 06:35:48,338 INFO  L231             Difference]: Finished difference. Result has 113 places, 106 transitions, 253 flow
[2024-03-09 06:35:48,338 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=253, PETRI_PLACES=113, PETRI_TRANSITIONS=106}
[2024-03-09 06:35:48,339 INFO  L281   CegarLoopForPetriNet]: 109 programPoint places, 4 predicate places.
[2024-03-09 06:35:48,339 INFO  L495      AbstractCegarLoop]: Abstraction has has 113 places, 106 transitions, 253 flow
[2024-03-09 06:35:48,339 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 87.25) internal successors, (349), 4 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:35:48,339 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:35:48,339 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]
[2024-03-09 06:35:48,339 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-03-09 06:35:48,339 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2024-03-09 06:35:48,340 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:35:48,340 INFO  L85        PathProgramCache]: Analyzing trace with hash -2019156887, now seen corresponding path program 1 times
[2024-03-09 06:35:48,340 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:35:48,340 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614776488]
[2024-03-09 06:35:48,340 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:35:48,340 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:35:48,347 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:35:48,359 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:35:48,359 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:35:48,359 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614776488]
[2024-03-09 06:35:48,359 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614776488] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:35:48,359 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:35:48,359 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-09 06:35:48,359 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229015444]
[2024-03-09 06:35:48,359 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:35:48,360 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 06:35:48,360 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:35:48,360 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 06:35:48,360 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 06:35:48,374 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 85 out of 107
[2024-03-09 06:35:48,374 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 106 transitions, 253 flow. Second operand  has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:35:48,374 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:35:48,375 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 107
[2024-03-09 06:35:48,375 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:35:48,721 INFO  L124   PetriNetUnfolderBase]: 1023/4264 cut-off events.
[2024-03-09 06:35:48,721 INFO  L125   PetriNetUnfolderBase]: For 720/933 co-relation queries the response was YES.
[2024-03-09 06:35:48,727 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6254 conditions, 4264 events. 1023/4264 cut-off events. For 720/933 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 41775 event pairs, 560 based on Foata normal form. 1/3721 useless extension candidates. Maximal degree in co-relation 6048. Up to 1329 conditions per place. 
[2024-03-09 06:35:48,740 INFO  L140   encePairwiseOnDemand]: 100/107 looper letters, 27 selfloop transitions, 6 changer transitions 0/119 dead transitions.
[2024-03-09 06:35:48,740 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 119 transitions, 363 flow
[2024-03-09 06:35:48,741 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 06:35:48,741 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 06:35:48,742 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 289 transitions.
[2024-03-09 06:35:48,742 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9003115264797508
[2024-03-09 06:35:48,742 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 289 transitions.
[2024-03-09 06:35:48,742 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 289 transitions.
[2024-03-09 06:35:48,742 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:35:48,742 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 289 transitions.
[2024-03-09 06:35:48,743 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:35:48,743 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 107.0) internal successors, (428), 4 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:35:48,743 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 107.0) internal successors, (428), 4 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:35:48,743 INFO  L175             Difference]: Start difference. First operand has 113 places, 106 transitions, 253 flow. Second operand 3 states and 289 transitions.
[2024-03-09 06:35:48,743 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 119 transitions, 363 flow
[2024-03-09 06:35:48,745 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 119 transitions, 357 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-09 06:35:48,747 INFO  L231             Difference]: Finished difference. Result has 115 places, 111 transitions, 293 flow
[2024-03-09 06:35:48,747 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=293, PETRI_PLACES=115, PETRI_TRANSITIONS=111}
[2024-03-09 06:35:48,747 INFO  L281   CegarLoopForPetriNet]: 109 programPoint places, 6 predicate places.
[2024-03-09 06:35:48,747 INFO  L495      AbstractCegarLoop]: Abstraction has has 115 places, 111 transitions, 293 flow
[2024-03-09 06:35:48,747 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:35:48,748 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:35:48,748 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]
[2024-03-09 06:35:48,748 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-03-09 06:35:48,748 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2024-03-09 06:35:48,748 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:35:48,748 INFO  L85        PathProgramCache]: Analyzing trace with hash -1650732958, now seen corresponding path program 1 times
[2024-03-09 06:35:48,748 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:35:48,748 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095139166]
[2024-03-09 06:35:48,748 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:35:48,748 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:35:48,754 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:35:48,783 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-09 06:35:48,784 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:35:48,784 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095139166]
[2024-03-09 06:35:48,784 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095139166] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:35:48,784 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:35:48,784 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-03-09 06:35:48,784 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154944750]
[2024-03-09 06:35:48,784 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:35:48,784 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-03-09 06:35:48,784 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:35:48,785 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-03-09 06:35:48,785 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-03-09 06:35:48,824 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 86 out of 107
[2024-03-09 06:35:48,824 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 111 transitions, 293 flow. Second operand  has 4 states, 4 states have (on average 87.5) internal successors, (350), 4 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:35:48,824 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:35:48,824 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 107
[2024-03-09 06:35:48,824 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:35:49,156 INFO  L124   PetriNetUnfolderBase]: 618/3166 cut-off events.
[2024-03-09 06:35:49,156 INFO  L125   PetriNetUnfolderBase]: For 436/440 co-relation queries the response was YES.
[2024-03-09 06:35:49,162 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4697 conditions, 3166 events. 618/3166 cut-off events. For 436/440 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 29550 event pairs, 247 based on Foata normal form. 63/2905 useless extension candidates. Maximal degree in co-relation 3847. Up to 511 conditions per place. 
[2024-03-09 06:35:49,170 INFO  L140   encePairwiseOnDemand]: 102/107 looper letters, 31 selfloop transitions, 4 changer transitions 0/127 dead transitions.
[2024-03-09 06:35:49,170 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 127 transitions, 404 flow
[2024-03-09 06:35:49,171 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-03-09 06:35:49,171 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-03-09 06:35:49,171 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 380 transitions.
[2024-03-09 06:35:49,171 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8878504672897196
[2024-03-09 06:35:49,171 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 380 transitions.
[2024-03-09 06:35:49,171 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 380 transitions.
[2024-03-09 06:35:49,172 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:35:49,172 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 380 transitions.
[2024-03-09 06:35:49,172 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:35:49,173 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 107.0) internal successors, (535), 5 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:35:49,173 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 107.0) internal successors, (535), 5 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:35:49,173 INFO  L175             Difference]: Start difference. First operand has 115 places, 111 transitions, 293 flow. Second operand 4 states and 380 transitions.
[2024-03-09 06:35:49,173 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 127 transitions, 404 flow
[2024-03-09 06:35:49,175 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 127 transitions, 392 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-09 06:35:49,176 INFO  L231             Difference]: Finished difference. Result has 117 places, 112 transitions, 297 flow
[2024-03-09 06:35:49,177 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=281, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=297, PETRI_PLACES=117, PETRI_TRANSITIONS=112}
[2024-03-09 06:35:49,177 INFO  L281   CegarLoopForPetriNet]: 109 programPoint places, 8 predicate places.
[2024-03-09 06:35:49,177 INFO  L495      AbstractCegarLoop]: Abstraction has has 117 places, 112 transitions, 297 flow
[2024-03-09 06:35:49,177 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 87.5) internal successors, (350), 4 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:35:49,177 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:35:49,177 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]
[2024-03-09 06:35:49,177 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-03-09 06:35:49,177 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2024-03-09 06:35:49,178 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:35:49,178 INFO  L85        PathProgramCache]: Analyzing trace with hash -709870861, now seen corresponding path program 1 times
[2024-03-09 06:35:49,178 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:35:49,178 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790302701]
[2024-03-09 06:35:49,178 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:35:49,178 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:35:49,186 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:35:49,238 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:35:49,238 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:35:49,238 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790302701]
[2024-03-09 06:35:49,238 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790302701] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 06:35:49,238 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [216896841]
[2024-03-09 06:35:49,238 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:35:49,238 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 06:35:49,238 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 06:35:49,241 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 06:35:49,243 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2024-03-09 06:35:49,299 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:35:49,312 INFO  L262         TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core
[2024-03-09 06:35:49,315 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 06:35:49,391 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:35:49,392 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 06:35:49,433 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:35:49,433 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [216896841] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 06:35:49,433 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 06:35:49,433 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13
[2024-03-09 06:35:49,433 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245510665]
[2024-03-09 06:35:49,434 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 06:35:49,434 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2024-03-09 06:35:49,434 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:35:49,434 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2024-03-09 06:35:49,435 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156
[2024-03-09 06:35:49,513 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 83 out of 107
[2024-03-09 06:35:49,514 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 112 transitions, 297 flow. Second operand  has 13 states, 13 states have (on average 84.92307692307692) internal successors, (1104), 13 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:35:49,514 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:35:49,515 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 107
[2024-03-09 06:35:49,515 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:35:49,975 INFO  L124   PetriNetUnfolderBase]: 1016/4333 cut-off events.
[2024-03-09 06:35:49,975 INFO  L125   PetriNetUnfolderBase]: For 584/584 co-relation queries the response was YES.
[2024-03-09 06:35:49,986 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6604 conditions, 4333 events. 1016/4333 cut-off events. For 584/584 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 40757 event pairs, 151 based on Foata normal form. 15/3810 useless extension candidates. Maximal degree in co-relation 3426. Up to 749 conditions per place. 
[2024-03-09 06:35:49,999 INFO  L140   encePairwiseOnDemand]: 99/107 looper letters, 50 selfloop transitions, 11 changer transitions 0/150 dead transitions.
[2024-03-09 06:35:49,999 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 150 transitions, 497 flow
[2024-03-09 06:35:50,001 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-03-09 06:35:50,001 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-03-09 06:35:50,002 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 893 transitions.
[2024-03-09 06:35:50,003 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8345794392523365
[2024-03-09 06:35:50,003 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 893 transitions.
[2024-03-09 06:35:50,003 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 893 transitions.
[2024-03-09 06:35:50,004 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:35:50,004 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 893 transitions.
[2024-03-09 06:35:50,005 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 11 states, 10 states have (on average 89.3) internal successors, (893), 10 states have internal predecessors, (893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:35:50,007 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 11 states, 11 states have (on average 107.0) internal successors, (1177), 11 states have internal predecessors, (1177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:35:50,008 INFO  L81            ComplementDD]: Finished complementDD. Result  has 11 states, 11 states have (on average 107.0) internal successors, (1177), 11 states have internal predecessors, (1177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:35:50,008 INFO  L175             Difference]: Start difference. First operand has 117 places, 112 transitions, 297 flow. Second operand 10 states and 893 transitions.
[2024-03-09 06:35:50,008 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 150 transitions, 497 flow
[2024-03-09 06:35:50,011 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 150 transitions, 491 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-09 06:35:50,013 INFO  L231             Difference]: Finished difference. Result has 127 places, 118 transitions, 347 flow
[2024-03-09 06:35:50,013 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=291, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=347, PETRI_PLACES=127, PETRI_TRANSITIONS=118}
[2024-03-09 06:35:50,013 INFO  L281   CegarLoopForPetriNet]: 109 programPoint places, 18 predicate places.
[2024-03-09 06:35:50,013 INFO  L495      AbstractCegarLoop]: Abstraction has has 127 places, 118 transitions, 347 flow
[2024-03-09 06:35:50,014 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 13 states, 13 states have (on average 84.92307692307692) internal successors, (1104), 13 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:35:50,014 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:35:50,014 INFO  L208   CegarLoopForPetriNet]: trace histogram [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]
[2024-03-09 06:35:50,021 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2024-03-09 06:35:50,216 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12
[2024-03-09 06:35:50,216 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2024-03-09 06:35:50,217 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:35:50,217 INFO  L85        PathProgramCache]: Analyzing trace with hash 1047928841, now seen corresponding path program 1 times
[2024-03-09 06:35:50,217 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:35:50,217 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497506440]
[2024-03-09 06:35:50,218 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:35:50,218 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:35:50,230 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:35:50,246 INFO  L134       CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2024-03-09 06:35:50,246 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:35:50,246 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497506440]
[2024-03-09 06:35:50,246 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497506440] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:35:50,246 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:35:50,246 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-09 06:35:50,246 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880105645]
[2024-03-09 06:35:50,246 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:35:50,247 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 06:35:50,247 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:35:50,247 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 06:35:50,247 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 06:35:50,266 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 85 out of 107
[2024-03-09 06:35:50,266 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 118 transitions, 347 flow. Second operand  has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:35:50,266 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:35:50,266 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 107
[2024-03-09 06:35:50,266 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:35:50,641 INFO  L124   PetriNetUnfolderBase]: 916/4000 cut-off events.
[2024-03-09 06:35:50,641 INFO  L125   PetriNetUnfolderBase]: For 1214/1242 co-relation queries the response was YES.
[2024-03-09 06:35:50,650 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6786 conditions, 4000 events. 916/4000 cut-off events. For 1214/1242 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 38755 event pairs, 539 based on Foata normal form. 1/3627 useless extension candidates. Maximal degree in co-relation 6142. Up to 1192 conditions per place. 
[2024-03-09 06:35:50,662 INFO  L140   encePairwiseOnDemand]: 100/107 looper letters, 28 selfloop transitions, 9 changer transitions 0/132 dead transitions.
[2024-03-09 06:35:50,663 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 132 transitions, 472 flow
[2024-03-09 06:35:50,663 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 06:35:50,663 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 06:35:50,664 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 288 transitions.
[2024-03-09 06:35:50,664 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.897196261682243
[2024-03-09 06:35:50,664 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 288 transitions.
[2024-03-09 06:35:50,664 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 288 transitions.
[2024-03-09 06:35:50,664 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:35:50,664 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 288 transitions.
[2024-03-09 06:35:50,665 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:35:50,665 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 107.0) internal successors, (428), 4 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:35:50,666 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 107.0) internal successors, (428), 4 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:35:50,666 INFO  L175             Difference]: Start difference. First operand has 127 places, 118 transitions, 347 flow. Second operand 3 states and 288 transitions.
[2024-03-09 06:35:50,666 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 132 transitions, 472 flow
[2024-03-09 06:35:50,669 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 132 transitions, 464 flow, removed 2 selfloop flow, removed 2 redundant places.
[2024-03-09 06:35:50,670 INFO  L231             Difference]: Finished difference. Result has 129 places, 125 transitions, 415 flow
[2024-03-09 06:35:50,670 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=415, PETRI_PLACES=129, PETRI_TRANSITIONS=125}
[2024-03-09 06:35:50,671 INFO  L281   CegarLoopForPetriNet]: 109 programPoint places, 20 predicate places.
[2024-03-09 06:35:50,671 INFO  L495      AbstractCegarLoop]: Abstraction has has 129 places, 125 transitions, 415 flow
[2024-03-09 06:35:50,671 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:35:50,671 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:35:50,671 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 06:35:50,685 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-03-09 06:35:50,685 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2024-03-09 06:35:50,685 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:35:50,686 INFO  L85        PathProgramCache]: Analyzing trace with hash -1375263459, now seen corresponding path program 1 times
[2024-03-09 06:35:50,686 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:35:50,686 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264720591]
[2024-03-09 06:35:50,686 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:35:50,686 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:35:50,694 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:35:50,735 INFO  L134       CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2024-03-09 06:35:50,736 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:35:50,736 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264720591]
[2024-03-09 06:35:50,736 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264720591] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:35:50,736 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:35:50,736 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-03-09 06:35:50,736 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168117014]
[2024-03-09 06:35:50,736 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:35:50,736 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 06:35:50,736 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:35:50,737 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 06:35:50,737 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 06:35:50,744 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 92 out of 107
[2024-03-09 06:35:50,744 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 125 transitions, 415 flow. Second operand  has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:35:50,744 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:35:50,745 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 107
[2024-03-09 06:35:50,745 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:35:50,859 INFO  L124   PetriNetUnfolderBase]: 98/1340 cut-off events.
[2024-03-09 06:35:50,859 INFO  L125   PetriNetUnfolderBase]: For 340/382 co-relation queries the response was YES.
[2024-03-09 06:35:50,890 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2016 conditions, 1340 events. 98/1340 cut-off events. For 340/382 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 10118 event pairs, 26 based on Foata normal form. 20/1253 useless extension candidates. Maximal degree in co-relation 922. Up to 100 conditions per place. 
[2024-03-09 06:35:50,894 INFO  L140   encePairwiseOnDemand]: 101/107 looper letters, 12 selfloop transitions, 6 changer transitions 0/124 dead transitions.
[2024-03-09 06:35:50,894 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 124 transitions, 436 flow
[2024-03-09 06:35:50,895 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 06:35:50,895 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 06:35:50,897 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 297 transitions.
[2024-03-09 06:35:50,897 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9252336448598131
[2024-03-09 06:35:50,897 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 297 transitions.
[2024-03-09 06:35:50,898 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 297 transitions.
[2024-03-09 06:35:50,898 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:35:50,898 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 297 transitions.
[2024-03-09 06:35:50,899 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:35:50,900 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 107.0) internal successors, (428), 4 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:35:50,901 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 107.0) internal successors, (428), 4 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:35:50,901 INFO  L175             Difference]: Start difference. First operand has 129 places, 125 transitions, 415 flow. Second operand 3 states and 297 transitions.
[2024-03-09 06:35:50,901 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 124 transitions, 436 flow
[2024-03-09 06:35:50,904 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 124 transitions, 424 flow, removed 2 selfloop flow, removed 2 redundant places.
[2024-03-09 06:35:50,906 INFO  L231             Difference]: Finished difference. Result has 129 places, 119 transitions, 369 flow
[2024-03-09 06:35:50,906 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=357, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=369, PETRI_PLACES=129, PETRI_TRANSITIONS=119}
[2024-03-09 06:35:50,907 INFO  L281   CegarLoopForPetriNet]: 109 programPoint places, 20 predicate places.
[2024-03-09 06:35:50,907 INFO  L495      AbstractCegarLoop]: Abstraction has has 129 places, 119 transitions, 369 flow
[2024-03-09 06:35:50,908 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:35:50,908 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:35:50,908 INFO  L208   CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 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]
[2024-03-09 06:35:50,908 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-03-09 06:35:50,908 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2024-03-09 06:35:50,908 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:35:50,909 INFO  L85        PathProgramCache]: Analyzing trace with hash -364070712, now seen corresponding path program 1 times
[2024-03-09 06:35:50,909 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:35:50,909 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949786425]
[2024-03-09 06:35:50,909 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:35:50,909 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:35:50,917 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:35:50,932 INFO  L134       CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked.
[2024-03-09 06:35:50,933 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:35:50,933 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949786425]
[2024-03-09 06:35:50,933 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949786425] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:35:50,933 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:35:50,933 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-09 06:35:50,933 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86177656]
[2024-03-09 06:35:50,933 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:35:50,933 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 06:35:50,933 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:35:50,934 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 06:35:50,934 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 06:35:50,947 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 85 out of 107
[2024-03-09 06:35:50,947 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 119 transitions, 369 flow. Second operand  has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:35:50,947 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:35:50,947 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 107
[2024-03-09 06:35:50,948 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:35:51,087 INFO  L124   PetriNetUnfolderBase]: 177/1400 cut-off events.
[2024-03-09 06:35:51,087 INFO  L125   PetriNetUnfolderBase]: For 698/698 co-relation queries the response was YES.
[2024-03-09 06:35:51,090 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2461 conditions, 1400 events. 177/1400 cut-off events. For 698/698 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 11059 event pairs, 135 based on Foata normal form. 0/1290 useless extension candidates. Maximal degree in co-relation 2169. Up to 336 conditions per place. 
[2024-03-09 06:35:51,093 INFO  L140   encePairwiseOnDemand]: 102/107 looper letters, 23 selfloop transitions, 4 changer transitions 0/124 dead transitions.
[2024-03-09 06:35:51,093 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 124 transitions, 443 flow
[2024-03-09 06:35:51,094 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 06:35:51,094 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 06:35:51,094 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 281 transitions.
[2024-03-09 06:35:51,095 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8753894080996885
[2024-03-09 06:35:51,095 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 281 transitions.
[2024-03-09 06:35:51,095 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 281 transitions.
[2024-03-09 06:35:51,095 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:35:51,095 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 281 transitions.
[2024-03-09 06:35:51,096 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:35:51,096 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 107.0) internal successors, (428), 4 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:35:51,096 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 107.0) internal successors, (428), 4 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:35:51,096 INFO  L175             Difference]: Start difference. First operand has 129 places, 119 transitions, 369 flow. Second operand 3 states and 281 transitions.
[2024-03-09 06:35:51,097 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 124 transitions, 443 flow
[2024-03-09 06:35:51,099 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 124 transitions, 437 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-09 06:35:51,100 INFO  L231             Difference]: Finished difference. Result has 132 places, 122 transitions, 397 flow
[2024-03-09 06:35:51,100 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=363, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=397, PETRI_PLACES=132, PETRI_TRANSITIONS=122}
[2024-03-09 06:35:51,100 INFO  L281   CegarLoopForPetriNet]: 109 programPoint places, 23 predicate places.
[2024-03-09 06:35:51,100 INFO  L495      AbstractCegarLoop]: Abstraction has has 132 places, 122 transitions, 397 flow
[2024-03-09 06:35:51,101 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:35:51,101 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:35:51,101 INFO  L208   CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 06:35:51,101 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-03-09 06:35:51,101 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2024-03-09 06:35:51,101 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:35:51,101 INFO  L85        PathProgramCache]: Analyzing trace with hash -1107906250, now seen corresponding path program 1 times
[2024-03-09 06:35:51,101 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:35:51,102 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562227893]
[2024-03-09 06:35:51,102 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:35:51,102 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:35:51,113 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-09 06:35:51,113 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-03-09 06:35:51,118 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-09 06:35:51,123 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-03-09 06:35:51,123 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-03-09 06:35:51,124 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining)
[2024-03-09 06:35:51,124 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining)
[2024-03-09 06:35:51,124 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining)
[2024-03-09 06:35:51,124 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining)
[2024-03-09 06:35:51,124 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining)
[2024-03-09 06:35:51,124 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining)
[2024-03-09 06:35:51,124 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining)
[2024-03-09 06:35:51,124 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-03-09 06:35:51,124 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 06:35:51,125 WARN  L233   ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-03-09 06:35:51,125 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances.
[2024-03-09 06:35:51,144 INFO  L144    ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions.
[2024-03-09 06:35:51,146 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 128 places, 125 transitions, 290 flow
[2024-03-09 06:35:51,186 INFO  L124   PetriNetUnfolderBase]: 42/556 cut-off events.
[2024-03-09 06:35:51,186 INFO  L125   PetriNetUnfolderBase]: For 48/51 co-relation queries the response was YES.
[2024-03-09 06:35:51,188 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 607 conditions, 556 events. 42/556 cut-off events. For 48/51 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2238 event pairs, 6 based on Foata normal form. 0/478 useless extension candidates. Maximal degree in co-relation 334. Up to 32 conditions per place. 
[2024-03-09 06:35:51,188 INFO  L82        GeneralOperation]: Start removeDead. Operand has 128 places, 125 transitions, 290 flow
[2024-03-09 06:35:51,190 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 128 places, 125 transitions, 290 flow
[2024-03-09 06:35:51,190 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-09 06:35:51,191 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;@6540b93f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-03-09 06:35:51,191 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 8 error locations.
[2024-03-09 06:35:51,192 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-03-09 06:35:51,193 INFO  L124   PetriNetUnfolderBase]: 2/36 cut-off events.
[2024-03-09 06:35:51,193 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-03-09 06:35:51,193 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:35:51,193 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]
[2024-03-09 06:35:51,193 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2024-03-09 06:35:51,193 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:35:51,193 INFO  L85        PathProgramCache]: Analyzing trace with hash -2041422413, now seen corresponding path program 1 times
[2024-03-09 06:35:51,193 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:35:51,193 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399853239]
[2024-03-09 06:35:51,193 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:35:51,193 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:35:51,198 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:35:51,217 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:35:51,218 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:35:51,218 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399853239]
[2024-03-09 06:35:51,218 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399853239] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:35:51,218 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:35:51,218 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-03-09 06:35:51,218 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076279539]
[2024-03-09 06:35:51,218 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:35:51,218 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-03-09 06:35:51,218 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:35:51,219 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-03-09 06:35:51,219 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-03-09 06:35:51,236 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 100 out of 125
[2024-03-09 06:35:51,236 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 125 transitions, 290 flow. Second operand  has 4 states, 4 states have (on average 101.25) internal successors, (405), 4 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:35:51,236 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:35:51,236 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 125
[2024-03-09 06:35:51,237 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:35:51,866 INFO  L124   PetriNetUnfolderBase]: 2015/8288 cut-off events.
[2024-03-09 06:35:51,867 INFO  L125   PetriNetUnfolderBase]: For 1213/1213 co-relation queries the response was YES.
[2024-03-09 06:35:51,882 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11683 conditions, 8288 events. 2015/8288 cut-off events. For 1213/1213 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 87488 event pairs, 996 based on Foata normal form. 245/7797 useless extension candidates. Maximal degree in co-relation 3032. Up to 2117 conditions per place. 
[2024-03-09 06:35:51,900 INFO  L140   encePairwiseOnDemand]: 118/125 looper letters, 30 selfloop transitions, 4 changer transitions 0/134 dead transitions.
[2024-03-09 06:35:51,901 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 134 transitions, 376 flow
[2024-03-09 06:35:51,901 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-03-09 06:35:51,901 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-03-09 06:35:51,902 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 438 transitions.
[2024-03-09 06:35:51,902 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.876
[2024-03-09 06:35:51,902 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 438 transitions.
[2024-03-09 06:35:51,902 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 438 transitions.
[2024-03-09 06:35:51,902 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:35:51,903 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 438 transitions.
[2024-03-09 06:35:51,903 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 109.5) internal successors, (438), 4 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:35:51,904 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 125.0) internal successors, (625), 5 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:35:51,904 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 125.0) internal successors, (625), 5 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:35:51,904 INFO  L175             Difference]: Start difference. First operand has 128 places, 125 transitions, 290 flow. Second operand 4 states and 438 transitions.
[2024-03-09 06:35:51,904 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 134 transitions, 376 flow
[2024-03-09 06:35:51,905 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 134 transitions, 376 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-09 06:35:51,906 INFO  L231             Difference]: Finished difference. Result has 132 places, 124 transitions, 302 flow
[2024-03-09 06:35:51,907 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=302, PETRI_PLACES=132, PETRI_TRANSITIONS=124}
[2024-03-09 06:35:51,907 INFO  L281   CegarLoopForPetriNet]: 128 programPoint places, 4 predicate places.
[2024-03-09 06:35:51,907 INFO  L495      AbstractCegarLoop]: Abstraction has has 132 places, 124 transitions, 302 flow
[2024-03-09 06:35:51,907 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 101.25) internal successors, (405), 4 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:35:51,907 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:35:51,907 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]
[2024-03-09 06:35:51,907 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-03-09 06:35:51,908 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2024-03-09 06:35:51,908 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:35:51,908 INFO  L85        PathProgramCache]: Analyzing trace with hash 572042246, now seen corresponding path program 1 times
[2024-03-09 06:35:51,908 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:35:51,908 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388740568]
[2024-03-09 06:35:51,908 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:35:51,908 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:35:51,914 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:35:51,923 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:35:51,923 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:35:51,923 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388740568]
[2024-03-09 06:35:51,923 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388740568] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:35:51,923 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:35:51,923 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-09 06:35:51,923 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670574656]
[2024-03-09 06:35:51,923 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:35:51,923 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 06:35:51,924 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:35:51,924 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 06:35:51,924 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 06:35:51,942 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 98 out of 125
[2024-03-09 06:35:51,942 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 124 transitions, 302 flow. Second operand  has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:35:51,942 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:35:51,942 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 125
[2024-03-09 06:35:51,942 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:35:54,007 INFO  L124   PetriNetUnfolderBase]: 7178/24007 cut-off events.
[2024-03-09 06:35:54,007 INFO  L125   PetriNetUnfolderBase]: For 4871/5497 co-relation queries the response was YES.
[2024-03-09 06:35:54,064 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 36328 conditions, 24007 events. 7178/24007 cut-off events. For 4871/5497 co-relation queries the response was YES. Maximal size of possible extension queue 871. Compared 296766 event pairs, 4490 based on Foata normal form. 2/21271 useless extension candidates. Maximal degree in co-relation 35461. Up to 8464 conditions per place. 
[2024-03-09 06:35:54,137 INFO  L140   encePairwiseOnDemand]: 117/125 looper letters, 36 selfloop transitions, 7 changer transitions 0/142 dead transitions.
[2024-03-09 06:35:54,137 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 142 transitions, 454 flow
[2024-03-09 06:35:54,138 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 06:35:54,138 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 06:35:54,139 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 338 transitions.
[2024-03-09 06:35:54,139 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9013333333333333
[2024-03-09 06:35:54,139 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 338 transitions.
[2024-03-09 06:35:54,140 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 338 transitions.
[2024-03-09 06:35:54,140 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:35:54,140 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 338 transitions.
[2024-03-09 06:35:54,141 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:35:54,142 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 125.0) internal successors, (500), 4 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:35:54,142 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 125.0) internal successors, (500), 4 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:35:54,142 INFO  L175             Difference]: Start difference. First operand has 132 places, 124 transitions, 302 flow. Second operand 3 states and 338 transitions.
[2024-03-09 06:35:54,142 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 142 transitions, 454 flow
[2024-03-09 06:35:54,159 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 142 transitions, 448 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-09 06:35:54,161 INFO  L231             Difference]: Finished difference. Result has 134 places, 130 transitions, 350 flow
[2024-03-09 06:35:54,161 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=350, PETRI_PLACES=134, PETRI_TRANSITIONS=130}
[2024-03-09 06:35:54,161 INFO  L281   CegarLoopForPetriNet]: 128 programPoint places, 6 predicate places.
[2024-03-09 06:35:54,161 INFO  L495      AbstractCegarLoop]: Abstraction has has 134 places, 130 transitions, 350 flow
[2024-03-09 06:35:54,161 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:35:54,162 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:35:54,162 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]
[2024-03-09 06:35:54,162 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-03-09 06:35:54,162 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2024-03-09 06:35:54,162 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:35:54,162 INFO  L85        PathProgramCache]: Analyzing trace with hash 304378482, now seen corresponding path program 1 times
[2024-03-09 06:35:54,162 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:35:54,162 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896798221]
[2024-03-09 06:35:54,162 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:35:54,162 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:35:54,167 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:35:54,195 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-09 06:35:54,195 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:35:54,195 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896798221]
[2024-03-09 06:35:54,196 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896798221] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:35:54,196 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:35:54,196 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-03-09 06:35:54,196 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100047280]
[2024-03-09 06:35:54,196 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:35:54,196 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-03-09 06:35:54,196 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:35:54,196 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-03-09 06:35:54,196 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-03-09 06:35:54,226 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 100 out of 125
[2024-03-09 06:35:54,226 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 130 transitions, 350 flow. Second operand  has 4 states, 4 states have (on average 101.5) internal successors, (406), 4 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:35:54,226 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:35:54,226 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 125
[2024-03-09 06:35:54,226 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:35:56,025 INFO  L124   PetriNetUnfolderBase]: 4997/18928 cut-off events.
[2024-03-09 06:35:56,025 INFO  L125   PetriNetUnfolderBase]: For 2714/2778 co-relation queries the response was YES.
[2024-03-09 06:35:56,069 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28944 conditions, 18928 events. 4997/18928 cut-off events. For 2714/2778 co-relation queries the response was YES. Maximal size of possible extension queue 736. Compared 235009 event pairs, 2028 based on Foata normal form. 259/17058 useless extension candidates. Maximal degree in co-relation 23406. Up to 3632 conditions per place. 
[2024-03-09 06:35:56,116 INFO  L140   encePairwiseOnDemand]: 120/125 looper letters, 40 selfloop transitions, 4 changer transitions 0/151 dead transitions.
[2024-03-09 06:35:56,116 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 151 transitions, 492 flow
[2024-03-09 06:35:56,117 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-03-09 06:35:56,117 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-03-09 06:35:56,117 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 445 transitions.
[2024-03-09 06:35:56,118 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.89
[2024-03-09 06:35:56,118 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 445 transitions.
[2024-03-09 06:35:56,118 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 445 transitions.
[2024-03-09 06:35:56,118 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:35:56,118 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 445 transitions.
[2024-03-09 06:35:56,119 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 111.25) internal successors, (445), 4 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:35:56,119 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 125.0) internal successors, (625), 5 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:35:56,120 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 125.0) internal successors, (625), 5 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:35:56,120 INFO  L175             Difference]: Start difference. First operand has 134 places, 130 transitions, 350 flow. Second operand 4 states and 445 transitions.
[2024-03-09 06:35:56,120 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 151 transitions, 492 flow
[2024-03-09 06:35:56,130 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 151 transitions, 478 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-09 06:35:56,132 INFO  L231             Difference]: Finished difference. Result has 136 places, 131 transitions, 352 flow
[2024-03-09 06:35:56,132 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=352, PETRI_PLACES=136, PETRI_TRANSITIONS=131}
[2024-03-09 06:35:56,132 INFO  L281   CegarLoopForPetriNet]: 128 programPoint places, 8 predicate places.
[2024-03-09 06:35:56,132 INFO  L495      AbstractCegarLoop]: Abstraction has has 136 places, 131 transitions, 352 flow
[2024-03-09 06:35:56,132 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 101.5) internal successors, (406), 4 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:35:56,132 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:35:56,133 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]
[2024-03-09 06:35:56,133 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2024-03-09 06:35:56,133 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2024-03-09 06:35:56,133 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:35:56,133 INFO  L85        PathProgramCache]: Analyzing trace with hash -36338752, now seen corresponding path program 1 times
[2024-03-09 06:35:56,133 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:35:56,133 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115425908]
[2024-03-09 06:35:56,133 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:35:56,133 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:35:56,140 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:35:56,183 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:35:56,183 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:35:56,183 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115425908]
[2024-03-09 06:35:56,183 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115425908] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 06:35:56,183 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254437021]
[2024-03-09 06:35:56,184 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:35:56,184 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 06:35:56,184 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 06:35:56,185 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 06:35:56,189 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2024-03-09 06:35:56,272 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:35:56,273 INFO  L262         TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core
[2024-03-09 06:35:56,274 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 06:35:56,338 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:35:56,338 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 06:35:56,380 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:35:56,380 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1254437021] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 06:35:56,380 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 06:35:56,380 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13
[2024-03-09 06:35:56,380 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40708349]
[2024-03-09 06:35:56,380 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 06:35:56,380 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2024-03-09 06:35:56,381 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:35:56,381 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2024-03-09 06:35:56,381 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156
[2024-03-09 06:35:56,435 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 97 out of 125
[2024-03-09 06:35:56,436 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 131 transitions, 352 flow. Second operand  has 13 states, 13 states have (on average 98.92307692307692) internal successors, (1286), 13 states have internal predecessors, (1286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:35:56,436 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:35:56,436 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 125
[2024-03-09 06:35:56,437 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:35:58,727 INFO  L124   PetriNetUnfolderBase]: 6986/24819 cut-off events.
[2024-03-09 06:35:58,727 INFO  L125   PetriNetUnfolderBase]: For 3247/3247 co-relation queries the response was YES.
[2024-03-09 06:35:58,828 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 38373 conditions, 24819 events. 6986/24819 cut-off events. For 3247/3247 co-relation queries the response was YES. Maximal size of possible extension queue 800. Compared 311486 event pairs, 1505 based on Foata normal form. 15/21402 useless extension candidates. Maximal degree in co-relation 17727. Up to 4886 conditions per place. 
[2024-03-09 06:35:58,919 INFO  L140   encePairwiseOnDemand]: 117/125 looper letters, 58 selfloop transitions, 11 changer transitions 0/173 dead transitions.
[2024-03-09 06:35:58,919 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 173 transitions, 576 flow
[2024-03-09 06:35:58,920 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-03-09 06:35:58,921 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-03-09 06:35:58,922 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1041 transitions.
[2024-03-09 06:35:58,923 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8328
[2024-03-09 06:35:58,923 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 1041 transitions.
[2024-03-09 06:35:58,923 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 1041 transitions.
[2024-03-09 06:35:58,923 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:35:58,924 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1041 transitions.
[2024-03-09 06:35:58,925 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 11 states, 10 states have (on average 104.1) internal successors, (1041), 10 states have internal predecessors, (1041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:35:58,927 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 11 states, 11 states have (on average 125.0) internal successors, (1375), 11 states have internal predecessors, (1375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:35:58,927 INFO  L81            ComplementDD]: Finished complementDD. Result  has 11 states, 11 states have (on average 125.0) internal successors, (1375), 11 states have internal predecessors, (1375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:35:58,927 INFO  L175             Difference]: Start difference. First operand has 136 places, 131 transitions, 352 flow. Second operand 10 states and 1041 transitions.
[2024-03-09 06:35:58,928 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 173 transitions, 576 flow
[2024-03-09 06:35:58,961 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 173 transitions, 570 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-09 06:35:58,962 INFO  L231             Difference]: Finished difference. Result has 146 places, 137 transitions, 402 flow
[2024-03-09 06:35:58,963 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=402, PETRI_PLACES=146, PETRI_TRANSITIONS=137}
[2024-03-09 06:35:58,963 INFO  L281   CegarLoopForPetriNet]: 128 programPoint places, 18 predicate places.
[2024-03-09 06:35:58,963 INFO  L495      AbstractCegarLoop]: Abstraction has has 146 places, 137 transitions, 402 flow
[2024-03-09 06:35:58,964 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 13 states, 13 states have (on average 98.92307692307692) internal successors, (1286), 13 states have internal predecessors, (1286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:35:58,964 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:35:58,964 INFO  L208   CegarLoopForPetriNet]: trace histogram [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]
[2024-03-09 06:35:58,970 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2024-03-09 06:35:59,164 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 06:35:59,166 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2024-03-09 06:35:59,166 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:35:59,166 INFO  L85        PathProgramCache]: Analyzing trace with hash 1069939606, now seen corresponding path program 1 times
[2024-03-09 06:35:59,167 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:35:59,167 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19748593]
[2024-03-09 06:35:59,168 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:35:59,168 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:35:59,180 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:35:59,193 INFO  L134       CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2024-03-09 06:35:59,193 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:35:59,193 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19748593]
[2024-03-09 06:35:59,193 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19748593] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:35:59,193 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:35:59,193 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-09 06:35:59,194 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109561700]
[2024-03-09 06:35:59,194 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:35:59,194 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 06:35:59,194 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:35:59,195 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 06:35:59,195 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 06:35:59,209 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 98 out of 125
[2024-03-09 06:35:59,209 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 137 transitions, 402 flow. Second operand  has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:35:59,209 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:35:59,209 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 125
[2024-03-09 06:35:59,209 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:36:02,295 INFO  L124   PetriNetUnfolderBase]: 8531/31196 cut-off events.
[2024-03-09 06:36:02,296 INFO  L125   PetriNetUnfolderBase]: For 11473/13428 co-relation queries the response was YES.
[2024-03-09 06:36:02,387 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 53189 conditions, 31196 events. 8531/31196 cut-off events. For 11473/13428 co-relation queries the response was YES. Maximal size of possible extension queue 1141. Compared 417675 event pairs, 4887 based on Foata normal form. 23/27760 useless extension candidates. Maximal degree in co-relation 16780. Up to 9853 conditions per place. 
[2024-03-09 06:36:02,495 INFO  L140   encePairwiseOnDemand]: 117/125 looper letters, 38 selfloop transitions, 11 changer transitions 0/157 dead transitions.
[2024-03-09 06:36:02,495 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 157 transitions, 579 flow
[2024-03-09 06:36:02,496 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 06:36:02,496 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 06:36:02,497 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 337 transitions.
[2024-03-09 06:36:02,497 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8986666666666666
[2024-03-09 06:36:02,497 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 337 transitions.
[2024-03-09 06:36:02,498 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 337 transitions.
[2024-03-09 06:36:02,498 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:36:02,498 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 337 transitions.
[2024-03-09 06:36:02,499 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:36:02,499 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 125.0) internal successors, (500), 4 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:36:02,500 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 125.0) internal successors, (500), 4 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:36:02,500 INFO  L175             Difference]: Start difference. First operand has 146 places, 137 transitions, 402 flow. Second operand 3 states and 337 transitions.
[2024-03-09 06:36:02,500 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 157 transitions, 579 flow
[2024-03-09 06:36:02,512 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 157 transitions, 571 flow, removed 2 selfloop flow, removed 2 redundant places.
[2024-03-09 06:36:02,513 INFO  L231             Difference]: Finished difference. Result has 148 places, 146 transitions, 490 flow
[2024-03-09 06:36:02,514 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=394, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=490, PETRI_PLACES=148, PETRI_TRANSITIONS=146}
[2024-03-09 06:36:02,514 INFO  L281   CegarLoopForPetriNet]: 128 programPoint places, 20 predicate places.
[2024-03-09 06:36:02,514 INFO  L495      AbstractCegarLoop]: Abstraction has has 148 places, 146 transitions, 490 flow
[2024-03-09 06:36:02,514 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:36:02,515 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:36:02,515 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 06:36:02,515 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2024-03-09 06:36:02,515 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2024-03-09 06:36:02,515 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:36:02,516 INFO  L85        PathProgramCache]: Analyzing trace with hash -1805915638, now seen corresponding path program 1 times
[2024-03-09 06:36:02,516 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:36:02,516 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572304079]
[2024-03-09 06:36:02,516 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:36:02,516 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:36:02,524 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:36:02,560 INFO  L134       CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2024-03-09 06:36:02,560 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:36:02,561 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572304079]
[2024-03-09 06:36:02,561 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572304079] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:36:02,561 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:36:02,561 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-03-09 06:36:02,561 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344831803]
[2024-03-09 06:36:02,561 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:36:02,562 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 06:36:02,562 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:36:02,562 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 06:36:02,562 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 06:36:02,573 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 106 out of 125
[2024-03-09 06:36:02,573 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 146 transitions, 490 flow. Second operand  has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:36:02,574 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:36:02,574 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 125
[2024-03-09 06:36:02,574 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:36:03,106 INFO  L124   PetriNetUnfolderBase]: 472/4778 cut-off events.
[2024-03-09 06:36:03,107 INFO  L125   PetriNetUnfolderBase]: For 1516/1591 co-relation queries the response was YES.
[2024-03-09 06:36:03,116 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7397 conditions, 4778 events. 472/4778 cut-off events. For 1516/1591 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 52409 event pairs, 234 based on Foata normal form. 128/4529 useless extension candidates. Maximal degree in co-relation 5367. Up to 454 conditions per place. 
[2024-03-09 06:36:03,122 INFO  L140   encePairwiseOnDemand]: 117/125 looper letters, 16 selfloop transitions, 8 changer transitions 0/144 dead transitions.
[2024-03-09 06:36:03,122 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 144 transitions, 517 flow
[2024-03-09 06:36:03,123 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 06:36:03,123 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 06:36:03,124 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 346 transitions.
[2024-03-09 06:36:03,124 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9226666666666666
[2024-03-09 06:36:03,124 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 346 transitions.
[2024-03-09 06:36:03,124 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 346 transitions.
[2024-03-09 06:36:03,124 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:36:03,124 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 346 transitions.
[2024-03-09 06:36:03,125 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:36:03,126 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 125.0) internal successors, (500), 4 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:36:03,126 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 125.0) internal successors, (500), 4 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:36:03,126 INFO  L175             Difference]: Start difference. First operand has 148 places, 146 transitions, 490 flow. Second operand 3 states and 346 transitions.
[2024-03-09 06:36:03,126 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 144 transitions, 517 flow
[2024-03-09 06:36:03,136 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 144 transitions, 505 flow, removed 2 selfloop flow, removed 2 redundant places.
[2024-03-09 06:36:03,137 INFO  L231             Difference]: Finished difference. Result has 148 places, 137 transitions, 426 flow
[2024-03-09 06:36:03,137 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=426, PETRI_PLACES=148, PETRI_TRANSITIONS=137}
[2024-03-09 06:36:03,138 INFO  L281   CegarLoopForPetriNet]: 128 programPoint places, 20 predicate places.
[2024-03-09 06:36:03,138 INFO  L495      AbstractCegarLoop]: Abstraction has has 148 places, 137 transitions, 426 flow
[2024-03-09 06:36:03,138 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:36:03,138 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:36:03,139 INFO  L208   CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 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]
[2024-03-09 06:36:03,139 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2024-03-09 06:36:03,139 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2024-03-09 06:36:03,139 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:36:03,139 INFO  L85        PathProgramCache]: Analyzing trace with hash 582579221, now seen corresponding path program 1 times
[2024-03-09 06:36:03,139 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:36:03,139 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788678065]
[2024-03-09 06:36:03,140 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:36:03,140 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:36:03,147 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:36:03,157 INFO  L134       CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked.
[2024-03-09 06:36:03,158 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:36:03,158 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788678065]
[2024-03-09 06:36:03,158 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788678065] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:36:03,158 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:36:03,158 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-09 06:36:03,158 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898174444]
[2024-03-09 06:36:03,158 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:36:03,159 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 06:36:03,159 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:36:03,159 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 06:36:03,159 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 06:36:03,184 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 98 out of 125
[2024-03-09 06:36:03,184 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 137 transitions, 426 flow. Second operand  has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:36:03,184 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:36:03,185 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 125
[2024-03-09 06:36:03,185 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:36:03,697 INFO  L124   PetriNetUnfolderBase]: 928/5614 cut-off events.
[2024-03-09 06:36:03,697 INFO  L125   PetriNetUnfolderBase]: For 3543/3583 co-relation queries the response was YES.
[2024-03-09 06:36:03,713 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10224 conditions, 5614 events. 928/5614 cut-off events. For 3543/3583 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 63319 event pairs, 707 based on Foata normal form. 2/5113 useless extension candidates. Maximal degree in co-relation 7438. Up to 1545 conditions per place. 
[2024-03-09 06:36:03,723 INFO  L140   encePairwiseOnDemand]: 120/125 looper letters, 30 selfloop transitions, 4 changer transitions 0/144 dead transitions.
[2024-03-09 06:36:03,724 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 144 transitions, 530 flow
[2024-03-09 06:36:03,724 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 06:36:03,724 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 06:36:03,725 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 327 transitions.
[2024-03-09 06:36:03,725 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.872
[2024-03-09 06:36:03,725 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 327 transitions.
[2024-03-09 06:36:03,725 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 327 transitions.
[2024-03-09 06:36:03,726 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:36:03,726 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 327 transitions.
[2024-03-09 06:36:03,726 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:36:03,727 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 125.0) internal successors, (500), 4 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:36:03,727 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 125.0) internal successors, (500), 4 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:36:03,727 INFO  L175             Difference]: Start difference. First operand has 148 places, 137 transitions, 426 flow. Second operand 3 states and 327 transitions.
[2024-03-09 06:36:03,727 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 144 transitions, 530 flow
[2024-03-09 06:36:03,733 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 144 transitions, 522 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-09 06:36:03,735 INFO  L231             Difference]: Finished difference. Result has 151 places, 140 transitions, 452 flow
[2024-03-09 06:36:03,735 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=418, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=452, PETRI_PLACES=151, PETRI_TRANSITIONS=140}
[2024-03-09 06:36:03,736 INFO  L281   CegarLoopForPetriNet]: 128 programPoint places, 23 predicate places.
[2024-03-09 06:36:03,736 INFO  L495      AbstractCegarLoop]: Abstraction has has 151 places, 140 transitions, 452 flow
[2024-03-09 06:36:03,736 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:36:03,736 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:36:03,736 INFO  L208   CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 06:36:03,736 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2024-03-09 06:36:03,736 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2024-03-09 06:36:03,737 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:36:03,737 INFO  L85        PathProgramCache]: Analyzing trace with hash -1061457761, now seen corresponding path program 1 times
[2024-03-09 06:36:03,737 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:36:03,737 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561790205]
[2024-03-09 06:36:03,737 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:36:03,737 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:36:03,752 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:36:03,835 INFO  L134       CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:36:03,835 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:36:03,835 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561790205]
[2024-03-09 06:36:03,836 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561790205] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 06:36:03,836 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1465718922]
[2024-03-09 06:36:03,836 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:36:03,836 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 06:36:03,836 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 06:36:03,837 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 06:36:03,841 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2024-03-09 06:36:03,937 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:36:03,939 INFO  L262         TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 9 conjunts are in the unsatisfiable core
[2024-03-09 06:36:03,942 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 06:36:04,137 INFO  L134       CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:36:04,137 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 06:36:04,239 INFO  L134       CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:36:04,239 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1465718922] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 06:36:04,239 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 06:36:04,240 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19
[2024-03-09 06:36:04,240 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021340273]
[2024-03-09 06:36:04,240 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 06:36:04,240 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 19 states
[2024-03-09 06:36:04,241 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:36:04,241 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants.
[2024-03-09 06:36:04,241 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342
[2024-03-09 06:36:04,305 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 97 out of 125
[2024-03-09 06:36:04,307 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 140 transitions, 452 flow. Second operand  has 19 states, 19 states have (on average 99.21052631578948) internal successors, (1885), 19 states have internal predecessors, (1885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:36:04,308 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:36:04,308 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 125
[2024-03-09 06:36:04,308 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:36:05,256 INFO  L124   PetriNetUnfolderBase]: 1216/7900 cut-off events.
[2024-03-09 06:36:05,257 INFO  L125   PetriNetUnfolderBase]: For 3282/3529 co-relation queries the response was YES.
[2024-03-09 06:36:05,279 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13529 conditions, 7900 events. 1216/7900 cut-off events. For 3282/3529 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 85618 event pairs, 179 based on Foata normal form. 20/7197 useless extension candidates. Maximal degree in co-relation 5310. Up to 893 conditions per place. 
[2024-03-09 06:36:05,292 INFO  L140   encePairwiseOnDemand]: 117/125 looper letters, 84 selfloop transitions, 14 changer transitions 1/206 dead transitions.
[2024-03-09 06:36:05,292 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 206 transitions, 858 flow
[2024-03-09 06:36:05,293 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2024-03-09 06:36:05,293 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 14 states.
[2024-03-09 06:36:05,295 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1458 transitions.
[2024-03-09 06:36:05,295 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8331428571428572
[2024-03-09 06:36:05,295 INFO  L72            ComplementDD]: Start complementDD. Operand 14 states and 1458 transitions.
[2024-03-09 06:36:05,295 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 14 states and 1458 transitions.
[2024-03-09 06:36:05,296 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:36:05,296 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1458 transitions.
[2024-03-09 06:36:05,298 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 15 states, 14 states have (on average 104.14285714285714) internal successors, (1458), 14 states have internal predecessors, (1458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:36:05,299 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 15 states, 15 states have (on average 125.0) internal successors, (1875), 15 states have internal predecessors, (1875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:36:05,300 INFO  L81            ComplementDD]: Finished complementDD. Result  has 15 states, 15 states have (on average 125.0) internal successors, (1875), 15 states have internal predecessors, (1875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:36:05,300 INFO  L175             Difference]: Start difference. First operand has 151 places, 140 transitions, 452 flow. Second operand 14 states and 1458 transitions.
[2024-03-09 06:36:05,300 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 206 transitions, 858 flow
[2024-03-09 06:36:05,306 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 206 transitions, 846 flow, removed 2 selfloop flow, removed 2 redundant places.
[2024-03-09 06:36:05,308 INFO  L231             Difference]: Finished difference. Result has 166 places, 144 transitions, 507 flow
[2024-03-09 06:36:05,308 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=507, PETRI_PLACES=166, PETRI_TRANSITIONS=144}
[2024-03-09 06:36:05,308 INFO  L281   CegarLoopForPetriNet]: 128 programPoint places, 38 predicate places.
[2024-03-09 06:36:05,308 INFO  L495      AbstractCegarLoop]: Abstraction has has 166 places, 144 transitions, 507 flow
[2024-03-09 06:36:05,309 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 19 states, 19 states have (on average 99.21052631578948) internal successors, (1885), 19 states have internal predecessors, (1885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:36:05,309 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:36:05,309 INFO  L208   CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 06:36:05,313 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0
[2024-03-09 06:36:05,513 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24
[2024-03-09 06:36:05,514 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2024-03-09 06:36:05,514 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:36:05,514 INFO  L85        PathProgramCache]: Analyzing trace with hash 665008963, now seen corresponding path program 1 times
[2024-03-09 06:36:05,514 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:36:05,515 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157761391]
[2024-03-09 06:36:05,515 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:36:05,515 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:36:05,525 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:36:05,537 INFO  L134       CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked.
[2024-03-09 06:36:05,537 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:36:05,537 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157761391]
[2024-03-09 06:36:05,537 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157761391] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:36:05,537 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:36:05,537 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-09 06:36:05,537 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744274588]
[2024-03-09 06:36:05,538 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:36:05,538 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 06:36:05,538 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:36:05,538 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 06:36:05,538 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 06:36:05,558 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 98 out of 125
[2024-03-09 06:36:05,558 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 144 transitions, 507 flow. Second operand  has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:36:05,558 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:36:05,558 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 125
[2024-03-09 06:36:05,558 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:36:06,098 INFO  L124   PetriNetUnfolderBase]: 883/5676 cut-off events.
[2024-03-09 06:36:06,098 INFO  L125   PetriNetUnfolderBase]: For 4246/4270 co-relation queries the response was YES.
[2024-03-09 06:36:06,117 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10741 conditions, 5676 events. 883/5676 cut-off events. For 4246/4270 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 62301 event pairs, 677 based on Foata normal form. 1/5182 useless extension candidates. Maximal degree in co-relation 9955. Up to 1476 conditions per place. 
[2024-03-09 06:36:06,129 INFO  L140   encePairwiseOnDemand]: 120/125 looper letters, 30 selfloop transitions, 4 changer transitions 0/150 dead transitions.
[2024-03-09 06:36:06,129 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 150 transitions, 602 flow
[2024-03-09 06:36:06,130 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 06:36:06,130 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 06:36:06,131 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 326 transitions.
[2024-03-09 06:36:06,131 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8693333333333333
[2024-03-09 06:36:06,131 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 326 transitions.
[2024-03-09 06:36:06,131 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 326 transitions.
[2024-03-09 06:36:06,132 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:36:06,132 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 326 transitions.
[2024-03-09 06:36:06,132 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:36:06,133 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 125.0) internal successors, (500), 4 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:36:06,133 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 125.0) internal successors, (500), 4 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:36:06,133 INFO  L175             Difference]: Start difference. First operand has 166 places, 144 transitions, 507 flow. Second operand 3 states and 326 transitions.
[2024-03-09 06:36:06,133 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 150 transitions, 602 flow
[2024-03-09 06:36:06,156 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 150 transitions, 584 flow, removed 2 selfloop flow, removed 7 redundant places.
[2024-03-09 06:36:06,158 INFO  L231             Difference]: Finished difference. Result has 163 places, 147 transitions, 525 flow
[2024-03-09 06:36:06,158 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=489, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=525, PETRI_PLACES=163, PETRI_TRANSITIONS=147}
[2024-03-09 06:36:06,158 INFO  L281   CegarLoopForPetriNet]: 128 programPoint places, 35 predicate places.
[2024-03-09 06:36:06,158 INFO  L495      AbstractCegarLoop]: Abstraction has has 163 places, 147 transitions, 525 flow
[2024-03-09 06:36:06,159 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:36:06,159 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:36:06,159 INFO  L208   CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 06:36:06,159 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2024-03-09 06:36:06,162 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2024-03-09 06:36:06,162 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:36:06,162 INFO  L85        PathProgramCache]: Analyzing trace with hash -691052328, now seen corresponding path program 1 times
[2024-03-09 06:36:06,162 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:36:06,174 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972727024]
[2024-03-09 06:36:06,174 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:36:06,174 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:36:06,186 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:36:06,310 INFO  L134       CoverageAnalysis]: Checked inductivity of 80 backedges. 52 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:36:06,310 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:36:06,310 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972727024]
[2024-03-09 06:36:06,310 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972727024] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 06:36:06,310 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352217948]
[2024-03-09 06:36:06,311 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:36:06,311 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 06:36:06,311 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 06:36:06,313 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 06:36:06,318 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2024-03-09 06:36:06,449 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:36:06,450 INFO  L262         TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 11 conjunts are in the unsatisfiable core
[2024-03-09 06:36:06,453 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 06:36:06,711 INFO  L134       CoverageAnalysis]: Checked inductivity of 80 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:36:06,711 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-03-09 06:36:06,711 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1352217948] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:36:06,711 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-03-09 06:36:06,711 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 21
[2024-03-09 06:36:06,711 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587746594]
[2024-03-09 06:36:06,712 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:36:06,712 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2024-03-09 06:36:06,712 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:36:06,712 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2024-03-09 06:36:06,712 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420
[2024-03-09 06:36:06,777 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 98 out of 125
[2024-03-09 06:36:06,778 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 147 transitions, 525 flow. Second operand  has 12 states, 12 states have (on average 100.0) internal successors, (1200), 12 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:36:06,778 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:36:06,778 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 125
[2024-03-09 06:36:06,778 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:36:07,856 INFO  L124   PetriNetUnfolderBase]: 1122/7422 cut-off events.
[2024-03-09 06:36:07,856 INFO  L125   PetriNetUnfolderBase]: For 4674/4959 co-relation queries the response was YES.
[2024-03-09 06:36:07,888 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13619 conditions, 7422 events. 1122/7422 cut-off events. For 4674/4959 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 80738 event pairs, 172 based on Foata normal form. 48/6797 useless extension candidates. Maximal degree in co-relation 5711. Up to 572 conditions per place. 
[2024-03-09 06:36:07,902 INFO  L140   encePairwiseOnDemand]: 117/125 looper letters, 89 selfloop transitions, 16 changer transitions 8/223 dead transitions.
[2024-03-09 06:36:07,902 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 223 transitions, 972 flow
[2024-03-09 06:36:07,903 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 
[2024-03-09 06:36:07,903 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 16 states.
[2024-03-09 06:36:07,904 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1682 transitions.
[2024-03-09 06:36:07,905 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.841
[2024-03-09 06:36:07,905 INFO  L72            ComplementDD]: Start complementDD. Operand 16 states and 1682 transitions.
[2024-03-09 06:36:07,905 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 16 states and 1682 transitions.
[2024-03-09 06:36:07,906 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:36:07,906 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1682 transitions.
[2024-03-09 06:36:07,908 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 17 states, 16 states have (on average 105.125) internal successors, (1682), 16 states have internal predecessors, (1682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:36:07,910 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 17 states, 17 states have (on average 125.0) internal successors, (2125), 17 states have internal predecessors, (2125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:36:07,911 INFO  L81            ComplementDD]: Finished complementDD. Result  has 17 states, 17 states have (on average 125.0) internal successors, (2125), 17 states have internal predecessors, (2125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:36:07,911 INFO  L175             Difference]: Start difference. First operand has 163 places, 147 transitions, 525 flow. Second operand 16 states and 1682 transitions.
[2024-03-09 06:36:07,911 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 223 transitions, 972 flow
[2024-03-09 06:36:07,922 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 223 transitions, 950 flow, removed 3 selfloop flow, removed 5 redundant places.
[2024-03-09 06:36:07,924 INFO  L231             Difference]: Finished difference. Result has 171 places, 145 transitions, 520 flow
[2024-03-09 06:36:07,924 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=488, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=520, PETRI_PLACES=171, PETRI_TRANSITIONS=145}
[2024-03-09 06:36:07,924 INFO  L281   CegarLoopForPetriNet]: 128 programPoint places, 43 predicate places.
[2024-03-09 06:36:07,925 INFO  L495      AbstractCegarLoop]: Abstraction has has 171 places, 145 transitions, 520 flow
[2024-03-09 06:36:07,925 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 12 states have (on average 100.0) internal successors, (1200), 12 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:36:07,925 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:36:07,925 INFO  L208   CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 06:36:07,932 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0
[2024-03-09 06:36:08,126 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,6 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 06:36:08,126 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2024-03-09 06:36:08,127 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:36:08,127 INFO  L85        PathProgramCache]: Analyzing trace with hash -455501539, now seen corresponding path program 1 times
[2024-03-09 06:36:08,127 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:36:08,128 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040695942]
[2024-03-09 06:36:08,128 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:36:08,128 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:36:08,144 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:36:08,360 INFO  L134       CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked.
[2024-03-09 06:36:08,360 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:36:08,361 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040695942]
[2024-03-09 06:36:08,361 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040695942] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:36:08,361 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:36:08,361 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 06:36:08,361 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853259753]
[2024-03-09 06:36:08,362 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:36:08,362 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 06:36:08,362 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:36:08,363 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 06:36:08,363 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 06:36:08,415 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 94 out of 125
[2024-03-09 06:36:08,416 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 145 transitions, 520 flow. Second operand  has 6 states, 6 states have (on average 96.0) internal successors, (576), 6 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:36:08,416 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:36:08,416 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 125
[2024-03-09 06:36:08,416 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:36:09,320 INFO  L124   PetriNetUnfolderBase]: 2334/8603 cut-off events.
[2024-03-09 06:36:09,320 INFO  L125   PetriNetUnfolderBase]: For 3825/4053 co-relation queries the response was YES.
[2024-03-09 06:36:09,346 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17385 conditions, 8603 events. 2334/8603 cut-off events. For 3825/4053 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 91411 event pairs, 950 based on Foata normal form. 0/7884 useless extension candidates. Maximal degree in co-relation 16744. Up to 1797 conditions per place. 
[2024-03-09 06:36:09,363 INFO  L140   encePairwiseOnDemand]: 119/125 looper letters, 55 selfloop transitions, 6 changer transitions 0/176 dead transitions.
[2024-03-09 06:36:09,363 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 176 transitions, 736 flow
[2024-03-09 06:36:09,363 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 06:36:09,364 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 06:36:09,364 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 625 transitions.
[2024-03-09 06:36:09,364 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8333333333333334
[2024-03-09 06:36:09,364 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 625 transitions.
[2024-03-09 06:36:09,364 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 625 transitions.
[2024-03-09 06:36:09,365 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:36:09,365 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 625 transitions.
[2024-03-09 06:36:09,365 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 104.16666666666667) internal successors, (625), 6 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:36:09,366 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 125.0) internal successors, (875), 7 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:36:09,366 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 125.0) internal successors, (875), 7 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:36:09,366 INFO  L175             Difference]: Start difference. First operand has 171 places, 145 transitions, 520 flow. Second operand 6 states and 625 transitions.
[2024-03-09 06:36:09,366 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 176 transitions, 736 flow
[2024-03-09 06:36:09,406 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 176 transitions, 682 flow, removed 3 selfloop flow, removed 17 redundant places.
[2024-03-09 06:36:09,407 INFO  L231             Difference]: Finished difference. Result has 158 places, 144 transitions, 476 flow
[2024-03-09 06:36:09,407 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=476, PETRI_PLACES=158, PETRI_TRANSITIONS=144}
[2024-03-09 06:36:09,408 INFO  L281   CegarLoopForPetriNet]: 128 programPoint places, 30 predicate places.
[2024-03-09 06:36:09,408 INFO  L495      AbstractCegarLoop]: Abstraction has has 158 places, 144 transitions, 476 flow
[2024-03-09 06:36:09,408 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 96.0) internal successors, (576), 6 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:36:09,408 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:36:09,408 INFO  L208   CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 06:36:09,408 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2024-03-09 06:36:09,408 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2024-03-09 06:36:09,409 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:36:09,409 INFO  L85        PathProgramCache]: Analyzing trace with hash -377896736, now seen corresponding path program 1 times
[2024-03-09 06:36:09,409 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:36:09,409 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101235153]
[2024-03-09 06:36:09,409 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:36:09,409 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:36:09,422 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:36:09,443 INFO  L134       CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked.
[2024-03-09 06:36:09,444 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:36:09,444 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101235153]
[2024-03-09 06:36:09,444 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101235153] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:36:09,444 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:36:09,444 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-09 06:36:09,444 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484186359]
[2024-03-09 06:36:09,444 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:36:09,444 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 06:36:09,444 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:36:09,444 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 06:36:09,445 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 06:36:09,457 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 100 out of 125
[2024-03-09 06:36:09,458 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 144 transitions, 476 flow. Second operand  has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:36:09,458 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:36:09,458 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 125
[2024-03-09 06:36:09,458 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:36:10,319 INFO  L124   PetriNetUnfolderBase]: 1353/8906 cut-off events.
[2024-03-09 06:36:10,319 INFO  L125   PetriNetUnfolderBase]: For 5209/5230 co-relation queries the response was YES.
[2024-03-09 06:36:10,338 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16947 conditions, 8906 events. 1353/8906 cut-off events. For 5209/5230 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 106620 event pairs, 605 based on Foata normal form. 0/8360 useless extension candidates. Maximal degree in co-relation 16203. Up to 1591 conditions per place. 
[2024-03-09 06:36:10,347 INFO  L140   encePairwiseOnDemand]: 118/125 looper letters, 30 selfloop transitions, 9 changer transitions 1/157 dead transitions.
[2024-03-09 06:36:10,347 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 157 transitions, 610 flow
[2024-03-09 06:36:10,348 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 06:36:10,348 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 06:36:10,348 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 337 transitions.
[2024-03-09 06:36:10,348 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8986666666666666
[2024-03-09 06:36:10,348 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 337 transitions.
[2024-03-09 06:36:10,348 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 337 transitions.
[2024-03-09 06:36:10,348 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:36:10,349 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 337 transitions.
[2024-03-09 06:36:10,349 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:36:10,349 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 125.0) internal successors, (500), 4 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:36:10,350 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 125.0) internal successors, (500), 4 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:36:10,350 INFO  L175             Difference]: Start difference. First operand has 158 places, 144 transitions, 476 flow. Second operand 3 states and 337 transitions.
[2024-03-09 06:36:10,350 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 157 transitions, 610 flow
[2024-03-09 06:36:10,398 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 157 transitions, 598 flow, removed 0 selfloop flow, removed 5 redundant places.
[2024-03-09 06:36:10,399 INFO  L231             Difference]: Finished difference. Result has 157 places, 148 transitions, 540 flow
[2024-03-09 06:36:10,400 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=540, PETRI_PLACES=157, PETRI_TRANSITIONS=148}
[2024-03-09 06:36:10,400 INFO  L281   CegarLoopForPetriNet]: 128 programPoint places, 29 predicate places.
[2024-03-09 06:36:10,400 INFO  L495      AbstractCegarLoop]: Abstraction has has 157 places, 148 transitions, 540 flow
[2024-03-09 06:36:10,400 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:36:10,400 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:36:10,400 INFO  L208   CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 06:36:10,400 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2024-03-09 06:36:10,401 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2024-03-09 06:36:10,401 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:36:10,401 INFO  L85        PathProgramCache]: Analyzing trace with hash -2123264483, now seen corresponding path program 1 times
[2024-03-09 06:36:10,401 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:36:10,401 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465875907]
[2024-03-09 06:36:10,401 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:36:10,401 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:36:10,417 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:36:10,504 INFO  L134       CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked.
[2024-03-09 06:36:10,504 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:36:10,504 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465875907]
[2024-03-09 06:36:10,504 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465875907] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 06:36:10,505 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [140239036]
[2024-03-09 06:36:10,505 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:36:10,505 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 06:36:10,505 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 06:36:10,506 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 06:36:10,510 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2024-03-09 06:36:10,623 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:36:10,624 INFO  L262         TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 5 conjunts are in the unsatisfiable core
[2024-03-09 06:36:10,626 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 06:36:10,788 INFO  L134       CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked.
[2024-03-09 06:36:10,788 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 06:36:10,899 INFO  L134       CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked.
[2024-03-09 06:36:10,899 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [140239036] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 06:36:10,899 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 06:36:10,899 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12
[2024-03-09 06:36:10,899 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9246386]
[2024-03-09 06:36:10,900 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 06:36:10,900 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2024-03-09 06:36:10,900 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:36:10,900 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2024-03-09 06:36:10,900 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132
[2024-03-09 06:36:11,023 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 97 out of 125
[2024-03-09 06:36:11,023 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 148 transitions, 540 flow. Second operand  has 12 states, 12 states have (on average 100.33333333333333) internal successors, (1204), 12 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-09 06:36:11,023 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:36:11,024 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 125
[2024-03-09 06:36:11,024 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:36:11,621 INFO  L124   PetriNetUnfolderBase]: 1050/4095 cut-off events.
[2024-03-09 06:36:11,621 INFO  L125   PetriNetUnfolderBase]: For 1793/1821 co-relation queries the response was YES.
[2024-03-09 06:36:11,633 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7677 conditions, 4095 events. 1050/4095 cut-off events. For 1793/1821 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 35282 event pairs, 84 based on Foata normal form. 128/4169 useless extension candidates. Maximal degree in co-relation 7031. Up to 518 conditions per place. 
[2024-03-09 06:36:11,639 INFO  L140   encePairwiseOnDemand]: 117/125 looper letters, 88 selfloop transitions, 10 changer transitions 17/228 dead transitions.
[2024-03-09 06:36:11,639 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 228 transitions, 1000 flow
[2024-03-09 06:36:11,640 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-03-09 06:36:11,640 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-03-09 06:36:11,641 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1079 transitions.
[2024-03-09 06:36:11,641 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8632
[2024-03-09 06:36:11,641 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 1079 transitions.
[2024-03-09 06:36:11,641 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 1079 transitions.
[2024-03-09 06:36:11,642 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:36:11,642 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1079 transitions.
[2024-03-09 06:36:11,643 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 11 states, 10 states have (on average 107.9) internal successors, (1079), 10 states have internal predecessors, (1079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:36:11,644 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 11 states, 11 states have (on average 125.0) internal successors, (1375), 11 states have internal predecessors, (1375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:36:11,645 INFO  L81            ComplementDD]: Finished complementDD. Result  has 11 states, 11 states have (on average 125.0) internal successors, (1375), 11 states have internal predecessors, (1375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:36:11,645 INFO  L175             Difference]: Start difference. First operand has 157 places, 148 transitions, 540 flow. Second operand 10 states and 1079 transitions.
[2024-03-09 06:36:11,645 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 228 transitions, 1000 flow
[2024-03-09 06:36:11,649 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 228 transitions, 982 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-09 06:36:11,651 INFO  L231             Difference]: Finished difference. Result has 167 places, 145 transitions, 540 flow
[2024-03-09 06:36:11,651 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=522, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=540, PETRI_PLACES=167, PETRI_TRANSITIONS=145}
[2024-03-09 06:36:11,651 INFO  L281   CegarLoopForPetriNet]: 128 programPoint places, 39 predicate places.
[2024-03-09 06:36:11,651 INFO  L495      AbstractCegarLoop]: Abstraction has has 167 places, 145 transitions, 540 flow
[2024-03-09 06:36:11,652 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 12 states have (on average 100.33333333333333) internal successors, (1204), 12 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-09 06:36:11,652 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:36:11,652 INFO  L208   CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 06:36:11,660 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0
[2024-03-09 06:36:11,852 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,7 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 06:36:11,853 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2024-03-09 06:36:11,853 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:36:11,854 INFO  L85        PathProgramCache]: Analyzing trace with hash 186415000, now seen corresponding path program 1 times
[2024-03-09 06:36:11,854 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:36:11,854 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811587385]
[2024-03-09 06:36:11,854 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:36:11,854 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:36:11,893 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-09 06:36:11,893 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-03-09 06:36:11,910 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-09 06:36:11,926 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-03-09 06:36:11,927 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-03-09 06:36:11,927 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (7 of 8 remaining)
[2024-03-09 06:36:11,927 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 8 remaining)
[2024-03-09 06:36:11,927 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 8 remaining)
[2024-03-09 06:36:11,927 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining)
[2024-03-09 06:36:11,927 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 8 remaining)
[2024-03-09 06:36:11,927 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 8 remaining)
[2024-03-09 06:36:11,927 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 8 remaining)
[2024-03-09 06:36:11,927 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 8 remaining)
[2024-03-09 06:36:11,927 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2024-03-09 06:36:11,928 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 06:36:11,931 INFO  L228   ceAbstractionStarter]: Analysis of concurrent program completed with 4 thread instances
[2024-03-09 06:36:11,931 INFO  L178   ceAbstractionStarter]: Computing trace abstraction results
[2024-03-09 06:36:11,994 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated
[2024-03-09 06:36:11,995 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated
[2024-03-09 06:36:11,995 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated
[2024-03-09 06:36:11,996 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated
[2024-03-09 06:36:11,996 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-09 06:36:11,996 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-09 06:36:11,996 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-09 06:36:11,996 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-09 06:36:11,996 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-09 06:36:11,996 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-09 06:36:11,996 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-09 06:36:11,996 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-09 06:36:11,997 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-09 06:36:11,997 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-09 06:36:11,997 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-09 06:36:11,997 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not
[2024-03-09 06:36:11,997 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-09 06:36:11,997 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-09 06:36:11,998 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-09 06:36:11,998 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-09 06:36:11,998 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
[2024-03-09 06:36:11,998 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-09 06:36:11,998 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-09 06:36:11,998 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-09 06:36:11,998 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
[2024-03-09 06:36:11,998 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-09 06:36:11,998 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-09 06:36:11,999 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-09 06:36:11,999 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
[2024-03-09 06:36:11,999 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-09 06:36:11,999 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-09 06:36:11,999 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-09 06:36:11,999 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-09 06:36:11,999 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post7 could not be translated
[2024-03-09 06:36:11,999 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-09 06:36:12,000 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-09 06:36:12,000 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-09 06:36:12,000 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
[2024-03-09 06:36:12,000 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
[2024-03-09 06:36:12,000 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-09 06:36:12,000 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
[2024-03-09 06:36:12,000 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-09 06:36:12,000 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-09 06:36:12,001 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-09 06:36:12,001 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-09 06:36:12,001 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
[2024-03-09 06:36:12,001 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-09 06:36:12,001 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
[2024-03-09 06:36:12,001 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-09 06:36:12,001 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
[2024-03-09 06:36:12,002 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-09 06:36:12,002 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-09 06:36:12,002 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not
[2024-03-09 06:36:12,002 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-09 06:36:12,002 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-09 06:36:12,002 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-09 06:36:12,002 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-09 06:36:12,003 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-09 06:36:12,003 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-09 06:36:12,011 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 06:36:12 BasicIcfg
[2024-03-09 06:36:12,011 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-03-09 06:36:12,012 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2024-03-09 06:36:12,012 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2024-03-09 06:36:12,012 INFO  L274        PluginConnector]: Witness Printer initialized
[2024-03-09 06:36:12,012 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.03 06:35:45" (3/4) ...
[2024-03-09 06:36:12,014 INFO  L140         WitnessPrinter]: No result that supports witness generation found
[2024-03-09 06:36:12,014 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-03-09 06:36:12,015 INFO  L158              Benchmark]: Toolchain (without parser) took 26808.72ms. Allocated memory was 136.3MB in the beginning and 5.8GB in the end (delta: 5.7GB). Free memory was 101.2MB in the beginning and 4.4GB in the end (delta: -4.3GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB.
[2024-03-09 06:36:12,015 INFO  L158              Benchmark]: CDTParser took 0.12ms. Allocated memory is still 104.9MB. Free memory is still 80.9MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-03-09 06:36:12,015 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 309.02ms. Allocated memory is still 136.3MB. Free memory was 100.7MB in the beginning and 81.9MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB.
[2024-03-09 06:36:12,015 INFO  L158              Benchmark]: Boogie Procedure Inliner took 37.37ms. Allocated memory is still 136.3MB. Free memory was 81.9MB in the beginning and 79.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-03-09 06:36:12,016 INFO  L158              Benchmark]: Boogie Preprocessor took 20.76ms. Allocated memory is still 136.3MB. Free memory was 79.8MB in the beginning and 78.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-03-09 06:36:12,016 INFO  L158              Benchmark]: RCFGBuilder took 308.21ms. Allocated memory is still 136.3MB. Free memory was 78.1MB in the beginning and 64.3MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB.
[2024-03-09 06:36:12,016 INFO  L158              Benchmark]: TraceAbstraction took 26125.98ms. Allocated memory was 136.3MB in the beginning and 5.8GB in the end (delta: 5.7GB). Free memory was 63.4MB in the beginning and 4.4GB in the end (delta: -4.4GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB.
[2024-03-09 06:36:12,016 INFO  L158              Benchmark]: Witness Printer took 2.52ms. Allocated memory is still 5.8GB. Free memory is still 4.4GB. There was no memory consumed. Max. memory is 16.1GB.
[2024-03-09 06:36:12,017 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.12ms. Allocated memory is still 104.9MB. Free memory is still 80.9MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 309.02ms. Allocated memory is still 136.3MB. Free memory was 100.7MB in the beginning and 81.9MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 37.37ms. Allocated memory is still 136.3MB. Free memory was 81.9MB in the beginning and 79.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 20.76ms. Allocated memory is still 136.3MB. Free memory was 79.8MB in the beginning and 78.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
 * RCFGBuilder took 308.21ms. Allocated memory is still 136.3MB. Free memory was 78.1MB in the beginning and 64.3MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB.
 * TraceAbstraction took 26125.98ms. Allocated memory was 136.3MB in the beginning and 5.8GB in the end (delta: 5.7GB). Free memory was 63.4MB in the beginning and 4.4GB in the end (delta: -4.4GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB.
 * Witness Printer took 2.52ms. Allocated memory is still 5.8GB. Free memory is still 4.4GB. There was no memory consumed. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator:
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
  - 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: Expected StepInfo for loop construct to contain Condition, but it did not
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~post7 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet0 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: IdentifierExpression #t~nondet2 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
  - GenericResult: Unfinished Backtranslation
    The program execution was not completely translated back.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - DataRaceFoundResult [Line: 678]: Data race detected
[2024-03-09 06:36:12,061 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated
[2024-03-09 06:36:12,061 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated
[2024-03-09 06:36:12,061 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated
[2024-03-09 06:36:12,061 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated
[2024-03-09 06:36:12,062 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-09 06:36:12,062 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-09 06:36:12,062 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-09 06:36:12,062 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-09 06:36:12,062 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-09 06:36:12,062 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-09 06:36:12,062 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-09 06:36:12,062 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-09 06:36:12,062 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-09 06:36:12,062 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-09 06:36:12,063 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-09 06:36:12,063 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not
[2024-03-09 06:36:12,063 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-09 06:36:12,063 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-09 06:36:12,063 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-09 06:36:12,063 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-09 06:36:12,063 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-09 06:36:12,063 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-09 06:36:12,063 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
[2024-03-09 06:36:12,063 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-09 06:36:12,063 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-09 06:36:12,063 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
[2024-03-09 06:36:12,063 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-09 06:36:12,064 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-09 06:36:12,064 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-09 06:36:12,064 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-09 06:36:12,064 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
[2024-03-09 06:36:12,064 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-09 06:36:12,064 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post7 could not be translated
[2024-03-09 06:36:12,064 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-09 06:36:12,064 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-09 06:36:12,064 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-09 06:36:12,064 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-09 06:36:12,064 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
[2024-03-09 06:36:12,064 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
[2024-03-09 06:36:12,064 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-09 06:36:12,065 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-09 06:36:12,065 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
[2024-03-09 06:36:12,065 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-09 06:36:12,065 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-09 06:36:12,065 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-09 06:36:12,065 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
[2024-03-09 06:36:12,065 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-09 06:36:12,065 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
[2024-03-09 06:36:12,065 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-09 06:36:12,065 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
[2024-03-09 06:36:12,065 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-09 06:36:12,066 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-09 06:36:12,066 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not
[2024-03-09 06:36:12,066 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-09 06:36:12,066 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-09 06:36:12,066 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-09 06:36:12,066 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-09 06:36:12,066 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-09 06:36:12,066 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-09 06:36:12,107 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated
[2024-03-09 06:36:12,108 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated
[2024-03-09 06:36:12,108 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated
[2024-03-09 06:36:12,108 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated
[2024-03-09 06:36:12,108 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-09 06:36:12,108 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-09 06:36:12,108 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-09 06:36:12,108 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-09 06:36:12,108 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-09 06:36:12,109 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-09 06:36:12,109 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-09 06:36:12,109 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-09 06:36:12,109 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-09 06:36:12,109 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-09 06:36:12,109 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-09 06:36:12,109 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not
[2024-03-09 06:36:12,109 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-09 06:36:12,109 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-09 06:36:12,109 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-09 06:36:12,109 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-09 06:36:12,109 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-09 06:36:12,110 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-09 06:36:12,110 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
[2024-03-09 06:36:12,110 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
[2024-03-09 06:36:12,110 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-09 06:36:12,110 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-09 06:36:12,110 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-09 06:36:12,110 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-09 06:36:12,110 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-09 06:36:12,110 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-09 06:36:12,110 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
[2024-03-09 06:36:12,110 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-09 06:36:12,110 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-09 06:36:12,110 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post7 could not be translated
[2024-03-09 06:36:12,110 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-09 06:36:12,110 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-09 06:36:12,111 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-09 06:36:12,111 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
[2024-03-09 06:36:12,111 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-09 06:36:12,111 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
[2024-03-09 06:36:12,111 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-09 06:36:12,111 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
[2024-03-09 06:36:12,111 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-09 06:36:12,111 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-09 06:36:12,111 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-09 06:36:12,111 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
[2024-03-09 06:36:12,111 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-09 06:36:12,112 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
[2024-03-09 06:36:12,112 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-09 06:36:12,112 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
[2024-03-09 06:36:12,112 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-09 06:36:12,112 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-09 06:36:12,112 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not
[2024-03-09 06:36:12,112 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-09 06:36:12,112 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-09 06:36:12,112 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-09 06:36:12,112 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-09 06:36:12,112 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-09 06:36:12,112 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
    Data race detected
The following path leads to a data race: 
[L674]               0  int data = 0;
        VAL             [data=0]
[L675]               0  pthread_mutex_t data_mutex = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } };
        VAL             [data=0, data_mutex={1:0}]
[L683]               0  int threads_total = 4;
        VAL             [data=0, data_mutex={1:0}, threads_total=4]
[L684]               0  pthread_t tids[4];
        VAL             [data=0, data_mutex={1:0}, threads_total=4, tids={13:0}]
[L685]               0  int i = 0;
        VAL             [data=0, data_mutex={1:0}, i=0, threads_total=4, tids={13:0}]
[L685]  COND TRUE    0  i < threads_total
        VAL             [data=0, data_mutex={1:0}, i=0, threads_total=4, tids={13:0}]
[L686]  FCALL, FORK  0  pthread_create(&tids[i], ((void *)0), &thread, ((void *)0))
        VAL             [arg={0:0}, data=0, data_mutex={1:0}, i=0, threads_total=4, tids={13:0}]
[L685]               0  i++
        VAL             [arg={0:0}, data=0, data_mutex={1:0}, i=1, threads_total=4, tids={13:0}]
[L685]  COND TRUE    0  i < threads_total
        VAL             [arg={0:0}, data=0, data_mutex={1:0}, i=1, threads_total=4, tids={13:0}]
[L686]  FCALL, FORK  0  pthread_create(&tids[i], ((void *)0), &thread, ((void *)0))
        VAL             [arg={0:0}, data=0, data_mutex={1:0}, i=1, threads_total=4, tids={13:0}]
[L685]               0  i++
        VAL             [arg={0:0}, data=0, data_mutex={1:0}, i=2, threads_total=4, tids={13:0}]
[L685]  COND TRUE    0  i < threads_total
        VAL             [arg={0:0}, data=0, data_mutex={1:0}, i=2, threads_total=4, tids={13:0}]
[L686]  FCALL, FORK  0  pthread_create(&tids[i], ((void *)0), &thread, ((void *)0))
        VAL             [arg={0:0}, data=0, data_mutex={1:0}, i=2, threads_total=4, tids={13:0}]
[L685]               0  i++
        VAL             [arg={0:0}, data=0, data_mutex={1:0}, i=3, threads_total=4, tids={13:0}]
[L685]  COND TRUE    0  i < threads_total
        VAL             [arg={0:0}, data=0, data_mutex={1:0}, i=3, threads_total=4, tids={13:0}]
[L686]  FCALL, FORK  0  pthread_create(&tids[i], ((void *)0), &thread, ((void *)0))
        VAL             [arg={0:0}, data=0, data_mutex={1:0}, i=3, threads_total=4, tids={13:0}]
[L678]               1  data = __VERIFIER_nondet_int()
        VAL             [arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}]
[L678]               2  data = __VERIFIER_nondet_int()
        VAL             [arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}]
[L678]               3  data = __VERIFIER_nondet_int()
        VAL             [arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}]
[L680]               3  return ((void *)0);
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}]
[L685]               0  i++
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=4, threads_total=4, tids={13:0}]
[L685]  COND FALSE   0  !(i < threads_total)
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=4, threads_total=4, tids={13:0}]
[L688]               0  int i = 0;
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=0, threads_total=4, tids={13:0}]
[L688]  COND TRUE    0  i < threads_total - 1
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=0, threads_total=4, tids={13:0}]
[L689]  EXPR         0  tids[i]
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=0, threads_total=4, tids={13:0}]
[L689]               0  pthread_join(tids[i], ((void *)0))
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=0, threads_total=4, tids={13:0}]
[L680]               1  return ((void *)0);
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}]
[L689]  FCALL, JOIN  1  pthread_join(tids[i], ((void *)0))
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=0, threads_total=4, tids={13:0}]
[L688]               0  i++
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=1, threads_total=4, tids={13:0}]
[L680]               2  return ((void *)0);
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}]
[L688]  COND TRUE    0  i < threads_total - 1
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=1, threads_total=4, tids={13:0}]
[L689]  EXPR         0  tids[i]
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=1, threads_total=4, tids={13:0}]
[L689]               0  pthread_join(tids[i], ((void *)0))
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=1, threads_total=4, tids={13:0}]
[L689]  FCALL, JOIN  2  pthread_join(tids[i], ((void *)0))
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=1, threads_total=4, tids={13:0}]
[L688]               0  i++
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=2, threads_total=4, tids={13:0}]
[L688]  COND TRUE    0  i < threads_total - 1
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=2, threads_total=4, tids={13:0}]
[L689]  EXPR         0  tids[i]
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=2, threads_total=4, tids={13:0}]
[L689]               0  pthread_join(tids[i], ((void *)0))
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=2, threads_total=4, tids={13:0}]
[L689]  FCALL, JOIN  3  pthread_join(tids[i], ((void *)0))
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=2, threads_total=4, tids={13:0}]
[L688]               0  i++
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=3, threads_total=4, tids={13:0}]
[L688]  COND FALSE   0  !(i < threads_total - 1)
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=3, threads_total=4, tids={13:0}]
[L678]               4  data = __VERIFIER_nondet_int()
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}]
[L691]               0  return data;
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, threads_total=4, tids={13:0}]
[L678]               4  data = __VERIFIER_nondet_int()
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}]

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

  - UnprovableResult [Line: 691]: 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. 
  - UnprovableResult [Line: 686]: 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. 
  - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
    CFG has 3 procedures, 86 locations, 5 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: 0.6s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 48 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 21 mSDsluCounter, 19 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 64 IncrementalHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 14 mSDtfsCounter, 64 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=179occurred in iteration=2, InterpolantAutomatonStates: 7, 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.1s InterpolantComputationTime, 81 NumberOfCodeBlocks, 81 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 49 ConstructedInterpolants, 0 QuantifiedInterpolants, 61 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
  - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances
    CFG has 4 procedures, 103 locations, 6 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: 1.5s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 251 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 175 mSDsluCounter, 76 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 46 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 399 IncrementalHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 30 mSDtfsCounter, 399 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 91 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=244occurred in iteration=3, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 232 NumberOfCodeBlocks, 232 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 220 ConstructedInterpolants, 0 QuantifiedInterpolants, 450 SizeOfPredicates, 4 NumberOfNonLiveVariables, 89 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 6/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 3 thread instances
    CFG has 5 procedures, 120 locations, 7 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: 3.1s, OverallIterations: 8, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 364 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 251 mSDsluCounter, 66 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 44 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 543 IncrementalHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 22 mSDtfsCounter, 543 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 96 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=415occurred in iteration=5, InterpolantAutomatonStates: 30, 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, 338 NumberOfCodeBlocks, 338 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 314 ConstructedInterpolants, 0 QuantifiedInterpolants, 588 SizeOfPredicates, 4 NumberOfNonLiveVariables, 89 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 31/34 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 4 thread instances
    CFG has 6 procedures, 137 locations, 8 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: 20.8s, OverallIterations: 14, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 17.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1273 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1049 mSDsluCounter, 236 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 123 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2131 IncrementalHoareTripleChecker+Invalid, 2160 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 113 mSDtfsCounter, 2131 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 513 GetRequests, 410 SyntacticMatches, 7 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 519 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=540occurred in iteration=12, InterpolantAutomatonStates: 82, 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.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 1076 NumberOfCodeBlocks, 1076 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1092 ConstructedInterpolants, 0 QuantifiedInterpolants, 3095 SizeOfPredicates, 26 NumberOfNonLiveVariables, 596 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 20 InterpolantComputations, 10 PerfectInterpolantSequences, 529/662 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
[2024-03-09 06:36:12,124 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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
